ltl2tgba.cc 34.9 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 "tgbaalgos/dupexp.hh"
49
#include "tgbaalgos/neverclaim.hh"
50
#include "tgbaalgos/reductgba_sim.hh"
51
#include "tgbaalgos/replayrun.hh"
52
#include "tgbaalgos/rundotdec.hh"
53
#include "tgbaalgos/sccfilter.hh"
54
55
#include "tgbaalgos/eltl2tgba_lacim.hh"
#include "eltlparse/public.hh"
56
#include "misc/timer.hh"
57

58
#include "tgbaalgos/stats.hh"
59
#include "tgbaalgos/scc.hh"
60
61
#include "tgbaalgos/emptiness_stats.hh"

62
63
64
65
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)	   \
R=!U(!$0, !$1)";
  return s;
}

78
79
80
void
syntax(char* prog)
{
81
82
83
84
85
  // 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;

86
  std::cerr << "Usage: "<< prog << " [-f|-l|-le|-taa] [OPTIONS...] formula"
87
	    << std::endl
88
            << "       "<< prog << " [-f|-l|-le|-taa] -F [OPTIONS...] file"
89
	    << std::endl
90
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
91
	    << std::endl
92

93
94
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
95
96
97
98
	    << "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
99
	    << std::endl
100
101
102

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
103
	    << std::endl
104
	    << "  -X    do not compute an automaton, read it from a file"
105
	    << std::endl
106
107
	    << "  -Pfile  multiply the formula automaton with the automaton"
	    << " from `file'"
108
	    << std::endl
109
110
111
	    << std::endl

	    << "Translation algorithm:" << std::endl
112
            << "  -f    use Couvreur's FM algorithm for LTL"
113
	    << "(default)"
114
	    << std::endl
115
            << "  -l    use Couvreur's LaCIM algorithm for LTL "
116
	    << std::endl
117
118
119
	    << "  -le   use Couvreur's LaCIM algorithm for ELTL"
	    << std::endl
            << "  -taa  use Tauriainen's TAA-based algorithm for LTL"
martinez's avatar
martinez committed
120
	    << std::endl
121
122
123
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
124
125
126
127
	    << "  -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
128
129
130
	    << "  -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
131
132
133
134
135
            << "  -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)"
136
	    << std::endl
137
138
139
140
            << "  -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
141
	    << std::endl
142

143
144
	    << "Options for Couvreur's LaCIM algorithm (-l or -le):"
	    << std::endl
145
146
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
147
	    << std::endl
148
	    << "  -A    same as -a, but as a set" << std::endl
149
150
	    << "  -lo   pre-define standard LTL operators as automata "
	    << "(implies -le)" << std::endl
151
	    << "  -r    display the relation BDD, not the reachability graph"
152
	    << std::endl
153
	    << "  -R    same as -r, but as a set" << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
154
155
	    << "  -R3b  symbolically prune unaccepting SCC from BDD relation"
	    << std::endl
156
	    << std::endl
157
158

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
159
	    << std::endl
160
	    << "  -c    enable language containment checks (implies -taa)"
161
	    << std::endl
162
163

	    << "Formula simplification (before translation):"
164
	    << std::endl
martinez's avatar
martinez committed
165
166
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
167
	    << "universality" << std::endl
martinez's avatar
martinez committed
168
	    << "  -r3   reduce formula using implication between "
169
	    << "sub-formulae" << std::endl
170
171
172
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
173
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
174
175
176
177
178
179
180
181
182
183
184
185
186
187
	    << "  -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
188
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
189
	    << "(use -L for more reduction)"
190
	    << std::endl
191
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
192
	    << "(use -L for more reduction)"
193
	    << std::endl
194
195
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
196
	    << std::endl
197
	    << "  -R3   use SCC to reduce the automata" << std::endl
198
199
200
201
	    << "  -R3f  clean more acceptance conditions that -R3" << std::endl
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
202
203
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
204
	    << std::endl
205
206
207
208
209

	    << "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
210
	    << std::endl
211
	    << "  -g    graph the accepting run on the automaton (requires -e)"
212
	    << std::endl
213
214
215
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
216
217
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
218
219
220
221
222
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
	    << "  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
	    << "  -k    display statistics on the automaton of dumping it"
	    << 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
	    << "  -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;
260
261
262
263
264
265
266
267
  exit(2);
}

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

268
  bool debug_opt = false;
269
  bool paper_opt = false;
270
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
271
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
272
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA }
273
    translation = TransFM;
274
  int fm_red = spot::ltl::Reduce_None;
275
  bool fm_exprop_opt = false;
276
  bool fm_symb_merge_opt = true;
277
  bool file_opt = false;
278
  int output = 0;
279
  int formula_index = 0;
280
281
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
282
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
283
  bool expect_counter_example = false;
