ltl2tgba.cc 21.1 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
// Copyright (C) 2003, 2004  Laboratoire d'Informatique de Paris 6 (LIP6),
// dpartement Systmes Rpartis Coopratifs (SRC), Universit Pierre
// et Marie Curie.
//
// 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
23
#include <iostream>
#include <cassert>
24
25
#include <fstream>
#include <string>
26
#include "ltlvisit/destroy.hh"
27
#include "ltlvisit/reduce.hh"
28
#include "ltlvisit/tostring.hh"
29
#include "ltlvisit/apcollect.hh"
30
31
#include "ltlast/allnodes.hh"
#include "ltlparse/public.hh"
32
#include "tgbaalgos/ltl2tgba_lacim.hh"
33
#include "tgbaalgos/ltl2tgba_fm.hh"
34
#include "tgba/bddprint.hh"
35
#include "tgbaalgos/dotty.hh"
36
#include "tgbaalgos/lbtt.hh"
37
#include "tgba/tgbatba.hh"
38
#include "tgbaalgos/gv04.hh"
39
#include "tgbaalgos/magic.hh"
40
#include "tgbaalgos/reducerun.hh"
41
42
#include "tgbaalgos/se05.hh"
#include "tgbaalgos/tau03.hh"
43
#include "tgbaalgos/tau03opt.hh"
44
45
#include "tgbaalgos/gtec/gtec.hh"
#include "tgbaalgos/gtec/ce.hh"
46
#include "tgbaparse/public.hh"
47
#include "tgbaalgos/dupexp.hh"
48
#include "tgbaalgos/neverclaim.hh"
49
#include "tgbaalgos/reductgba_sim.hh"
50
#include "tgbaalgos/replayrun.hh"
51
#include "tgbaalgos/rundotdec.hh"
52

53
54
55
void
syntax(char* prog)
{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
56
  std::cerr << "Usage: "<< prog << " [OPTIONS...] formula" << std::endl
57
            << "       "<< prog << " -F [OPTIONS...] file" << std::endl
58
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
59
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
60
	    << "Options:" << std::endl
martinez's avatar
martinez committed
61
	    << "  -a    display the acceptance_conditions BDD, not the "
62
	    << "reachability graph"
63
	    << std::endl
martinez's avatar
martinez committed
64
65
	    << "  -A    same as -a, but as a set" << std::endl
	    << "  -d    turn on traces during parsing" << std::endl
66
67
	    << "  -D    degeneralize the automaton as a TBA" << std::endl
	    << "  -DS   degeneralize the automaton as an SBA" << std::endl
68
69
70
	    << "  -e[ALGO]  emptiness-check, expect and compute an "
	    << "accepting run" << std::endl
	    << "  -E[ALGO]  emptiness-check, expect no accepting run"
71
	    << std::endl
martinez's avatar
martinez committed
72
73
74
            << "  -f    use Couvreur's FM algorithm for translation"
	    << std::endl
            << "  -F    read the formula from the file" << std::endl
75
	    << "  -g    graph the accepting run on the automaton (requires -e)"
76
	    << std::endl
martinez's avatar
martinez committed
77
            << "  -L    fair-loop approximation (implies -f)" << std::endl
78
	    << "  -m    try to reduce accepting runs, in a second pass"
79
	    << std::endl
martinez's avatar
martinez committed
80
81
	    << "  -N    display the never clain for Spin "
	    << "(implies -D)" << std::endl
martinez's avatar
martinez committed
82
83
            << "  -p    branching postponement (implies -f)" << std::endl
	    << "  -r    display the relation BDD, not the reachability graph"
84
	    << std::endl
martinez's avatar
martinez committed
85
86
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
87
	    << "and universality" << std::endl
martinez's avatar
martinez committed
88
	    << "  -r3   reduce formula using implication between "
89
	    << "sub-formulae" << std::endl
martinez's avatar
martinez committed
90
91
92
	    << "  -r4   reduce formula using all rules" << std::endl
	    << "  -rd   display the reduce formula" << std::endl
	    << "  -R    same as -r, but as a set" << std::endl
93
	    << "  -R1q  merge states using direct simulation "
martinez's avatar
martinez committed
94
	    << "(use -L for more reduction)"
95
	    << std::endl
96
	    << "  -R1t  remove transitions using direct simulation "
martinez's avatar
martinez committed
97
	    << "(use -L for more reduction)"
98
	    << std::endl
99
100
	    << "  -R2q  merge states using delayed simulation" << std::endl
	    << "  -R2t  remove transitions using delayed simulation"
101
	    << std::endl
102
103
104
	    << "  -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
105
	    << "  -s    convert to explicit automata, and number states "
106
	    << "in DFS order" << std::endl
martinez's avatar
martinez committed
107
	    << "  -S    convert to explicit automata, and number states "
108
	    << "in BFS order" << std::endl
martinez's avatar
martinez committed
109
	    << "  -t    display reachable states in LBTT's format" << std::endl
110
111
            << "  -U[PROPS]  consider atomic properties PROPS as exclusive "
	    << "events (implies -f)" << std::endl
martinez's avatar
martinez committed
112
113
114
	    << "  -v    display the BDD variables used by the automaton"
	    << std::endl
            << "  -x    try to produce a more deterministic automata "
115
	    << "(implies -f)" << std::endl
martinez's avatar
martinez committed
116
	    << "  -X    do not compute an automaton, read it from a file"
117
	    << std::endl
martinez's avatar
martinez committed
118
	    << "  -y    do not merge states with same symbolic representation "
119
120
121
	    << "(implies -f)" << std::endl
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
122
	    << "  couvreur99 (the default)" << std::endl
123
124
	    << "  couvreur99_shy" << std::endl
	    << "  magic_search" << std::endl
125
	    << "  magic_search_repeated" << std::endl
126
127
128
129
	    << "  bsh_magic_search[(heap size in Mo - 10Mo by default)]"
            << std::endl
	    << "  bsh_magic_search_repeated[(heap size in MB - 10MB"
            << " by default)]" << std::endl
130
	    << "  gv04" << std::endl
131
	    << "  se05_search" << std::endl
132
133
134
135
	    << "  se05_search_repeated" << std::endl
	    << "  bsh_se05_search[(heap size in MB - 10MB by default)]"
            << std::endl
	    << "  bsh_se05_search_repeated[(heap size in MB - 10MB"
136
            << " by default)]" << std::endl
137
138
	    << "  tau03_search" << std::endl
	    << "  tau03_opt_search" << std::endl;
139
140
141
142
143
144
145
146
  exit(2);
}

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

