ltl2tgba.cc 52.8 KB
Newer Older
1
// -*- coding: utf-8 -*-
2
3
// Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012, 2013 Laboratoire
// de Recherche et Développement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
4
// Copyright (C) 2003, 2004, 2005, 2006, 2007 Laboratoire d'Informatique de
5
6
// Paris 6 (LIP6), département Systèmes Répartis
// Coopératifs (SRC), Université Pierre et Marie Curie.
7
8
9
10
11
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
12
// the Free Software Foundation; either version 3 of the License, or
13
14
15
16
17
18
19
20
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
21
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
22

23
#include <iostream>
24
#include <iomanip>
25
#include <cassert>
26
27
#include <fstream>
#include <string>
28
#include <cstdlib>
29
#include "ltlvisit/tostring.hh"
30
#include "ltlvisit/apcollect.hh"
31
#include "ltlast/allnodes.hh"
32
#include "ltlparse/public.hh"
33
#include "tgbaalgos/ltl2tgba_lacim.hh"
34
#include "tgbaalgos/ltl2tgba_fm.hh"
35
#include "tgbaalgos/ltl2taa.hh"
36
#include "tgba/bddprint.hh"
37
#include "tgbaalgos/save.hh"
38
#include "tgbaalgos/dotty.hh"
39
#include "tgbaalgos/lbtt.hh"
40
#include "tgba/tgbatba.hh"
41
#include "tgba/tgbasgba.hh"
42
#include "tgbaalgos/degen.hh"
43
#include "tgba/tgbaproduct.hh"
44
#include "tgba/futurecondcol.hh"
45
#include "tgbaalgos/reducerun.hh"
46
#include "tgbaparse/public.hh"
47
#include "neverparse/public.hh"
48
#include "dstarparse/public.hh"
49
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
50
#include "tgbaalgos/minimize.hh"
51
#include "taalgos/minimize.hh"
52
#include "tgbaalgos/neverclaim.hh"
53
#include "tgbaalgos/replayrun.hh"
54
#include "tgbaalgos/rundotdec.hh"
55
#include "tgbaalgos/sccfilter.hh"
56
#include "tgbaalgos/safety.hh"
57
#include "tgbaalgos/eltl2tgba_lacim.hh"
58
#include "tgbaalgos/gtec/gtec.hh"
59
#include "eltlparse/public.hh"
60
#include "misc/timer.hh"
Thomas Badie's avatar
Thomas Badie committed
61
#include "misc/unique_ptr.hh"
62
#include "tgbaalgos/stats.hh"
63
#include "tgbaalgos/scc.hh"
64
#include "tgbaalgos/emptiness_stats.hh"
65
#include "tgbaalgos/scc.hh"
66
#include "tgbaalgos/isdet.hh"
67
#include "tgbaalgos/cycles.hh"
68
#include "tgbaalgos/isweakscc.hh"
69
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
70
#include "tgbaalgos/simulation.hh"
71
#include "tgbaalgos/compsusp.hh"
72

73
#include "taalgos/tgba2ta.hh"
74
#include "taalgos/dotty.hh"
75
#include "taalgos/stats.hh"
76

77
78
79
80
81
82
83
84
85
86
87
88
std::string
ltl_defs()
{
  std::string s = "\
X=(0 1 true	   \
   1 2 $0	   \
   accept 2)	   \
U=(0 0 $0	   \
   0 1 $1	   \
   accept 1)	   \
G=(0 0 $0)	   \
F=U(true, $0)	   \
89
90
91
W=G($0)|U($0, $1)  \
R=!U(!$0, !$1)     \
M=F($0)&R($0, $1)";
92
93
94
  return s;
}

