ltl2tgba.cc 47.6 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 "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
49
#include "tgbaalgos/minimize.hh"
50
#include "taalgos/minimize.hh"
51
#include "tgbaalgos/neverclaim.hh"
52
#include "tgbaalgos/replayrun.hh"
53
#include "tgbaalgos/rundotdec.hh"
54
#include "tgbaalgos/sccfilter.hh"
55
#include "tgbaalgos/safety.hh"
56
#include "tgbaalgos/eltl2tgba_lacim.hh"
57
#include "tgbaalgos/gtec/gtec.hh"
58
#include "eltlparse/public.hh"
59
#include "misc/timer.hh"
Thomas Badie's avatar
Thomas Badie committed
60
#include "misc/unique_ptr.hh"
61
#include "tgbaalgos/stats.hh"
62
#include "tgbaalgos/scc.hh"
63
#include "tgbaalgos/emptiness_stats.hh"
64
#include "tgbaalgos/scc.hh"
65
#include "tgbaalgos/isdet.hh"
66
#include "tgbaalgos/cycles.hh"
67
#include "tgbaalgos/isweakscc.hh"
68
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
69
#include "tgbaalgos/simulation.hh"
70

71
#include "taalgos/tgba2ta.hh"
72
#include "taalgos/dotty.hh"
73
#include "taalgos/stats.hh"
74

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

93
94
95
void
syntax(char* prog)
{
96
97
98
99
100
  // 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;

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

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

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
118
	    << std::endl
119
	    << "  -X    do not compute an automaton, read it from a file"
120
	    << std::endl
121
122
	    << "  -XL   do not compute an automaton, read it from an"
	    << " LBTT file" << std::endl
123
124
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
125
126
127
128
	    << "  -Pfile  multiply the formula automaton with the TGBA read"
	    << " from `file'\n"
	    << "  -KPfile multiply the formula automaton with the Kripke"
	    << " structure from `file'\n"
129
130
131
	    << std::endl

	    << "Translation algorithm:" << std::endl
132
            << "  -f    use Couvreur's FM algorithm for LTL"
133
	    << " (default)" << std::endl
134
            << "  -l    use Couvreur's LaCIM algorithm for LTL "
135
	    << std::endl
136
137
138
	    << "  -le   use Couvreur's LaCIM algorithm for ELTL"
	    << std::endl
            << "  -taa  use Tauriainen's TAA-based algorithm for LTL"
martinez's avatar
martinez committed
139
	    << std::endl
140
141
142
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
143
144
	    << "  -fr   reduce formula at each step of FM" << std::endl
	    << "          as specified with the -r{1..7} options" << std::endl
145
146
147
148
149
            << "  -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)"
150
	    << std::endl
151
152
153
154
            << "  -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
155
	    << std::endl
156

157
158
	    << "Options for Couvreur's LaCIM algorithm (-l or -le):"
	    << std::endl
159
160
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
161
	    << std::endl
162
	    << "  -A    same as -a, but as a set" << std::endl
163
164
	    << "  -lo   pre-define standard LTL operators as automata "
	    << "(implies -le)" << std::endl
165
	    << "  -r    display the relation BDD, not the reachability graph"
166
	    << std::endl
167
	    << "  -R    same as -r, but as a set" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
168
169
	    << "  -R3b  symbolically prune unaccepting SCC from BDD relation"
	    << std::endl
170
	    << std::endl
171
172

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
173
	    << std::endl
174
	    << "  -c    enable language containment checks (implies -taa)"
175
	    << std::endl
176
	    << std::endl
177
178

	    << "Formula simplification (before translation):"
179
	    << std::endl
martinez's avatar
martinez committed
180
181
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
182
	    << "universality" << std::endl
martinez's avatar
martinez committed
183
	    << "  -r3   reduce formula using implication between "
184
	    << "sub-formulae" << std::endl
185
186
187
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
188
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
189
	    << "  -rd   display the reduced formula" << std::endl
190
	    << "  -rD   dump statistics about the simplifier cache" << std::endl
191
192
	    << "  -rL   disable basic rewritings producing larger formulas"
	    << std::endl << std::endl
193
194
195
196
197
198
199

	    << "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
200
201
202
203
	    << "          (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"
204
205
206
207
	    << std::endl

	    << "Automaton simplifications (after translation):"
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
208
	    << "  -R3   use SCC to reduce the automaton" << std::endl
209
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
210
211
212
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
213
	    << "  -RDS  reduce the automaton with direct simulation"
214
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
215
	    << "  -RRS  reduce the automaton with reverse simulation"
Thomas Badie's avatar
Thomas Badie committed
216
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
217
	    << "  -RIS  iterate both direct and reverse simulations"
218
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
219
            << "  -Rm   attempt to WDBA-minimize the automaton" << std::endl
220
	    << std::endl
221
222
223
            << "  -RM   attempt to WDBA-minimize the automaton unless the "
	    << "result is bigger" << std::endl
	    << std::endl
224

225
            << "Automaton conversion:" << std::endl
226
227
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
228
	    << "  -s    convert to explicit automaton, and number states "
229
	    << "in DFS order" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
230
	    << "  -S    convert to explicit automaton, and number states "
231
	    << "in BFS order" << std::endl
232
233
	    << std::endl

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

314
315
316
317
318
319
320
321
  exit(2);
}

