ltl2tgba.cc 33.7 KB
Newer Older
Guillaume Sadegh's avatar
Guillaume Sadegh committed
1
2
3
4
// Copyright (C) 2007, 2008, 2009 Laboratoire de Recherche et Dveloppement
// de l'Epita (LRDE).
// 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
86
87
88
89
  // 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;

  std::cerr << "Usage: "<< prog << " [-f|-l|-taa] [OPTIONS...] formula"
	    << std::endl
            << "       "<< prog << " [-f|-l|-taa] -F [OPTIONS...] file"
	    << 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
95
96
97
98

            << "Translate an LTL into an automaton, or read the automaton "
	    << "from a file." << std::endl
	    << "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
martinez's avatar
martinez committed
112
            << "  -f    use Couvreur's FM algorithm for translation"
113
	    << std::endl
114
115
116
            << "  -l    use Couvreur's LaCIM algorithm for translation "
	    << "(default)"
	    << std::endl
117
            << "  -taa  use Tauriainen's TAA-based algorithm for translation"
martinez's avatar
martinez committed
118
	    << std::endl
119
120
121
122
123
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
	    << "  -c    enable language containment checks (implies -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
145

	    << "Options for Couvreur's LaCIM algorithm (-l):" << std::endl
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
146
	    << std::endl
147
	    << "  -A    same as -a, but as a set" << std::endl
148
	    << "  -xltl translate an extended LTL, not an LTL" << std::endl
149
	    << "  -r    display the relation BDD, not the reachability graph"
150
	    << std::endl
151
	    << "  -R    same as -r, but as a set" << std::endl
152
	    << std::endl
153
154

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
155
	    << std::endl
156
	    << "  -c    enable language containment checks" << std::endl
157
	    << std::endl
158
159

	    << "Formula simplification (before translation):"
160
	    << std::endl
martinez's avatar
martinez committed
161
162
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
163
	    << "universality" << std::endl
martinez's avatar
martinez committed
164
	    << "  -r3   reduce formula using implication between "
165
	    << "sub-formulae" << std::endl
166
167
168
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
169
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
170
171
172
173
174
175
176
177
178
179
180
181
182
183
	    << "  -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
184
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
185
	    << "(use -L for more reduction)"
186
	    << std::endl
187
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
188
	    << "(use -L for more reduction)"
189
	    << std::endl
190
191
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
192
	    << std::endl
193
	    << "  -R3   use SCC to reduce the automata" << std::endl
194
	    << "  -R3b  delete unaccepting SCC directly on the BDD" << std::endl
195
196
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
197
	    << std::endl
198
199
200
201
202

	    << "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
203
	    << std::endl
204
	    << "  -g    graph the accepting run on the automaton (requires -e)"
205
	    << std::endl
206
207
208
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
209
210
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
211
212
213
214
215
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
216
217
218
219
220
221
222
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
	    << "  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;
253
254
255
256
257
258
259
260
  exit(2);
}

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

261
  bool debug_opt = false;
262
  bool paper_opt = false;
263
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
264
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
265
  enum { TransFM, TransLaCIM, TransTAA } translation = TransLaCIM;
266
  int fm_red = spot::ltl::Reduce_None;
267
  bool fm_exprop_opt = false;
268
  bool fm_symb_merge_opt = true;
269
  bool file_opt = false;
270
  int output = 0;
271
  int formula_index = 0;
272
273
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
274
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
275
  bool expect_counter_example = false;
276
  bool from_file = false;
277
  int reduc_aut = spot::Reduce_None;
278
  int redopt = spot::ltl::Reduce_None;
279
280
  bool eltl = false;
  bool delete_unaccepting_scc = false;
281
282
  bool display_reduce_form = false;
  bool display_rel_sim = false;
283
  bool display_parity_game = false;
284
  bool post_branching = false;
285
  bool fair_loop_approx = false;
286
  bool graph_run_opt = false;
287
  bool graph_run_tgba_opt = false;
288
  bool opt_reduce = false;
289
  bool containment = false;
290
  bool show_fc = false;
291
  bool spin_comments = false;
292
293
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
294
  spot::tgba_explicit_string* system = 0;
295
  spot::tgba* product = 0;
