ltl2tgba.cc 51 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
#include "tgbaalgos/compsusp.hh"
71

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

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

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

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

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

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

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

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

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

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

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

	    << "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
205
206
207
208
	    << "          (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"
209
210
211
212
	    << std::endl

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

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

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

321
322
323
  exit(2);
}

Thomas Badie's avatar
Thomas Badie committed
324
325
326
327
328
329
330
331
332
333
334
static int
to_int(const char* s)
{
  char* endptr;
  int res = strtol(s, &endptr, 10);
  if (*endptr)
    return -1;
  return res;
}


335
336
337
338
339
int
main(int argc, char** argv)
{
  int exit_code = 0;

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

415
  for (;;)
416
    {
417
      if (argc < formula_index + 2)
418
	syntax(argv[0]);
419
420
421

      ++formula_index;

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

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

924
  if ((graph_run_opt || graph_run_tgba_opt)
925
      && (!echeck_inst || !expect_counter_example))
926
    {
927
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
928
929
930
      exit(1);
    }

931
932
933
934
  std::string input;

  if (file_opt)
    {
935
      tm.start("reading formula");
936
      if (strcmp(argv[formula_index], "-"))
937
	{
938
	  std::ifstream fin(argv[formula_index]);
939
	  if (!fin)
940
941
942
943
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
944

945
	  if (!std::getline(fin, input, '\0'))
946
947
948
949
950
951
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
952
	{
953
	  std::getline(std::cin, input, '\0');
954
	}
955
      tm.stop("reading formula");
956
957
958
959
960
961
    }
  else
    {
      input = argv[formula_index];
    }

962
  const spot::ltl::formula* f = 0;
963
  if (!from_file) // Reading a formula, not reading an automaton from a file.
964
    {
965
966
967
968
969
      switch (translation)
	{
	case TransFM:
	case TransLaCIM:
	case TransTAA:
970
	case TransCompo:
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
	  {
	    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;
1007
	}
1008
    }
1009

1010
  if (f || from_file)
1011
    {
1012
      spot::tgba_bdd_concrete* concrete = 0;
1013
      const spot::tgba* to_free = 0;
1014
      const spot::tgba* to_free2 = 0;
1015
      spot::tgba* a = 0;
1016
      bool assume_sba = false;