147
  bool debug_opt = false;
148
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
149
  bool degeneralize_maybe = false;
150
  bool fm_opt = false;
151
  bool fm_exprop_opt = false;
152
  bool fm_symb_merge_opt = true;
153
  bool file_opt = false;
154
  int output = 0;
155
  int formula_index = 0;
156
  std::string echeck_algo;
157
  enum { None, Couvreur, Couvreur2, MagicSearch, Se05Search,
158
	 Tau03Search, Tau03OptSearch, Gv04 } echeck = None;
159
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
160
  bool search_many = false;
161
162
  bool bit_state_hashing = false;
  int heap_size = 10*1024*1024;
163
  bool expect_counter_example = false;
164
  bool from_file = false;
165
  int reduc_aut = spot::Reduce_None;
166
  int redopt = spot::ltl::Reduce_None;
167
168
  bool display_reduce_form = false;
  bool display_rel_sim = false;
169
  bool display_parity_game = false;
170
  bool post_branching = false;
171
  bool fair_loop_approx = false;
172
  bool graph_run_opt = false;
173
  bool opt_reduce = false;
174
175
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
176

177
  for (;;)
178
    {
179
      if (argc < formula_index + 2)
180
	syntax(argv[0]);
181
182
183

      ++formula_index;

184
185
186
187
188
189
190
191
192
      if (!strcmp(argv[formula_index], "-a"))
	{
	  output = 2;
	}
      else if (!strcmp(argv[formula_index], "-A"))
	{
	  output = 4;
	}
      else if (!strcmp(argv[formula_index], "-d"))
193
194
195
	{
	  debug_opt = true;
	}
196
197
      else if (!strcmp(argv[formula_index], "-D"))
	{
198
199
200
201
202
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
203
	}
204
      else if (!strncmp(argv[formula_index], "-e", 2))
205
206
207
208
209
210
211
212
213
214
215
216
217
        {
          if (argv[formula_index][2] != 0)
            {
              char *p = strchr(argv[formula_index], '(');
              if (p && sscanf(p+1, "%d)", &heap_size) == 1)
                *p = '\0';
              echeck_algo = argv[formula_index] + 2;
            }
          else
            echeck_algo = "couvreur99";
          expect_counter_example = true;
          output = -1;
        }
218
      else if (!strncmp(argv[formula_index], "-E", 2))
219
220
221
222
223
224
225
226
227
228
229
230
231
        {
          if (argv[formula_index][2] != 0)
            {
              char *p = strchr(argv[formula_index], '(');
              if (p && sscanf(p+1, "%d)", &heap_size) == 1)
                *p = '\0';
              echeck_algo = argv[formula_index] + 2;
            }
          else
            echeck_algo = "couvreur99";
          expect_counter_example = false;
          output = -1;
        }
232
233
234
235
236
237
238
239
      else if (!strcmp(argv[formula_index], "-f"))
	{
	  fm_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
240
241
242
243
      else if (!strcmp(argv[formula_index], "-g"))
	{
	  graph_run_opt = true;
	}
244
245
246
247
248
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
	  fm_opt = true;
	}
249
250
      else if (!strcmp(argv[formula_index], "-m"))
	{
251
	  opt_reduce = true;
252
	}
martinez's avatar
martinez committed
253
254
      else if (!strcmp(argv[formula_index], "-N"))
	{
255
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
256
257
	  output = 8;
	}
258
259
260
261
262
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
	  fm_opt = true;
	}
