ltl2tgba.cc 40.7 KB
Newer Older
1
// Copyright (C) 2007, 2008, 2009, 2010, 2011 Laboratoire de Recherche et
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
2
// Dveloppement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
3
4
// Copyright (C) 2003, 2004, 2005, 2006, 2007 Laboratoire d'Informatique de
// Paris 6 (LIP6), dpartement Systmes Rpartis
5
// Coopratifs (SRC), Universit Pierre et Marie Curie.
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
//
// 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.

24
#include <iostream>
25
#include <iomanip>
26
#include <cassert>
27
28
#include <fstream>
#include <string>
29
#include <cstdlib>
30
#include "ltlvisit/contain.hh"
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 "tgba/tgbaproduct.hh"
45
#include "tgba/futurecondcol.hh"
46
#include "tgbaalgos/reducerun.hh"
47
#include "tgbaparse/public.hh"
48
#include "neverparse/public.hh"
49
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
50
#include "tgbaalgos/minimize.hh"
51
#include "tgbaalgos/neverclaim.hh"
52
#include "tgbaalgos/reductgba_sim.hh"
53
#include "tgbaalgos/replayrun.hh"
54
#include "tgbaalgos/rundotdec.hh"
55
#include "tgbaalgos/sccfilter.hh"
56
#include "tgbaalgos/safety.hh"
57
#include "tgbaalgos/eltl2tgba_lacim.hh"
58
#include "tgbaalgos/gtec/gtec.hh"
59
#include "eltlparse/public.hh"
60
#include "misc/timer.hh"
61
#include "tgbaalgos/stats.hh"
62
#include "tgbaalgos/scc.hh"
63
#include "tgbaalgos/emptiness_stats.hh"
64
65
#include "tgbaalgos/scc.hh"
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
66
#include "tgbaalgos/simulation.hh"
67

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

86
87
88
void
syntax(char* prog)
{
89
90
91
92
93
  // 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;

94
  std::cerr << "Usage: "<< prog << " [-f|-l|-le|-taa] [OPTIONS...] formula"
95
	    << std::endl
96
            << "       "<< prog << " [-f|-l|-le|-taa] -F [OPTIONS...] file"
97
	    << std::endl
98
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
99
	    << std::endl
100

101
102
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
103
104
105
106
	    << "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
107
	    << std::endl
108
109
110

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

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

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
135
136
137
138
	    << "  -fr1  use -r1 (see below) at each step of FM" << std::endl
	    << "  -fr2  use -r2 (see below) at each step of FM" << std::endl
	    << "  -fr3  use -r3 (see below) at each step of FM" << std::endl
	    << "  -fr4  use -r4 (see below) at each step of FM" << std::endl
139
140
141
	    << "  -fr5  use -r5 (see below) at each step of FM" << std::endl
	    << "  -fr6  use -r6 (see below) at each step of FM" << std::endl
	    << "  -fr7  use -r7 (see below) at each step of FM" << 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
187
188
189
190
191
192
193
194
195
196
197
198
	    << "  -rd   display the reduced formula" << std::endl
	    << std::endl

	    << "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
199
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
200
	    << "(use -L for more reduction)"
201
	    << std::endl
202
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
203
	    << "(use -L for more reduction)"
204
	    << std::endl
205
206
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
207
	    << std::endl
208
	    << "  -R3   use SCC to reduce the automata" << std::endl
209
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
210
211
212
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
213
214
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
Felix Abecassis's avatar
Felix Abecassis committed
215
            << "  -Rm   attempt to minimize the automata" << std::endl
216
	    << std::endl
217

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

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

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

297
  bool debug_opt = false;
298
  bool paper_opt = false;
299
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
300
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
301
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA }
302
    translation = TransFM;
303
  int fm_red = spot::ltl::Reduce_None;
304
  bool fm_exprop_opt = false;
305
  bool fm_symb_merge_opt = true;
306
  bool file_opt = false;
307
  int output = 0;
308
  int formula_index = 0;
309
310
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
311
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
312
  bool expect_counter_example = false;
313
314
  bool accepting_run = false;
  bool accepting_run_replay = false;
315
  bool from_file = false;
316
  bool read_neverclaim = false;
317
  int reduc_aut = spot::Reduce_None;
318
  int redopt = spot::ltl::Reduce_None;
319
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
320
  bool symbolic_scc_pruning = false;
321
322
  bool display_reduce_form = false;
  bool display_rel_sim = false;
323
  bool display_parity_game = false;
324
  bool post_branching = false;
325
  bool fair_loop_approx = false;
326
  bool graph_run_opt = false;
327
  bool graph_run_tgba_opt = false;
328
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
329
  bool opt_minimize = false;
330
  bool opt_monitor = false;
331
  bool containment = false;
332
  bool show_fc = false;
333
  bool spin_comments = false;
334
335
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
336
  spot::tgba* system = 0;