int
main(int argc, char** argv)
{
  int exit_code = 0;

322
  bool debug_opt = false;
323
  bool paper_opt = false;
324
  bool utf8_opt = false;
325
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
326
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
327
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA }
328
    translation = TransFM;
329
  bool fm_red = false;
330
  bool fm_exprop_opt = false;
331
  bool fm_symb_merge_opt = true;
332
  bool file_opt = false;
333
  bool degen_reset = true;
334
  bool degen_order = false;
335
  bool degen_cache = true;
336
  int output = 0;
337
  int formula_index = 0;
338
339
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
340
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
341
  bool expect_counter_example = false;
342
343
  bool accepting_run = false;
  bool accepting_run_replay = false;
344
  bool from_file = false;
345
  bool read_neverclaim = false;
346
  bool read_lbtt = false;
347
  bool scc_filter = false;
348
  bool simpltl = false;
349
350
  spot::ltl::ltl_simplifier_options redopt(false, false, false, false,
					   false, false, false);
351
  bool simpcache_stats = false;
352
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
353
  bool symbolic_scc_pruning = false;
354
  bool display_reduced_form = false;
355
  bool post_branching = false;
356
  bool fair_loop_approx = false;
357
  bool graph_run_opt = false;
358
  bool graph_run_tgba_opt = false;
359
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
360
  bool opt_minimize = false;
361
  bool reject_bigger = false;
362
  bool opt_bisim_ta = false;
363
  bool opt_monitor = false;
364
  bool containment = false;
365
  bool show_fc = false;
366
  bool spin_comments = false;
367
368
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
369
  spot::tgba* system = 0;
370
  const spot::tgba* product_to_free = 0;
371
  spot::bdd_dict* dict = new spot::bdd_dict();
372
373
  spot::timer_map tm;
  bool use_timer = false;
Thomas Badie's avatar
Thomas Badie committed
374
  bool reduction_dir_sim = false;
Thomas Badie's avatar
Thomas Badie committed
375
  bool reduction_rev_sim = false;
376
  bool reduction_iterated_sim = false;
Thomas Badie's avatar
Thomas Badie committed
377
  spot::tgba* temp_dir_sim = 0;
378
  bool ta_opt = false;
379
  bool tgta_opt = false;
380
  bool opt_with_artificial_initial_state = true;
381
382
  bool opt_single_pass_emptiness_check = false;
  bool opt_with_artificial_livelock = false;
Thomas Badie's avatar
Thomas Badie committed
383
  spot::tgba* temp_rev_sim = 0;
384
385
  spot::tgba* temp_iterated_sim = 0;

386

387
  for (;;)
