ltl2tgba.cc 31.7 KB
Newer Older
1
// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 Laboratoire
2
3
// d'Informatique de Paris 6 (LIP6), département Systèmes Répartis
// Coopératifs (SRC), Université Pierre et Marie Curie.
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
//
// 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.

22
#include <iostream>
23
#include <iomanip>
24
#include <cassert>
25
26
#include <fstream>
#include <string>
27
#include <cstdlib>
28
#include "ltlvisit/contain.hh"
29
#include "ltlvisit/tostring.hh"
30
#include "ltlvisit/apcollect.hh"
31
#include "ltlast/allnodes.hh"
32
#include "ltlparse/public.hh"
33
#include "tgbaalgos/ltl2tgba_lacim.hh"
34
#include "tgbaalgos/ltl2tgba_fm.hh"
35
#include "tgbaalgos/ltl2taa.hh"
36
#include "tgba/bddprint.hh"
37
#include "tgbaalgos/save.hh"
38
#include "tgbaalgos/dotty.hh"
39
#include "tgbaalgos/lbtt.hh"
40
#include "tgba/tgbatba.hh"
41
#include "tgba/tgbasgba.hh"
42
#include "tgba/tgbaproduct.hh"
43
#include "tgba/futurecondcol.hh"
44
#include "tgbaalgos/reducerun.hh"
45
#include "tgbaparse/public.hh"
46
#include "tgbaalgos/dupexp.hh"
47
#include "tgbaalgos/neverclaim.hh"
48
#include "tgbaalgos/reductgba_sim.hh"
49
#include "tgbaalgos/replayrun.hh"
50
#include "tgbaalgos/rundotdec.hh"
51
#include "tgbaalgos/sccfilter.hh"
52
#include "misc/timer.hh"
53

54
#include "tgbaalgos/stats.hh"
55
#include "tgbaalgos/scc.hh"
56
57
#include "tgbaalgos/emptiness_stats.hh"

58
59
60
void
syntax(char* prog)
{
61
62
63
64
65
66
67
68
69
  // 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
70
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
71
	    << std::endl
72
73
74
75
76
77
78

            << "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
79
	    << std::endl
80
81
82

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
83
	    << std::endl
84
	    << "  -X    do not compute an automaton, read it from a file"
85
	    << std::endl
86
87
	    << "  -Pfile  multiply the formula automaton with the automaton"
	    << " from `file'"
88
	    << std::endl
89
90
91
	    << std::endl

	    << "Translation algorithm:" << std::endl
martinez's avatar
martinez committed
92
            << "  -f    use Couvreur's FM algorithm for translation"
93
	    << std::endl
94
95
96
            << "  -l    use Couvreur's LaCIM algorithm for translation "
	    << "(default)"
	    << std::endl
97
            << "  -taa  use Tauriainen's TAA-based algorithm for translation"
martinez's avatar
martinez committed
98
	    << std::endl
99
100
101
102
103
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
	    << "  -c    enable language containment checks (implies -f)"
	    << std::endl
104
105
106
107
	    << "  -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
108
109
110
	    << "  -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
111
112
113
114
115
            << "  -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)"
116
	    << std::endl
117
118
119
120
            << "  -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
121
	    << std::endl
122
123
124
125

	    << "Options for Couvreur's LaCIM algorithm (-l):" << std::endl
	    << "  -a    display the acceptance_conditions BDD, not the "
	    << "reachability graph"
126
	    << std::endl
127
128
	    << "  -A    same as -a, but as a set" << std::endl
	    << "  -r    display the relation BDD, not the reachability graph"
129
	    << std::endl
130
	    << "  -R    same as -r, but as a set" << std::endl
131
	    << std::endl
132
133

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
134
	    << std::endl
135
	    << "  -c    enable language containment checks" << std::endl
136
	    << std::endl
137
138

	    << "Formula simplification (before translation):"
139
	    << std::endl
martinez's avatar
martinez committed
140
141
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
142
	    << "universality" << std::endl
martinez's avatar
martinez committed
143
	    << "  -r3   reduce formula using implication between "
144
	    << "sub-formulae" << std::endl
145
146
147
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
148
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
149
150
151
152
153
154
155
156
157
158
159
160
161
162
	    << "  -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
163
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
164
	    << "(use -L for more reduction)"
165
	    << std::endl
166
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
167
	    << "(use -L for more reduction)"
168
	    << std::endl
169
170
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
171
	    << std::endl
172
173
174
	    << "  -R3   use SCC to reduce the automata" << std::endl
	    << "  -Rd   display the simulation relation" << std::endl
	    << "  -RD   display the parity game (dot format)" << std::endl
175
	    << std::endl
176
177
178
179
180

	    << "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
181
	    << std::endl
182
	    << "  -g    graph the accepting run on the automaton (requires -e)"
183
	    << std::endl
184
185
186
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
187
188
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
189
190
191
192
193
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
	    << "  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;
231
232
233
234
235
236
237
238
  exit(2);
}

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

