ltl2tgba.cc 37.4 KB
Newer Older
1
2
3
// -*- coding: utf-8 -*-
// Copyright (C) 2007, 2008, 2009, 2010, 2011, 2012 Laboratoire de Recherche et
// Développement de l'Epita (LRDE).
Guillaume Sadegh's avatar
Guillaume Sadegh committed
4
// Copyright (C) 2003, 2004, 2005, 2006, 2007 Laboratoire d'Informatique de
5
6
// Paris 6 (LIP6), département Systèmes Répartis
// Coopératifs (SRC), Université Pierre et Marie Curie.
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
//
// 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.

25
#include <iostream>
26
#include <iomanip>
27
#include <cassert>
28
29
#include <fstream>
#include <string>
30
#include <cstdlib>
31
#include "ltlvisit/tostring.hh"
32
#include "ltlvisit/apcollect.hh"
33
#include "ltlast/allnodes.hh"
34
#include "ltlparse/public.hh"
35
#include "tgbaalgos/ltl2tgba_lacim.hh"
36
#include "tgbaalgos/ltl2tgba_fm.hh"
37
#include "tgbaalgos/ltl2taa.hh"
38
#include "tgba/bddprint.hh"
39
#include "tgbaalgos/save.hh"
40
#include "tgbaalgos/dotty.hh"
41
#include "tgbaalgos/lbtt.hh"
42
#include "tgba/tgbatba.hh"
43
#include "tgba/tgbasgba.hh"
44
#include "tgba/tgbaproduct.hh"
45
#include "tgba/futurecondcol.hh"
46
#include "tgbaalgos/reducerun.hh"
47
#include "tgbaparse/public.hh"
48
#include "neverparse/public.hh"
49
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
50
#include "tgbaalgos/minimize.hh"
51
#include "tgbaalgos/neverclaim.hh"
52
#include "tgbaalgos/replayrun.hh"
53
#include "tgbaalgos/rundotdec.hh"
54
#include "tgbaalgos/sccfilter.hh"
55
#include "tgbaalgos/safety.hh"
56
#include "tgbaalgos/eltl2tgba_lacim.hh"
57
#include "tgbaalgos/gtec/gtec.hh"
58
#include "eltlparse/public.hh"
59
#include "misc/timer.hh"
60
#include "tgbaalgos/stats.hh"
61
#include "tgbaalgos/scc.hh"
62
#include "tgbaalgos/emptiness_stats.hh"
63
64
#include "tgbaalgos/scc.hh"
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
65
#include "tgbaalgos/simulation.hh"
66

67
68
69
70
71
72
73
74
75
76
77
78
std::string
ltl_defs()
{
  std::string s = "\
X=(0 1 true	   \
   1 2 $0	   \
   accept 2)	   \
U=(0 0 $0	   \
   0 1 $1	   \
   accept 1)	   \
G=(0 0 $0)	   \
F=U(true, $0)	   \
79
80
81
W=G($0)|U($0, $1)  \
R=!U(!$0, !$1)     \
M=F($0)&R($0, $1)";
82
83
84
  return s;
}