263
264
      else if (!strcmp(argv[formula_index], "-r"))
	{
265
266
	  output = 1;
	}
267
268
269
270
271
272
      else if (!strcmp(argv[formula_index], "-r1"))
	{
	  redopt |= spot::ltl::Reduce_Basics;
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
273
	  redopt |= spot::ltl::Reduce_Eventuality_And_Universality;
274
275
276
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
277
	  redopt |= spot::ltl::Reduce_Syntactic_Implications;
278
279
280
281
282
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
	  redopt |= spot::ltl::Reduce_All;
	}
283
284
285
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
286
	}
martinez's avatar
martinez committed
287
288
289
290
291
292
293
294
295
      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"))
296
	{
martinez's avatar
martinez committed
297
	  reduc_aut |= spot::Reduce_quotient_Del_Sim;
298
	}
martinez's avatar
martinez committed
299
      else if (!strcmp(argv[formula_index], "-R2t"))
300
	{
martinez's avatar
martinez committed
301
	  reduc_aut |= spot::Reduce_transition_Del_Sim;
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
	}
      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;
	}
319
320
321
322
323
324
325
326
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
327
328
329
330
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
331
332
333
334
335
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
	  fm_opt = true;
	  // Parse -U's argument.
336
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
337
338
339
340
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
341
	      tok = strtok(0, ", \t;");
342
343
	    }
	}
344
345
346
347
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
348
349
350
351
352
      else if (!strcmp(argv[formula_index], "-x"))
	{
	  fm_opt = true;
	  fm_exprop_opt = true;
	}
353
354
355
356
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
357
358
359
360
361
      else if (!strcmp(argv[formula_index], "-y"))
	{
	  fm_opt = true;
	  fm_symb_merge_opt = false;
	}
362
363
364
365
      else
	{
	  break;
	}
366
367
    }

368
  if (echeck_algo != "")
369
    {
370
371
372
373
374
375
376
377
378
379
380
      if (echeck_algo == "couvreur99")
	{
	  echeck = Couvreur;
	}
      else if (echeck_algo == "couvreur99_shy")
	{
	  echeck = Couvreur2;
	}
      else if (echeck_algo == "magic_search")
	{
	  echeck = MagicSearch;
381
	  degeneralize_maybe = true;
382
383
384
385
	}
      else if (echeck_algo == "magic_search_repeated")
	{
	  echeck = MagicSearch;
386
	  degeneralize_maybe = true;
387
	  search_many = true;
388
	}
389
390
391
      else if (echeck_algo == "bsh_magic_search")
	{
	  echeck = MagicSearch;
392
	  degeneralize_maybe = true;
393
394
395
396
397
          bit_state_hashing = true;
	}
      else if (echeck_algo == "bsh_magic_search_repeated")
	{
	  echeck = MagicSearch;
398
	  degeneralize_maybe = true;
399
          bit_state_hashing = true;
400
	  search_many = true;
401
	}
402
403
      else if (echeck_algo == "se05_search")
	{
404
	  echeck = Se05Search;
405
	  degeneralize_maybe = true;
406
407
408
	}
      else if (echeck_algo == "se05_search_repeated")
	{
409
	  echeck = Se05Search;
410
	  degeneralize_maybe = true;
411
	  search_many = true;
412
413
414
415
	}
      else if (echeck_algo == "bsh_se05_search")
	{
	  echeck = Se05Search;
416
	  degeneralize_maybe = true;
417
418
419
420
421
          bit_state_hashing = true;
	}
      else if (echeck_algo == "bsh_se05_search_repeated")
	{
	  echeck = Se05Search;
422
	  degeneralize_maybe = true;
423
          bit_state_hashing = true;
424
425
426
427
428
	  search_many = true;
	}
      else if (echeck_algo == "tau03_search")
	{
	  echeck = Tau03Search;
429
	}
430
431
432
433
      else if (echeck_algo == "tau03_opt_search")
	{
	  echeck = Tau03OptSearch;
	}
434
435
436
437
438
      else if (echeck_algo == "gv04")
	{
	  echeck = Gv04;
	  degeneralize_maybe = true;
	}
439
440
441
442
443
      else
	{
	  std::cerr << "unknown emptiness-check: " << echeck_algo << std::endl;
	  syntax(argv[0]);
	}
444
445
    }

