ltl2tgba.cc 54.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
#include "tgbaalgos/dbacomp.hh"
74

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

331
332
333
  exit(2);
}

Thomas Badie's avatar
Thomas Badie committed
334
335
336
337
338
339
static int
to_int(const char* s)
{
  char* endptr;
  int res = strtol(s, &endptr, 10);
  if (*endptr)
340
341
342
343
    {
      std::cerr << "Failed to parse `" << s << "' as an integer." << std::endl;
      exit(1);
    }
Thomas Badie's avatar
Thomas Badie committed
344
345
346
  return res;
}

347
348
349
350
351
int
main(int argc, char** argv)
{
  int exit_code = 0;

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

432
  for (;;)
433
    {
434
      if (argc < formula_index + 2)
435
	syntax(argv[0]);
436
437
438

      ++formula_index;

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

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

972
  if ((graph_run_opt || graph_run_tgba_opt)
973
      && (!echeck_inst || !expect_counter_example))
974
    {
975
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
976
977
978
      exit(1);
    }

979
980
981
982
  std::string input;

  if (file_opt)
    {
983
      tm.start("reading formula");
984
      if (strcmp(argv[formula_index], "-"))
985
	{
986
	  std::ifstream fin(argv[formula_index]);
987
	  if (!fin)
988
989
990
991
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
992

993
	  if (!std::getline(fin, input, '\0'))