ltl2tgba.cc 11 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
27
28
#include "ltlvisit/destroy.hh"
#include "ltlast/allnodes.hh"
#include "ltlparse/public.hh"
29
#include "tgbaalgos/ltl2tgba_lacim.hh"
30
#include "tgbaalgos/ltl2tgba_fm.hh"
31
#include "tgba/bddprint.hh"
32
#include "tgbaalgos/dotty.hh"
33
#include "tgbaalgos/lbtt.hh"
34
#include "tgba/tgbatba.hh"
35
#include "tgbaalgos/magic.hh"
36
37
#include "tgbaalgos/gtec/gtec.hh"
#include "tgbaalgos/gtec/ce.hh"
38
#include "tgbaparse/public.hh"
39
#include "tgbaalgos/dupexp.hh"
40
#include "tgbaalgos/neverclaim.hh"
41
42
43
44

void
syntax(char* prog)
{
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
45
  std::cerr << "Usage: "<< prog << " [OPTIONS...] formula" << std::endl
46
            << "       "<< prog << " -F [OPTIONS...] file" << std::endl
47
            << "       "<< prog << " -X [OPTIONS...] file" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
48
	    << std::endl
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
49
	    << "Options:" << std::endl
50
	    << "  -a   display the acceptance_conditions BDD, not the "
51
	    << "reachability graph"
52
	    << std::endl
53
	    << "  -A   same as -a, but as a set" << std::endl
54
	    << "  -d   turn on traces during parsing" << std::endl
55
	    << "  -D   degeneralize the automaton" << std::endl
56
57
	    << "  -e   emptiness-check (Couvreur), expect and compute "
	    << "a counter-example" << std::endl
58
59
	    << "  -e2  emptiness-check (Couvreur variant), expect and compute "
	    << "a counter-example" << std::endl
60
61
	    << "  -E   emptiness-check (Couvreur), expect no counter-example "
	    << std::endl
62
63
	    << "  -E2  emptiness-check (Couvreur variant), expect no "
	    << "counter-example " << std::endl
64
65
66
            << "  -f   use Couvreur's FM algorithm for translation"
	    << std::endl
            << "  -F   read the formula from the file" << std::endl
67
68
69
70
71
72
	    << "  -m   magic-search (implies -D), expect a counter-example"
	    << std::endl
	    << "  -M   magic-search (implies -D), expect no counter-example"
	    << std::endl
	    << "  -n   same as -m, but display more counter-examples"
	    << std::endl
73
74
	    << "  -N   display the never clain for Spin "
	    << "(implies -D)" << std::endl
75
            << "  -p   branching postponement (implies -f)" << std::endl
76
	    << "  -r   display the relation BDD, not the reachability graph"
77
	    << std::endl
78
	    << "  -R   same as -r, but as a set" << std::endl
79
80
81
82
	    << "  -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
83
	    << "  -t   display reachable states in LBTT's format" << std::endl
84
85
	    << "  -T   display reachable states in LBTT's format w/o "
	    << "acceptance conditions" << std::endl
Alexandre Duret-Lutz's avatar
spacing    
Alexandre Duret-Lutz committed
86
	    << "  -v   display the BDD variables used by the automaton"
87
	    << std::endl
88
89
            << "  -x   try to produce a more deterministic automata "
	    << "(implies -f)" << std::endl
90
	    << "  -X   do not compute an automaton, read it from a file"
91
92
93
	    << std::endl
	    << "  -y   do not merge states with same symbolic representation "
	    << "(implies -f)" << std::endl;
94
95
96
97
98
99
100
101
  exit(2);
}

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

102
  bool debug_opt = false;
103
  bool degeneralize_opt = false;
104
  bool fm_opt = false;
105
  bool fm_exprop_opt = false;
106
  bool fm_symb_merge_opt = true;
107
  bool file_opt = false;
108
  int output = 0;
109
  int formula_index = 0;
110
  enum { None, Couvreur, Couvreur2, MagicSearch } echeck = None;
111
  enum { NoneDup, BFS, DFS } dupexp = NoneDup;
112
113
  bool magic_many = false;
  bool expect_counter_example = false;
114
  bool from_file = false;
115
  bool post_branching = false;
116

117
  for (;;)
