ltl2tgba.cc 37.2 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/contain.hh"
32
#include "ltlvisit/tostring.hh"
33
#include "ltlvisit/apcollect.hh"
34
#include "ltlast/allnodes.hh"
35
#include "ltlparse/public.hh"
36
#include "tgbaalgos/ltl2tgba_lacim.hh"
37
#include "tgbaalgos/ltl2tgba_fm.hh"
38
#include "tgbaalgos/ltl2taa.hh"
39
#include "tgba/bddprint.hh"
40
#include "tgbaalgos/save.hh"
41
#include "tgbaalgos/dotty.hh"
42
#include "tgbaalgos/lbtt.hh"
43
#include "tgba/tgbatba.hh"
44
#include "tgba/tgbasgba.hh"
45
#include "tgba/tgbaproduct.hh"
46
#include "tgba/futurecondcol.hh"
47
#include "tgbaalgos/reducerun.hh"
48
#include "tgbaparse/public.hh"
49
#include "neverparse/public.hh"
50
#include "tgbaalgos/dupexp.hh"
Felix Abecassis's avatar
Felix Abecassis committed
51
#include "tgbaalgos/minimize.hh"
52
#include "tgbaalgos/neverclaim.hh"
53
#include "tgbaalgos/replayrun.hh"
54
#include "tgbaalgos/rundotdec.hh"
55
#include "tgbaalgos/sccfilter.hh"
56
#include "tgbaalgos/safety.hh"
57
#include "tgbaalgos/eltl2tgba_lacim.hh"
58
#include "tgbaalgos/gtec/gtec.hh"
59
#include "eltlparse/public.hh"
60
#include "misc/timer.hh"
61
#include "tgbaalgos/stats.hh"
62
#include "tgbaalgos/scc.hh"
63
#include "tgbaalgos/emptiness_stats.hh"
64
65
#include "tgbaalgos/scc.hh"
#include "kripkeparse/public.hh"
Thomas Badie's avatar
Thomas Badie committed
66
#include "tgbaalgos/simulation.hh"
67

68
69
70
71
72
73
74
75
76
77
78
79
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)	   \
80
81
82
W=G($0)|U($0, $1)  \
R=!U(!$0, !$1)     \
M=F($0)&R($0, $1)";
83
84
85
  return s;
}

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

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

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

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

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

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

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

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

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

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

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

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

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

331

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

      ++formula_index;

339
340
341
342
343
      if (!strcmp(argv[formula_index], "-0"))
	{
	  paper_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-a"))
344
345
346
	{
	  output = 2;
	}
347
      else if (!strcmp(argv[formula_index], "-A"))
348
	{
349
	  output = 4;
350
	}
351
      else if (!strcmp(argv[formula_index], "-b"))
352
	{
353
	  output = 7;
354
	}
355
356
357
      else if (!strcmp(argv[formula_index], "-c"))
	{
	  containment = true;
358
	  translation = TransTAA;
359
	}
360
361
362
363
364
365
366
367
368
      else if (!strcmp(argv[formula_index], "-C"))
	{
	  accepting_run = true;
	}
      else if (!strcmp(argv[formula_index], "-CR"))
	{
	  accepting_run = true;
	  accepting_run_replay = true;
	}
369
      else if (!strcmp(argv[formula_index], "-d"))
370
371
372
	{
	  debug_opt = true;
	}
373
374
      else if (!strcmp(argv[formula_index], "-D"))
	{
375
376
377
378
379
	  degeneralize_opt = DegenTBA;
	}
      else if (!strcmp(argv[formula_index], "-DS"))
	{
	  degeneralize_opt = DegenSBA;
380
	}
381
      else if (!strncmp(argv[formula_index], "-e", 2))
382
        {
383
384
385
386
387
388
389
390
391
392
393
394
395
	  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);
	    }
396
397
398
          expect_counter_example = true;
          output = -1;
        }
399
      else if (!strncmp(argv[formula_index], "-E", 2))
400
        {
401
402
403
404
405
406
407
408
409
410
411
412
413
	  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);
	    }
414
415
416
          expect_counter_example = false;
          output = -1;
        }
417
418
      else if (!strcmp(argv[formula_index], "-f"))
	{
419
	  translation = TransFM;
420
	}
421
      else if (!strcmp(argv[formula_index], "-fr"))
422
	{
423
	  fm_red = true;
424
	  translation = TransFM;
425
	}
426
427
428
429
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
430
431
432
433
      else if (!strcmp(argv[formula_index], "-FC"))
	{
	  show_fc = true;
	}
434
435
      else if (!strcmp(argv[formula_index], "-g"))
	{
436
	  accepting_run = true;
437
438
	  graph_run_opt = true;
	}
439
440
      else if (!strcmp(argv[formula_index], "-G"))
	{
441
	  accepting_run = true;
442
443
	  graph_run_tgba_opt = true;
	}
444
445
446
447
      else if (!strcmp(argv[formula_index], "-k"))
	{
	  output = 9;
	}
448
449
450
451
      else if (!strcmp(argv[formula_index], "-ks"))
	{
	  output = 12;
	}
452
453
454
455
      else if (!strcmp(argv[formula_index], "-kt"))
	{
	  output = 13;
	}