95
96
97
void
syntax(char* prog)
{
98
99
100
101
102
  // Display the supplied name unless it appears to be a libtool wrapper.
  char* slash = strrchr(prog, '/');
  if (slash && (strncmp(slash + 1, "lt-", 3) == 0))
    prog = slash + 4;

103
  std::cerr << "Usage: "<< prog << " [-f|-l|-le|-taa] [OPTIONS...] formula"
104
	    << std::endl
105
            << "       "<< prog << " [-f|-l|-le|-taa] -F [OPTIONS...] file"
106
	    << std::endl
107
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
108
	    << std::endl
109

110
111
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
112
113
114
115
	    << "Optionally multiply this automaton by another"
	    << " automaton read from a file." << std::endl
            << "Output the result in various formats, or perform an emptiness "
            << "check." << std::endl
116
	    << std::endl
117
118
119

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
120
	    << std::endl
121
	    << "  -X    do not compute an automaton, read it from a file"
122
	    << std::endl
123
124
125
126
	    << "  -XD   do not compute an automaton, read it from an"
	    << " ltl2dstar file" << std::endl
	    << "  -XDB  read the from an ltl2dstar file and convert it to "
	    << "TGBA" << std::endl
127
128
	    << "  -XDD  read the from an ltl2dstar file and convert it to "
	    << "TGBA,\n       keeping it deterministic when possible\n"
129
130
	    << "  -XL   do not compute an automaton, read it from an"
	    << " LBTT file" << std::endl
131
132
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
133
134
135
136
	    << "  -Pfile  multiply the formula automaton with the TGBA read"
	    << " from `file'\n"
	    << "  -KPfile multiply the formula automaton with the Kripke"
	    << " structure from `file'\n"
137
138
139
	    << std::endl

	    << "Translation algorithm:" << std::endl
140
            << "  -f    use Couvreur's FM algorithm for LTL"
141
	    << " (default)" << std::endl
142
            << "  -l    use Couvreur's LaCIM algorithm for LTL "
143
	    << std::endl
144
145
146
	    << "  -le   use Couvreur's LaCIM algorithm for ELTL"
	    << std::endl
            << "  -taa  use Tauriainen's TAA-based algorithm for LTL"
martinez's avatar
martinez committed
147
	    << std::endl
148
149
	    << "  -u    use Compositional translation"
	    << std::endl
150
151
152
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
153
154
	    << "  -fr   reduce formula at each step of FM" << std::endl
	    << "          as specified with the -r{1..7} options" << std::endl
155
156
157
158
159
            << "  -L    fair-loop approximation (implies -f)" << std::endl
            << "  -p    branching postponement (implies -f)" << std::endl
            << "  -U[PROPS]  consider atomic properties of the formula as "
	    << "exclusive events, and" << std::endl
	    << "        PROPS as unobservables events (implies -f)"
160
	    << std::endl
161
162
163
164
            << "  -x    try to produce a more deterministic automaton "
	    << "(implies -f)" << std::endl
	    << "  -y    do not merge states with same symbolic representation "
	    << "(implies -f)" << std::endl
165
	    << std::endl
166

167
168
	    << "Options for Couvreur's LaCIM algorithm (-l or -le):"
	    << std::endl
169
170
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
171
	    << std::endl
172
	    << "  -A    same as -a, but as a set" << std::endl
173
174
	    << "  -lo   pre-define standard LTL operators as automata "
	    << "(implies -le)" << std::endl
175
	    << "  -r    display the relation BDD, not the reachability graph"
176
	    << std::endl
177
	    << "  -R    same as -r, but as a set" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
178
179
	    << "  -R3b  symbolically prune unaccepting SCC from BDD relation"
	    << std::endl
180
	    << std::endl
181
182

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
183
	    << std::endl
184
	    << "  -c    enable language containment checks (implies -taa)"
185
	    << std::endl
186
	    << std::endl
187
188

	    << "Formula simplification (before translation):"
189
	    << std::endl
martinez's avatar
martinez committed
190
191
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
192
	    << "universality" << std::endl
martinez's avatar
martinez committed
193
	    << "  -r3   reduce formula using implication between "
194
	    << "sub-formulae" << std::endl
195
196
197
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
198
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
199
	    << "  -rd   display the reduced formula" << std::endl
200
	    << "  -rD   dump statistics about the simplifier cache" << std::endl
201
	    << "  -rL   disable basic rewritings producing larger formulas"
202
203
	    << std::endl
	    << "  -ru   lift formulae that are eventual and universal"
204
	    << std::endl << std::endl
205
206
207
208
209
210
211

	    << "Automaton degeneralization (after translation):"
	    << std::endl
            << "  -lS   move generalized acceptance conditions to states "
	    << "(SGBA)" << std::endl
	    << "  -D    degeneralize the automaton as a TBA" << std::endl
	    << "  -DS   degeneralize the automaton as an SBA" << std::endl
212
213
214
215
	    << "          (append z/Z, o/O, l/L: to turn on/off options "
            << "(default: zol)\n "
	    << "          z: level resetting, o: adaptive order, "
	    << "l: level cache)\n"
216
217
218
219
	    << std::endl

	    << "Automaton simplifications (after translation):"
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
220
	    << "  -R3   use SCC to reduce the automaton" << std::endl
221
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
222
223
224
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
225
	    << "  -RDS  reduce the automaton with direct simulation"
226
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
227
	    << "  -RRS  reduce the automaton with reverse simulation"
Thomas Badie's avatar
Thomas Badie committed
228
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
229
	    << "  -RIS  iterate both direct and reverse simulations"
230
	    << std::endl
Thomas Badie's avatar
Thomas Badie committed
231
232
            << "  -RDCS reduce the automaton with direct simulation"
            << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
233
            << "  -Rm   attempt to WDBA-minimize the automaton" << std::endl
234
	    << std::endl
235
236
237
            << "  -RM   attempt to WDBA-minimize the automaton unless the "
	    << "result is bigger" << std::endl
	    << std::endl
238

239
            << "Automaton conversion:" << std::endl
240
241
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
242
	    << "  -s    convert to explicit automaton, and number states "
243
	    << "in DFS order" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
244
	    << "  -S    convert to explicit automaton, and number states "
245
	    << "in BFS order" << std::endl
246
247
	    << std::endl

248
249
250
251
252
253
254
255
256
257
258
259
260
261
	    << "Conversion to Testing Automaton:" << std::endl
 	    << "  -TA   output a Generalized Testing Automaton (GTA),\n"
	    << "          or a Testing Automaton (TA) with -DS\n"
 	    << "  -lv   add an artificial livelock state to obtain a "
	    << "Single-pass (G)TA\n"
            << "  -sp   convert into a single-pass (G)TA without artificial "
	    << "livelock state\n"
	    << "  -in   do not use an artificial initial state\n"
            << "  -TGTA output a Transition-based Generalized TA"
            << std::endl
	    << "  -RT   reduce the (G)TA/TGTA using bisimulation.\n"
            << std::endl

	    << "Options for performing emptiness checks (on TGBA):" << std::endl
262
263
264
	    << "  -e[ALGO]  run emptiness check, expect and compute an "
	    << "accepting run" << std::endl
	    << "  -E[ALGO]  run emptiness check, expect no accepting run"
martinez's avatar
martinez committed
265
	    << std::endl
266
267
268
269
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
270
	    << "  -g    graph the accepting run on the automaton (requires -e)"
271
	    << std::endl
272
273
274
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
275
276
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
277
278
279
280
281
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
282
283
284
285
286
287
288
289
290
291
292
293
294
	    << "  Tau03_opt(OPTIONS)" << std::endl
	    << std::endl

	    << "If no emptiness check is run, the automaton will be output "
	    << "in dot format" << std::endl << "by default.  This can be "
	    << "changed with the following options." << std::endl
	    << std::endl

	    << "Output options (if no emptiness check):" << std::endl
	    << "  -b    output the automaton in the format of spot"
            << std::endl
            << "  -FC   dump the automaton showing future conditions on states"
	    << std::endl
295
296
297
	    << "  -k    display statistics on the automaton (size and SCCs)"
	    << std::endl
	    << "  -ks   display statistics on the automaton (size only)"
298
	    << std::endl
299
300
301
	    << "  -kt   display statistics on the automaton (size + "
	    << "subtransitions)"
	    << std::endl
302
303
304
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
	    << std::endl
305
	    << "  -KC   list cycles in automaton" << std::endl
306
	    << "  -KW   list weak SCCs" << std::endl
307
	    << "  -N    output the never clain for Spin (implies -DS)"
308
309
	    << std::endl
	    << "  -NN   output the never clain for Spin, with commented states"
310
	    << " (implies -DS)" << std::endl
311
312
	    << "  -O    tell if a formula represents a safety, guarantee, "
	    << "or obligation property"
313
	    << std::endl
314
315
316
317
318
319
	    << "  -t    output automaton in LBTT's format" << std::endl
	    << std::endl

	    << "Miscellaneous options:" << std::endl
	    << "  -0    produce minimal output dedicated to the paper"
	    << std::endl
320
	    << "  -8    output UTF-8 formulae" << std::endl
321
322
323
324
	    << "  -d    turn on traces during parsing" << std::endl
            << "  -T    time the different phases of the translation"
	    << std::endl
	    << "  -v    display the BDD variables used by the automaton"
325
	    << std::endl
326
	    << std::endl;
327

328
329
330
  exit(2);
}