388
    {
389
      if (argc < formula_index + 2)
390
	syntax(argv[0]);
391
392
393

      ++formula_index;

394
395
396
397
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
398
399
400
401
402
      else if (!strcmp(argv[formula_index], "-8"))
	{
	  utf8_opt = true;
	  spot::enable_utf8();
	}
403
      else if (!strcmp(argv[formula_index], "-a"))
404
405
406
	{
	  output = 2;
	}
407
      else if (!strcmp(argv[formula_index], "-A"))
408
	{
409
	  output = 4;
410
	}
411
      else if (!strcmp(argv[formula_index], "-b"))
412
	{
413
	  output = 7;
414
	}
415
416
417
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
418
	  translation = TransTAA;
419
	}
420
421
422
423
424
425
426
427
428
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
429
      else if (!strcmp(argv[formula_index], "-d"))
430
431
432
	{
	  debug_opt = true;
	}
433
434
      else if (!strcmp(argv[formula_index], "-D"))
	{
435
436
	  degeneralize_opt = DegenTBA;
	}
437
      else if (!strncmp(argv[formula_index], "-DS", 3))
438
439
	{
	  degeneralize_opt = DegenSBA;
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
	  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;
		}
	    }
465
	}
466
      else if (!strncmp(argv[formula_index], "-e", 2))
467
        {
468
469
470
471
472
473
474
475
476
477
478
479
480
	  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);
	    }
481
482
483
          expect_counter_example = true;
          output = -1;
        }
484
      else if (!strncmp(argv[formula_index], "-E", 2))
485
        {
486
487
488
489
490
491
492
493
494
495
496
497
498
	  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);
	    }
499
500
501
          expect_counter_example = false;
          output = -1;
        }
502
503
      else if (!strcmp(argv[formula_index], "-f"))
	{
504
	  translation = TransFM;
505
	}
506
      else if (!strcmp(argv[formula_index], "-fr"))
507
	{
508
	  fm_red = true;
509
	  translation = TransFM;
510
	}
511
512
513
514
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
515
516
517
518
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
519
520
      else if (!strcmp(argv[formula_index], "-g"))
	{
521
	  accepting_run = true;
522
523
	  graph_run_opt = true;
	}
524
525
      else if (!strcmp(argv[formula_index], "-G"))
	{
526
	  accepting_run = true;
527
528
	  graph_run_tgba_opt = true;
	}
529
530
531
532
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
533
534
535
536
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
537
538
539
540
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
541
542
543
544
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
545
546
547
548
549
550
551
552
553
554
555
556
      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");
	}
557
558
559
560
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
561
562
563
564
      else if (!strcmp(argv[formula_index], "-KC"))
	{
	  output = 15;
	}
565
566
567
568
      else if (!strcmp(argv[formula_index], "-KW"))
	{
	  output = 16;
	}
569
570
571
572
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
573
574
575
576
577
578
579
580
581
582
      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;
	}
583
584
585
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
586
	  translation = TransFM;
587
	}
588
589
590
591
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
592
593
      else if (!strcmp(argv[formula_index], "-m"))
	{
594
	  opt_reduce = true;
595
	}
martinez's avatar
martinez committed
596
597
      else if (!strcmp(argv[formula_index], "-N"))
	{
598
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
599
600
	  output = 8;
	}
601
602
603
604
605
606
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
607
608
      else if (!strcmp(argv[formula_index], "-O"))
	{
609
	  output = 14;
610
          opt_minimize = true;
611
	}
612
613
614
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
615
	  translation = TransFM;
616
	}
617
618
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
619
620
	  tm.start("reading -P's argument");

621
	  spot::tgba_parse_error_list pel;
622
623
624
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
625
626
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
627
	    return 2;
628
	  s->merge_transitions();
629
	  tm.stop("reading -P's argument");
630
	  system = s;
631
	}
632
633
      else if (!strcmp(argv[formula_index], "-r"))
	{
634
635
	  output = 1;
	}
636
637
      else if (!strcmp(argv[formula_index], "-r1"))
	{
638
639
	  simpltl = true;
	  redopt.reduce_basics = true;
640
641
642
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
643
644
	  simpltl = true;
	  redopt.event_univ = true;
645
646
647
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
648
649
	  simpltl = true;
	  redopt.synt_impl = true;
650
651
652
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
653
654
655
656
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
657
	}