296
  spot::tgba* product_to_free = 0;
297
  spot::bdd_dict* dict = new spot::bdd_dict();
298
299
  spot::timer_map tm;
  bool use_timer = false;
300

301
  for (;;)
302
    {
303
      if (argc < formula_index + 2)
304
	syntax(argv[0]);
305
306
307

      ++formula_index;

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

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

628
  if ((graph_run_opt || graph_run_tgba_opt)
629
      && (!echeck_inst || !expect_counter_example))
630
    {
631
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
632
633
634
      exit(1);
    }

635
636
637
638
  std::string input;

  if (file_opt)
    {
639
      tm.start("reading formula");
640
      if (strcmp(argv[formula_index], "-"))
641
	{
642
	  std::ifstream fin(argv[formula_index]);
643
	  if (!fin)
644
645
646
647
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
648

649
	  if (!std::getline(fin, input, '\0'))
650
651
652
653
654
655
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
656
	{
657
	  std::getline(std::cin, input, '\0');
658
	}
659
      tm.stop("reading formula");
660
661
662
663
664
665
    }
  else
    {
      input = argv[formula_index];
    }

666
667
668
  spot::ltl::formula* f = 0;
  if (!from_file)
    {
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
      if (!eltl)
        {
          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);
	}
      else if (!file_opt || output == 6)
        {
	  // Call the LTL parser first to handle abbreviations such as
	  // [] when the formula is not given in a file or when the
	  // output in done in LBTT's format. The ELTL parser is then
	  // called with usual LTL operators.
	  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);
        }
      else
        {
	  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);
	}
703
704
    }
  if (f || from_file)
705
    {
706
707
708
709
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

710
711
712
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
713
	  spot::tgba_explicit_string* e;
714
	  tm.start("parsing automaton");
715
716
	  to_free = a = e = spot::tgba_parse(input, pel, dict,
					     env, env, debug_opt);
717
	  tm.stop("parsing automaton");
718
	  if (spot::format_tgba_parse_errors(std::cerr, input, pel))
719
720
721
722
723
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
724
	  e->merge_transitions();
725
	}
726
      else
727
	{
728
	  if (redopt != spot::ltl::Reduce_None)
729
	    {
730
	      tm.start("reducing formula");
731
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
732
	      f->destroy();
733
	      tm.stop("reducing formula");
734
	      f = t;
735
736
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
737
	    }
738

739
	  tm.start("translating formula");
740
741
742
743
744
745
746
747
748
749
750
751
752
753
	  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,
				       fm_red, containment);
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
754
755
756
757
	      if (!eltl)
		a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	      else
		a = concrete = spot::eltl_to_tgba_lacim(f, dict);
758
759
	      break;
	    }
760
	  tm.stop("translating formula");
761
	  to_free = a;
762
	}
763

764
      spot::tgba_tba_proxy* degeneralized = 0;
765
      spot::tgba_sgba_proxy* state_labeled = 0;
766

767
768
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
769
	  && degeneralize_opt == NoDegen
770
771
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
772
773
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
774
	a = degeneralized = new spot::tgba_tba_proxy(a);
775
776
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
777
778
779
780
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
781

782
783
784
785
786
787
788
789
790
      if (delete_unaccepting_scc)
        {
	  tm.start("reducing A_f w/ SCC on BDD");
	  if (spot::tgba_bdd_concrete* bc =
	      dynamic_cast<spot::tgba_bdd_concrete*>(a))
	      bc->delete_unaccepting_scc();
	  tm.stop("reducing A_f w/ SCC on BDD");
	}

791
      spot::tgba_reduc* aut_red = 0;
792
      spot::tgba* aut_scc = 0;
793
794
      if (reduc_aut != spot::Reduce_None)
	{
795
796

	  if (reduc_aut & spot::Reduce_Scc)
797
	    {
798
	      tm.start("reducing A_f w/ SCC");
799
	      a = aut_scc = spot::scc_filter(a);
800
	      tm.stop("reducing A_f w/ SCC");
801
	    }
802

803
	  if (reduc_aut & ~spot::Reduce_Scc)
804
	    {
805
	      tm.start("reducing A_f w/ sim.");
806
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
807
808

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
809
810
811
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
812
		{
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
		  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);
849

martinez's avatar
martinez committed
850
		  if (rel_dir)
851
		    spot::free_relation_simulation(rel_dir);
martinez's avatar
martinez committed
852
		  if (rel_del)
853
		    spot::free_relation_simulation(rel_del);
martinez's avatar
martinez committed
854
		}
855
	      tm.stop("reducing A_f w/ sim.");
856
857
858
	    }
	}