337
338
  const spot::tgba* product = 0;
  const spot::tgba* product_to_free = 0;
339
  spot::bdd_dict* dict = new spot::bdd_dict();
340
341
  spot::timer_map tm;
  bool use_timer = false;
342
  bool assume_sba = false;
Thomas Badie's avatar
Thomas Badie committed
343
344
345
  bool reduction_dir_sim = false;
  spot::tgba* temp_dir_sim = 0;

346

347
  for (;;)
348
    {
349
      if (argc < formula_index + 2)
350
	syntax(argv[0]);
351
352
353

      ++formula_index;

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

575
	  spot::tgba_parse_error_list pel;
576
577
578
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
579
580
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
581
	    return 2;
582
	  s->merge_transitions();
583
	  tm.stop("reading -P's argument");
584
	  system = s;
585
	}
586
587
      else if (!strcmp(argv[formula_index], "-r"))
	{
588
589
	  output = 1;
	}
590
591
592
593
594
595
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
596
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
597
598
599
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
600
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
601
602
603
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
604
605
606
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
607
	}
608
609
      else if (!strcmp(argv[formula_index], "-r5"))
	{
610
	  redopt |= spot::ltl::Reduce_Containment_Checks;
611
612
613
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
614
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
615
616
617
618
619
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
620
621
622
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
623
	}
martinez's avatar
martinez committed
624
625
626
627
      else if (!strcmp(argv[formula_index], "-R1q"))
	{
	  reduc_aut |= spot::Reduce_quotient_Dir_Sim;
	}
Thomas Badie's avatar
Thomas Badie committed
628
629
630
631
      else if (!strcmp(argv[formula_index], "-RSD"))
        {
          reduction_dir_sim = true;
        }
martinez's avatar
martinez committed
632
633
634
635
636
      else if (!strcmp(argv[formula_index], "-R1t"))
	{
	  reduc_aut |= spot::Reduce_transition_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R2q"))
637
	{
martinez's avatar
martinez committed
638
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
639
	}
martinez's avatar
martinez committed
640
      else if (!strcmp(argv[formula_index], "-R2t"))
641
	{
martinez's avatar
martinez committed
642
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
643
644
645
646
647
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
648
649
650
651
652
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	  scc_filter_all = true;
	}
653
654
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
655
	  symbolic_scc_pruning = true;
656
	}
657
658
659
660
661
662
663
664
665
666
667
668
      else if (!strcmp(argv[formula_index], "-rd"))
	{
	  display_reduce_form = true;
	}
      else if (!strcmp(argv[formula_index], "-Rd"))
	{
	  display_rel_sim = true;
	}
      else if (!strcmp(argv[formula_index], "-RD"))
	{
	  display_parity_game = true;
	}
Felix Abecassis's avatar
Felix Abecassis committed
669
670
671
672
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
673
674
675
676
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
677
678
679
680
681
682
683
684
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
685
686
687
688
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
689
690
691
692
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
693
694
695
696
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
697
698
699
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
700
	  translation = TransFM;
701
	  // Parse -U's argument.
702
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
703
704
705
706
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
707
	      tok = strtok(0, ", \t;");
708
709
	    }
	}
710
711
712
713
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
714
715
      else if (!strcmp(argv[formula_index], "-x"))
	{
716
	  translation = TransFM;
717
718
	  fm_exprop_opt = true;
	}
719
720
721
722
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
723
724
725
726
727
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
728
729
      else if (!strcmp(argv[formula_index], "-y"))
	{
730
	  translation = TransFM;
731
732
	  fm_symb_merge_opt = false;
	}
733
734
735
736
      else
	{
	  break;
	}
737
738
    }

739
  if ((graph_run_opt || graph_run_tgba_opt)
740
      && (!echeck_inst || !expect_counter_example))
741
    {
742
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
743
744
745
      exit(1);
    }

746
747
748
749
  std::string input;

  if (file_opt)
    {
750
      tm.start("reading formula");
751
      if (strcmp(argv[formula_index], "-"))
752
	{
753
	  std::ifstream fin(argv[formula_index]);
754
	  if (!fin)
755
756
757
758
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
759

760
	  if (!std::getline(fin, input, '\0'))
761
762
763
764
765
766
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
767
	{
768
	  std::getline(std::cin, input, '\0');
769
	}
770
      tm.stop("reading formula");
771
772
773
774
775
776
    }
  else
    {
      input = argv[formula_index];
    }

777
  spot::ltl::formula* f = 0;
778
  if (!from_file) // Reading a formula, not reading an automaton from a file.
779
    {
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
      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;
821
	}
822
823
    }
  if (f || from_file)
824
    {
825
826
827
      const spot::tgba_bdd_concrete* concrete = 0;
      const spot::tgba* to_free = 0;
      const spot::tgba* a = 0;
828

829
830
      if (from_file)
	{
831
	  spot::tgba_explicit_string* e;
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
	  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
847
	    {
848
	      spot::neverclaim_parse_error_list pel;
849
	      tm.start("parsing neverclaim");
850
851
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
852
	      tm.stop("parsing neverclaim");
853
854
855
856
857
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
858
		}
859
	    }
860
	  e->merge_transitions();
861
	}