284
  bool from_file = false;
285
  int reduc_aut = spot::Reduce_None;
286
  int redopt = spot::ltl::Reduce_None;
287
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
288
  bool symbolic_scc_pruning = false;
289
290
  bool display_reduce_form = false;
  bool display_rel_sim = false;
291
  bool display_parity_game = false;
292
  bool post_branching = false;
293
  bool fair_loop_approx = false;
294
  bool graph_run_opt = false;
295
  bool graph_run_tgba_opt = false;
296
  bool opt_reduce = false;
297
  bool containment = false;
298
  bool show_fc = false;
299
  bool spin_comments = false;
300
301
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
302
  spot::tgba_explicit_string* system = 0;
303
  spot::tgba* product = 0;
304
  spot::tgba* product_to_free = 0;
305
  spot::bdd_dict* dict = new spot::bdd_dict();
306
307
  spot::timer_map tm;
  bool use_timer = false;
308

309
  for (;;)
310
    {
311
      if (argc < formula_index + 2)
312
	syntax(argv[0]);
313
314
315

      ++formula_index;

316
317
318
319
320
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-a"))
321
322
323
	{
	  output = 2;
	}
324
      else if (!strcmp(argv[formula_index], "-A"))
325
	{
326
	  output = 4;
327
	}
328
      else if (!strcmp(argv[formula_index], "-b"))
329
	{
330
	  output = 7;
331
	}
332
333
334
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
335
	  translation = TransTAA;
336
	}
337
      else if (!strcmp(argv[formula_index], "-d"))
338
339
340
	{
	  debug_opt = true;
	}
341
342
      else if (!strcmp(argv[formula_index], "-D"))
	{
343
344
345
346
347
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
348
	}
349
      else if (!strncmp(argv[formula_index], "-e", 2))
350
        {
351
352
353
354
355
356
357
358
359
360
361
362
363
	  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);
	    }
364
365
366
          expect_counter_example = true;
          output = -1;
        }
367
      else if (!strncmp(argv[formula_index], "-E", 2))
368
        {
369
370
371
372
373
374
375
376
377
378
379
380
381
	  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);
	    }
382
383
384
          expect_counter_example = false;
          output = -1;
        }
385
386
      else if (!strcmp(argv[formula_index], "-f"))
	{
387
	  translation = TransFM;
388
	}
389
390
      else if (!strcmp(argv[formula_index], "-fr1"))
	{
391
	  translation = TransFM;
392
393
394
395
	  fm_red |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-fr2"))
	{
396
	  translation = TransFM;
397
398
399
400
	  fm_red |= spot::ltl::Reduce_Eventuality_And_Universality;
	}
      else if (!strcmp(argv[formula_index], "-fr3"))
	{
401
	  translation = TransFM;
402
403
404
	  fm_red |= spot::ltl::Reduce_Syntactic_Implications;
	}
      else if (!strcmp(argv[formula_index], "-fr4"))
405
	{
406
	  translation = TransFM;
407
408
409
410
411
412
 	  fm_red |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
	}
      else if (!strcmp(argv[formula_index], "-fr5"))
	{
413
	  translation = TransFM;
414
415
416
417
	  fm_red |= spot::ltl::Reduce_Containment_Checks;
	}
      else if (!strcmp(argv[formula_index], "-fr6"))
	{
418
	  translation = TransFM;
419
420
421
	  fm_red |= spot::ltl::Reduce_Containment_Checks_Stronger;
	}
      else if (!strcmp(argv[formula_index], "-fr7"))
422
	{
423
	  translation = TransFM;
424
425
	  fm_red |= spot::ltl::Reduce_All;
	}
426
427
428
429
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
430
431
432
433
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
434
435
436
437
      else if (!strcmp(argv[formula_index], "-g"))
	{
	  graph_run_opt = true;
	}
438
439
440
441
      else if (!strcmp(argv[formula_index], "-G"))
	{
	  graph_run_tgba_opt = true;
	}
442
443
444
445
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
446
447
448
449
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
450
451
452
453
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
454
455
456
457
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
458
459
460
461
462
463
464
465
466
467
      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;
	}
468
469
470
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
471
	  translation = TransFM;
472
	}
473
474
475
476
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
477
478
      else if (!strcmp(argv[formula_index], "-m"))
	{
479
	  opt_reduce = true;
480
	}
martinez's avatar
martinez committed
481
482
      else if (!strcmp(argv[formula_index], "-N"))
	{
483
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
484
485
	  output = 8;
	}
486
487
488
489
490
491
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
492
493
494
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
495
	  translation = TransFM;
496
	}
497
498
499
500
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
	  spot::tgba_parse_error_list pel;
	  system = spot::tgba_parse(argv[formula_index] + 2,
501
				    pel, dict, env, env, debug_opt);
