ltl2tgba.cc 26.9 KB
Newer Older
1
// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009 Laboratoire
2
3
// d'Informatique de Paris 6 (LIP6), dpartement Systmes Rpartis
// Coopratifs (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/destroy.hh"
29
#include "ltlvisit/contain.hh"
30
#include "ltlvisit/tostring.hh"
31
#include "ltlvisit/apcollect.hh"
32
#include "ltlast/allnodes.hh"
33
#include "ltlparse/public.hh"
34
#include "tgbaalgos/ltl2tgba_lacim.hh"
35
#include "tgbaalgos/ltl2tgba_fm.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/tgbaproduct.hh"
42
#include "tgba/futurecondcol.hh"
43
#include "tgbaalgos/reducerun.hh"
44
#include "tgbaparse/public.hh"
45
#include "tgbaalgos/dupexp.hh"
46
#include "tgbaalgos/neverclaim.hh"
47
#include "tgbaalgos/reductgba_sim.hh"
48
#include "tgbaalgos/replayrun.hh"
49
#include "tgbaalgos/rundotdec.hh"
50

51
#include "tgbaalgos/stats.hh"
52
#include "tgbaalgos/scc.hh"
53
54
#include "tgbaalgos/emptiness_stats.hh"

55
56
57
void
syntax(char* prog)
{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
58
  std::cerr << "Usage: "<< prog << " [OPTIONS...] formula" << std::endl
59
            << "       "<< prog << " -F [OPTIONS...] file" << std::endl
60
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
61
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
62
	    << "Options:" << std::endl
63
64
	    << "  -0    produce minimal output dedicated to the paper"
	    << std::endl
martinez's avatar
martinez committed
65
	    << "  -a    display the acceptance_conditions BDD, not the "
66
	    << "reachability graph"
67
	    << std::endl
martinez's avatar
martinez committed
68
	    << "  -A    same as -a, but as a set" << std::endl
69
70
	    << "  -b    display the automaton in the format of spot"
            << std::endl
71
72
	    << "  -c    enable language containment checks (implies -f)"
	    << std::endl
martinez's avatar
martinez committed
73
	    << "  -d    turn on traces during parsing" << std::endl
74
75
	    << "  -D    degeneralize the automaton as a TBA" << std::endl
	    << "  -DS   degeneralize the automaton as an SBA" << std::endl
76
77
78
	    << "  -e[ALGO]  emptiness-check, expect and compute an "
	    << "accepting run" << std::endl
	    << "  -E[ALGO]  emptiness-check, expect no accepting run"
79
	    << std::endl
martinez's avatar
martinez committed
80
81
            << "  -f    use Couvreur's FM algorithm for translation"
	    << std::endl
82
83
84
85
	    << "  -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
86
87
88
	    << "  -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
89
	    << "  -fr8  use -r8 (see below) at each step of FM" << std::endl
martinez's avatar
martinez committed
90
            << "  -F    read the formula from the file" << std::endl
91
92
            << "  -FC   dump the automaton showing future conditions on states"
	    << std::endl
93
	    << "  -g    graph the accepting run on the automaton (requires -e)"
94
	    << std::endl
95
96
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
97
98
	    << "  -k    display statistics on the TGBA instead of dumping it"
	    << std::endl
99
100
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
101
	    << std::endl
martinez's avatar
martinez committed
102
            << "  -L    fair-loop approximation (implies -f)" << std::endl
103
	    << "  -m    try to reduce accepting runs, in a second pass"
104
	    << std::endl
martinez's avatar
martinez committed
105
106
	    << "  -N    display the never clain for Spin "
	    << "(implies -D)" << std::endl
martinez's avatar
martinez committed
107
            << "  -p    branching postponement (implies -f)" << std::endl
108
109
	    << "  -Pfile  multiply the formula with the automaton from `file'."
	    << std::endl
martinez's avatar
martinez committed
110
	    << "  -r    display the relation BDD, not the reachability graph"
111
	    << std::endl
martinez's avatar
martinez committed
112
113
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
114
	    << "and universality" << std::endl
martinez's avatar
martinez committed
115
	    << "  -r3   reduce formula using implication between "
116
	    << "sub-formulae" << std::endl
117
118
119
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
120
121
	    << "  -r7   reduce formula using tau03+ and -r1" << std::endl
	    << "  -r8   reduce formula using tau03+ and -r4" << std::endl
martinez's avatar
martinez committed
122
123
	    << "  -rd   display the reduce formula" << std::endl
	    << "  -R    same as -r, but as a set" << std::endl
124
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
125
	    << "(use -L for more reduction)"
126
	    << std::endl
127
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
128
	    << "(use -L for more reduction)"
129
	    << std::endl
130
131
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
132
	    << std::endl
133
134
135
	    << "  -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
martinez's avatar
martinez committed
136
	    << "  -s    convert to explicit automata, and number states "
137
	    << "in DFS order" << std::endl
martinez's avatar
martinez committed
138
	    << "  -S    convert to explicit automata, and number states "
139
	    << "in BFS order" << std::endl
martinez's avatar
martinez committed
140
	    << "  -t    display reachable states in LBTT's format" << std::endl
141
142
143
144
            << "  -U[PROPS]  consider atomic properties of the formula as "
	    << "exclusive events, and" << std::endl
	    << "        PROPS as unobservables events (implies -f)"
	    << std::endl
martinez's avatar
martinez committed
145
146
147
	    << "  -v    display the BDD variables used by the automaton"
	    << std::endl
            << "  -x    try to produce a more deterministic automata "
148
	    << "(implies -f)" << std::endl
martinez's avatar
martinez committed
149
	    << "  -X    do not compute an automaton, read it from a file"
150
	    << std::endl
martinez's avatar
martinez committed
151
	    << "  -y    do not merge states with same symbolic representation "
152
153
154
	    << "(implies -f)" << std::endl
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
155
156
157
158
159
160
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
	    << "  Tau03_opt(OPTIONS)" << std::endl;
161
162
163
164
165
166
167
168
  exit(2);
}

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