Thomas Badie's avatar
Thomas Badie committed
331
332
333
334
335
336
337
338
339
340
341
static int
to_int(const char* s)
{
  char* endptr;
  int res = strtol(s, &endptr, 10);
  if (*endptr)
    return -1;
  return res;
}


342
343
344
345
346
int
main(int argc, char** argv)
{
  int exit_code = 0;

347
  bool debug_opt = false;
348
  bool paper_opt = false;
349
  bool utf8_opt = false;
350
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
351
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
352
353
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA,
	 TransCompo }
354
    translation = TransFM;
355
  bool fm_red = false;
356
  bool fm_exprop_opt = false;
357
  bool fm_symb_merge_opt = true;
358
  bool file_opt = false;
359
  bool degen_reset = true;
360
  bool degen_order = false;
361
  bool degen_cache = true;
362
  int output = 0;
363
  int formula_index = 0;
364
365
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
366
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
367
  bool expect_counter_example = false;
368
369
  bool accepting_run = false;
  bool accepting_run_replay = false;
370
  bool from_file = false;
371
372
  enum { ReadSpot, ReadLbtt, ReadNeverclaim, ReadDstar } readformat = ReadSpot;
  bool nra2nba = false;
373
  bool dra2dba = false;
374
  bool scc_filter = false;