658
659
      else if (!strcmp(argv[formula_index], "-r5"))
	{
660
661
	  simpltl = true;
	  redopt.containment_checks = true;
662
663
664
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
665
666
667
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
668
669
670
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
671
672
673
674
675
676
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
677
	}
678
679
680
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
681
	}
682
683
684
685
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
686
	{
687
	  // For backward compatibility, make all these options
688
	  // equal to -RDS.
689
	  reduction_dir_sim = true;
690
	}
Thomas Badie's avatar
Thomas Badie committed
691
692
693
694
      else if (!strcmp(argv[formula_index], "-RRS"))
        {
          reduction_rev_sim = true;
        }
695
696
      else if (!strcmp(argv[formula_index], "-R3"))
	{
697
	  scc_filter = true;
698
	}
699
700
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
701
	  scc_filter = true;
702
703
	  scc_filter_all = true;
	}
704
705
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
706
	  symbolic_scc_pruning = true;
707
	}
708
709
      else if (!strcmp(argv[formula_index], "-rd"))
	{
710
	  display_reduced_form = true;
711
	}
712
713
714
715
      else if (!strcmp(argv[formula_index], "-rD"))
	{
	  simpcache_stats = true;
	}
716
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
717
        {
718
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
719
        }
720
721
722
723
      else if (!strcmp(argv[formula_index], "-RIS"))
        {
          reduction_iterated_sim = true;
        }
724
      else if (!strcmp(argv[formula_index], "-rL"))
725
726
727
728
729
        {
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.reduce_size_strictly = true;
        }
730
731
732
733
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
734
735
736
737
738
      else if (!strcmp(argv[formula_index], "-RM"))
        {
          opt_minimize = true;
	  reject_bigger = true;
        }
739
740
741
742
      else if (!strcmp(argv[formula_index], "-RT"))
        {
          opt_bisim_ta = true;
        }
743
744
745
746
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
747
748
749
750
751
752
753
754
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
755
756
757
758
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
759
760
761
762
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
763
764
765
766
      else if (!strcmp(argv[formula_index], "-TA"))
        {
          ta_opt = true;
        }
767
      else if (!strcmp(argv[formula_index], "-TGTA"))
768
        {
769
          tgta_opt = true;
770
        }
771
772
773
774
      else if (!strcmp(argv[formula_index], "-lv"))
        {
          opt_with_artificial_livelock = true;
        }
775
776
777
778
      else if (!strcmp(argv[formula_index], "-sp"))
        {
          opt_single_pass_emptiness_check = true;
        }
779
780
781
782
      else if (!strcmp(argv[formula_index], "-in"))
        {
          opt_with_artificial_initial_state = false;
        }
783
784
785
786
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
787
788
789
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
790
	  translation = TransFM;
791
	  // Parse -U's argument.
792
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
793
794
795
	  while (tok)
	    {
	      unobservables->insert
796
		(static_cast<const spot::ltl::atomic_prop*>(env.require(tok)));
797
	      tok = strtok(0, ", \t;");
798
799
	    }
	}
800
801
802
803
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
804
805
      else if (!strcmp(argv[formula_index], "-x"))
	{
806
	  translation = TransFM;
807
808
	  fm_exprop_opt = true;
	}
809
810
811
812
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
813
814
815
816
817
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
818
819
820
821
822
      else if (!strcmp(argv[formula_index], "-XL"))
	{
	  from_file = true;
	  read_lbtt = true;
	}
823
824
      else if (!strcmp(argv[formula_index], "-y"))
	{
825
	  translation = TransFM;
826
827
	  fm_symb_merge_opt = false;
	}
828
829
830
831
      else
	{
	  break;
	}
832
833
    }

834
  if ((graph_run_opt || graph_run_tgba_opt)
835
      && (!echeck_inst || !expect_counter_example))
836
    {
837
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
838
839
840
      exit(1);
    }