85
86
87
void
syntax(char* prog)
{
88
89
90
91
92
  // 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;

93
  std::cerr << "Usage: "<< prog << " [-f|-l|-le|-taa] [OPTIONS...] formula"
94
	    << std::endl
95
            << "       "<< prog << " [-f|-l|-le|-taa] -F [OPTIONS...] file"
96
	    << std::endl
97
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
98
	    << std::endl
99

100
101
            << "Translate an LTL formula into an automaton, or read the "
	    << "automaton from a file." << std::endl
102
103
104
105
	    << "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
106
	    << std::endl
107
108
109

            << "Input options:" << std::endl
            << "  -F    read the formula from a file, not from the command line"
110
	    << std::endl
111
	    << "  -X    do not compute an automaton, read it from a file"
112
	    << std::endl
113
114
	    << "  -XN   do not compute an automaton, read it from a"
	    << " neverclaim file" << std::endl
115
116
117
118
	    << "  -Pfile  multiply the formula automaton with the TGBA read"
	    << " from `file'\n"
	    << "  -KPfile multiply the formula automaton with the Kripke"
	    << " structure from `file'\n"
119
120
121
	    << std::endl

	    << "Translation algorithm:" << std::endl
122
            << "  -f    use Couvreur's FM algorithm for LTL"
123
	    << "(default)"
124
	    << std::endl
125
            << "  -l    use Couvreur's LaCIM algorithm for LTL "
126
	    << std::endl
127
128
129
	    << "  -le   use Couvreur's LaCIM algorithm for ELTL"
	    << std::endl
            << "  -taa  use Tauriainen's TAA-based algorithm for LTL"
martinez's avatar
martinez committed
130
	    << std::endl
131
132
133
	    << std::endl

	    << "Options for Couvreur's FM algorithm (-f):" << std::endl
134
135
	    << "  -fr   reduce formula at each step of FM" << std::endl
	    << "          as specified with the -r{1..7} options" << std::endl
136
137
138
139
140
            << "  -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)"
141
	    << std::endl
142
143
144
145
            << "  -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
146
	    << std::endl
147

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

	    << "Options for Tauriainen's TAA-based algorithm (-taa):"
164
	    << std::endl
165
	    << "  -c    enable language containment checks (implies -taa)"
166
	    << std::endl
167
	    << std::endl
168
169

	    << "Formula simplification (before translation):"
170
	    << std::endl
martinez's avatar
martinez committed
171
172
	    << "  -r1   reduce formula using basic rewriting" << std::endl
	    << "  -r2   reduce formula using class of eventuality and "
173
	    << "universality" << std::endl
martinez's avatar
martinez committed
174
	    << "  -r3   reduce formula using implication between "
175
	    << "sub-formulae" << std::endl
176
177
178
	    << "  -r4   reduce formula using all above rules" << std::endl
	    << "  -r5   reduce formula using tau03" << std::endl
	    << "  -r6   reduce formula using tau03+" << std::endl
179
	    << "  -r7   reduce formula using tau03+ and -r4" << std::endl
180
181
182
183
184
185
186
187
188
189
190
191
192
	    << "  -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
193
	    << "  -R3   use SCC to reduce the automata" << std::endl
194
	    << "  -R3f  clean more acceptance conditions than -R3" << std::endl
195
196
197
	    << "          "
	    << "(prefer -R3 over -R3f if you degeneralize with -D, -DS, or -N)"
	    << std::endl
198
199
200
	    << "  -RDS  minimize the automaton with direct simulation"
	    << std::endl
            << "  -Rm   attempt to WDBA-minimize the automata" << std::endl
201
	    << std::endl
202

203
            << "Automaton conversion:" << std::endl
204
205
            << "  -M    convert into a deterministic minimal monitor "
	    << "(implies -R3 or R3b)" << std::endl
206
207
208
209
	    << "  -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
210
211
	    << std::endl

212
213
214
215
	    << "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
216
	    << std::endl
217
218
219
220
	    << "  -C    compute an accepting run (Counterexample) if it exists"
	    << std::endl
	    << "  -CR   compute and replay an accepting run (implies -C)"
	    << std::endl
221
	    << "  -g    graph the accepting run on the automaton (requires -e)"
222
	    << std::endl
223
224
225
	    << "  -G    graph the accepting run seen as an automaton "
	    << " (requires -e)" << std::endl
	    << "  -m    try to reduce accepting runs, in a second pass"
226
227
	    << std::endl
	    << "Where ALGO should be one of:" << std::endl
228
229
230
231
232
	    << "  Cou99(OPTIONS) (the default)" << std::endl
	    << "  CVWY90(OPTIONS)" << std::endl
	    << "  GV04(OPTIONS)" << std::endl
	    << "  SE05(OPTIONS)" << std::endl
	    << "  Tau03(OPTIONS)" << std::endl
233
234
235
236
237
238
239
240
241
242
243
244
245
	    << "  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
246
247
248
	    << "  -k    display statistics on the automaton (size and SCCs)"
	    << std::endl
	    << "  -ks   display statistics on the automaton (size only)"
249
	    << std::endl
250
251
252
	    << "  -kt   display statistics on the automaton (size + "
	    << "subtransitions)"
	    << std::endl
253
254
255
	    << "  -K    dump the graph of SCCs in dot format" << std::endl
	    << "  -KV   verbosely dump the graph of SCCs in dot format"
	    << std::endl
256
	    << "  -N    output the never clain for Spin (implies -DS)"
257
258
	    << std::endl
	    << "  -NN   output the never clain for Spin, with commented states"
259
	    << " (implies -DS)" << std::endl
260
261
	    << "  -O    tell if a formula represents a safety, guarantee, "
	    << "or obligation property"
262
	    << std::endl
263
264
265
266
267
268
269
270
271
272
273
	    << "  -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
            << "  -T    time the different phases of the translation"
	    << std::endl
	    << "  -v    display the BDD variables used by the automaton"
	    << std::endl;
274
275
276
277
278
279
280
281
  exit(2);
}

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