375
  bool simpltl = false;
376
377
  spot::ltl::ltl_simplifier_options redopt(false, false, false, false,
					   false, false, false);
378
  bool simpcache_stats = false;
379
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
380
  bool symbolic_scc_pruning = false;
381
  bool display_reduced_form = false;
382
  bool post_branching = false;
383
  bool fair_loop_approx = false;
384
  bool graph_run_opt = false;
385
  bool graph_run_tgba_opt = false;
386
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
387
  bool opt_minimize = false;
388
  bool reject_bigger = false;
389
  bool opt_bisim_ta = false;
390
  bool opt_monitor = false;
391
  bool containment = false;
392
  bool show_fc = false;
393
  bool spin_comments = false;
394
395
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
396
  spot::tgba* system = 0;
397
  const spot::tgba* product_to_free = 0;
398
  spot::bdd_dict* dict = new spot::bdd_dict();
399
400
  spot::timer_map tm;
  bool use_timer = false;
Thomas Badie's avatar
Thomas Badie committed
401
  bool reduction_dir_sim = false;
Thomas Badie's avatar
Thomas Badie committed
402
  bool reduction_rev_sim = false;
403
  bool reduction_iterated_sim = false;
Thomas Badie's avatar
Thomas Badie committed
404
405
406
  bool reduction_dont_care_sim = false;
  int limit_dont_care_sim = 0;
  bool reduction_iterated_dont_care_sim = false;
Thomas Badie's avatar
Thomas Badie committed
407
  spot::tgba* temp_dir_sim = 0;
408
  bool ta_opt = false;
409
  bool tgta_opt = false;
410
  bool opt_with_artificial_initial_state = true;
411
412
  bool opt_single_pass_emptiness_check = false;
  bool opt_with_artificial_livelock = false;
Thomas Badie's avatar
Thomas Badie committed
413
  spot::tgba* temp_rev_sim = 0;
414
  spot::tgba* temp_iterated_sim = 0;
Thomas Badie's avatar
Thomas Badie committed
415
416
  spot::tgba* temp_dont_care_sim = 0;
  spot::tgba* temp_dont_care_iterated_sim = 0;
417
418
419
420
421
  bool cs_nowdba = true;
  bool cs_wdba_smaller = false;
  bool cs_nosimul = true;
  bool cs_early_start = false;
  bool cs_oblig = false;
422

423
  for (;;)
424
    {
425
      if (argc < formula_index + 2)
426
	syntax(argv[0]);
427
428
429

      ++formula_index;

430
431
432
433
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
434
435
436
437
438
      else if (!strcmp(argv[formula_index], "-8"))
	{
	  utf8_opt = true;
	  spot::enable_utf8();
	}
439
      else if (!strcmp(argv[formula_index], "-a"))
440
441
442
	{
	  output = 2;
	}
443
      else if (!strcmp(argv[formula_index], "-A"))
444
	{
445
	  output = 4;
446
	}
447
      else if (!strcmp(argv[formula_index], "-b"))
448
	{
449
	  output = 7;
450
	}
451
452
453
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
454
	  translation = TransTAA;
455
	}