502
503
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
504
505
	    return 2;
	  system->merge_transitions();
506
507
508

	  if (!paper_opt)
	    std::clog << argv[formula_index] + 2 << " read" << std::endl;
509
	}
510
511
      else if (!strcmp(argv[formula_index], "-r"))
	{
512
513
	  output = 1;
	}
514
515
516
517
518
519
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
520
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
521
522
523
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
524
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
525
526
527
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
528
529
530
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
531
	}
532
533
      else if (!strcmp(argv[formula_index], "-r5"))
	{
534
	  redopt |= spot::ltl::Reduce_Containment_Checks;
535
536
537
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
538
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
539
540
541
542
543
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
544
545
546
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
547
	}
martinez's avatar
martinez committed
548
549
550
551
552
553
554
555
556
      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"))
557
	{
martinez's avatar
martinez committed
558
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
559
	}
martinez's avatar
martinez committed
560
      else if (!strcmp(argv[formula_index], "-R2t"))
561
	{
martinez's avatar
martinez committed
562
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
563
564
565
566
567
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
568
569
570
571
572
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	  scc_filter_all = true;
	}
573
574
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
575
	  symbolic_scc_pruning = true;
576
	}
577
578
579
580
581
582
583
584
585
586
587
588
      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;
	}
589
590
591
592
593
594
595
596
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
597
598
599
600
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
601
602
603
604
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
605
606
607
608
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
609
610
611
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
612
	  translation = TransFM;
613
	  // Parse -U's argument.
614
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
615
616
617
618
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
619
	      tok = strtok(0, ", \t;");
620
621
	    }
	}
622
623
624
625
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
626
627
      else if (!strcmp(argv[formula_index], "-x"))
	{
628
	  translation = TransFM;
629
630
	  fm_exprop_opt = true;
	}
631
632
633
634
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
635
636
      else if (!strcmp(argv[formula_index], "-y"))
	{
637
	  translation = TransFM;
638
639
	  fm_symb_merge_opt = false;
	}
640
641
642
643
      else
	{
	  break;
	}
644
645
    }

646
  if ((graph_run_opt || graph_run_tgba_opt)
647
      && (!echeck_inst || !expect_counter_example))
648
    {
649
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
650
651
652
      exit(1);
    }

653
654
655
656
  std::string input;

  if (file_opt)
    {
657
      tm.start("reading formula");
658
      if (strcmp(argv[formula_index], "-"))
659
	{
660
	  std::ifstream fin(argv[formula_index]);
661
	  if (!fin)
662
663
664
665
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
666

667
	  if (!std::getline(fin, input, '\0'))
668
669
670
671
672
673
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
674
	{
675
	  std::getline(std::cin, input, '\0');
676
	}
677
      tm.stop("reading formula");
678
679
680
681
682
683
    }
  else
    {
      input = argv[formula_index];
    }

684
  spot::ltl::formula* f = 0;
685
  if (!from_file) // Reading a formula, not reading an automaton from a file.
686
    {
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
      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;
728
	}
729
730
    }
  if (f || from_file)
731
    {
732
733
734
735
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

736
737
738
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
739
	  spot::tgba_explicit_string* e;
740
	  tm.start("parsing automaton");
741
742
	  to_free = a = e = spot::tgba_parse(input, pel, dict,
					     env, env, debug_opt);
743
	  tm.stop("parsing automaton");
744
	  if (spot::format_tgba_parse_errors(std::cerr, input, pel))
745
746
747
748
749
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
750
	  e->merge_transitions();
751
	}
752
      else
753
	{
754
	  if (redopt != spot::ltl::Reduce_None)
755
	    {
756
	      tm.start("reducing formula");
757
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
758
	      f->destroy();
759
	      tm.stop("reducing formula");
760
	      f = t;
761
762
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
763
	    }
764

765
	  tm.start("translating formula");
766
767
768
769
770
771
772
773
	  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,
774
				       fm_red);
775
776
777
778
779
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
780
781
782
783
784
	      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);
785
786
	      break;
	    }
787
	  tm.stop("translating formula");
788
	  to_free = a;
789
	}
790

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
      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");
	    }
	}

813
814
815
816
817
818
      // 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");
819
	  a = aut_scc = spot::scc_filter(a, scc_filter_all);
820
821
822
	  tm.stop("reducing A_f w/ SCC");
	}

823
      spot::tgba_tba_proxy* degeneralized = 0;
824
      spot::tgba_sgba_proxy* state_labeled = 0;
825

826
827
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
828
	  && degeneralize_opt == NoDegen
829
830
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
831
832
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
833
	a = degeneralized = new spot::tgba_tba_proxy(a);
834
835
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
836
837
838
839
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
840

841
842
843
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
844
	  if (reduc_aut & ~spot::Reduce_Scc)