282
  bool debug_opt = false;
283
  bool paper_opt = false;
284
  enum { NoDegen, DegenTBA, DegenSBA } degeneralize_opt = NoDegen;
285
  enum { TransitionLabeled, StateLabeled } labeling_opt = TransitionLabeled;
286
  enum { TransFM, TransLaCIM, TransLaCIM_ELTL, TransLaCIM_ELTL_ops, TransTAA }
287
    translation = TransFM;
288
  bool fm_red = false;
289
  bool fm_exprop_opt = false;
290
  bool fm_symb_merge_opt = true;
291
  bool file_opt = false;
292
  int output = 0;
293
  int formula_index = 0;
294
295
  const char* echeck_algo = 0;
  spot::emptiness_check_instantiator* echeck_inst = 0;
296
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
297
  bool expect_counter_example = false;
298
299
  bool accepting_run = false;
  bool accepting_run_replay = false;
300
  bool from_file = false;
301
  bool read_neverclaim = false;
302
  bool scc_filter = false;
303
304
  bool simpltl = false;
  spot::ltl::ltl_simplifier_options redopt(false, false, false, false, false);
305
  bool scc_filter_all = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
306
  bool symbolic_scc_pruning = false;
307
  bool display_reduce_form = false;
308
  bool post_branching = false;
309
  bool fair_loop_approx = false;
310
  bool graph_run_opt = false;
311
  bool graph_run_tgba_opt = false;
312
  bool opt_reduce = false;
Felix Abecassis's avatar
Felix Abecassis committed
313
  bool opt_minimize = false;
314
  bool opt_monitor = false;
315
  bool containment = false;
316
  bool show_fc = false;
317
  bool spin_comments = false;
318
319
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
  spot::ltl::atomic_prop_set* unobservables = 0;
320
  spot::tgba* system = 0;
321
322
  const spot::tgba* product = 0;
  const spot::tgba* product_to_free = 0;
323
  spot::bdd_dict* dict = new spot::bdd_dict();
324
325
  spot::timer_map tm;
  bool use_timer = false;
326
  bool assume_sba = false;
Thomas Badie's avatar
Thomas Badie committed
327
328
329
  bool reduction_dir_sim = false;
  spot::tgba* temp_dir_sim = 0;

330

331
  for (;;)
332
    {
333
      if (argc < formula_index + 2)
334
	syntax(argv[0]);
335
336
337

      ++formula_index;

338
339
340
341
342
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-a"))
343
344
345
	{
	  output = 2;
	}
346
      else if (!strcmp(argv[formula_index], "-A"))
347
	{
348
	  output = 4;
349
	}
350
      else if (!strcmp(argv[formula_index], "-b"))
351
	{
352
	  output = 7;
353
	}
354
355
356
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
357
	  translation = TransTAA;
358
	}
359
360
361
362
363
364
365
366
367
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
368
      else if (!strcmp(argv[formula_index], "-d"))
369
370
371
	{
	  debug_opt = true;
	}
372
373
      else if (!strcmp(argv[formula_index], "-D"))
	{
374
375
376
377
378
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
379
	}
380
      else if (!strncmp(argv[formula_index], "-e", 2))
381
        {
382
383
384
385
386
387
388
389
390
391
392
393
394
	  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);
	    }
395
396
397
          expect_counter_example = true;
          output = -1;
        }
398
      else if (!strncmp(argv[formula_index], "-E", 2))
399
        {
400
401
402
403
404
405
406
407
408
409
410
411
412
	  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);
	    }
413
414
415
          expect_counter_example = false;
          output = -1;
        }
416
417
      else if (!strcmp(argv[formula_index], "-f"))
	{
418
	  translation = TransFM;
419
	}