841
842
843
844
  std::string input;

  if (file_opt)
    {
845
      tm.start("reading formula");
846
      if (strcmp(argv[formula_index], "-"))
847
	{
848
	  std::ifstream fin(argv[formula_index]);
849
	  if (!fin)
850
851
852
853
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
854

855
	  if (!std::getline(fin, input, '\0'))
856
857
858
859
860
861
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
862
	{
863
	  std::getline(std::cin, input, '\0');
864
	}
865
      tm.stop("reading formula");
866
867
868
869
870
871
    }
  else
    {
      input = argv[formula_index];
    }

872
  const spot::ltl::formula* f = 0;
873
  if (!from_file) // Reading a formula, not reading an automaton from a file.
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
      switch (translation)
	{
	case TransFM:
	case TransLaCIM:
	case TransTAA:
	  {
	    spot::ltl::parse_error_list pel;
	    tm.start("parsing formula");
	    f = spot::ltl::parse(input, pel, env, debug_opt);
	    tm.stop("parsing formula");
	    exit_code = spot::ltl::format_parse_errors(std::cerr, input, pel);
	  }
	  break;
	case TransLaCIM_ELTL:
	  {
	    spot::eltl::parse_error_list p;
	    tm.start("parsing formula");
	    f = spot::eltl::parse_string(input, p, env, false);
	    tm.stop("parsing formula");
	    exit_code = spot::eltl::format_parse_errors(std::cerr, p);
	  }
	  break;
	case TransLaCIM_ELTL_ops:
	  {
	    // Call the LTL parser first to handle operators such as
	    // [] or <> and rewrite the output as a string with G or F.
	    // Then prepend definitions of usual LTL operators, and parse
	    // the result again as an ELTL formula.
	    spot::ltl::parse_error_list pel;
	    tm.start("parsing formula");
	    f = spot::ltl::parse(input, pel, env, debug_opt);
	    input = ltl_defs();
	    input += "%";
	    input += spot::ltl::to_string(f, true);
	    f->destroy();
	    spot::eltl::parse_error_list p;
	    f = spot::eltl::parse_string(input, p, env, debug_opt);
	    tm.stop("parsing formula");
	    exit_code = spot::eltl::format_parse_errors(std::cerr, p);
	  }
	  break;
916
	}
917
    }
918

919
  if (f || from_file)
920
    {
921
      spot::tgba_bdd_concrete* concrete = 0;
922
      const spot::tgba* to_free = 0;
923
      const spot::tgba* to_free2 = 0;
924
      spot::tgba* a = 0;
925
      bool assume_sba = false;
926

927
928
      if (from_file)
	{
929
930
	  spot::tgba_explicit_string* e = 0;
	  if (!read_neverclaim && !read_lbtt)
931
932
933
934
935
936
937
938
939
940
941
942
943
	    {
	      spot::tgba_parse_error_list pel;
	      tm.start("parsing automaton");
	      to_free = a = e = spot::tgba_parse(input, pel, dict,
						 env, env, debug_opt);
	      tm.stop("parsing automaton");
	      if (spot::format_tgba_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
		}
	    }
944
	  else if (read_neverclaim)
945
	    {
946
	      spot::neverclaim_parse_error_list pel;
947
	      tm.start("parsing neverclaim");
948
949
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
950
	      tm.stop("parsing neverclaim");
951
952
953
954
955
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
956
		}
957
	      assume_sba = true;
958
	    }
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
	  else
	    {
	      std::string error;
	      std::fstream f(input.c_str());
	      if (!f)
		{
		  std::cerr << "cannot open " << input << std::endl;
		  delete dict;
		  return 2;
		}
	      tm.start("parsing lbtt");
	      to_free = a =
		const_cast<spot::tgba*>(spot::lbtt_parse(f, error, dict,
							 env, env));
	      tm.stop("parsing lbtt");
	      if (!to_free)
		{
		  std::cerr << error << std::endl;
		  delete dict;
		  return 2;
		}
	    }
	  if (e)
	    e->merge_transitions();
983
	}
984
      else
985
	{
986
987
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
988
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
989
990

	  if (simp)