446
447
448
449
450
451
  if (graph_run_opt && (echeck_algo == "" || !expect_counter_example))
    {
      std::cerr << argv[0] << ": error: -g requires -e." << std::endl;
      exit(1);
    }

452
453
454
455
  std::string input;

  if (file_opt)
    {
456
      if (strcmp(argv[formula_index], "-"))
457
	{
458
	  std::ifstream fin(argv[formula_index]);
459
	  if (!fin)
460
461
462
463
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
464

465
	  if (!std::getline(fin, input, '\0'))
466
467
468
469
470
471
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
472
	{
473
	  std::getline(std::cin, input, '\0');
474
475
476
477
478
479
480
	}
    }
  else
    {
      input = argv[formula_index];
    }

481
  spot::bdd_dict* dict = new spot::bdd_dict();
482
483
484
485
486
487
488
489
490

  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)
491
    {
492
493
494
495
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

496
497
498
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
499
500
	  spot::tgba_explicit* e;
	  to_free = a = e = spot::tgba_parse(input, pel, dict, env, debug_opt);
501
	  if (spot::format_tgba_parse_errors(std::cerr, pel))
502
503
504
505
506
	    {
	      delete to_free;
	      delete dict;
	      return 2;
	    }
507
	  e->merge_transitions();
508
	}
509
      else
510
	{
511
	  if (redopt != spot::ltl::Reduce_None)
512
	    {
513
514
515
	      spot::ltl::formula* t = spot::ltl::reduce(f, redopt);
	      spot::ltl::destroy(f);
	      f = t;
516
517
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
518
	    }
519

520
	  if (fm_opt)
521
	    to_free = a = spot::ltl_to_tgba_fm(f, dict, fm_exprop_opt,
522
					       fm_symb_merge_opt,
523
					       post_branching,
524
					       fair_loop_approx, unobservables);
525
526
527
	  else
	    to_free = a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	}
528

529
      spot::tgba_tba_proxy* degeneralized = 0;
530

531
532
533
534
535
      if (degeneralize_maybe
	  && degeneralize_opt == NoDegen
	  && a->number_of_acceptance_conditions() > 1)
	degeneralize_opt = DegenTBA;
      if (degeneralize_opt == DegenTBA)
536
	a = degeneralized = new spot::tgba_tba_proxy(a);
537
538
      else if (degeneralize_opt == DegenSBA)
	a = degeneralized = new spot::tgba_sba_proxy(a);
539

540
541
542
543
      spot::tgba_reduc* aut_red = 0;
      if (reduc_aut != spot::Reduce_None)
	{
	  a = aut_red = new spot::tgba_reduc(a);
544
545
546
547

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

martinez's avatar
martinez committed
548
549
550
551
	  if (reduc_aut & (spot::Reduce_quotient_Dir_Sim |
			   spot::Reduce_transition_Dir_Sim |
			   spot::Reduce_quotient_Del_Sim |
			   spot::Reduce_transition_Del_Sim))
552
	    {
martinez's avatar
martinez committed
553
554
555
556
557
	      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))
558
559
560
561
		rel_dir =
		  spot::get_direct_relation_simulation(a,
						       std::cout,
						       display_parity_game);
martinez's avatar
martinez committed
562
563
	      else if (reduc_aut & (spot::Reduce_quotient_Del_Sim |
				    spot::Reduce_transition_Del_Sim))
564
565
566
567
		rel_del =
		  spot::get_delayed_relation_simulation(a,
							std::cout,
							display_parity_game);
568
569

	      if (display_rel_sim)
martinez's avatar
martinez committed
570
571
572
573
574
575
		{
		  if (rel_dir)
		    aut_red->display_rel_sim(rel_dir, std::cout);
		  if (rel_del)
		    aut_red->display_rel_sim(rel_del, std::cout);
		}
576

martinez's avatar
martinez committed
577
578
579
580
581
582
583
584
585
586
587
588
589
	      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);
590
591
592
	    }
	}

593
594
595
596
597
598
599
600
601
602
603
604
605
      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;
	}

