ltl2tgba.cc 40.3 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 "tgbaalgos/neverclaim.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
#include "taalgos/sba2ta.hh"
#include "taalgos/dotty.hh"

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

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

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

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

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

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

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

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

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

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

	    << "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
198
	    << "  -R3   use SCC to reduce the automata" << std::endl
199
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
200
201
202
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
203
204
205
	    << "  -RDS  minimize the automaton with direct simulation"
	    << std::endl
            << "  -Rm   attempt to WDBA-minimize the automata" << std::endl
206
	    << std::endl
207

208
            << "Automaton conversion:" << std::endl
209
210
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
211
212
213
214
	    << "  -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
215
216
	    << std::endl

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

  	  	<< "Options for Testing Automata:"
 	    << std::endl
 	    << "  -TA    Translate an LTL formula into a Testing automata"
 	    << std::endl;

286
287
288
289
290
291
292
293
  exit(2);
}

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

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

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

      ++formula_index;

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

547
	  spot::tgba_parse_error_list pel;
548
549
550
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
551
552
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
553
	    return 2;
554
	  s->merge_transitions();
555
	  tm.stop("reading -P's argument");
556
	  system = s;
557
	}
558
559
      else if (!strcmp(argv[formula_index], "-r"))
	{
560
561
	  output = 1;
	}
562
563
      else if (!strcmp(argv[formula_index], "-r1"))
	{
564
565
	  simpltl = true;
	  redopt.reduce_basics = true;
566
567
568
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
569
570
	  simpltl = true;
	  redopt.event_univ = true;
571
572
573
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
574
575
	  simpltl = true;
	  redopt.synt_impl = true;
576
577
578
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
579
580
581
582
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
583
	}
584
585
      else if (!strcmp(argv[formula_index], "-r5"))
	{
586
587
	  simpltl = true;
	  redopt.containment_checks = true;
588
589
590
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
591
592
593
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
594
595
596
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
597
598
599
600
601
602
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
603
	}
604
605
606
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
607
	}
608
609
610
611
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
612
	{
613
	  // For backward compatibility, make all these options
614
	  // equal to -RDS.
615
	  reduction_dir_sim = true;
616
617
618
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
619
	  scc_filter = true;
620
	}
621
622
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
623
	  scc_filter = true;
624
625
	  scc_filter_all = true;
	}
626
627
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
628
	  symbolic_scc_pruning = true;
629
	}
630
631
      else if (!strcmp(argv[formula_index], "-rd"))
	{
632
	  display_reduced_form = true;
633
	}
634
635
636
637
      else if (!strcmp(argv[formula_index], "-rD"))
	{
	  simpcache_stats = true;
	}
638
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
639
        {
640
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
641
        }
642
      else if (!strcmp(argv[formula_index], "-rL"))
643
644
645
646
647
        {
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.reduce_size_strictly = true;
        }
648
649
650
651
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
652
653
654
655
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
656
657
658
659
660
661
662
663
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
664
665
666
667
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
668
669
670
671
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
672
673
674
675
      else if (!strcmp(argv[formula_index], "-TA"))
        {
          ta_opt = true;
        }
676
677
678
679
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
680
681
682
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
683
	  translation = TransFM;
684
	  // Parse -U's argument.
685
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
686
687
688
	  while (tok)
	    {
	      unobservables->insert
689
		(static_cast<const spot::ltl::atomic_prop*>(env.require(tok)));
690
	      tok = strtok(0, ", \t;");
691
692
	    }
	}
693
694
695
696
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
697
698
      else if (!strcmp(argv[formula_index], "-x"))
	{
699
	  translation = TransFM;
700
701
	  fm_exprop_opt = true;
	}
702
703
704
705
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
706
707
708
709
710
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
711
712
      else if (!strcmp(argv[formula_index], "-y"))
	{
713
	  translation = TransFM;
714
715
	  fm_symb_merge_opt = false;
	}
716
717
718
719
      else
	{
	  break;
	}
720
721
    }

722
  if ((graph_run_opt || graph_run_tgba_opt)
723
      && (!echeck_inst || !expect_counter_example))
724
    {
725
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
726
727
728
      exit(1);
    }

729
730
731
732
  std::string input;

  if (file_opt)
    {
733
      tm.start("reading formula");
734
      if (strcmp(argv[formula_index], "-"))
735
	{
736
	  std::ifstream fin(argv[formula_index]);
737
	  if (!fin)
738
739
740
741
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
742

743
	  if (!std::getline(fin, input, '\0'))
744
745
746
747
748
749
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
750
	{
751
	  std::getline(std::cin, input, '\0');
752
	}
753
      tm.stop("reading formula");
754
755
756
757
758
759
    }
  else
    {
      input = argv[formula_index];
    }

760
  const spot::ltl::formula* f = 0;
761
  if (!from_file) // Reading a formula, not reading an automaton from a file.
762
    {
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
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
      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;
804
	}
805
    }
806

807
  if (f || from_file)
808
    {
809
      spot::tgba_bdd_concrete* concrete = 0;
810
      const spot::tgba* to_free = 0;
811
      spot::tgba* a = 0;
812

813
814
      if (from_file)
	{
815
	  spot::tgba_explicit_string* e;
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
	  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
831
	    {
832
	      spot::neverclaim_parse_error_list pel;
833
	      tm.start("parsing neverclaim");
834
835
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
836
	      tm.stop("parsing neverclaim");
837
838
839
840
841
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
842
		}
843
	      assume_sba = true;
844
	    }
845
	  e->merge_transitions();
846
	}
847
      else
848
	{
849
850
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
851
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
852
853

	  if (simp)
854
	    {
855
	      tm.start("reducing formula");
856
	      const spot::ltl::formula* t = simp->simplify(f);
857
	      f->destroy();
858
	      tm.stop("reducing formula");
859
	      f = t;
860
861
862
863
864
865
866
	      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;
		}
867
868
869
	      // This helps ltl_to_tgba_fm() to order BDD variables in
	      // a more natural way.
	      simp->clear_as_bdd_cache();
870
	    }
871

872
873
874
875
876
877
878
879
880
	  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;
	    }

881
	  tm.start("translating formula");
882
883
884
885
886
887
888
889
	  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,
890
				       fm_red ? simp : 0);
891
892
893
894
895
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
896
897
898
899
900
	      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);
901
902
	      break;
	    }
903
	  tm.stop("translating formula");
904
	  to_free = a;
905

906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
	  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);
	    }
923
	  delete simp;
924
	}
925

926
      if (opt_monitor && !scc_filter)
927
	{
928
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
929
930
	    symbolic_scc_pruning = true;
	  else
931
	    scc_filter = true;
932
933
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
934
935
      if (symbolic_scc_pruning)
        {
936
937
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
938
939
940
941
942
943
944
945
946
947
948
949
950
	  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)
951
952
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
953
954
955
956
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

957
958
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
959
      const spot::tgba* aut_scc = 0;
960
      if (scc_filter)
961
962
	{
	  tm.start("reducing A_f w/ SCC");
963
	  aut_scc = a = spot::scc_filter(a, scc_filter_all);
964
	  tm.stop("reducing A_f w/ SCC");
965
	  assume_sba = false;
966
967
	}

968
      const spot::tgba* degeneralized = 0;
969

970
      spot::tgba* minimized = 0;
Felix Abecassis's avatar
Felix Abecassis committed
971
      if (opt_minimize)
972
	{
973
974
975
976
977
	  tm.start("obligation minimization");
	  minimized = minimize_obligation(a, f);
	  tm.stop("obligation minimization");

	  if (minimized == 0)
978
	    {
979
	      // if (!f)
980
981
982
983
984
985
		{
		  std::cerr << "Error: Without a formula I cannot make "
			    << "sure that the automaton built with -Rm\n"
			    << "       is correct." << std::endl;
		  exit(2);
		}
986
	    }
987
988
989
990
991
992
993
	  else if (minimized == a)
	    {
	      minimized = 0;
	    }
	  else
	    {
	      a = minimized;
Thomas Badie's avatar
Thomas Badie committed
994
995
              // When the minimization succeed, simulation is useless.
              reduction_dir_sim = false;
996
	      assume_sba = true;
997
	    }
998
	}
Felix Abecassis's avatar
Felix Abecassis committed
999

Thomas Badie's avatar
Thomas Badie committed
1000
1001
1002
1003
1004
1005
1006

      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");
1007
	  assume_sba = false;
Thomas Badie's avatar
Thomas Badie committed
1008
1009
1010
        }