420
      else if (!strcmp(argv[formula_index], "-fr"))
421
	{
422
	  fm_red = true;
423
	  translation = TransFM;
424
	}
425
426
427
428
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
429
430
431
432
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
433
434
      else if (!strcmp(argv[formula_index], "-g"))
	{
435
	  accepting_run = true;
436
437
	  graph_run_opt = true;
	}
438
439
      else if (!strcmp(argv[formula_index], "-G"))
	{
440
	  accepting_run = true;
441
442
	  graph_run_tgba_opt = true;
	}
443
444
445
446
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
447
448
449
450
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
451
452
453
454
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
455
456
457
458
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
459
460
461
462
463
464
465
466
467
468
469
470
      else if (!strncmp(argv[formula_index], "-KP", 3))
	{
	  tm.start("reading -KP's argument");

	  spot::kripke_parse_error_list pel;
	  system = spot::kripke_parse(argv[formula_index] + 3,
				      pel, dict, env, debug_opt);
	  if (spot::format_kripke_parse_errors(std::cerr,
					       argv[formula_index] + 2, pel))
	    return 2;
	  tm.stop("reading -KP's argument");
	}
471
472
473
474
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
475
476
477
478
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
479
480
481
482
483
484
485
486
487
488
      else if (!strcmp(argv[formula_index], "-le"))
	{
	  /* -lo is documented to imply -le, so do not overwrite it. */
	  if (translation != TransLaCIM_ELTL_ops)
	    translation = TransLaCIM_ELTL;
	}
      else if (!strcmp(argv[formula_index], "-lo"))
	{
	  translation = TransLaCIM_ELTL_ops;
	}
489
490
491
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
492
	  translation = TransFM;
493
	}
494
495
496
497
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
498
499
      else if (!strcmp(argv[formula_index], "-m"))
	{
500
	  opt_reduce = true;
501
	}
martinez's avatar
martinez committed
502
503
      else if (!strcmp(argv[formula_index], "-N"))
	{
504
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
505
506
	  output = 8;
	}
507
508
509
510
511
512
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
513
514
      else if (!strcmp(argv[formula_index], "-O"))
	{
515
	  output = 14;
516
          opt_minimize = true;
517
	}
518
519
520
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
521
	  translation = TransFM;
522
	}
523
524
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
525
526
	  tm.start("reading -P's argument");

527
	  spot::tgba_parse_error_list pel;
528
529
530
	  spot::tgba_explicit_string* s;
	  s = spot::tgba_parse(argv[formula_index] + 2,
			       pel, dict, env, env, debug_opt);
531
532
	  if (spot::format_tgba_parse_errors(std::cerr,
					     argv[formula_index] + 2, pel))
533
	    return 2;
534
	  s->merge_transitions();
535
	  tm.stop("reading -P's argument");
536
	  system = s;
537
	}
538
539
      else if (!strcmp(argv[formula_index], "-r"))
	{
540
541
	  output = 1;
	}
542
543
      else if (!strcmp(argv[formula_index], "-r1"))
	{
544
545
	  simpltl = true;
	  redopt.reduce_basics = true;
546
547
548
	}
      else if (!strcmp(argv[formula_index], "-r2"))
	{
549
550
	  simpltl = true;
	  redopt.event_univ = true;
551
552
553
	}
      else if (!strcmp(argv[formula_index], "-r3"))
	{
554
555
	  simpltl = true;
	  redopt.synt_impl = true;
556
557
558
	}
      else if (!strcmp(argv[formula_index], "-r4"))
	{
559
560
561
562
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
563
	}
564
565
      else if (!strcmp(argv[formula_index], "-r5"))
	{
566
567
	  simpltl = true;
	  redopt.containment_checks = true;
568
569
570
	}
      else if (!strcmp(argv[formula_index], "-r6"))
	{
571
572
573
	  simpltl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
574
575
576
	}
      else if (!strcmp(argv[formula_index], "-r7"))
	{
577
578
579
580
581
582
	  simpltl = true;
	  redopt.reduce_basics = true;
	  redopt.event_univ = true;
	  redopt.synt_impl = true;
	  redopt.containment_checks = true;
	  redopt.containment_checks_stronger = true;
583
	}
584
585
586
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
587
	}
