ltl2tgba.cc 45.6 KB
Newer Older
1
2
3
// -*- coding: utf-8 -*-
// Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012 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
12
13
14
15
16
17
18
19
20
21
22
23
24
//
// 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
// the Free Software Foundation; either version 2 of the License, or
// (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
// along with Spot; see the file COPYING.  If not, write to the Free
// Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA.

25
#include <iostream>
26
#include <iomanip>
27
#include <cassert>
28
29
#include <fstream>
#include <string>
30
#include <cstdlib>
31
#include "ltlvisit/tostring.hh"
32
#include "ltlvisit/apcollect.hh"
33
#include "ltlast/allnodes.hh"
34
#include "ltlparse/public.hh"
35
#include "tgbaalgos/ltl2tgba_lacim.hh"
36
#include "tgbaalgos/ltl2tgba_fm.hh"
37
#include "tgbaalgos/ltl2taa.hh"
38
#include "tgba/bddprint.hh"
39
#include "tgbaalgos/save.hh"
40
#include "tgbaalgos/dotty.hh"
41
#include "tgbaalgos/lbtt.hh"
42
#include "tgba/tgbatba.hh"
43
#include "tgba/tgbasgba.hh"
44
#include "tgbaalgos/degen.hh"
45
#include "tgba/tgbaproduct.hh"
46
#include "tgba/futurecondcol.hh"
47
#include "tgbaalgos/reducerun.hh"
48
#include "tgbaparse/public.hh"
49
#include "neverparse/public.hh"
50
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
51
#include "tgbaalgos/minimize.hh"
52
#include "taalgos/minimize.hh"
53
#include "tgbaalgos/neverclaim.hh"
54
#include "tgbaalgos/replayrun.hh"
55
#include "tgbaalgos/rundotdec.hh"
56
#include "tgbaalgos/sccfilter.hh"
57
#include "tgbaalgos/safety.hh"
58
#include "tgbaalgos/eltl2tgba_lacim.hh"
59
#include "tgbaalgos/gtec/gtec.hh"
60
#include "eltlparse/public.hh"
61
#include "misc/timer.hh"
62
#include "tgbaalgos/stats.hh"
63
#include "tgbaalgos/scc.hh"
64
#include "tgbaalgos/emptiness_stats.hh"
65
#include "tgbaalgos/scc.hh"
66
#include "tgbaalgos/isdet.hh"
67
#include "tgbaalgos/cycles.hh"
68
#include "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
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
123
124
125
126
	    << "  -Pfile  multiply the formula automaton with the TGBA read"
	    << " from `file'\n"
	    << "  -KPfile multiply the formula automaton with the Kripke"
	    << " structure from `file'\n"
127
128
129
	    << std::endl

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

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

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

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

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

	    << "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
	    << std::endl

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

219
            << "Automaton conversion:" << std::endl
220
221
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
222
	    << "  -s    convert to explicit automaton, and number states "
223
	    << "in DFS order" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
224
	    << "  -S    convert to explicit automaton, and number states "
225
	    << "in BFS order" << std::endl
226
227
	    << std::endl

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

307
308
309
310
311
312
313
314
  exit(2);
}

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

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

377

378
  for (;;)
379
    {
380
      if (argc < formula_index + 2)
381
	syntax(argv[0]);
382
383
384

      ++formula_index;

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

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

791
  if ((graph_run_opt || graph_run_tgba_opt)
792
      && (!echeck_inst || !expect_counter_example))
793
    {
794
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
795
796
797
      exit(1);
    }

798
799
800
801
  std::string input;

  if (file_opt)
    {
802
      tm.start("reading formula");
803
      if (strcmp(argv[formula_index], "-"))
804
	{
805
	  std::ifstream fin(argv[formula_index]);
806
	  if (!fin)
807
808
809
810
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
811

812
	  if (!std::getline(fin, input, '\0'))
813
814
815
816
817
818
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
819
	{
820
	  std::getline(std::cin, input, '\0');
821
	}
822
      tm.stop("reading formula");
823
824
825
826
827
828
    }
  else
    {
      input = argv[formula_index];
    }

829
  const spot::ltl::formula* f = 0;
830
  if (!from_file) // Reading a formula, not reading an automaton from a file.
831
    {
832
833
834
835
836
837
838
839
840
841
842
843
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
      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;
873
	}
874
    }
875

876
  if (f || from_file)
877
    {
878
      spot::tgba_bdd_concrete* concrete = 0;
879
      const spot::tgba* to_free = 0;
880
      const spot::tgba* to_free2 = 0;
881
      spot::tgba* a = 0;
882

883
884
      if (from_file)
	{
885
	  spot::tgba_explicit_string* e;
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
	  if (!read_neverclaim)
	    {
	      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;
		}
	    }
	  else
901
	    {
902
	      spot::neverclaim_parse_error_list pel;
903
	      tm.start("parsing neverclaim");
904
905
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
906
	      tm.stop("parsing neverclaim");
907
908
909
910
911
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
912
		}
913
	      assume_sba = true;
914
	    }
915
	  e->merge_transitions();
916
	}
917
      else
918
	{
919
920
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
921
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
922
923

	  if (simp)
924
	    {
925
	      tm.start("reducing formula");
926
	      const spot::ltl::formula* t = simp->simplify(f);
927
	      f->destroy();
928
	      tm.stop("reducing formula");
929
	      f = t;
930
931
932
933
934
935
936
	      if (display_reduced_form)
		{
		  if (utf8_opt)
		    std::cout << spot::ltl::to_utf8_string(f) << std::endl;
		  else
		    std::cout << spot::ltl::to_string(f) << std::endl;
		}
937
938
939
	      // This helps ltl_to_tgba_fm() to order BDD variables in
	      // a more natural way.
	      simp->clear_as_bdd_cache();
940
	    }
941

942
943
944
945
946
947
948
949
950
	  if (f->is_psl_formula()
	      && !f->is_ltl_formula()
	      && translation != TransFM)
	    {
	      std::cerr << "Only the FM algorithm can translate PSL formulae;"
			<< " I'm using it for this formula." << std::endl;
	      translation = TransFM;
	    }

951
	  tm.start("translating formula");
952
953
954
955
956
957
958
959
	  switch (translation)
	    {
	    case TransFM:
	      a = spot::ltl_to_tgba_fm(f, dict, fm_exprop_opt,
				       fm_symb_merge_opt,
				       post_branching,
				       fair_loop_approx,
				       unobservables,
960
				       fm_red ? simp : 0);
961
962
963
964
965
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
966
967
968
969
970
	      a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	      break;
	    case TransLaCIM_ELTL:
	    case TransLaCIM_ELTL_ops:
	      a = concrete = spot::eltl_to_tgba_lacim(f, dict);
971
972
	      break;
	    }
973
	  tm.stop("translating formula");
974
	  to_free = a;
975

976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
	  if (simp && simpcache_stats)
	    {
	      simp->print_stats(std::cerr);
	      bddStat s;
	      bdd_stats(&s);
	      std::cerr << "BDD produced: " << s.produced
			<< "\n    nodenum: " << s.nodenum
			<< "\n    maxnodenum: " << s.maxnodenum
			<< "\n    freenodes: " <<  s.freenodes
			<< "\n    minfreenodes: " << s.minfreenodes
			<< "\n    varnum: " <&