118
    {
119
      if (argc < formula_index + 2)
120
	syntax(argv[0]);
121
122
123

      ++formula_index;

124
125
126
127
128
129
130
131
132
      if (!strcmp(argv[formula_index], "-a"))
	{
	  output = 2;
	}
      else if (!strcmp(argv[formula_index], "-A"))
	{
	  output = 4;
	}
      else if (!strcmp(argv[formula_index], "-d"))
133
134
135
	{
	  debug_opt = true;
	}
136
137
138
139
      else if (!strcmp(argv[formula_index], "-D"))
	{
	  degeneralize_opt = true;
	}
140
141
142
143
144
145
      else if (!strcmp(argv[formula_index], "-e"))
	{
	  echeck = Couvreur;
	  expect_counter_example = true;
	  output = -1;
	}
146
147
148
149
150
151
      else if (!strcmp(argv[formula_index], "-e2"))
	{
	  echeck = Couvreur2;
	  expect_counter_example = true;
	  output = -1;
	}
152
153
154
155
156
157
      else if (!strcmp(argv[formula_index], "-E"))
	{
	  echeck = Couvreur;
	  expect_counter_example = false;
	  output = -1;
	}
158
159
160
161
162
163
      else if (!strcmp(argv[formula_index], "-E2"))
	{
	  echeck = Couvreur2;
	  expect_counter_example = false;
	  output = -1;
	}
164
165
166
167
168
169
170
171
      else if (!strcmp(argv[formula_index], "-f"))
	{
	  fm_opt = true;
	}
      else if (!strcmp(argv[formula_index], "-F"))
	{
	  file_opt = true;
	}
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
      else if (!strcmp(argv[formula_index], "-m"))
	{
	  echeck = MagicSearch;
	  degeneralize_opt = true;
	  expect_counter_example = true;
	  output = -1;
	}
      else if (!strcmp(argv[formula_index], "-M"))
	{
	  echeck = MagicSearch;
	  degeneralize_opt = true;
	  expect_counter_example = false;
	  output = -1;
	}
      else if (!strcmp(argv[formula_index], "-n"))
	{
	  echeck = MagicSearch;
	  degeneralize_opt = true;
	  expect_counter_example = true;
	  output = -1;
	  magic_many = true;
	}
194
195
196
197
198
      else if (!strcmp(argv[formula_index], "-N"))
	{
	  degeneralize_opt = true;
	  output = 8;
	}
199
200
201
202
203
      else if (!strcmp(argv[formula_index], "-p"))
	{
	  post_branching = true;
	  fm_opt = true;
	}
204
205
      else if (!strcmp(argv[formula_index], "-r"))
	{
206
207
208
209
210
	  output = 1;
	}
      else if (!strcmp(argv[formula_index], "-R"))
	{
	  output = 3;
211
	}
212
213
214
215
216
217
218
219
      else if (!strcmp(argv[formula_index], "-s"))
	{
	  dupexp = DFS;
	}
      else if (!strcmp(argv[formula_index], "-S"))
	{
	  dupexp = BFS;
	}
220
221
222
223
      else if (!strcmp(argv[formula_index], "-t"))
	{
	  output = 6;
	}
224
225
226
227
      else if (!strcmp(argv[formula_index], "-T"))
	{
	  output = 7;
	}
228
229
230
231
      else if (!strcmp(argv[formula_index], "-v"))
	{
	  output = 5;
	}
232
233
234
235
236
      else if (!strcmp(argv[formula_index], "-x"))
	{
	  fm_opt = true;
	  fm_exprop_opt = true;
	}
237
238
239
240
      else if (!strcmp(argv[formula_index], "-X"))
	{
	  from_file = true;
	}
241
242
243
244
245
      else if (!strcmp(argv[formula_index], "-y"))
	{
	  fm_opt = true;
	  fm_symb_merge_opt = false;
	}
246
247
248
249
      else
	{
	  break;
	}
250
251
    }

252
253
254
255
  std::string input;

  if (file_opt)
    {
256
      if (strcmp(argv[formula_index], "-"))
257
	{
258
259
260
261
262
263
	  std::ifstream fin(argv[formula_index]);
	  if (! fin)
	    {
	      std::cerr << "Cannot open " << argv[formula_index] << std::endl;
	      exit(2);
	    }
264

265
266
267
268
269
270
271
	  if (! std::getline(fin, input, '\0'))
	    {
	      std::cerr << "Cannot read " << argv[formula_index] << std::endl;
	      exit(2);
	    }
	}
      else
272
	{
273
	  std::getline(std::cin, input, '\0');
274
275
276
277
278
279
280
	}
    }
  else
    {
      input = argv[formula_index];
    }