456
457
458
459
460
461
462
463
464
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
465
      else if (!strcmp(argv[formula_index], "-d"))
466
467
468
	{
	  debug_opt = true;
	}
469
470
      else if (!strcmp(argv[formula_index], "-D"))
	{
471
472
	  degeneralize_opt = DegenTBA;
	}
473
      else if (!strncmp(argv[formula_index], "-DS", 3))
474
475
	{
	  degeneralize_opt = DegenSBA;
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
	  const char* p = argv[formula_index] + 3;
	  while (*p)
	    {
	      switch (*p++)
		{
		case 'o':
		  degen_order = true;
		  break;
		case 'O':
		  degen_order = false;
		  break;
		case 'z':
		  degen_reset = true;
		  break;
		case 'Z':
		  degen_reset = false;
		  break;
		case 'l':
		  degen_cache = true;
		  break;
		case 'L':
		  degen_cache = false;
		  break;
		}
	    }
501
	}
502
      else if (!strncmp(argv[formula_index], "-e", 2))
503
        {
504
505
506
507
508
509
510
511
512
513
514
515
516
	  echeck_algo = 2 + argv[formula_index];
	  if (!*echeck_algo)
	    echeck_algo = "Cou99";

	  const char* err;
	  echeck_inst =
	    spot::emptiness_check_instantiator::construct(echeck_algo, &err);
	  if (!echeck_inst)
	    {
	      std::cerr << "Failed to parse argument of -e near `"
			<< err <<  "'" << std::endl;
	      exit(2);
	    }
517
518
519
          expect_counter_example = true;
          output = -1;
        }
520
      else if (!strncmp(argv[formula_index], "-E", 2))
521
        {
522
523
524
525
526
527
528
529
530
531
532
533
534
	  const char* echeck_algo = 2 + argv[formula_index];
	  if (!*echeck_algo)
	    echeck_algo = "Cou99";

	  const char* err;
	  echeck_inst =
	    spot::emptiness_check_instantiator::construct(echeck_algo, &err);
	  if (!echeck_inst)
	    {
	      std::cerr << "Failed to parse argument of -e near `"
			<< err <<  "'" << std::endl;
	      exit(2);
	    }
535
536
537
          expect_counter_example = false;
          output = -1;
        }
538
539
      else if (!strcmp(argv[formula_index], "-f"))
	{
540
	  translation = TransFM;
541
	}
542
      else if (!strcmp(argv[formula_index], "-fr"))
543
	{
544
	  fm_red = true;
545
	  translation = TransFM;
546
	}
547
548
549
550
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
551
552
553
554
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
555
556
      else if (!strcmp(argv[formula_index], "-g"))
	{
557
	  accepting_run = true;
558
559
	  graph_run_opt = true;
	}
560
561
      else if (!strcmp(argv[formula_index], "-G"))
	{
562
	  accepting_run = true;
563
564
	  graph_run_tgba_opt = true;
	}
565
566
567
568
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
569
570
571
572
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
573
574
575
576
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
577
578
579
580
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
581
582
583
584
585
586
587
588
589
590
591
592
      else if (!strncmp(argv[formula_index], "-KP", 3))
	{
	  tm.start("reading -KP's argument");

	  spot::kripke_parse_error_list pel;
	  system = spot::kripke_parse(argv[formula_index] + 3,
				      pel, dict, env, debug_opt);
	  if (spot::format_kripke_parse_errors(std::cerr,
					       argv[formula_index] + 2, pel))
	    return 2;
	  tm.stop("reading -KP's argument");
	}
593
594
595
596
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
597
598
599
600
      else if (!strcmp(argv[formula_index], "-KC"))
	{
	  output = 15;
	}
601
602
603
604
      else if (!strcmp(argv[formula_index], "-KW"))
	{
	  output = 16;
	}
605
606
607
608
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
609
610
611
612
613
614
615
616
617
618
      else if (!strcmp(argv[formula_index], "-le"))
	{
	  /* -lo is documented to imply -le, so do not overwrite it. */
	  if (translation != TransLaCIM_ELTL_ops)
	    translation = TransLaCIM_ELTL;
	}
      else if (!strcmp(argv[formula_index], "-lo"))
	{
	  translation = TransLaCIM_ELTL_ops;
	}
619
620
621
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
622
	  translation = TransFM;
623
	}
