ltl2tgba.cc 53.3 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
#include "tgbaalgos/powerset.hh"
73

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

78
79
80
81
82
83
84
85
86
87
88
89
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)	   \
90
91
92
W=G($0)|U($0, $1)  \
R=!U(!$0, !$1)     \
M=F($0)&R($0, $1)";
93
94
95
  return s;
}

96
97
98
void
syntax(char* prog)
{
99
100
101
102
103
  // 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;

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

111
112
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
113
114
115
116
	    << "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
117
	    << std::endl
118
119
120

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

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

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
154
155
	    << "  -fr   reduce formula at each step of FM" << std::endl
	    << "          as specified with the -r{1..7} options" << std::endl
156
157
158
159
160
            << "  -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)"
161
	    << std::endl
162
163
164
165
            << "  -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
166
	    << std::endl
167

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

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

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

	    << "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
213
214
215
216
	    << "          (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"
217
218
219
220
	    << std::endl

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

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

250
251
252
253
254
255
256
257
258
259
260
261
262
263
	    << "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
264
265
266
	    << "  -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
267
	    << std::endl
268
269
270
271
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
272
	    << "  -g    graph the accepting run on the automaton (requires -e)"
273
	    << std::endl
274
275
276
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
277
278
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
279
280
281
282
283
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
284
285
286
287
288
289
290
291
292
293
294
295
296
	    << "  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
297
298
299
	    << "  -k    display statistics on the automaton (size and SCCs)"
	    << std::endl
	    << "  -ks   display statistics on the automaton (size only)"
300
	    << std::endl
301
302
303
	    << "  -kt   display statistics on the automaton (size + "
	    << "subtransitions)"
	    << std::endl
304
305
306
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
	    << std::endl
307
	    << "  -KC   list cycles in automaton" << std::endl
308
	    << "  -KW   list weak SCCs" << std::endl
309
	    << "  -N    output the never clain for Spin (implies -DS)"
310
311
	    << std::endl
	    << "  -NN   output the never clain for Spin, with commented states"
312
	    << " (implies -DS)" << std::endl
313
314
	    << "  -O    tell if a formula represents a safety, guarantee, "
	    << "or obligation property"
315
	    << std::endl
316
317
318
319
320
321
	    << "  -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
322
	    << "  -8    output UTF-8 formulae" << std::endl
323
324
325
326
	    << "  -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"
327
	    << std::endl
328
	    << std::endl;
329

330
331
332
  exit(2);
}

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


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

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

426
  for (;;)
427
    {
428
      if (argc < formula_index + 2)
429
	syntax(argv[0]);
430
431
432

      ++formula_index;

433
434
435
436
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
437
438
439
440
441
      else if (!strcmp(argv[formula_index], "-8"))
	{
	  utf8_opt = true;
	  spot::enable_utf8();
	}
442
      else if (!strcmp(argv[formula_index], "-a"))
443
444
445
	{
	  output = 2;
	}
446
      else if (!strcmp(argv[formula_index], "-A"))
447
	{
448
	  output = 4;
449
	}
450
      else if (!strcmp(argv[formula_index], "-b"))
451
	{
452
	  output = 7;
453
	}
454
455
456
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
457
	  translation = TransTAA;
458
	}
459
460
461
462
463
464
465
466
467
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
468
      else if (!strcmp(argv[formula_index], "-d"))
469
470
471
	{
	  debug_opt = true;
	}
472
473
      else if (!strcmp(argv[formula_index], "-D"))
	{
474
475
	  degeneralize_opt = DegenTBA;
	}
476
      else if (!strncmp(argv[formula_index], "-DS", 3))
477
478
	{
	  degeneralize_opt = DegenSBA;
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
	  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;
		}
	    }
504
	}
505
      else if (!strncmp(argv[formula_index], "-e", 2))
506
        {
507
508
509
510
511
512
513
514
515
516
517
518
519
	  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);
	    }
520
521
522
          expect_counter_example = true;
          output = -1;
        }
523
      else if (!strncmp(argv[formula_index], "-E", 2))
524
        {
525
526
527
528
529
530
531
532
533
534
535
536
537
	  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);
	    }
538
539
540
          expect_counter_example = false;
          output = -1;
        }
541
542
      else if (!strcmp(argv[formula_index], "-f"))
	{
543
	  translation = TransFM;
544
	}
545
      else if (!strcmp(argv[formula_index], "-fr"))
546
	{
547
	  fm_red = true;
548
	  translation = TransFM;
549
	}
550
551
552
553
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
554
555
556
557
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
558
559
      else if (!strcmp(argv[formula_index], "-g"))
	{
560
	  accepting_run = true;
561
562
	  graph_run_opt = true;
	}
563
564
      else if (!strcmp(argv[formula_index], "-G"))
	{
565
	  accepting_run = true;
566
567
	  graph_run_tgba_opt = true;
	}
568
569
570
571
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
572
573
574
575
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
576
577
578
579
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
580
581
582
583
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
584
585
586
587
588
589
590
591
592
593
594
595
      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");
	}
596
597
598
599
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
600
601
602
603
      else if (!strcmp(argv[formula_index], "-KC"))
	{
	  output = 15;
	}
604
605
606
607
      else if (!strcmp(argv[formula_index], "-KW"))
	{
	  output = 16;
	}
608
609
610
611
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
612
613
614
615
616
617
618
619
620
621
      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;
	}
622
623
624
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
625
	  translation = TransFM;
626
	}
627
628
629
630
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
631
632
      else if (!strcmp(argv[formula_index], "-m"))
	{
633
	  opt_reduce = true;
634
	}
martinez's avatar
martinez committed
635
636
      else if (!strcmp(argv[formula_index], "-N"))
	{
637
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
638
639
	  output = 8;
	}
640
641
642
643
644
645
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
646
647
      else if (!strcmp(argv[formula_index], "-O"))
	{
648
	  output = 14;
649
          opt_minimize = true;
650
	}
651
652
653
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
654
	  translation = TransFM;
655
	}
656
657
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
658
659
	  tm.start("reading -P's argument");

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

958
  if ((graph_run_opt || graph_run_tgba_opt)
959
      && (!echeck_inst || !expect_counter_example))
960
    {
961
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
962
963
964
      exit(1);
    }

965
966
967
968
  std::string input;

  if (file_opt)
    {
969
      tm.start("reading formula");
970
      if (strcmp(argv[formula_index], "-"))
971
	{
972
	  std::ifstream fin(argv[formula_index]);
973
	  if (!fin)
974
975
976
977
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
978

979
	  if (!std::getline(fin, input, '\0'))
980
981
982
983
984
985
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
986
	{
987
	  std::getline(std::cin, input, '\0');
988
	}
989
      tm.stop("reading formula");
990
991
992
993
994
995
    }
  else
    {
      input = argv[formula_index];
    }

996
  const spot::ltl::formula* f = 0;
997
  if (!from_file) // Reading a formula, not reading an automaton from a file.
998
    {
999
1000
1001
1002
1003
      switch (translation)
	{
	case TransFM:
	case TransLaCIM:
	case TransTAA: