ltl2tgba.cc 38.7 KB
Newer Older
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1
2
// Copyright (C) 2007, 2008, 2009, 2010 Laboratoire de Recherche et
// 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

62
#include "tgbaalgos/stats.hh"
63
#include "tgbaalgos/scc.hh"
64
65
#include "tgbaalgos/emptiness_stats.hh"

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

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

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

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

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
109
	    << std::endl
110
	    << "  -X    do not compute an automaton, read it from a file"
111
	    << std::endl
112
113
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
114
115
	    << "  -Pfile  multiply the formula automaton with the automaton"
	    << " from `file'"
116
	    << std::endl
117
118
119
	    << std::endl

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

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
132
133
134
135
	    << "  -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
136
137
138
	    << "  -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
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
184
185
186
187
188
189
190
191
192
193
194
195
196
	    << "  -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
197
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
198
	    << "(use -L for more reduction)"
199
	    << std::endl
200
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
201
	    << "(use -L for more reduction)"
202
	    << std::endl
203
204
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
205
	    << std::endl
206
	    << "  -R3   use SCC to reduce the automata" << std::endl
207
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
208
209
210
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
211
212
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
Felix Abecassis's avatar
Felix Abecassis committed
213
            << "  -Rm   attempt to minimize the automata" << std::endl
214
	    << std::endl
215
216
217
218
219

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

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

286
  bool debug_opt = false;
287
  bool paper_opt = false;
288
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
289
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
290
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA }
291
    translation = TransFM;
292
  int fm_red = spot::ltl::Reduce_None;
293
  bool fm_exprop_opt = false;
294
  bool fm_symb_merge_opt = true;
295
  bool file_opt = false;
296
  int output = 0;
297
  int formula_index = 0;
298
299
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
300
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
301
  bool expect_counter_example = false;
302
303
  bool accepting_run = false;
  bool accepting_run_replay = false;
304
  bool from_file = false;
305
  bool read_neverclaim = false;
306
  int reduc_aut = spot::Reduce_None;
307
  int redopt = spot::ltl::Reduce_None;
308
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
309
  bool symbolic_scc_pruning = false;
310
311
  bool display_reduce_form = false;
  bool display_rel_sim = false;
312
  bool display_parity_game = false;
313
  bool post_branching = false;
314
  bool fair_loop_approx = false;
315
  bool graph_run_opt = false;
316
  bool graph_run_tgba_opt = false;
317
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
318
  bool opt_minimize = false;
319
  bool containment = false;
320
  bool show_fc = false;
321
  bool spin_comments = false;
322
323
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
324
  spot::tgba_explicit_string* system = 0;
325
  spot::tgba* product = 0;
326
  spot::tgba* product_to_free = 0;
327
  spot::bdd_dict* dict = new spot::bdd_dict();
328
329
  spot::timer_map tm;
  bool use_timer = false;
330

331
  for (;;)
332
    {
333
      if (argc < formula_index + 2)
334
	syntax(argv[0]);
335
336
337

      ++formula_index;

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

542
543
	  spot::tgba_parse_error_list pel;
	  system = spot::tgba_parse(argv[formula_index] + 2,
544
				    pel, dict, env, env, debug_opt);
545
546
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
547
548
	    return 2;
	  system->merge_transitions();
549

550
	  tm.stop("reading -P's argument");
551
	}
552
553
      else if (!strcmp(argv[formula_index], "-r"))
	{
554
555
	  output = 1;
	}
556
557
558
559
560
561
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
562
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
563
564
565
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
566
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
567
568
569
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
570
571
572
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
573
	}
574
575
      else if (!strcmp(argv[formula_index], "-r5"))
	{
576
	  redopt |= spot::ltl::Reduce_Containment_Checks;
577
578
579
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
580
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
581
582
583
584
585
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
586
587
588
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
589
	}
martinez's avatar
martinez committed
590
591
592
593
594
595
596
597
598
      else if (!strcmp(argv[formula_index], "-R1q"))
	{
	  reduc_aut |= spot::Reduce_quotient_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R1t"))
	{
	  reduc_aut |= spot::Reduce_transition_Dir_Sim;
	}
      else if (!strcmp(argv[formula_index], "-R2q"))
599
	{
martinez's avatar
martinez committed
600
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
601
	}
martinez's avatar
martinez committed
602
      else if (!strcmp(argv[formula_index], "-R2t"))
603
	{
martinez's avatar
martinez committed
604
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
605
606
607
608
609
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
610
611
612
613
614
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	  scc_filter_all = true;
	}
615
616
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
617
	  symbolic_scc_pruning = true;
618
	}
619
620
621
622
623
624
625
626
627
628
629
630
      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
631
632
633
634
      else if (!strcmp(argv[formula_index], "-Rm"))
        {
          opt_minimize = true;
        }
635
636
637
638
639
640
641
642
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
643
644
645
646
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
647
648
649
650
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
651
652
653
654
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
655
656
657
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
658
	  translation = TransFM;
659
	  // Parse -U's argument.
660
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
661
662
663
664
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
665
	      tok = strtok(0, ", \t;");