624
625
626
627
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
628
629
      else if (!strcmp(argv[formula_index], "-m"))
	{
630
	  opt_reduce = true;
631
	}
martinez's avatar
martinez committed
632
633
      else if (!strcmp(argv[formula_index], "-N"))
	{
634
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
635
636
	  output = 8;
	}
637
638
639
640
641
642
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
643
644
      else if (!strcmp(argv[formula_index], "-O"))
	{
645
	  output = 14;
646
          opt_minimize = true;
647
	}
648
649
650
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
651
	  translation = TransFM;
652
	}
653
654
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
655
656
	  tm.start("reading -P's argument");

657
	  spot::tgba_parse_error_list pel;
658
659
660
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
661
662
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
663
	    return 2;
664
	  s->merge_transitions();
665
	  tm.stop("reading -P's argument");
666
	  system = s;
667
	}
668
669
      else if (!strcmp(argv[formula_index], "-r"))
	{
670
671
	  output = 1;
	}
672
673
      else if (!strcmp(argv[formula_index], "-r1"))
	{
674
675
	  simpltl = true;
	  redopt.reduce_basics = true;
676
677
678
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
679
680
	  simpltl = true;
	  redopt.event_univ = true;
681
682
683
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
684
685
	  simpltl = true;
	  redopt.synt_impl = true;
686
687
688
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
689
690
691
692
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
693
	}
694
695
      else if (!strcmp(argv[formula_index], "-r5"))
	{
696
697
	  simpltl = true;
	  redopt.containment_checks = true;
698
699
700
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
701
702
703
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
704
705
706
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
707
708
709
710
711
712
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
713
	}
714
715
716
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
717
	}
718
719
720
721
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
722
	{
723
	  // For backward compatibility, make all these options
724
	  // equal to -RDS.
725
	  reduction_dir_sim = true;
726
	}
Thomas Badie's avatar
Thomas Badie committed
727
728
729
730
      else if (!strcmp(argv[formula_index], "-RRS"))
        {
          reduction_rev_sim = true;
        }
731
732
      else if (!strcmp(argv[formula_index], "-R3"))
	{
733
	  scc_filter = true;
734
	}
735
736
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
737
	  scc_filter = true;
738
739
	  scc_filter_all = true;
	}
740
741
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
742
	  symbolic_scc_pruning = true;
743
	}
744
745
      else if (!strcmp(argv[formula_index], "-rd"))
	{
746
	  display_reduced_form = true;
747
	}
748
749
750
751
      else if (!strcmp(argv[formula_index], "-rD"))
	{
	  simpcache_stats = true;
	}
752
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
753
        {
754
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
755
        }
756
757
758
759
      else if (!strcmp(argv[formula_index], "-RIS"))
        {
          reduction_iterated_sim = true;
        }
Thomas Badie's avatar
Thomas Badie committed
760
761
762
763
764
765
766
767
768
769
770
771
      else if (!strncmp(argv[formula_index], "-RDCS", 5))
        {
          reduction_dont_care_sim = true;
          if (argv[formula_index][5] == '=')
            limit_dont_care_sim = to_int(argv[formula_index] + 6);
        }
      else if (!strncmp(argv[formula_index], "-RDCIS", 6))
        {
          reduction_iterated_dont_care_sim = true;
          if (argv[formula_index][6] == '=')
            limit_dont_care_sim = to_int(argv[formula_index] + 7);
        }
772
      else if (!strcmp(argv[formula_index], "-rL"))
773
774
775
776
777
        {
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.reduce_size_strictly = true;
        }
778
779
780
781
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
782
783
784
785
786
      else if (!strcmp(argv[formula_index], "-RM"))
        {
          opt_minimize = true;
	  reject_bigger = true;
        }
787
788
789
      else if (!strcmp(argv[formula_index], "-RT"))
        {
          opt_bisim_ta = true;
790
791
792
793
794
795
	}
      else if (!strcmp(argv[formula_index], "-ru"))
        {
	  simpltl = true;
	  redopt.event_univ = true;
	  redopt.favor_event_univ = true;
796
        }
797
798
799
800
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
801
802
803
804
805
806
807
808
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
809
810
811
812
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
813
814
815
816
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
817
818
819
820
      else if (!strcmp(argv[formula_index], "-TA"))
        {
          ta_opt = true;
        }
821
      else if (!strcmp(argv[formula_index], "-TGTA"))