239
  bool debug_opt = false;
240
  bool paper_opt = false;
241
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
242
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
243
  enum { TransFM, TransLaCIM, TransTAA } translation = TransLaCIM;
244
  int fm_red = spot::ltl::Reduce_None;
245
  bool fm_exprop_opt = false;
246
  bool fm_symb_merge_opt = true;
247
  bool file_opt = false;
248
  int output = 0;
249
  int formula_index = 0;
250
251
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
252
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
253
  bool expect_counter_example = false;
254
  bool from_file = false;
255
  int reduc_aut = spot::Reduce_None;
256
  int redopt = spot::ltl::Reduce_None;
257
258
  bool display_reduce_form = false;
  bool display_rel_sim = false;
259
  bool display_parity_game = false;
260
  bool post_branching = false;
261
  bool fair_loop_approx = false;
262
  bool graph_run_opt = false;
263
  bool graph_run_tgba_opt = false;
264
  bool opt_reduce = false;
265
  bool containment = false;
266
  bool show_fc = false;
267
  bool spin_comments = false;
268
269
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
270
  spot::tgba_explicit_string* system = 0;
271
  spot::tgba* product = 0;
272
  spot::tgba* product_to_free = 0;
273
  spot::bdd_dict* dict = new spot::bdd_dict();
274
275
  spot::timer_map tm;
  bool use_timer = false;
276

277
  for (;;)
278
    {
279
      if (argc < formula_index + 2)
280
	syntax(argv[0]);
281
282
283

      ++formula_index;

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

	  if (!paper_opt)
	    std::clog << argv[formula_index] + 2 << " read" << std::endl;
472
	}
473
474
      else if (!strcmp(argv[formula_index], "-r"))
	{
475
476
	  output = 1;
	}
477
478
479
480
481
482
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
483
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
484
485
486
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
487
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
488
489
490
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
491
492
493
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
494
	}
495
496
      else if (!strcmp(argv[formula_index], "-r5"))
	{
497
	  redopt |= spot::ltl::Reduce_Containment_Checks;
498
499
500
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
501
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
502
503
504
505
506
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
507
508
509
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
510
	}
martinez's avatar
martinez committed
511
512
513
514
515
516
517
518
519
      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"))
520
	{
martinez's avatar
martinez committed
521
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
522
	}
martinez's avatar
martinez committed
523
      else if (!strcmp(argv[formula_index], "-R2t"))
524
	{
martinez's avatar
martinez committed
525
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
	  reduc_aut |= spot::Reduce_Scc;
	}
      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;
	}
543
544
545
546
547
548
549
550
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
551
552
553
554
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
555
556
557
558
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
559
560
561
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
562
	  translation = TransFM;
563
	  // Parse -U's argument.
564
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
565
566
567
568
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
569
	      tok = strtok(0, ", \t;");
570
571
	    }
	}
572
573
574
575
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
576
577
      else if (!strcmp(argv[formula_index], "-x"))
	{
578
	  translation = TransFM;
579
580
	  fm_exprop_opt = true;
	}
581
582
583
584
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
585
586
      else if (!strcmp(argv[formula_index], "-y"))
	{
587
	  translation = TransFM;
588
589
	  fm_symb_merge_opt = false;
	}
590
591
592
593
      else
	{
	  break;
	}
594
595
    }

596
  if ((graph_run_opt || graph_run_tgba_opt)
597
      && (!echeck_inst || !expect_counter_example))