845
	    {
846
	      tm.start("reducing A_f w/ sim.");
847
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
848
849

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
850
851
852
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
853
		{
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
		  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);
890

martinez's avatar
martinez committed
891
		  if (rel_dir)
892
		    spot::free_relation_simulation(rel_dir);
martinez's avatar
martinez committed
893
		  if (rel_del)
894
		    spot::free_relation_simulation(rel_del);
martinez's avatar
martinez committed
895
		}
896
	      tm.stop("reducing A_f w/ sim.");
897
898
899
	    }
	}

900
901
902
903
904
905
906
907
908
909
910
911
912
      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;
	}

913
914
      spot::tgba* product_degeneralized = 0;

915
      if (system)
916
917
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
918
919
920
921
922
923

	  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)
924
925
926
927
928
929
930
931
            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);
        }
932

933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
      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);
	    }
	}

951
952
953
954
955
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

956
      if (output != -1)
957
	{
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
	  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::tgba_sba_proxy* s =
		  static_cast<const spot::tgba_sba_proxy*>(degeneralized);
1000
		spot::never_claim_reachable(std::cout, s, f, spin_comments);
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
		break;
	      }
	    case 9:
	      stats_reachable(a).dump(std::cout);
	      build_scc_stats(a).dump(std::cout);
	      break;
	    case 10:
	      dump_scc_dot(a, std::cout, false);
	      break;
	    case 11:
	      dump_scc_dot(a, std::cout, true);
	      break;
	    default:
	      assert(!"unknown output option");
	    }
	  tm.stop("producing output");
1017
	}
1018

1019
      if (echeck_inst)
1020
	{
1021
1022
1023
	  spot::emptiness_check* ec = echeck_inst->instantiate(a);
	  bool search_many = echeck_inst->options().get("repeated");
	  assert(ec);
1024
1025
	  do
	    {
1026
	      tm.start("running emptiness check");
1027
	      spot::emptiness_check_result* res = ec->check();
1028
1029
	      tm.stop("running emptiness check");

1030
1031
1032
              if (paper_opt)
                {
                  std::ios::fmtflags old = std::cout.flags();
1033
                  std::cout << std::left << std::setw(25)
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
                            << echeck_algo << ", ";
                  spot::tgba_statistics a_size =
                                        spot::stats_reachable(ec->automaton());
                  std::cout << std::right << std::setw(10)
                            << a_size.states << ", "
                            << std::right << std::setw(10)
                            << a_size.transitions << ", ";
                  std::cout <<
                            ec->automaton()->number_of_acceptance_conditions()
                            << ", ";
                  const spot::ec_statistics* ecs =
                        dynamic_cast<const spot::ec_statistics*>(ec);
                  if (ecs)
                    std::cout << std::right << std::setw(10)
                              << ecs->states() << ", "
                              << std::right << std::setw(10)
                              << ecs->transitions() << ", "
                              << std::right << std::setw(10)
                              << ecs->max_depth();
                  else
1054
                    std::cout << "no stats, , ";
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
                  if (res)
                    std::cout << ", accepting run found";
                  else
                    std::cout << ", no accepting run found";
                  std::cout << std::endl;
                  std::cout << std::setiosflags(old);
                }
              else
                {
                  if (!graph_run_opt && !graph_run_tgba_opt)
                    ec->print_stats(std::cout);
                  if (expect_counter_example != !!res &&
1067
		      (!expect_counter_example || ec->safe()))
1068
1069
1070
                    exit_code = 1;

                  if (!res)
1071
                    {
1072
                      std::cout << "no accepting run found";
1073
                      if (!ec->safe() && expect_counter_example)
1074
1075
                        {
                          std::cout << " even if expected" << std::endl;
1076
1077
                          std::cout << "this may be due to the use of the bit"
                                    << " state hashing technique" << std::endl;
1078
1079
1080
1081
1082
1083
                          std::cout << "you can try to increase the heap size "
                                    << "or use an explicit storage"
                                    << std::endl;
                        }
                      std::cout << std::endl;
                      break;
1084
                    }
1085
1086
                  else
                    {
1087

1088
		      tm.start("computing accepting run");
1089
                      spot::tgba_run* run = res->accepting_run();
1090
1091
		      tm.stop("computing accepting run");

1092
1093
1094
1095
1096
1097
1098
1099
                      if (!run)
                        {
                          std::cout << "an accepting run exists" << std::endl;
                        }
                      else
                        {
                          if (opt_reduce)
                            {
1100
			      tm.start("reducing accepting run");
1101
1102
                              spot::tgba_run* redrun =
                                spot::reduce_run(res->automaton(), run);
1103
			      tm.stop("reducing accepting run");
1104
1105
1106
                              delete run;
                              run = redrun;
                            }
1107
			  tm.start("printing accepting run");
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
                          if (graph_run_opt)<