822
        {
823
          tgta_opt = true;
824
        }
825
826
827
828
      else if (!strcmp(argv[formula_index], "-lv"))
        {
          opt_with_artificial_livelock = true;
        }
829
830
831
832
      else if (!strcmp(argv[formula_index], "-sp"))
        {
          opt_single_pass_emptiness_check = true;
        }
833
834
835
836
      else if (!strcmp(argv[formula_index], "-in"))
        {
          opt_with_artificial_initial_state = false;
        }
837
838
839
840
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
841
842
843
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
844
	  translation = TransFM;
845
	  // Parse -U's argument.
846
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
847
848
849
	  while (tok)
	    {
	      unobservables->insert
850
		(static_cast<const spot::ltl::atomic_prop*>(env.require(tok)));
851
	      tok = strtok(0, ", \t;");
852
853
	    }
	}
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
      else if (!strncmp(argv[formula_index], "-u", 2))
	{
	  translation = TransCompo;
	  const char* c = argv[formula_index] + 2;
	  while (*c != 0)
	    {
	      switch (*c)
		{
		case '2':
		  cs_nowdba = false;
		  cs_wdba_smaller = true;
		  break;
		case 'w':
		  cs_nowdba = false;
		  cs_wdba_smaller = false;
		  break;
		case 's':
		  cs_nosimul = false;
		  break;
		case 'e':
		  cs_early_start = true;
		  break;
		case 'W':
		  cs_nowdba = true;
		  break;
		case 'S':
		  cs_nosimul = true;
		  break;
		case 'E':
		  cs_early_start = false;
		  break;
		case 'o':
		  cs_oblig = true;
		  break;
		case 'O':
		  cs_oblig = false;
		  break;
		default:
		  std::cerr << "Unknown suboption `" << *c
			    << "' for option -u" << std::endl;
		}
	      ++c;
	    }
	}
898
899
900
901
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
902
903
      else if (!strcmp(argv[formula_index], "-x"))
	{
904
	  translation = TransFM;
905
906
	  fm_exprop_opt = true;
	}
907
908
909
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
910
	  readformat = ReadSpot;
911
	}
912
      else if (!strcmp(argv[formula_index], "-XD"))
913
914
	{
	  from_file = true;
915
916
917
918
919
920
921
	  readformat = ReadDstar;
	}
      else if (!strcmp(argv[formula_index], "-XDB"))
	{
	  from_file = true;
	  readformat = ReadDstar;
	  nra2nba = true;
922
	}
923
924
925
926
927
928
929
      else if (!strcmp(argv[formula_index], "-XDD"))
	{
	  from_file = true;
	  readformat = ReadDstar;
	  nra2nba = true;
	  dra2dba = true;
	}
930
931
932
      else if (!strcmp(argv[formula_index], "-XL"))
	{
	  from_file = true;
933
934
935
936
937
938
	  readformat = ReadLbtt;
	}
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  readformat = ReadNeverclaim;
939
	}
940
941
      else if (!strcmp(argv[formula_index], "-y"))
	{
942
	  translation = TransFM;
943
944
	  fm_symb_merge_opt = false;
	}
945
946
947
948
      else
	{
	  break;
	}
949
950
    }

951
  if ((graph_run_opt || graph_run_tgba_opt)
952
      && (!echeck_inst || !expect_counter_example))
953
    {
954
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
955
956
957
      exit(1);
    }

958
959
960
961
  std::string input;

  if (file_opt)
    {
962
      tm.start("reading formula");
963
      if (strcmp(argv[formula_index], "-"))
964
	{
965
	  std::ifstream fin(argv[formula_index]);
966
	  if (!fin)
967
968
969
970
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
971

972
	  if (!std::getline(fin, input, '\0'))
973
974
975
976
977
978
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
979
	{
980
	  std::getline(std::cin, input, '\0');
981
	}
982
      tm.stop("reading formula");
983
984
985
986
987
988
    }
  else
    {
      input = argv[formula_index];
    }

989
  const spot::ltl::formula* f = 0;
990
  if (!from_file) // Reading a formula, not reading an automaton from a file.
991
    {
992
993
994
995
996
      switch (translation)
	{
	case TransFM:
	case TransLaCIM:
	case TransTAA:
997
	case TransCompo:
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
	  {
	    spot::ltl::parse_error_list pel;
	    tm.start("parsing formula");
	    f = spot::ltl::parse(input,