ltl2tgba.cc 45 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
66
#include "tgbaalgos/scc.hh"
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
67
#include "tgbaalgos/simulation.hh"
68

69
#include "taalgos/tgba2ta.hh"
70
#include "taalgos/dotty.hh"
71
#include "taalgos/stats.hh"
72

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

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

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

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

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

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

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

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

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

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

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

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

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

304
305
306
307
308
309
310
311
  exit(2);
}

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

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

374

375
  for (;;)
376
    {
377
      if (argc < formula_index + 2)
378
	syntax(argv[0]);
379
380
381

      ++formula_index;

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

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

784
  if ((graph_run_opt || graph_run_tgba_opt)
785
      && (!echeck_inst || !expect_counter_example))
786
    {
787
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
788
789
790
      exit(1);
    }

791
792
793
794
  std::string input;

  if (file_opt)
    {
795
      tm.start("reading formula");
796
      if (strcmp(argv[formula_index], "-"))
797
	{
798
	  std::ifstream fin(argv[formula_index]);
799
	  if (!fin)
800
801
802
803
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
804

805
	  if (!std::getline(fin, input, '\0'))
806
807
808
809
810
811
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
812
	{
813
	  std::getline(std::cin, input, '\0');
814
	}
815
      tm.stop("reading formula");
816
817
818
819
820
821
    }
  else
    {
      input = argv[formula_index];
    }

822
  const spot::ltl::formula* f = 0;
823
  if (!from_file) // Reading a formula, not reading an automaton from a file.
824
    {
825
826
827
828
829
830
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
      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;
866
	}
867
    }
868

869
  if (f || from_file)
870
    {
871
      spot::tgba_bdd_concrete* concrete = 0;
872
      const spot::tgba* to_free = 0;
873
      const spot::tgba* to_free2 = 0;
874
      spot::tgba* a = 0;
875

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

	  if (simp)
917
	    {
918
	      tm.start("reducing formula");
919
	      const spot::ltl::formula* t = simp->simplify(f);
920
	      f->destroy();
921
	      tm.stop("reducing formula");
922
	      f = t;
923
924
925
926
927
928
929
	      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;
		}
930
931
932
	      // This helps ltl_to_tgba_fm() to order BDD variables in
	      // a more natural way.
	      simp->clear_as_bdd_cache();
933
	    }
934

935
936
937
938
939
940
941
942
943
	  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;
	    }

944
	  tm.start("translating formula");
945
946
947
948
949
950
951
952
	  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,
953
				       fm_red ? simp : 0);
954
955
956
957
958
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
959
960
961
962
963
	      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);
964
965
	      break;
	    }
966
	  tm.stop("translating formula");
967
	  to_free = a;
968

969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
	  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: " <<  s.varnum
			<< "\n    cachesize: " << s.cachesize
			<< "\n    gbcnum: " << s.gbcnum
			<< std::endl;
	      bdd_fprintstat(stderr);
	      dict->dump(std::cerr);
	    }
986
	  delete simp;
987
	}
988

989
      if (opt_monitor && !scc_filter)