859
860
861
862
863
864
865
866
867
868
869
870
871
      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;
	}

872
873
      spot::tgba* product_degeneralized = 0;

874
      if (system)
875
876
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
877
878
879
880
881
882

	  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)
883
884
885
886
887
888
889
890
            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);
        }
891

892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
      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);
	    }
	}

910
911
912
913
914
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

915
      if (output != -1)
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
	  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);
959
		spot::never_claim_reachable(std::cout, s, f, spin_comments);
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
		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");
976
	}
977

978
      if (echeck_inst)
979
	{
980
981
982
	  spot::emptiness_check* ec = echeck_inst->instantiate(a);
	  bool search_many = echeck_inst->options().get("repeated");
	  assert(ec);
983
984
	  do
	    {
985
	      tm.start("running emptiness check");
986
	      spot::emptiness_check_result* res = ec->check();
987
988
	      tm.stop("running emptiness check");

989
990
991
              if (paper_opt)
                {
                  std::ios::fmtflags old = std::cout.flags();
992
                  std::cout << std::left << std::setw(25)
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
                            << 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
1013
                    std::cout << "no stats, , ";
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
                  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 &&
1026
		      (!expect_counter_example || ec->safe()))
1027
1028
1029
                    exit_code = 1;

                  if (!res)
1030
                    {
1031
                      std::cout << "no accepting run found";
1032
                      if (!ec->safe() && expect_counter_example)
1033
1034
                        {
                          std::cout << " even if expected" << std::endl;
1035
1036
                          std::cout << "this may be due to the use of the bit"
                                    << " state hashing technique" << std::endl;
1037
1038
1039
1040
1041
1042
                          std::cout << "you can try to increase the heap size "
                                    << "or use an explicit storage"
                                    << std::endl;
                        }
                      std::cout << std::endl;
                      break;
1043
                    }
1044
1045
                  else
                    {
1046

1047
		      tm.start("computing accepting run");
1048
                      spot::tgba_run* run = res->accepting_run();
1049
1050
		      tm.stop("computing accepting run");

1051
1052
1053
1054
1055
1056
1057
1058
                      if (!run)
                        {
                          std::cout << "an accepting run exists" << std::endl;
                        }
                      else
                        {
                          if (opt_reduce)
                            {
1059
			      tm.start("reducing accepting run");
1060
1061
                              spot::tgba_run* redrun =
                                spot::reduce_run(res->automaton(), run);
1062
			      tm.stop("reducing accepting run");
1063
1064
1065
                              delete run;
                              run = redrun;
                            }
1066
			  tm.start("printing accepting run");
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
                          if (graph_run_opt)
                            {
                              spot::tgba_run_dotty_decorator deco(run);
                              spot::dotty_reachable(std::cout, a, &deco);
                            }
                          else if (graph_run_tgba_opt)
                            {
                              spot::tgba* ar = spot::tgba_run_to_tgba(a, run);
                              spot::dotty_reachable(std::cout, ar);
                              delete ar;
                            }
                          else
                            {
                              spot::print_tgba_run(std::cout, a, run);
                              if (!spot::replay_tgba_run(std::cout, a, run,
                                                                        true))
                                exit_code = 1;
                            }
                          delete run;
1086
			  tm.stop("printing accepting run");
1087
1088
1089
                        }
                    }
                }
1090
1091
	      delete res;
	    }
1092
	  while (search_many);
1093
	  delete ec;
martinez's avatar
martinez committed
1094
1095
	}

1096
1097
      if (show_fc)
	delete a;
1098
      if (f)
1099
        f->destroy();
1100
1101
      delete product_degeneralized;
      delete product_to_free;
1102
      delete system;
1103
1104
      delete expl;
      delete aut_red;
1105
      delete aut_scc;
1106
      delete degeneralized;