588
589
590
591
      else if (!strcmp(argv[formula_index], "-R1q")
	       || !strcmp(argv[formula_index], "-R1t")
	       || !strcmp(argv[formula_index], "-R2q")
	       || !strcmp(argv[formula_index], "-R2t"))
592
	{
593
	  // For backward compatibility, make all these options
594
	  // equal to -RDS.
595
	  reduction_dir_sim = true;
596
597
598
	}
      else if (!strcmp(argv[formula_index], "-R3"))
	{
599
	  scc_filter = true;
600
	}
601
602
      else if (!strcmp(argv[formula_index], "-R3f"))
	{
603
	  scc_filter = true;
604
605
	  scc_filter_all = true;
	}
606
607
      else if (!strcmp(argv[formula_index], "-R3b"))
	{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
608
	  symbolic_scc_pruning = true;
609
	}
610
611
612
613
      else if (!strcmp(argv[formula_index], "-rd"))
	{
	  display_reduce_form = true;
	}
614
      else if (!strcmp(argv[formula_index], "-RDS"))
Felix Abecassis's avatar
Felix Abecassis committed
615
        {
616
          reduction_dir_sim = true;
Felix Abecassis's avatar
Felix Abecassis committed
617
        }
618
      else if (!strcmp(argv[formula_index], "-Rm"))
619
        {
620
          opt_minimize = true;
621
        }
622
623
624
625
      else if (!strcmp(argv[formula_index], "-M"))
        {
          opt_monitor = true;
        }
626
627
628
629
630
631
632
633
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
634
635
636
637
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
638
639
640
641
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  use_timer = true;
	}
642
643
644
645
      else if (!strcmp(argv[formula_index], "-taa"))
	{
	  translation = TransTAA;
	}
646
647
648
      else if (!strncmp(argv[formula_index], "-U", 2))
	{
	  unobservables = new spot::ltl::atomic_prop_set;
649
	  translation = TransFM;
650
	  // Parse -U's argument.
651
	  const char* tok = strtok(argv[formula_index] + 2, ", \t;");
652
653
654
655
	  while (tok)
	    {
	      unobservables->insert
		(static_cast<spot::ltl::atomic_prop*>(env.require(tok)));
656
	      tok = strtok(0, ", \t;");
657
658
	    }
	}
659
660
661
662
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
663
664
      else if (!strcmp(argv[formula_index], "-x"))
	{
665
	  translation = TransFM;
666
667
	  fm_exprop_opt = true;
	}
668
669
670
671
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
672
673
674
675
676
      else if (!strcmp(argv[formula_index], "-XN"))
	{
	  from_file = true;
	  read_neverclaim = true;
	}
677
678
      else if (!strcmp(argv[formula_index], "-y"))
	{
679
	  translation = TransFM;
680
681
	  fm_symb_merge_opt = false;
	}
682
683
684
685
      else
	{
	  break;
	}
686
687
    }

688
  if ((graph_run_opt || graph_run_tgba_opt)
689
      && (!echeck_inst || !expect_counter_example))
690
    {
691
      std::cerr << argv[0] << ": error: -g and -G require -e." << std::endl;
692
693
694
      exit(1);
    }