169
  bool debug_opt = false;
170
  bool paper_opt = false;
171
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
172
  bool fm_opt = false;
173
  int fm_red = spot::ltl::Reduce_None;
174
  bool fm_exprop_opt = false;
175
  bool fm_symb_merge_opt = true;
176
  bool file_opt = false;
177
  int output = 0;
178
  int formula_index = 0;
179
180
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
181
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
182
  bool expect_counter_example = false;
183
  bool from_file = false;
184
  int reduc_aut = spot::Reduce_None;
185
  int redopt = spot::ltl::Reduce_None;
186
187
  bool display_reduce_form = false;
  bool display_rel_sim = false;
188
  bool display_parity_game = false;
189
  bool post_branching = false;
190
  bool fair_loop_approx = false;
191
  bool graph_run_opt = false;
192
  bool graph_run_tgba_opt = false;
193
  bool opt_reduce = false;
194
  bool containment = false;
195
  bool show_fc = false;
196
197
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
198
199
  spot::tgba_explicit* system = 0;
  spot::tgba* product = 0;
200
  spot::tgba* product_to_free = 0;
201
  spot::bdd_dict* dict = new spot::bdd_dict();
202

203
  for (;;)
204
    {
205
      if (argc < formula_index + 2)
206
	syntax(argv[0]);
207
208
209

      ++formula_index;

210
211
212
213
214
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-a"))
215
216
217
	{
	  output = 2;
	}
218
      else if (!strcmp(argv[formula_index], "-A"))
219
	{
220
	  output = 4;
221
	}
222
      else if (!strcmp(argv[formula_index], "-b"))
223
	{
224
	  output = 7;
225
	}
226
227
228
229
230
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
	  fm_opt = true;
	}
231
      else if (!strcmp(argv[formula_index], "-d"))
232
233
234
	{
	  debug_opt = true;
	}
235
236
      else if (!strcmp(argv[formula_index], "-D"))
	{
237
238
239
240
241
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
242
	}
243
      else if (!strncmp(argv[formula_index], "-e", 2))
244
        {
245
246
247
248
249
250
251
252
253
254
255
256
257
	  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);
	    }
258
259
260
          expect_counter_example = true;
          output = -1;
        }
261
      else if (!strncmp(argv[formula_index], "-E", 2))
262
        {
263
264
265
266
267
268
269
270
271
272
273
274
275
	  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);
	    }
276
277
278
          expect_counter_example = false;
          output = -1;
        }