281
  spot::ltl::environment& env(spot::ltl::default_environment::instance());
282
  spot::bdd_dict* dict = new spot::bdd_dict();
283
284
285
286
287
288
289
290
291

  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)
292
    {
293
294
295
296
      spot::tgba_bdd_concrete* concrete = 0;
      spot::tgba* to_free = 0;
      spot::tgba* a = 0;

297
298
299
      if (from_file)
	{
	  spot::tgba_parse_error_list pel;
300
301
	  spot::tgba_explicit* e;
	  to_free = a = e = spot::tgba_parse(input, pel, dict, env, debug_opt);
302
303
	  if (spot::format_tgba_parse_errors(std::cerr, pel))
	    return 2;
304
	  e->merge_transitions();
305
	}
306
      else
307
308
	{
	  if (fm_opt)
309
	    to_free = a = spot::ltl_to_tgba_fm(f, dict, fm_exprop_opt,
310
311
					       fm_symb_merge_opt,
					       post_branching);
312
313
314
	  else
	    to_free = a = concrete = spot::ltl_to_tgba_lacim(f, dict);
	}
315

316
      spot::tgba_tba_proxy* degeneralized = 0;
317
318
319
      if (degeneralize_opt)
	a = degeneralized = new spot::tgba_tba_proxy(a);

320
321
322
323
324
325
326
327
328
329
330
331
332
      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;
	}

333
334
      switch (output)
	{
335
336
337
	case -1:
	  /* No output.  */
	  break;
338
339
340
341
	case 0:
	  spot::dotty_reachable(std::cout, a);
	  break;
	case 1:
342
343
344
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
345
346
	  break;
	case 2:
347
348
349
	  if (concrete)
	    spot::bdd_print_dot(std::cout, concrete->get_dict(),
				concrete->
350
				get_core_data().acceptance_conditions);
351
352
	  break;
	case 3:
353
354
355
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->get_core_data().relation);
356
357
	  break;
	case 4:
358
359
360
	  if (concrete)
	    spot::bdd_print_set(std::cout, concrete->get_dict(),
				concrete->
361
				get_core_data().acceptance_conditions);
362
	  break;
363
	case 5:
364
	  a->get_dict()->dump(std::cout);
365
	  break;
366
367
368
	case 6:
	  spot::lbtt_reachable(std::cout, a);
	  break;
369
370
371
	case 7:
	  spot::nonacceptant_lbtt_reachable(std::cout, a);
	  break;
372
373
374
	case 8:
	  spot::never_claim_reachable(std::cout, degeneralized, f);
	  break;
375
376
377
	default:
	  assert(!"unknown output option");
	}
378

379
380
381
382
383
      switch (echeck)
	{
	case None:
	  break;
	case Couvreur:
384
	case Couvreur2:
385
	  {
386
	    spot::emptiness_check* ec;
387
	    if (echeck == Couvreur)
388
	      ec = new spot::emptiness_check(a);
389
	    else
390
391
392
	      ec = new spot::emptiness_check_shy(a);

	    bool res = ec->check();
393

394
395
396
397
398
	    if (expect_counter_example)
	      {
		if (res)
		  {
		    exit_code = 1;
399
		    delete ec;
400
401
		    break;
		  }
402
		spot::counter_example ce(ec->result());
403
		ce.print_result(std::cout);
404
405
406
407
408
	      }
	    else
	      {
		exit_code = !res;
	      }
409
	    delete ec;
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
	  }
	  break;
	case MagicSearch:
	  {
	    spot::magic_search ms(degeneralized);
	    bool res = ms.check();
	    if (expect_counter_example)
	      {
		if (!res)
		  {
		    exit_code = 1;
		    break;
		  }
		do
		  ms.print_result(std::cout);
		while (magic_many && ms.check());
	      }
	    else
	      {
		exit_code = res;
	      }
	  }
	  break;
	}

435
436
      if (f)
        spot::ltl::destroy(f);
437
438
      if (expl)
	delete expl;
439
440
441
      if (degeneralize_opt)
	delete degeneralized;

442
      delete to_free;
443
444
445
446
447
448
449
450
451
452
    }
  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);
453
  delete dict;
454
455
  return exit_code;
}