695
696
697
698
  std::string input;

  if (file_opt)
    {
699
      tm.start("reading formula");
700
      if (strcmp(argv[formula_index], "-"))
701
	{
702
	  std::ifstream fin(argv[formula_index]);
703
	  if (!fin)
704
705
706
707
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
708

709
	  if (!std::getline(fin, input, '\0'))
710
711
712
713
714
715
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
716
	{
717
	  std::getline(std::cin, input, '\0');
718
	}
719
      tm.stop("reading formula");
720
721
722
723
724
725
    }
  else
    {
      input = argv[formula_index];
    }

726
  spot::ltl::formula* f = 0;
727
  if (!from_file) // Reading a formula, not reading an automaton from a file.
728
    {
729
730
731
732
733
734
735
736
737
738
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
      switch (translation)
	{
	case TransFM:
	case TransLaCIM:
	case TransTAA:
	  {
	    spot::ltl::parse_error_list pel;
	    tm.start("parsing formula");
	    f = spot::ltl::parse(input, pel, env, debug_opt);
	    tm.stop("parsing formula");
	    exit_code = spot::ltl::format_parse_errors(std::cerr, input, pel);
	  }
	  break;
	case TransLaCIM_ELTL:
	  {
	    spot::eltl::parse_error_list p;
	    tm.start("parsing formula");
	    f = spot::eltl::parse_string(input, p, env, false);
	    tm.stop("parsing formula");
	    exit_code = spot::eltl::format_parse_errors(std::cerr, p);
	  }
	  break;
	case TransLaCIM_ELTL_ops:
	  {
	    // Call the LTL parser first to handle operators such as
	    // [] or <> and rewrite the output as a string with G or F.
	    // Then prepend definitions of usual LTL operators, and parse
	    // the result again as an ELTL formula.
	    spot::ltl::parse_error_list pel;
	    tm.start("parsing formula");
	    f = spot::ltl::parse(input, pel, env, debug_opt);
	    input = ltl_defs();
	    input += "%";
	    input += spot::ltl::to_string(f, true);
	    f->destroy();
	    spot::eltl::parse_error_list p;
	    f = spot::eltl::parse_string(input, p, env, debug_opt);
	    tm.stop("parsing formula");
	    exit_code = spot::eltl::format_parse_errors(std::cerr, p);
	  }
	  break;
770
	}
771
    }
772

773
  if (f || from_file)
774
    {
775
776
777
      const spot::tgba_bdd_concrete* concrete = 0;
      const spot::tgba* to_free = 0;
      const spot::tgba* a = 0;
778

779
780
      if (from_file)
	{
781
	  spot::tgba_explicit_string* e;
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
	  if (!read_neverclaim)
	    {
	      spot::tgba_parse_error_list pel;
	      tm.start("parsing automaton");
	      to_free = a = e = spot::tgba_parse(input, pel, dict,
						 env, env, debug_opt);
	      tm.stop("parsing automaton");
	      if (spot::format_tgba_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
		}
	    }
	  else
797
	    {
798
	      spot::neverclaim_parse_error_list pel;
799
	      tm.start("parsing neverclaim");
800
801
	      to_free = a = e = spot::neverclaim_parse(input, pel, dict,
						       env, debug_opt);
802
	      tm.stop("parsing neverclaim");
803
804
805
806
807
	      if (spot::format_neverclaim_parse_errors(std::cerr, input, pel))
		{
		  delete to_free;
		  delete dict;
		  return 2;
808
		}
809
	    }
810
	  e->merge_transitions();
811
	}
812
      else
813
	{
814
815
	  spot::ltl::ltl_simplifier* simp = 0;
	  if (simpltl)
816
	    simp = new spot::ltl::ltl_simplifier(redopt, dict);
817
818

	  if (simp)
819
	    {
820
	      tm.start("reducing formula");
821
	      spot::ltl::formula* t = simp->simplify(f);
822
	      f->destroy();
823
	      tm.stop("reducing formula");
824
	      f = t;
825
826
	      if (display_reduce_form)
		std::cout << spot::ltl::to_string(f) << std::endl;
827
	    }
828

829
830
831
832
833
834
835
836
837
	  if (f->is_psl_formula()
	      && !f->is_ltl_formula()
	      && translation != TransFM)
	    {
	      std::cerr << "Only the FM algorithm can translate PSL formulae;"
			<< " I'm using it for this formula." << std::endl;
	      translation = TransFM;
	    }

838
	  tm.start("translating formula");
839
840
841
842
843
844
845
846
	  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,
847
				       fm_red ? simp : 0);
848
849
850
851
852
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
853
854
855
856
857
	      a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	      break;
	    case TransLaCIM_ELTL:
	    case TransLaCIM_ELTL_ops:
	      a = concrete = spot::eltl_to_tgba_lacim(f, dict);
858
859
	      break;
	    }
860
	  tm.stop("translating formula");
861
	  to_free = a;
862
863

	  delete simp;
864
	}
865

866
      if (opt_monitor && !scc_filter)