279
280
281
282
      else if (!strcmp(argv[formula_index], "-f"))
	{
	  fm_opt = true;
	}
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
      else if (!strcmp(argv[formula_index], "-fr1"))
	{
	  fm_opt = true;
	  fm_red |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-fr2"))
	{
	  fm_opt = true;
	  fm_red |= spot::ltl::Reduce_Eventuality_And_Universality;
	}
      else if (!strcmp(argv[formula_index], "-fr3"))
	{
	  fm_opt = true;
	  fm_red |= spot::ltl::Reduce_Syntactic_Implications;
	}
      else if (!strcmp(argv[formula_index], "-fr4"))
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
	{
	  fm_opt = true;
 	  fm_red |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
	}
      else if (!strcmp(argv[formula_index], "-fr5"))
	{
	  fm_opt = true;
	  fm_red |= spot::ltl::Reduce_Containment_Checks;
	}
      else if (!strcmp(argv[formula_index], "-fr6"))
	{
	  fm_opt = true;
	  fm_red |= spot::ltl::Reduce_Containment_Checks_Stronger;
	}
      else if (!strcmp(argv[formula_index], "-fr7"))
316
317
318
319
	{
	  fm_opt = true;
	  fm_red |= spot::ltl::Reduce_All;
	}
320
321
322
323
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
324
325
326
327
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
328
329
330
331
      else if (!strcmp(argv[formula_index], "-g"))
	{
	  graph_run_opt = true;
	}
332
333
334
335
      else if (!strcmp(argv[formula_index], "-G"))
	{
	  graph_run_tgba_opt = true;
	}
336
337
338
339
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
340
341
342
343
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
344
345
346
347
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
348
349
350
351
352
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
	  fm_opt = true;
	}
353
354
      else if (!strcmp(argv[formula_index], "-m"))
	{
355
	  opt_reduce = true;
356
	}
martinez's avatar
martinez committed
357
358
      else if (!strcmp(argv[formula_index], "-N"))
	{
359
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
360
361
	  output = 8;
	}
362
363
364
365
366
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
	  fm_opt = true;
	}
367
368
369
370
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
	  spot::tgba_parse_error_list pel;
	  system = spot::tgba_parse(argv[formula_index] + 2,
371
				    pel, dict, env, env, debug_opt);
372
373
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
374
375
	    return 2;
	  system->merge_transitions();
376
377
378

	  if (!paper_opt)
	    std::clog << argv[formula_index] + 2 << " read" << std::endl;
379
	}
380
381
      else if (!strcmp(argv[formula_index], "-r"))
	{
382
383
	  output = 1;
	}
384
385
386
387
388
389
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
390
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
391
392
393
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
394
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
395
396
397
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
398
399
400
 	  redopt |= spot::ltl::Reduce_Basics
	    | spot::ltl::Reduce_Eventuality_And_Universality
	    | spot::ltl::Reduce_Syntactic_Implications;
401
	}
402
403
      else if (!strcmp(argv[formula_index], "-r5"))
	{
404
	  redopt |= spot::ltl::Reduce_Containment_Checks;
405
406
407
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
408
	  redopt |= spot::ltl::Reduce_Containment_Checks_Stronger;
409
410
411
412
413
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
414
415
416
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
417
	}
martinez's avatar
martinez committed
418
419
420
421
422
423
424
425
426
      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"))
427
	{
martinez's avatar
martinez committed
428
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
429
	}
martinez's avatar
martinez committed
430
      else if (!strcmp(argv[formula_index], "-R2t"))
431
	{
martinez's avatar
martinez committed
432
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
	}
      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;
	}
450
451
452
453
454
455
456
457
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
458
459
460
461
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
462
463
464
465
466
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
	  fm_opt = true;
	  // Parse -U's argument.
467
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
468
469
470
471
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
472
	      tok = strtok(0, ", \t;");
473
474
	    }
	}
475
476
477
478
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
479
480
481
482
483
      else if (!strcmp(argv[formula_index], "-x"))
	{
	  fm_opt = true;
	  fm_exprop_opt = true;
	}
484
485
486
487
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
488
489
490
491
492
      else if (!strcmp(argv[formula_index], "-y"))
	{
	  fm_opt = true;
	  fm_symb_merge_opt = false;
	}
493
494
495
496
      else
	{
	  break;
	}
497
498
    }

499
  if ((graph_run_opt || graph_run_tgba_opt)
500
      && (!echeck_inst || !expect_counter_example))