606
607
      switch (output)
	{
608
609
610
	case -1:
	  /* No output.  */
	  break;
611
612
613
614
	case 0:
	  spot::dotty_reachable(std::cout, a);
	  break;
	case 1:
615
616
617
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
618
619
	  break;
	case 2:
620
621
622
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->
623
				get_core_data().acceptance_conditions);
624
625
	  break;
	case 3:
626
627
628
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
629
630
	  break;
	case 4:
631
632
633
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->
634
				get_core_data().acceptance_conditions);
635
	  break;
636
	case 5:
637
	  a->get_dict()->dump(std::cout);
638
	  break;
639
640
641
	case 6:
	  spot::lbtt_reachable(std::cout, a);
	  break;
642
	case 8:
643
644
645
646
647
648
649
	  {
	    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;
	  }
650
651
652
	default:
	  assert(!"unknown output option");
	}
653

654
      spot::emptiness_check* ec = 0;
655
656
657
658
      switch (echeck)
	{
	case None:
	  break;
martinez's avatar
martinez committed
659

660
	case Couvreur:
661
662
663
	  ec = new spot::couvreur99_check(a);
	  break;

664
	case Couvreur2:
665
	  ec = new spot::couvreur99_check_shy(a);
666
	  break;
martinez's avatar
martinez committed
667

668
669
        case MagicSearch:
          if (bit_state_hashing)
670
            ec = spot::bit_state_hashing_magic_search(a, heap_size);
671
          else
672
            ec = spot::explicit_magic_search(a);
673
          break;
674

675
676
        case Se05Search:
          if (bit_state_hashing)
677
            ec = spot::bit_state_hashing_se05_search(a, heap_size);
678
          else
679
            ec = spot::explicit_se05_search(a);
680
          break;
681
682
683
684
685
686
687
688
689
690
691
692

	case Tau03Search:
          if (a->number_of_acceptance_conditions() == 0)
            {
              std::cout << "To apply tau03_search, the automaton must have at "
                        << "least on accepting condition. Try with another "
                        << "algorithm." << std::endl;
            }
          else
            {
              ec = spot::explicit_tau03_search(a);
            }
693
694

	case Tau03OptSearch:
695
          ec = spot::explicit_tau03_opt_search(a);
696
	  break;
697
698
699
	case Gv04:
	  ec = spot::explicit_gv04_check(a);
	  break;
700
	}
martinez's avatar
martinez committed
701

702
703
704
705
706
      if (ec)
	{
	  do
	    {
	      spot::emptiness_check_result* res = ec->check();
707
708
	      if (!graph_run_opt)
		ec->print_stats(std::cout);
709
710
	      if (expect_counter_example != !!res &&
                      (!bit_state_hashing || !expect_counter_example))
711
712
713
714
		exit_code = 1;

	      if (!res)
		{
715
716
717
718
719
720
721
722
723
724
725
                  std::cout << "no accepting run found";
                  if (bit_state_hashing && expect_counter_example)
                    {
                      std::cout << " even if expected" << std::endl;
                      std::cout << "this is maybe due to the use of the bit "
                                << "state hashing technic" << std::endl;
                      std::cout << "you can try to increase the heap size "
                                << "or use an explicit storage" << std::endl;
                    }
                  std::cout << std::endl;
                  break;
726
727
728
729
730
731
732
		}
	      else
		{

		  spot::tgba_run* run = res->accepting_run();
		  if (!run)
		    {
733
		      std::cout << "an accepting run exists" << std::endl;
734
735
736
		    }
		  else
		    {
737
		      if (opt_reduce)
738
			{
739
740
			  spot::tgba_run* redrun =
			    spot::reduce_run(res->automaton(), run);
741
			  delete run;
742
			  run = redrun;
743
			}
744
745
746
		      if (graph_run_opt)
			{
			  spot::tgba_run_dotty_decorator deco(run);
747
			  spot::dotty_reachable(std::cout, a, &deco);
748
749
750
			}
		      else
			{
751
752
			  spot::print_tgba_run(std::cout, a, run);
			  if (!spot::replay_tgba_run(std::cout, a, run, true))
753
754
			    exit_code = 1;
			}
755
756
757
758
759
		      delete run;
		    }
		}
	      delete res;
	    }
760
	  while (search_many);
761
	  delete ec;
martinez's avatar
martinez committed
762
763
	}

764
765
      if (f)
        spot::ltl::destroy(f);
766
767
768
      delete expl;
      delete degeneralized;
      delete aut_red;
769
      delete to_free;
770
771
772
773
774
775
776
777
778
779
    }
  else
    {
      exit_code = 1;
    }

  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);
780
  delete dict;
781
782
  return exit_code;
}