867
	{
868
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
869
870
	    symbolic_scc_pruning = true;
	  else
871
	    scc_filter = true;
872
873
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
874
875
      if (symbolic_scc_pruning)
        {
876
877
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
878
879
880
881
882
883
884
885
886
887
888
889
890
	  if (!bc)
	    {
	      std::cerr << ("Error: Automaton is not symbolic: cannot "
			    "prune SCCs symbolically.\n"
			    "       Try -R3 instead of -R3b, or use "
			    "another translation.")
			<< std::endl;
	      exit(2);
	    }
	  else
	    {
	      tm.start("reducing A_f w/ symbolic SCC pruning");
	      if (bc)
891
892
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
893
894
895
896
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

897
898
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
899
      const spot::tgba* aut_scc = 0;
900
      if (scc_filter)
901
902
	{
	  tm.start("reducing A_f w/ SCC");
903
	  a = aut_scc = spot::scc_filter(a, scc_filter_all);
904
905
906
	  tm.stop("reducing A_f w/ SCC");
	}

907
908
      const spot::tgba_tba_proxy* degeneralized = 0;
      const spot::tgba_sgba_proxy* state_labeled = 0;
909

910
      const spot::tgba* minimized = 0;
Felix Abecassis's avatar
Felix Abecassis committed
911
      if (opt_minimize)
912
	{
913
914
915
916
917
	  tm.start("obligation minimization");
	  minimized = minimize_obligation(a, f);
	  tm.stop("obligation minimization");

	  if (minimized == 0)
918
	    {
919
	      // if (!f)
920
921
922
923
924
925
		{
		  std::cerr << "Error: Without a formula I cannot make "
			    << "sure that the automaton built with -Rm\n"
			    << "       is correct." << std::endl;
		  exit(2);
		}
926
	    }
927
928
929
930
931
932
933
	  else if (minimized == a)
	    {
	      minimized = 0;
	    }
	  else
	    {
	      a = minimized;
Thomas Badie's avatar
Thomas Badie committed
934
935
              // When the minimization succeed, simulation is useless.
              reduction_dir_sim = false;
936
	      assume_sba = true;
937
	    }
938
	}
Felix Abecassis's avatar
Felix Abecassis committed
939

Thomas Badie's avatar
Thomas Badie committed
940
941
942
943
944
945
946
947
948
949

      if (reduction_dir_sim)
        {
          tm.start("Reduction w/ direct simulation");
          temp_dir_sim = spot::simulation(a);
          a = temp_dir_sim;
          tm.stop("Reduction w/ direct simulation");
        }


950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
      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)
	{
	  degeneralize_opt = DegenTBA;
	  assume_sba = false;
	}

      if (!assume_sba && !opt_monitor)
	{
	  if (degeneralize_opt == DegenTBA)
	    {
	      a = degeneralized = new spot::tgba_tba_proxy(a);
	    }
	  else if (degeneralize_opt == DegenSBA)
	    {
	      a = degeneralized = new spot::tgba_sba_proxy(a);
	      assume_sba = true;
	    }
	  else if (labeling_opt == StateLabeled)
	    {
	      a = state_labeled = new spot::tgba_sgba_proxy(a);
	    }
	}

977
978
979
      if (opt_monitor)
	{
	  tm.start("Monitor minimization");
980
	  a = minimized = minimize_monitor(a);
981
	  tm.stop("Monitor minimization");
982
983
984
	  assume_sba = false; 	// All states are accepting, so double
				// circles in the dot output are
				// pointless.
985
986
	}

Pierre PARUTTO's avatar
Pierre PARUTTO committed
987
      const spot::tgba_explicit_string* expl = 0;
988
989
990
991
992
993
994
995
996
997
998
999
      switch (dupexp)
	{
	case NoneDup:
	  break;
	case BFS:
	  a = expl = tgba_dupexp_bfs(a);
	  break;
	case DFS:
	  a = expl = tgba_dupexp_dfs(a);
	  break;
	}

1000
      const spot::tgba* product_degeneralized = 0;
1001

1002
      if (system)
1003
1004
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
1005

1006
1007
	  assume_sba = false;

1008
1009
1010
1011
1012
	  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)
1013
1014
            degeneralize_opt = DegenTBA;
          if (degeneralize_opt == DegenTBA)
1015
1016
1017
1018
	    {
	      a = product = product_degeneralized =
		new spot::tgba_tba_proxy(product);
	    }
1019
          else if (degeneralize_opt == DegenSBA)
1020
1021
1022
1023
1024
	    {
	      a = product = product_degeneralized =
		new spot::tgba_sba_proxy(product);
	      assume_sba = true;
	    }
1025
        }
1026

1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
      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;