862
      else
863
	{
864
	  if (redopt != spot::ltl::Reduce_None)
865
	    {
866
	      tm.start("reducing formula");
867
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
868
	      f->destroy();
869
	      tm.stop("reducing formula");
870
	      f = t;
871
872
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
873
	    }
874

875
	  tm.start("translating formula");
876
877
878
879
880
881
882
883
	  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,
884
				       fm_red);
885
886
887
888
889
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
890
891
892
893
894
	      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);
895
896
	      break;
	    }
897
	  tm.stop("translating formula");
898
	  to_free = a;
899
	}
900

901
902
      if (opt_monitor && ((reduc_aut & spot::Reduce_Scc) == 0))
	{
903
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
904
905
906
907
908
	    symbolic_scc_pruning = true;
	  else
	    reduc_aut |= spot::Reduce_Scc;
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
909
910
      if (symbolic_scc_pruning)
        {
911
912
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
913
914
915
916
917
918
919
920
921
922
923
924
925
	  if (!bc)
	    {
	      std::cerr << ("Error: Automaton is not symbolic: cannot "
			    "prune SCCs symbolically.\n"
			    "       Try -R3 instead of -R3b, or use "
			    "another translation.")
			<< std::endl;
	      exit(2);
	    }
	  else
	    {
	      tm.start("reducing A_f w/ symbolic SCC pruning");
	      if (bc)
926
927
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
928
929
930
931
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

932
933
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
934
      const spot::tgba* aut_scc = 0;
935
936
937
      if (reduc_aut & spot::Reduce_Scc)
	{
	  tm.start("reducing A_f w/ SCC");
938
	  a = aut_scc = spot::scc_filter(a, scc_filter_all);
939
940
941
	  tm.stop("reducing A_f w/ SCC");
	}

942
943
      const spot::tgba_tba_proxy* degeneralized = 0;
      const spot::tgba_sgba_proxy* state_labeled = 0;
944

945
      const spot::tgba* minimized = 0;
Felix Abecassis's avatar
Felix Abecassis committed
946
      if (opt_minimize)
947
	{
948
949
950
951
952
	  tm.start("obligation minimization");
	  minimized = minimize_obligation(a, f);
	  tm.stop("obligation minimization");

	  if (minimized == 0)
953
	    {
954
	      // if (!f)
955
956
957
958
959
960
		{
		  std::cerr << "Error: Without a formula I cannot make "
			    << "sure that the automaton built with -Rm\n"
			    << "       is correct." << std::endl;
		  exit(2);
		}
961
	    }
962
963
964
965
966
967
968
	  else if (minimized == a)
	    {
	      minimized = 0;
	    }
	  else
	    {
	      a = minimized;
Thomas Badie's avatar
Thomas Badie committed
969
970
              // When the minimization succeed, simulation is useless.
              reduction_dir_sim = false;
971
	      assume_sba = true;
972
	    }
973
	}
Felix Abecassis's avatar
Felix Abecassis committed
974

Thomas Badie's avatar
Thomas Badie committed
975
976
977
978
979
980
981
982
983
984

      if (reduction_dir_sim)
        {
          tm.start("Reduction w/ direct simulation");
          temp_dir_sim = spot::simulation(a);
          a = temp_dir_sim;
          tm.stop("Reduction w/ direct simulation");
        }


985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
	  && degeneralize_opt == NoDegen
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
	{
	  degeneralize_opt = DegenTBA;
	  assume_sba = false;
	}

      if (!assume_sba && !opt_monitor)
	{
	  if (degeneralize_opt == DegenTBA)
	    {
	      a = degeneralized = new spot::tgba_tba_proxy(a);
	    }
	  else if (degeneralize_opt == DegenSBA)
	    {
	      a = degeneralized = new spot::tgba_sba_proxy(a);
	      assume_sba = true;
	    }
	  else if (labeling_opt == StateLabeled)
	    {
	      a = state_labeled = new spot::tgba_sgba_proxy(a);
	    }
	}

1012
1013
1014
      if (opt_monitor)
	{
	  tm.start("Monitor minimization");
1015
	  a = minimized = minimize_monitor(a);
1016
	  tm.stop("Monitor minimization");
1017
1018
1019
	  assume_sba = false; 	// All states are accepting, so double
				// circles in the dot output are
				// pointless.
1020
1021
	}

Thomas Badie's avatar
Thomas Badie committed
1022
1023


1024
1025
1026
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
1027
	  if (reduc_aut & ~spot::Reduce_Scc)
1028
	    {
1029
	      tm.start("reducing A_f w/ sim.");
1030
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
1031
1032

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
1033
1034
1035
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
1036
		{