666
667
	    }
	}
668
669
670
671
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
672
673
      else if (!strcmp(argv[formula_index], "-x"))
	{
674
	  translation = TransFM;
675
676
	  fm_exprop_opt = true;
	}
677
678
679
680
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
681
682
683
684
685
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
686
687
      else if (!strcmp(argv[formula_index], "-y"))
	{
688
	  translation = TransFM;
689
690
	  fm_symb_merge_opt = false;
	}
691
692
693
694
      else
	{
	  break;
	}
695
696
    }

697
  if ((graph_run_opt || graph_run_tgba_opt)
698
      && (!echeck_inst || !expect_counter_example))
699
    {
700
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
701
702
703
      exit(1);
    }

704
705
706
707
  std::string input;

  if (file_opt)
    {
708
      tm.start("reading formula");
709
      if (strcmp(argv[formula_index], "-"))
710
	{
711
	  std::ifstream fin(argv[formula_index]);
712
	  if (!fin)
713
714
715
716
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
717

718
	  if (!std::getline(fin, input, '\0'))
719
720
721
722
723
724
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
725
	{
726
	  std::getline(std::cin, input, '\0');
727
	}
728
      tm.stop("reading formula");
729
730
731
732
733
734
    }
  else
    {
      input = argv[formula_index];
    }

735
  spot::ltl::formula* f = 0;
736
  if (!from_file) // Reading a formula, not reading an automaton from a file.
737
    {
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
      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;
779
	}
780
781
    }
  if (f || from_file)
782
    {
783
784
785
786
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

787
788
      if (from_file)
	{
789
	  spot::tgba_explicit_string* e;
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
	  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
805
	    {
806
	      spot::neverclaim_parse_error_list pel;
807
	      tm.start("parsing neverclaim");
808
809
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
810
	      tm.stop("parsing neverclaim");
811
812
813
814
815
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
816
		}
817
	    }
818
	  e->merge_transitions();
819
	}
820
      else
821
	{
822
	  if (redopt != spot::ltl::Reduce_None)
823
	    {
824
	      tm.start("reducing formula");
825
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
826
	      f->destroy();
827
	      tm.stop("reducing formula");
828
	      f = t;
829
830
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
831
	    }
832

833
	  tm.start("translating formula");
834
835
836
837
838
839
840
841
	  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,
842
				       fm_red);
843
844
845
846
847
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
848
849
850
851
852
	      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);
853
854
	      break;
	    }
855
	  tm.stop("translating formula");
856
	  to_free = a;
857
	}
858

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
      if (symbolic_scc_pruning)
        {
	  spot::tgba_bdd_concrete* bc =
	    dynamic_cast<spot::tgba_bdd_concrete*>(a);
	  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)
		bc->delete_unaccepting_scc();
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

881
882
883
884
885
886
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
      spot::tgba* aut_scc = 0;
      if (reduc_aut & spot::Reduce_Scc)
	{
	  tm.start("reducing A_f w/ SCC");
887
	  a = aut_scc = spot::scc_filter(a, scc_filter_all);
888
889
890
	  tm.stop("reducing A_f w/ SCC");
	}

891
      spot::tgba_tba_proxy* degeneralized = 0;
892
      spot::tgba_sgba_proxy* state_labeled = 0;
893

894
895
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
896
	  && degeneralize_opt == NoDegen
897
898
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
899
900
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
901
	a = degeneralized = new spot::tgba_tba_proxy(a);
902
903
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
904
905
906
907
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
908

Felix Abecassis's avatar
Felix Abecassis committed
909
910
      spot::tgba_explicit* minimized = 0;
      if (opt_minimize)
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
	{
	  tm.start("WDBA-minimization");
	  minimized = minimize(a);
	  tm.stop("WDBA-minimization");
	  tm.start("WDBA-check");
	  // If A is a safety automaton, the WDBA minimization
	  // must be correct.
	  if (is_safety_automaton(a))
	    {
	      a = minimized;
	    }
	  else // We don't know if A is a safety automaton.
	    {
	      // Let's make sure that a recognize the same language
	      // as minimized.
	      spot::ltl::formula* neg =
		spot::ltl::unop::instance(spot::ltl::unop::Not, f->clone());
	      spot::tgba* n = spot::ltl_to_tgba_fm(neg, dict, fm_exprop_opt,
						   fm_symb_merge_opt,
						   post_branching,
						   fair_loop_approx,
						   unobservables, fm_red);
	      neg->destroy();
	      spot::tgba* nscc = spot::scc_filter(n, true);
	      // If the negation is a safety automaton,
	      // then the minimization is correct.
	      if (is_safety_automaton(n))
		{
		  a = minimized;
		}
	      else
		{
		  spot::tgba* p = new spot::tgba_product(minimized, nscc);
		  spot::emptiness_check* ec = couvreur99(p);
		  spot::emptiness_check_result* res = ec->check();
		  if (!res)
		    {
		      delete ec;
		      delete p;
		      spot::tgba* nm = minimize(nscc);
		      p = new spot::tgba_product(a, nm);
		      ec = couvreur99(p);
		      res = ec->check();
		      if (!res)
			{
			  // Finally, we are now sure that it was safe
			  // to minimize the automaton.
			  a = minimized;
			}
		      delete nm;
		    }
		  delete res;
		  delete ec;
		  delete p;
		}
	      delete nscc;
	      delete n;
	    }
	  tm.stop("WDBA-check");
	}
