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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

375

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

      ++formula_index;

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

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

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

792
793
794
795
  std::string input;

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

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

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

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

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

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

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

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

970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
	  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);
	    }
987
	  delete simp;
988
	}
989