ltl2tgba.cc 49.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
Thomas Badie's avatar
Thomas Badie committed
219
220
            << "  -RDCS reduce the automaton with direct simulation"
            << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
221
            << "  -Rm   attempt to WDBA-minimize the automaton" << std::endl
222
	    << std::endl
223
224
225
            << "  -RM   attempt to WDBA-minimize the automaton unless the "
	    << "result is bigger" << std::endl
	    << std::endl
226

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

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

316
317
318
  exit(2);
}

Thomas Badie's avatar
Thomas Badie committed
319
320
321
322
323
324
325
326
327
328
329
static int
to_int(const char* s)
{
  char* endptr;
  int res = strtol(s, &endptr, 10);
  if (*endptr)
    return -1;
  return res;
}


330
331
332
333
334
int
main(int argc, char** argv)
{
  int exit_code = 0;

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

404
  for (;;)
405
    {
406
      if (argc < formula_index + 2)
407
	syntax(argv[0]);
408
409
410

      ++formula_index;

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

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

863
  if ((graph_run_opt || graph_run_tgba_opt)
864
      && (!echeck_inst || !expect_counter_example))
865
    {
866
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
867
868
869
      exit(1);
    }

870
871
872
873
  std::string input;

  if (file_opt)
    {
874
      tm.start("reading formula");
875
      if (strcmp(argv[formula_index], "-"))
876
	{
877
	  std::ifstream fin(argv[formula_index]);
878
	  if (!fin)
879
880
881
882
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
883

884
	  if (!std::getline(fin, input, '\0'))
885
886
887
888
889
890
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
891
	{
892
	  std::getline(std::cin, input, '\0');
893
	}
894
      tm.stop("reading formula");
895
896
897
898
899
900
    }
  else
    {
      input = argv[formula_index];
    }

901
  const spot::ltl::formula* f = 0;
902
  if (!from_file) // Reading a formula, not reading an automaton from a file.
903
    {
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
      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;
945
	}
946
    }
947

948
  if (f || from_file)
949
    {
950
      spot::tgba_bdd_concrete* concrete = 0;
951
      const spot::tgba* to_free = 0;
952
      const spot::tgba* to_free2 = 0;
953
      spot::tgba* a = 0;
954
      bool assume_sba = false;
955

956
957
      if (from_file)
	{
958
959
	  spot::tgba_explicit_string* e = 0;
	  if (!read_neverclaim && !read_lbtt)
960
961
962
963
964
965
966
967
968
969
970
971
972
	    {
	      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;
		}
	    }
973
	  else if (read_neverclaim)
974
	    {
975
	      spot::neverclaim_parse_error_list pel;
976
	      tm.start("parsing neverclaim");
977
978
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
979
	      tm.stop("parsing neverclaim");
980
981
982
983
984
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
985
		}
986
	      assume_sba = true;
987
	    }
988
989
990
991
992
993
994
995
99