456
457
458
459
      else if (!strcmp(argv[formula_index], "-K"))
	{
	  output = 10;
	}
460
461
462
463
464
465
466
467
468
469
470
471
      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");
	}
472
473
474
475
      else if (!strcmp(argv[formula_index], "-KV"))
	{
	  output = 11;
	}
476
477
478
479
      else if (!strcmp(argv[formula_index], "-l"))
	{
	  translation = TransLaCIM;
	}
480
481
482
483
484
485
486
487
488
489
      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;
	}
490
491
492
      else if (!strcmp(argv[formula_index], "-L"))
	{
	  fair_loop_approx = true;
493
	  translation = TransFM;
494
	}
495
496
497
498
      else if (!strcmp(argv[formula_index], "-lS"))
	{
	  labeling_opt = StateLabeled;
	}
499
500
      else if (!strcmp(argv[formula_index], "-m"))
	{
501
	  opt_reduce = true;
502
	}
martinez's avatar
martinez committed
503
504
      else if (!strcmp(argv[formula_index], "-N"))
	{
505
	  degeneralize_opt = DegenSBA;
martinez's avatar
martinez committed
506
507
	  output = 8;
	}
508
509
510
511
512
513
      else if (!strcmp(argv[formula_index], "-NN"))
	{
	  degeneralize_opt = DegenSBA;
	  output = 8;
	  spin_comments = true;
	}
514
515
      else if (!strcmp(argv[formula_index], "-O"))
	{
516
	  output = 14;
517
          opt_minimize = true;
518
	}
519
520
521
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
522
	  translation = TransFM;
523
	}
524
525
      else if (!strncmp(argv[formula_index], "-P", 2))
	{
526
527
	  tm.start("reading -P's argument");

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

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

696
697
698
699
  std::string input;

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

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

727
  spot::ltl::formula* f = 0;
728
  if (!from_file) // Reading a formula, not reading an automaton from a file.
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
770
      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;
771
	}
772
    }
773

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

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

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

830
	  tm.start("translating formula");
831
832
833
834
835
836
837
838
	  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,
839
				       fm_red ? simp : 0);
840
841
842
843
844
	      break;
	    case TransTAA:
	      a = spot::ltl_to_taa(f, dict, containment);
	      break;
	    case TransLaCIM:
845
846
847
848
849
	      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);
850
851
	      break;
	    }
852
	  tm.stop("translating formula");
853
	  to_free = a;
854
855

	  delete simp;
856
	}
857

858
      if (opt_monitor && !scc_filter)
859
	{
860
	  if (dynamic_cast<const spot::tgba_bdd_concrete*>(a))
861
862
	    symbolic_scc_pruning = true;
	  else
863
	    scc_filter = true;
864
865
	}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
866
867
      if (symbolic_scc_pruning)
        {
868
869
	  const spot::tgba_bdd_concrete* bc =
	    dynamic_cast<const spot::tgba_bdd_concrete*>(a);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
870
871
872
873
874
875
876
877
878
879
880
881
882
	  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)
883
884
		const_cast<spot::tgba_bdd_concrete*>(bc)
		  ->delete_unaccepting_scc();
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
885
886
887
888
	      tm.stop("reducing A_f w/ symbolic SCC pruning");
	    }
	}

889
890
      // Remove dead SCCs and useless acceptance conditions before
      // degeneralization.
891
      const spot::tgba* aut_scc = 0;
892
      if (scc_filter)
893
894
	{
	  tm.start("reducing A_f w/ SCC");
895
	  a = aut_scc = spot::scc_filter(a, scc_filter_all);
896
897
898
	  tm.stop("reducing A_f w/ SCC");
	}

899
900
      const spot::tgba_tba_proxy* degeneralized = 0;
      const spot::tgba_sgba_proxy* state_labeled = 0;
901

902
      const spot::tgba* minimized = 0;
Felix Abecassis's avatar
Felix Abecassis committed
903
      if (opt_minimize)
904
	{
905
906
907
908
909
	  tm.start("obligation minimization");
	  minimized = minimize_obligation(a, f);
	  tm.stop("obligation minimization");

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

Thomas Badie's avatar
Thomas Badie committed
932
933
934
935
936
937
938
939
940
941

      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");
        }


942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
      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);
	    }
	}

969
970
971
      if (opt_monitor)
	{
	  tm.start("Monitor minimization");
972
	  a = minimized = minimize_monitor(a);
973
	  tm.stop("Monitor minimization");
974
975
976
	  assume_sba = false; 	// All states are accepting, so double
				// circles in the dot output are
				// pointless.
977
978
	}

Pierre PARUTTO's avatar
Pierre PARUTTO committed
979
      const spot::tgba_explicit_string* expl = 0;
980
981
982
983
984
985
986
987
988
989
990
991
      switch (dupexp)
	{
	case NoneDup:
	  break;
	case BFS:
	  a = expl = tgba_dupexp_bfs(a);
	  break;
	case DFS:
	  a = expl = tgba_dupexp_dfs(a);
	  break;
	}

992
      const spot::tgba* product_degeneralized = 0;
993

994
      if (system)
995
996
        {
          a = product = product_to_free = new spot::tgba_product(system, a);
997

Alexandre Duret-Lutz's avatar