501
    {
502
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
503
504
505
      exit(1);
    }

506
507
508
509
  std::string input;

  if (file_opt)
    {
510
      if (strcmp(argv[formula_index], "-"))
511
	{
512
	  std::ifstream fin(argv[formula_index]);
513
	  if (!fin)
514
515
516
517
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
518

519
	  if (!std::getline(fin, input, '\0'))
520
521
522
523
524
525
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
526
	{
527
	  std::getline(std::cin, input, '\0');
528
529
530
531
532
533
534
	}
    }
  else
    {
      input = argv[formula_index];
    }

535
536
537
538
539
540
541
542
  spot::ltl::formula* f = 0;
  if (!from_file)
    {
      spot::ltl::parse_error_list pel;
      f = spot::ltl::parse(input, pel, env, debug_opt);
      exit_code = spot::ltl::format_parse_errors(std::cerr, input, pel);
    }
  if (f || from_file)
543
    {
544
545
546
547
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

548
549
550
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
551
	  spot::tgba_explicit* e;
552
553
	  to_free = a = e = spot::tgba_parse(input, pel, dict,
					     env, env, debug_opt);
554
	  if (spot::format_tgba_parse_errors(std::cerr, input, pel))
555
556
557
558
559
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
560
	  e->merge_transitions();
561
	}
562
      else
563
	{
564
	  if (redopt != spot::ltl::Reduce_None)
565
	    {
566
567
568
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
	      spot::ltl::destroy(f);
	      f = t;
569
570
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
571
	    }
572

573
	  if (fm_opt)
574
	    to_free = a = spot::ltl_to_tgba_fm(f, dict, fm_exprop_opt,
575
					       fm_symb_merge_opt,
576
					       post_branching,
577
					       fair_loop_approx, unobservables,
578
					       fm_red, containment);
579
580
581
	  else
	    to_free = a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	}
582

583
      spot::tgba_tba_proxy* degeneralized = 0;
584

585
586
      unsigned int n_acc = a->number_of_acceptance_conditions();
      if (echeck_inst
587
	  && degeneralize_opt == NoDegen
588
589
	  && n_acc > 1
	  && echeck_inst->max_acceptance_conditions() < n_acc)
590
591
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
592
	a = degeneralized = new spot::tgba_tba_proxy(a);
593
594
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
595

596
597
598
599
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
	  a = aut_red = new spot::tgba_reduc(a);
600
601
602
603

	  if (reduc_aut & spot::Reduce_Scc)
	    aut_red->prune_scc();

martinez's avatar
martinez committed
604
605
606
607
	  if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
			   spot::Reduce_transition_Dir_Sim |
			   spot::Reduce_quotient_Del_Sim |
			   spot::Reduce_transition_Del_Sim))
608
	    {
martinez's avatar
martinez committed
609
610
611
612
613
	      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))
614
615
616
617
618
619
620
621
		{
		  rel_dir =
		    spot::get_direct_relation_simulation(a,
							 std::cout,
							 display_parity_game);
		  assert(rel_dir);
		}
	      if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
martinez's avatar
martinez committed
622
				    spot::Reduce_transition_Del_Sim))
623
624
625
626
627
628
629
		{
		  rel_del =
		    spot::get_delayed_relation_simulation(a,
							  std::cout,
							  display_parity_game);
		  assert(rel_del);
		}
630
631

	      if (display_rel_sim)
martinez's avatar
martinez committed
632
633
634
635
636
637
		{
		  if (rel_dir)
		    aut_red->display_rel_sim(rel_dir, std::cout);
		  if (rel_del)
		    aut_red->display_rel_sim(rel_del, std::cout);
		}
638

martinez's avatar
martinez committed
639
640
641
642
643
644
645
646
647
648
649
650
651
	      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);

	      if (rel_dir)
		spot::free_relation_simulation(rel_dir);
	      if (rel_del)
		spot::free_relation_simulation(rel_del);
652
653
654
	    }
	}

655
656
657
658
659
660
661
662
663
664
665
666
667
      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;
	}

668
669
      spot::tgba* product_degeneralized = 0;

670
      if (system)
671
672
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
673
674
675
676
677
678

	  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)
679
680
681
682
683
684
685
686
            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);
        }
687

688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
      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);
	    }
	}