Felix Abecassis's avatar
Felix Abecassis committed
971

972
973
974
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
975
	  if (reduc_aut & ~spot::Reduce_Scc)
976
	    {
977
	      tm.start("reducing A_f w/ sim.");
978
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
979
980

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
981
982
983
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
984
		{
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
1012
1013
1014
1015
1016
1017
1018
1019
1020
		  spot::direct_simulation_relation* rel_dir = 0;
		  spot::delayed_simulation_relation* rel_del = 0;

		  if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
				   spot::Reduce_transition_Dir_Sim))
		    {
		      rel_dir =
			spot::get_direct_relation_simulation
			  (a, std::cout, display_parity_game);
		      assert(rel_dir);
		    }
		  if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
					spot::Reduce_transition_Del_Sim))
		    {
		      rel_del =
			spot::get_delayed_relation_simulation
			  (a, std::cout, display_parity_game);
		      assert(rel_del);
		    }

		  if (display_rel_sim)
		    {
		      if (rel_dir)
			aut_red->display_rel_sim(rel_dir, std::cout);
		      if (rel_del)
			aut_red->display_rel_sim(rel_del, std::cout);
		    }

		  if (reduc_aut & spot::Reduce_quotient_Dir_Sim)
		    aut_red->quotient_state(rel_dir);
		  if (reduc_aut & spot::Reduce_transition_Dir_Sim)
		    aut_red->delete_transitions(rel_dir);
		  if (reduc_aut & spot::Reduce_quotient_Del_Sim)
		    aut_red->quotient_state(rel_del);
		  if (reduc_aut & spot::Reduce_transition_Del_Sim)
		    aut_red->delete_transitions(rel_del);
1021

martinez's avatar
martinez committed
1022
		  if (rel_dir)
1023
		    spot::free_relation_simulation(rel_dir);
martinez's avatar
martinez committed
1024
		  if (rel_del)
1025
		    spot::free_relation_simulation(rel_del);
martinez's avatar
martinez committed
1026
		}
1027
	      tm.stop("reducing A_f w/ sim.");
1028
1029
1030
	    }
	}

1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
      spot::tgba_explicit* expl = 0;
      switch (dupexp)
	{
	case NoneDup:
	  break;
	case BFS:
	  a = expl = tgba_dupexp_bfs(a);
	  break;
	case DFS:
	  a = expl = tgba_dupexp_dfs(a);
	  break;
	}

1044
1045
      spot::tgba* product_degeneralized = 0;

1046
      if (system)
1047
1048
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
1049
1050
1051
1052
1053
1054

	  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)
1055
1056
1057
1058
1059
1060
1061
1062
            degeneralize_opt = DegenTBA;
          if (degeneralize_opt == DegenTBA)
            a = product = product_degeneralized =
                                            new spot::tgba_tba_proxy(product);
          else if (degeneralize_opt == DegenSBA)
            a = product = product_degeneralized =
                                            new spot::tgba_sba_proxy(product);
        }
1063

1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
      if (echeck_inst
	  && (a->number_of_acceptance_conditions()
	      < echeck_inst->min_acceptance_conditions()))
	{
	  if (!paper_opt)
	    {
	      std::cerr << echeck_algo << " requires at least "
			<< echeck_inst->min_acceptance_conditions()
			<< " acceptance conditions." << std::endl;
	      exit(1);
	    }
	  else
	    {
	      std::cout << std::endl;
	      exit(0);
	    }
	}

1082
1083
1084
1085
1086
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

1087
      if (output != -1)
1088
	{
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
	  tm.start("producing output");
	  switch (output)
	    {
	    case 0:
	      spot::dotty_reachable(std::cout, a);
	      break;
	    case 1:
	      if (concrete)
		spot::bdd_print_dot(std::cout, concrete->get_dict(),
				    concrete->get_core_data().relation);
	      break;
	    case 2:
	      if (concrete)
		spot::bdd_print_dot(std::cout, concrete->get_dict(),
				    concrete->
				    get_core_data().acceptance_conditions);
	      break;
	    case 3:
	      if (concrete)
		spot::bdd_print_set(std::cout, concrete->get_dict(),
				    concrete->get_core_data().relation);
	      break;
	    case 4:
	      if (concrete)
		spot::bdd_print_set(std::cout, concrete->get_dict(),
				    concrete->
				    get_core_data().acceptance_conditions);
	      break;
	    case 5:
	      a->get_dict()->dump(std::cout);
	      break;
	    case 6:
	      spot::lbtt_reachable(std::cout, a);
	      break;
	    case 7:
	      spot::tgba_save_reachable(std::cout, a);
	      break;
	    case 8:
	      {
		assert(degeneralize_opt == DegenSBA);
		const spot