598
    {
599
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
600
601
602
      exit(1);
    }

603
604
605
606
  std::string input;

  if (file_opt)
    {
607
      tm.start("reading formula");
608
      if (strcmp(argv[formula_index], "-"))
609
	{
610
	  std::ifstream fin(argv[formula_index]);
611
	  if (!fin)
612
613
614
615
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
616

617
	  if (!std::getline(fin, input, '\0'))
618
619
620
621
622
623
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
624
	{
625
	  std::getline(std::cin, input, '\0');
626
	}
627
      tm.stop("reading formula");
628
629
630
631
632
633
    }
  else
    {
      input = argv[formula_index];
    }

634
635
636
637
  spot::ltl::formula* f = 0;
  if (!from_file)
    {
      spot::ltl::parse_error_list pel;
638
      tm.start("parsing formula");
639
      f = spot::ltl::parse(input, pel, env, debug_opt);
640
      tm.stop("parsing formula");
641
642
643
      exit_code = spot::ltl::format_parse_errors(std::cerr, input, pel);
    }
  if (f || from_file)
644
    {
645
646
647
648
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

649
650
651
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
652
	  spot::tgba_explicit_string* e;
653
	  tm.start("parsing automaton");
654
655
	  to_free = a = e = spot::tgba_parse(input, pel, dict,
					     env, env, debug_opt);
656
	  tm.stop("parsing automaton");
657
	  if (spot::format_tgba_parse_errors(std::cerr, input, pel))
658
659
660
661
662
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
663
	  e->merge_transitions();
664
	}
665
      else
666
	{
667
	  if (redopt != spot::ltl::Reduce_None)
668
	    {
669
	      tm.start("reducing formula");
670
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
671
	      f->destroy();
672
	      tm.stop("reducing formula");
673
	      f = t;
674
675
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
676
	    }
677

678
	  tm.start("translating formula");
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
	  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:
	      a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	      break;
	    }
696
	  tm.stop("translating formula");
697
	  to_free = a;
698
	}
699

700
      spot::tgba_tba_proxy* degeneralized = 0;
701
      spot::tgba_sgba_proxy* state_labeled = 0;
702

703
704
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
705
	  && degeneralize_opt == NoDegen
706
707
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
708
709
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
710
	a = degeneralized = new spot::tgba_tba_proxy(a);
711
712
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
713
714
715
716
      else if (labeling_opt == StateLabeled)
      {
        a = state_labeled = new spot::tgba_sgba_proxy(a);
      }
717

718
      spot::tgba_reduc* aut_red = 0;
719
      spot::tgba* aut_scc = 0;
720
721
      if (reduc_aut != spot::Reduce_None)
	{
722
723

	  if (reduc_aut & spot::Reduce_Scc)
724
	    {
725
	      tm.start("reducing A_f w/ SCC");
726
	      a = aut_scc = spot::scc_filter(a);
727
	      tm.stop("reducing A_f w/ SCC");
728
	    }
729

730
	  if (reduc_aut & ~spot::Reduce_Scc)
731
	    {
732
	      tm.start("reducing A_f w/ sim.");
733
	      a = aut_red = new spot::tgba_reduc(a);
martinez's avatar
martinez committed
734
735

	      if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
736
737
738
			       spot::Reduce_transition_Dir_Sim |
			       spot::Reduce_quotient_Del_Sim |
			       spot::Reduce_transition_Del_Sim))
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
		  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);
776

martinez's avatar
martinez committed
777
		  if (rel_dir)
778
		    spot::free_relation_simulation(rel_dir);
martinez's avatar
martinez committed
779
		  if (rel_del)
780
		    spot::free_relation_simulation(rel_del);
martinez's avatar
martinez committed
781
		}
782
	      tm.stop("reducing A_f w/ sim.");
783
784
785
	    }
	}

786
787
788
789
790
791
792
793
794
795
796
797
798
      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;
	}

799
800
      spot::tgba* product_degeneralized = 0;

801
      if (system)
802
803
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
804
805
806
807
808
809

	  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)
810
811
812
813
814
815
816
817
            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);
        }
818

819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
      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);
	    }
	}