706
707
708
709
710
      if (show_fc)
	{
	  a = new spot::future_conditions_collector(a, true);
	}

711
712
      switch (output)
	{
713
714
715
	case -1:
	  /* No output.  */
	  break;
716
717
718
719
	case 0:
	  spot::dotty_reachable(std::cout, a);
	  break;
	case 1:
720
721
722
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
723
724
	  break;
	case 2:
725
726
727
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->
728
				get_core_data().acceptance_conditions);
729
730
	  break;
	case 3:
731
732
733
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
734
735
	  break;
	case 4:
736
737
738
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->
739
				get_core_data().acceptance_conditions);
740
	  break;
741
	case 5:
742
	  a->get_dict()->dump(std::cout);
743
	  break;
744
745
746
	case 6:
	  spot::lbtt_reachable(std::cout, a);
	  break;
747
748
749
	case 7:
	  spot::tgba_save_reachable(std::cout, a);
	  break;
750
	case 8:
751
752
753
754
755
756
757
	  {
	    assert(degeneralize_opt == DegenSBA);
	    const spot::tgba_sba_proxy* s =
	      static_cast<const spot::tgba_sba_proxy*>(degeneralized);
	    spot::never_claim_reachable(std::cout, s, f);
	    break;
	  }
758
759
	case 9:
	  stats_reachable(a).dump(std::cout);
760
761
762
	  build_scc_stats(a).dump(std::cout);
	  break;
	case 10:
763
764
765
766
	  dump_scc_dot(a, std::cout, false);
	  break;
	case 11:
	  dump_scc_dot(a, std::cout, true);
767
	  break;
768
769
770
	default:
	  assert(!"unknown output option");
	}
771

772
      if (echeck_inst)
773
	{
774
775
776
	  spot::emptiness_check* ec = echeck_inst->instantiate(a);
	  bool search_many = echeck_inst->options().get("repeated");
	  assert(ec);
777
778
779
	  do
	    {
	      spot::emptiness_check_result* res = ec->check();
780
781
782
              if (paper_opt)
                {
                  std::ios::fmtflags old = std::cout.flags();
783
                  std::cout << std::left << std::setw(25)
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
                            << 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
804
                    std::cout << "no stats, , ";
805
806
807
808
809
810
811
812
813
814
815
816
                  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 &&
817
		      (!expect_counter_example || ec->safe()))
818
819
820
                    exit_code = 1;

                  if (!res)
821
                    {
822
                      std::cout << "no accepting run found";
823
                      if (!ec->safe() && expect_counter_example)
824
825
                        {
                          std::cout << " even if expected" << std::endl;
826
827
                          std::cout << "this may be due to the use of the bit"
                                    << " state hashing technique" << std::endl;
828
829
830
831
832
833
                          std::cout << "you can try to increase the heap size "
                                    << "or use an explicit storage"
                                    << std::endl;
                        }
                      std::cout << std::endl;
                      break;
834
                    }
835
836
                  else
                    {
837

838
839
840
841
842
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
                      spot::tgba_run* run = res->accepting_run();
                      if (!run)
                        {
                          std::cout << "an accepting run exists" << std::endl;
                        }
                      else
                        {
                          if (opt_reduce)
                            {
                              spot::tgba_run* redrun =
                                spot::reduce_run(res->automaton(), run);
                              delete run;
                              run = redrun;
                            }
                          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;
                        }
                    }
                }
874
875
	      delete res;
	    }
876
	  while (search_many);
877
	  delete ec;
martinez's avatar
martinez committed
878
879
	}

880
881
      if (show_fc)
	delete a;
882
883
      if (f)
        spot::ltl::destroy(f);
884
885
      delete product_degeneralized;
      delete product_to_free;
886
      delete system;
887
888
      delete expl;
      delete aut_red;
889
      delete degeneralized;
890
      delete to_free;
891
      delete echeck_inst;
892
893
894
895
896
897
    }
  else
    {
      exit_code = 1;
    }

898
899
900
901
902
903
904
905
  if (unobservables)
    {
      for (spot::ltl::atomic_prop_set::iterator i =
	     unobservables->begin(); i != unobservables->end(); ++i)
	spot::ltl::destroy(*i);
      delete unobservables;
    }

906
907
908
909
  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);
910
  delete dict;
911
912
  return exit_code;
}