837
838
839
840
841
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

842
      if (output != -1)
843
	{
844
845
846
847
848
849
850
851
852
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
	  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);
886
		spot::never_claim_reachable(std::cout, s, f, spin_comments);
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
		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");
903
	}
904

905
      if (echeck_inst)
906
	{
907
908
909
	  spot::emptiness_check* ec = echeck_inst->instantiate(a);
	  bool search_many = echeck_inst->options().get("repeated");
	  assert(ec);
910
911
	  do
	    {
912
	      tm.start("running emptiness check");
913
	      spot::emptiness_check_result* res = ec->check();
914
915
	      tm.stop("running emptiness check");

916
917
918
              if (paper_opt)
                {
                  std::ios::fmtflags old = std::cout.flags();
919
                  std::cout << std::left << std::setw(25)
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
                            << 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
940
                    std::cout << "no stats, , ";
941
942
943
944
945
946
947
948
949
950
951
952
                  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 &&
953
		      (!expect_counter_example || ec->safe()))
954
955
956
                    exit_code = 1;

                  if (!res)
957
                    {
958
                      std::cout << "no accepting run found";
959
                      if (!ec->safe() && expect_counter_example)
960
961
                        {
                          std::cout << " even if expected" << std::endl;
962
963
                          std::cout << "this may be due to the use of the bit"
                                    << " state hashing technique" << std::endl;
964
965
966
967
968
969
                          std::cout << "you can try to increase the heap size "
                                    << "or use an explicit storage"
                                    << std::endl;
                        }
                      std::cout << std::endl;
                      break;
970
                    }
971
972
                  else
                    {
973

974
		      tm.start("computing accepting run");
975
                      spot::tgba_run* run = res->accepting_run();
976
977
		      tm.stop("computing accepting run");

978
979
980
981
982
983
984
985
                      if (!run)
                        {
                          std::cout << "an accepting run exists" << std::endl;
                        }
                      else
                        {
                          if (opt_reduce)
                            {
986
			      tm.start("reducing accepting run");
987
988
                              spot::tgba_run* redrun =
                                spot::reduce_run(res->automaton(), run);
989
			      tm.stop("reducing accepting run");
990
991
992
                              delete run;
                              run = redrun;
                            }
993
			  tm.start("printing accepting run");
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
                          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;
1013
			  tm.stop("printing accepting run");
1014
1015
1016
                        }
                    }
                }
1017
1018
	      delete res;
	    }
1019
	  while (search_many);
1020
	  delete ec;
martinez's avatar
martinez committed
1021
1022
	}

1023
1024
      if (show_fc)
	delete a;
1025
      if (f)
1026
        f->destroy();
1027
1028
      delete product_degeneralized;
      delete product_to_free;
1029
      delete system;
1030
1031
      delete expl;
      delete aut_red;
1032
      delete aut_scc;
1033
      delete degeneralized;
1034
      delete state_labeled;
1035
      delete to_free;
1036
      delete echeck_inst;
1037
1038
1039
1040
1041
1042
    }
  else
    {
      exit_code = 1;
    }

1043
1044
1045
  if (use_timer)
    tm.print(std::cout);

1046
1047
1048
1049
  if (unobservables)
    {
      for (spot::ltl::atomic_prop_set::iterator i =
	     unobservables->begin(); i != unobservables->end(); ++i)
1050
	(*i)->destroy();
1051
1052
1053
      delete unobservables;
    }

1054
1055
1056
1057
1058
  spot::ltl::atomic_prop::dump_instances(std::cerr);
  spot::ltl::unop::dump_instances(std::cerr);
  spot::ltl::binop::dump_instances(std::cerr);
  spot::ltl::multop::dump_instances(std::cerr);
  spot::ltl::automatop::dump_instances(std::cerr);
1059
1060
1061
1062
  assert(spot::ltl::atomic_prop::instance_count() == 0);
  assert(spot::ltl::unop::instance_count() == 0);
  assert(spot::ltl::binop::instance_count() == 0);
  assert(spot::ltl::multop::instance_count() == 0);
1063
  assert(spot::ltl::automatop::instance_count() == 0);
1064
  delete dict;
1065
1066
  return exit_code;
}