autfilt.cc 38.9 KB
Newer Older
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1
// -*- coding: utf-8 -*-
Alexandre Duret-Lutz's avatar
typos    
Alexandre Duret-Lutz committed
2
// Copyright (C) 2013, 2014, 2015, 2016 Laboratoire de Recherche et
3
// Développement de l'Epita (LRDE).
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
//
// 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 3 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 this program.  If not, see <http://www.gnu.org/licenses/>.

#include "common_sys.hh"

#include <string>
#include <iostream>
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
24
#include <limits>
25
26
#include <set>
#include <memory>
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
27
28
29
30
31
32
33

#include <argp.h>
#include "error.h"

#include "common_setup.hh"
#include "common_finput.hh"
#include "common_cout.hh"
34
#include "common_aoutput.hh"
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
35
#include "common_range.hh"
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
36
#include "common_post.hh"
37
#include "common_conv.hh"
38
#include "common_hoaread.hh"
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
39

40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <spot/twaalgos/product.hh>
#include <spot/twaalgos/isdet.hh>
#include <spot/twaalgos/stutter.hh>
#include <spot/twaalgos/isunamb.hh>
#include <spot/misc/optionmap.hh>
#include <spot/misc/timer.hh>
#include <spot/misc/random.hh>
#include <spot/parseaut/public.hh>
#include <spot/tl/exclusive.hh>
#include <spot/twaalgos/remprop.hh>
#include <spot/twaalgos/randomize.hh>
#include <spot/twaalgos/are_isomorphic.hh>
#include <spot/twaalgos/canonicalize.hh>
#include <spot/twaalgos/mask.hh>
#include <spot/twaalgos/sepsets.hh>
#include <spot/twaalgos/stripacc.hh>
#include <spot/twaalgos/remfin.hh>
#include <spot/twaalgos/cleanacc.hh>
#include <spot/twaalgos/dtwasat.hh>
#include <spot/twaalgos/complement.hh>
#include <spot/twaalgos/strength.hh>
61
#include <spot/twaalgos/hoa.hh>
62
63
#include <spot/twaalgos/sccinfo.hh>
#include <spot/twaalgos/isweakscc.hh>
64
#include <spot/twaalgos/gtec/gtec.hh>
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
65

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
66
static const char argp_program_doc[] ="\
67
Convert, transform, and filter omega-automata.\v\
68
69
70
71
Exit status:\n\
  0  if some automata were output\n\
  1  if no automata were output (no match)\n\
  2  if any error has been reported";
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
72

73
74
// Keep this list sorted
enum {
75
76
  OPT_ACC_SCCS = 256,
  OPT_ACC_SETS,
77
  OPT_ACCEPT_WORD,
78
  OPT_AP_N,
79
80
  OPT_ARE_ISOMORPHIC,
  OPT_CLEAN_ACC,
81
  OPT_CNF_ACC,
82
  OPT_COMPLEMENT,
83
84
  OPT_COMPLEMENT_ACC,
  OPT_COUNT,
85
  OPT_DECOMPOSE_STRENGTH,
86
87
88
  OPT_DESTUT,
  OPT_DNF_ACC,
  OPT_EDGES,
89
  OPT_EQUIVALENT_TO,
90
  OPT_EXCLUSIVE_AP,
91
  OPT_GENERIC,
92
93
94
  OPT_HIGHLIGHT_NONDET,
  OPT_HIGHLIGHT_NONDET_EDGES,
  OPT_HIGHLIGHT_NONDET_STATES,
95
  OPT_HIGHLIGHT_WORD,
96
  OPT_INSTUT,
97
  OPT_INCLUDED_IN,
98
  OPT_INHERENTLY_WEAK_SCCS,
99
100
101
102
  OPT_INTERSECT,
  OPT_IS_COMPLETE,
  OPT_IS_DETERMINISTIC,
  OPT_IS_EMPTY,
103
  OPT_IS_STUTTER_INVARIANT,
104
  OPT_IS_TERMINAL,
105
  OPT_IS_UNAMBIGUOUS,
106
  OPT_IS_WEAK,
107
  OPT_IS_INHERENTLY_WEAK,
108
109
110
  OPT_KEEP_STATES,
  OPT_MASK_ACC,
  OPT_MERGE,
111
  OPT_NONDET_STATES,
112
113
  OPT_PRODUCT_AND,
  OPT_PRODUCT_OR,
114
  OPT_RANDOMIZE,
115
  OPT_REJ_SCCS,
116
  OPT_REJECT_WORD,
117
  OPT_REM_AP,
118
119
  OPT_REM_DEAD,
  OPT_REM_UNREACH,
120
  OPT_REM_UNUSED_AP,
121
  OPT_REM_FIN,
122
  OPT_SAT_MINIMIZE,
123
  OPT_SCCS,
124
  OPT_SEED,
125
  OPT_SEP_SETS,
126
  OPT_SIMPLIFY_EXCLUSIVE_AP,
127
128
  OPT_STATES,
  OPT_STRIPACC,
129
130
  OPT_TERMINAL_SCCS,
  OPT_TRIV_SCCS,
131
132
  OPT_USED_AP_N,
  OPT_UNUSED_AP_N,
133
  OPT_WEAK_SCCS,
134
};
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
135
136
137
138

static const argp_option options[] =
  {
    /**************************************************/
139
    { nullptr, 0, nullptr, 0, "Input:", 1 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
140
141
142
    { "file", 'F', "FILENAME", 0,
      "process the automaton in FILENAME", 0 },
    /**************************************************/
143
    { "count", 'c', nullptr, 0, "print only a count of matched automata", 3 },
144
    { "max-count", 'n', "NUM", 0, "output at most NUM automata", 3 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
145
    /**************************************************/
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
    { nullptr, 0, nullptr, 0, "Filtering options:", 5 },
    { "ap", OPT_AP_N, "RANGE", 0,
      "match automata with a number of (declared) atomic propositions in RANGE",
      0 },
    { "used-ap", OPT_USED_AP_N, "RANGE", 0,
      "match automata with a number of used atomic propositions in RANGE", 0 },
    { "unused-ap", OPT_UNUSED_AP_N, "RANGE", 0,
      "match automata with a number of declared, but unused atomic "
      "propositions in RANGE", 0 },
    { "are-isomorphic", OPT_ARE_ISOMORPHIC, "FILENAME", 0,
      "keep automata that are isomorphic to the automaton in FILENAME", 0 },
    { "isomorphic", 0, nullptr, OPTION_ALIAS | OPTION_HIDDEN, nullptr, 0 },
    { "unique", 'u', nullptr, 0,
      "do not output the same automaton twice (same in the sense that they "\
      "are isomorphic)", 0 },
    { "is-complete", OPT_IS_COMPLETE, nullptr, 0,
      "keep complete automata", 0 },
    { "is-deterministic", OPT_IS_DETERMINISTIC, nullptr, 0,
      "keep deterministic automata", 0 },
    { "is-empty", OPT_IS_EMPTY, nullptr, 0,
      "keep automata with an empty language", 0 },
167
168
    { "is-stutter-invariant", OPT_IS_STUTTER_INVARIANT, nullptr, 0,
      "keep automata representing stutter-invariant properties", 0 },
169
170
    { "is-terminal", OPT_IS_TERMINAL, nullptr, 0,
      "keep only terminal automata", 0 },
171
172
    { "is-unambiguous", OPT_IS_UNAMBIGUOUS, nullptr, 0,
      "keep only unambiguous automata", 0 },
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
    { "is-weak", OPT_IS_WEAK, nullptr, 0,
      "keep only weak automata", 0 },
    { "is-inherently-weak", OPT_IS_INHERENTLY_WEAK, nullptr, 0,
      "keep only inherently weak automata", 0 },
    { "intersect", OPT_INTERSECT, "FILENAME", 0,
      "keep automata whose languages have an non-empty intersection with"
      " the automaton from FILENAME", 0 },
    { "included-in", OPT_INCLUDED_IN, "FILENAME", 0,
      "keep automata whose languages are included in that of the "
      "automaton from FILENAME", 0 },
    { "equivalent-to", OPT_EQUIVALENT_TO, "FILENAME", 0,
      "keep automata thare are equivalent (language-wise) to the automaton "
      "in FILENAME", 0 },
    { "invert-match", 'v', nullptr, 0, "select non-matching automata", 0 },
    { "states", OPT_STATES, "RANGE", 0,
      "keep automata whose number of states is in RANGE", 0 },
    { "edges", OPT_EDGES, "RANGE", 0,
      "keep automata whose number of edges is in RANGE", 0 },
191
192
    { "nondet-states", OPT_NONDET_STATES, "RANGE", 0,
      "keep automata whose number of nondeterministic states is in RANGE", 0 },
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
    { "acc-sets", OPT_ACC_SETS, "RANGE", 0,
      "keep automata whose number of acceptance sets is in RANGE", 0 },
    { "sccs", OPT_SCCS, "RANGE", 0,
      "keep automata whose number of SCCs is in RANGE", 0 },
    { "acc-sccs", OPT_ACC_SCCS, "RANGE", 0,
      "keep automata whose number of non-trivial accepting SCCs is in RANGE",
      0 },
    { "accepting-sccs", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
    { "rej-sccs", OPT_REJ_SCCS, "RANGE", 0,
      "keep automata whose number of non-trivial rejecting SCCs is in RANGE",
      0 },
    { "rejecting-sccs", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
    { "triv-sccs", OPT_TRIV_SCCS, "RANGE", 0,
      "keep automata whose number of trivial SCCs is in RANGE", 0 },
    { "trivial-sccs", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
    { "inherently-weak-sccs", OPT_INHERENTLY_WEAK_SCCS, "RANGE", 0,
      "keep automata whose number of accepting inherently-weak SCCs is in "
      "RANGE.  An accepting SCC is inherently weak if it does not have a "
      "rejecting cycle.", 0 },
    { "weak-sccs", OPT_WEAK_SCCS, "RANGE", 0,
      "keep automata whose number of accepting weak SCCs is in RANGE.  "
      "In a weak SCC, all transitions belong to the same acceptance sets.", 0 },
    { "terminal-sccs", OPT_TERMINAL_SCCS, "RANGE", 0,
      "keep automata whose number of accepting terminal SCCs is in RANGE.  "
      "Terminal SCCs are weak and complete.", 0 },
    { "accept-word", OPT_ACCEPT_WORD, "WORD", 0,
      "keep automata that accept WORD", 0 },
    { "reject-word", OPT_REJECT_WORD, "WORD", 0,
      "keep automata that reject WORD", 0 },
    /**************************************************/
    RANGE_DOC_FULL,
    WORD_DOC,
    /**************************************************/
    { nullptr, 0, nullptr, 0, "Transformations:", 7 },
227
    { "merge-transitions", OPT_MERGE, nullptr, 0,
228
      "merge transitions with same destination and acceptance", 0 },
229
230
231
    { "product", OPT_PRODUCT_AND, "FILENAME", 0,
      "build the product with the automaton in FILENAME "
      "to intersect languages", 0 },
232
    { "product-and", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
233
234
235
    { "product-or", OPT_PRODUCT_OR, "FILENAME", 0,
      "build the product with the automaton in FILENAME "
      "to sum languages", 0 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
236
    { "randomize", OPT_RANDOMIZE, "s|t", OPTION_ARG_OPTIONAL,
237
      "randomize states and transitions (specify 's' or 't' to "
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
238
      "randomize only states or transitions)", 0 },
239
240
    { "instut", OPT_INSTUT, "1|2", OPTION_ARG_OPTIONAL,
      "allow more stuttering (two possible algorithms)", 0 },
241
    { "destut", OPT_DESTUT, nullptr, 0, "allow less stuttering", 0 },
242
243
    { "mask-acc", OPT_MASK_ACC, "NUM[,NUM...]", 0,
      "remove all transitions in specified acceptance sets", 0 },
244
    { "strip-acceptance", OPT_STRIPACC, nullptr, 0,
245
      "remove the acceptance condition and all acceptance sets", 0 },
246
247
    { "keep-states", OPT_KEEP_STATES, "NUM[,NUM...]", 0,
      "only keep specified states.  The first state will be the new "\
248
      "initial state.  Implies --remove-unreachable-states.", 0 },
249
    { "dnf-acceptance", OPT_DNF_ACC, nullptr, 0,
250
      "put the acceptance condition in Disjunctive Normal Form", 0 },
251
    { "cnf-acceptance", OPT_CNF_ACC, nullptr, 0,
252
      "put the acceptance condition in Conjunctive Normal Form", 0 },
253
    { "remove-fin", OPT_REM_FIN, nullptr, 0,
254
      "rewrite the automaton without using Fin acceptance", 0 },
255
    { "cleanup-acceptance", OPT_CLEAN_ACC, nullptr, 0,
256
      "remove unused acceptance sets from the automaton", 0 },
257
258
259
    { "complement", OPT_COMPLEMENT, nullptr, 0,
      "complement each automaton (currently support only deterministic "
      "automata)", 0 },
260
    { "complement-acceptance", OPT_COMPLEMENT_ACC, nullptr, 0,
261
262
      "complement the acceptance condition (without touching the automaton)",
      0 },
263
264
265
    { "decompose-strength", OPT_DECOMPOSE_STRENGTH, "t|w|s", 0,
      "extract the (t) terminal, (w) weak, or (s) strong part of an automaton"
      " (letters may be combined to combine more strengths in the output)", 0 },
266
267
268
269
270
    { "exclusive-ap", OPT_EXCLUSIVE_AP, "AP,AP,...", 0,
      "if any of those APs occur in the automaton, restrict all edges to "
      "ensure two of them may not be true at the same time.  Use this option "
      "multiple times to declare independent groups of exclusive "
      "propositions.", 0 },
271
    { "simplify-exclusive-ap", OPT_SIMPLIFY_EXCLUSIVE_AP, nullptr, 0,
272
273
274
      "if --exclusive-ap is used, assume those AP groups are actually exclusive"
      " in the system to simplify the expression of transition labels (implies "
      "--merge-transitions)", 0 },
275
276
277
    { "remove-ap", OPT_REM_AP, "AP[=0|=1][,AP...]", 0,
      "remove atomic propositions either by existential quantification, or "
      "by assigning them 0 or 1", 0 },
278
279
    { "remove-unused-ap", OPT_REM_UNUSED_AP, nullptr, 0,
      "remove declared atomic propositions that are not used", 0 },
280
    { "remove-unreachable-states", OPT_REM_UNREACH, nullptr, 0,
281
      "remove states that are unreachable from the initial state", 0 },
282
    { "remove-dead-states", OPT_REM_DEAD, nullptr, 0,
283
284
      "remove states that are unreachable, or that cannot belong to an "
      "infinite path", 0 },
285
    { "separate-sets", OPT_SEP_SETS, nullptr, 0,
286
287
      "if both Inf(x) and Fin(x) appear in the acceptance condition, replace "
      "Fin(x) by a new Fin(y) and adjust the automaton", 0 },
288
    { "sat-minimize", OPT_SAT_MINIMIZE, "options", OPTION_ARG_OPTIONAL,
Alexandre Duret-Lutz's avatar
typos    
Alexandre Duret-Lutz committed
289
      "minimize the automaton using a SAT solver (only works for deterministic"
290
      " automata)", 0 },
291
    /**************************************************/
292
    { nullptr, 0, nullptr, 0, "Decorations (for -d and -H1.1 output):", 8 },
293
294
    { "highlight-nondet-states", OPT_HIGHLIGHT_NONDET_STATES, "NUM",
      OPTION_ARG_OPTIONAL, "highlight nondeterministic states with color NUM",
295
      0 },
296
297
    { "highlight-nondet-edges", OPT_HIGHLIGHT_NONDET_EDGES, "NUM",
      OPTION_ARG_OPTIONAL, "highlight nondeterministic edges with color NUM",
298
      0 },
299
300
301
    { "highlight-nondet", OPT_HIGHLIGHT_NONDET, "NUM",
      OPTION_ARG_OPTIONAL,
      "highlight nondeterministic states and edges with color NUM", 0},
302
303
    { "highlight-word", OPT_HIGHLIGHT_WORD, "[NUM,]WORD", 0,
      "highlight one run matching WORD using color NUM", 0},
304
    /**************************************************/
305
306
    { nullptr, 0, nullptr, 0,
      "If any option among --small, --deterministic, or --any is given, "
307
      "then the simplification level defaults to --high unless specified "
308
      "otherwise.  If any option among --low, --medium, or --high is given, "
309
      "then the simplification goal defaults to --small unless specified "
310
311
312
      "otherwise.  If none of those options are specified, then autfilt "
      "acts as is --any --low were given: these actually disable the "
      "simplification routines.", 22 },
313
    /**************************************************/
314
    { nullptr, 0, nullptr, 0, "Miscellaneous options:", -1 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
315
316
    { "extra-options", 'x', "OPTS", 0,
      "fine-tuning options (see spot-x (7))", 0 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
317
318
    { "seed", OPT_SEED, "INT", 0,
      "seed for the random number generator (0)", 0 },
319
    { nullptr, 0, nullptr, 0, nullptr, 0 }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
320
321
  };

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
322
static const struct argp_child children[] =
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
323
  {
324
    { &hoaread_argp, 0, nullptr, 0 },
325
326
    { &aoutput_argp, 0, nullptr, 0 },
    { &aoutput_io_format_argp, 0, nullptr, 4 },
327
    { &post_argp_disabled, 0, nullptr, 0 },
328
329
    { &misc_argp, 0, nullptr, -1 },
    { nullptr, 0, nullptr, 0 }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
330
331
  };

332
typedef spot::twa_graph::graph_t::edge_storage_t tr_t;
333
typedef std::set<std::vector<tr_t>> unique_aut_t;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
334
static long int match_count = 0;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
335
336
337
338
static spot::option_map extra_options;
static bool randomize_st = false;
static bool randomize_tr = false;
static int opt_seed = 0;
339

340
// We want all these variables to be destroyed when we exit main, to
341
342
343
344
345
346
// make sure it happens before all other global variables (like the
// atomic propositions maps) are destroyed.  Otherwise we risk
// accessing deleted stuff.
static struct opt_t
{
  spot::bdd_dict_ptr dict = spot::make_bdd_dict();
347
348
  spot::twa_graph_ptr product_and = nullptr;
  spot::twa_graph_ptr product_or = nullptr;
349
  spot::twa_graph_ptr intersect = nullptr;
350
  spot::twa_graph_ptr included_in = nullptr;
351
352
  spot::twa_graph_ptr equivalent_pos = nullptr;
  spot::twa_graph_ptr equivalent_neg = nullptr;
353
  spot::twa_graph_ptr are_isomorphic = nullptr;
354
355
356
  std::unique_ptr<spot::isomorphism_checker>
                         isomorphism_checker = nullptr;
  std::unique_ptr<unique_aut_t> uniq = nullptr;
357
358
  spot::exclusive_ap excl_ap;
  spot::remove_ap rem_ap;
359
  std::vector<spot::twa_graph_ptr> acc_words;
360
  std::vector<spot::twa_graph_ptr> rej_words;
361
  std::vector<std::pair<spot::twa_graph_ptr, unsigned>> hl_words;
362
363
}* opt;

364
static bool opt_merge = false;
365
366
static bool opt_is_complete = false;
static bool opt_is_deterministic = false;
367
static bool opt_is_unambiguous = false;
368
369
static bool opt_is_terminal = false;
static bool opt_is_weak = false;
370
static bool opt_is_inherently_weak = false;
371
static bool opt_is_stutter_invariant = false;
372
static bool opt_invert = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
373
static range opt_states = { 0, std::numeric_limits<int>::max() };
374
375
static range opt_edges = { 0, std::numeric_limits<int>::max() };
static range opt_accsets = { 0, std::numeric_limits<int>::max() };
376
static range opt_ap_n = { 0, std::numeric_limits<int>::max() };
377
378
379
static range opt_used_ap_n = { 0, std::numeric_limits<int>::max() };
static range opt_unused_ap_n = { 0, std::numeric_limits<int>::max() };
static bool need_unused_ap_count = false;
380
381
382
383
384
385
386
387
388
389
390
391
static range opt_sccs = { 0, std::numeric_limits<int>::max() };
static range opt_acc_sccs = { 0, std::numeric_limits<int>::max() };
static range opt_rej_sccs = { 0, std::numeric_limits<int>::max() };
static range opt_triv_sccs = { 0, std::numeric_limits<int>::max() };
static bool opt_sccs_set = false;
static bool opt_art_sccs_set = false; // need to classify SCCs as Acc/Rej/Triv.
static range opt_inhweak_sccs = { 0, std::numeric_limits<int>::max() };
static bool opt_inhweak_sccs_set = false;
static range opt_weak_sccs = { 0, std::numeric_limits<int>::max() };
static bool opt_weak_sccs_set = false;
static range opt_terminal_sccs = { 0, std::numeric_limits<int>::max() };
static bool opt_terminal_sccs_set = false;
392
393
static range opt_nondet_states = { 0, std::numeric_limits<int>::max() };
static bool opt_nondet_states_set = false;
394
static int opt_max_count = -1;
395
static bool opt_destut = false;
396
static char opt_instut = 0;
397
static bool opt_is_empty = false;
398
static bool opt_stripacc = false;
399
static bool opt_dnf_acc = false;
400
static bool opt_cnf_acc = false;
401
static bool opt_rem_fin = false;
402
static bool opt_clean_acc = false;
403
static bool opt_complement = false;
404
static bool opt_complement_acc = false;
405
static char* opt_decompose_strength = nullptr;
406
static spot::acc_cond::mark_t opt_mask_acc = 0U;
407
408
static std::vector<bool> opt_keep_states = {};
static unsigned int opt_keep_states_initial = 0;
409
static bool opt_simplify_exclusive_ap = false;
410
411
static bool opt_rem_dead = false;
static bool opt_rem_unreach = false;
412
static bool opt_rem_unused_ap = false;
413
static bool opt_sep_sets = false;
414
static const char* opt_sat_minimize = nullptr;
415
416
static int opt_highlight_nondet_states = -1;
static int opt_highlight_nondet_edges = -1;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
417

418
419
420
421
422
423
424
425
426
427
428
429
static spot::twa_graph_ptr
ensure_deterministic(const spot::twa_graph_ptr& aut)
{
  if (spot::is_deterministic(aut))
    return aut;
  spot::postprocessor p;
  p.set_type(spot::postprocessor::Generic);
  p.set_pref(spot::postprocessor::Deterministic);
  p.set_level(level);
  return p.run(aut);
}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
430
431
432
433
434
435
static int
parse_opt(int key, char* arg, struct argp_state*)
{
  // This switch is alphabetically-ordered.
  switch (key)
    {
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
436
    case 'c':
437
      automaton_format = Count;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
438
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
439
440
441
    case 'F':
      jobs.emplace_back(arg, true);
      break;
442
443
444
    case 'n':
      opt_max_count = to_pos_int(arg);
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
445
    case 'u':
446
      opt->uniq =
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
447
448
        std::unique_ptr<unique_aut_t>(new std::set<std::vector<tr_t>>());
      break;
449
450
451
    case 'v':
      opt_invert = true;
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
452
453
    case 'x':
      {
454
455
456
        const char* opt = extra_options.parse_options(arg);
        if (opt)
          error(2, 0, "failed to parse --options near '%s'", opt);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
457
458
      }
      break;
459
460
461
    case OPT_AP_N:
      opt_ap_n = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
462
463
464
    case OPT_ACC_SETS:
      opt_accsets = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
465
466
467
468
    case OPT_ACC_SCCS:
      opt_acc_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_art_sccs_set = true;
      break;
469
    case OPT_ACCEPT_WORD:
470
      try
471
472
473
474
        {
          opt->acc_words.push_back(spot::parse_word(arg, opt->dict)
                                   ->as_automaton());
        }
475
      catch (const spot::parse_error& e)
476
477
478
479
        {
          error(2, 0, "failed to parse the argument of --accept-word:\n%s",
                e.what());
        }
480
      break;
481
    case OPT_ARE_ISOMORPHIC:
482
      opt->are_isomorphic = read_automaton(arg, opt->dict);
483
      break;
484
485
486
    case OPT_CLEAN_ACC:
      opt_clean_acc = true;
      break;
487
488
489
490
    case OPT_CNF_ACC:
      opt_dnf_acc = false;
      opt_cnf_acc = true;
      break;
491
492
493
    case OPT_COMPLEMENT:
      opt_complement = true;
      break;
494
495
496
    case OPT_COMPLEMENT_ACC:
      opt_complement_acc = true;
      break;
497
498
499
    case OPT_DECOMPOSE_STRENGTH:
      opt_decompose_strength = arg;
      break;
500
501
502
503
504
    case OPT_DESTUT:
      opt_destut = true;
      break;
    case OPT_DNF_ACC:
      opt_dnf_acc = true;
505
      opt_cnf_acc = false;
506
      break;
507
508
509
    case OPT_EDGES:
      opt_edges = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
510
    case OPT_EXCLUSIVE_AP:
511
      opt->excl_ap.add_group(arg);
512
      break;
513
514
    case OPT_EQUIVALENT_TO:
      if (opt->equivalent_pos)
515
        error(2, 0, "only one --equivalent-to option can be given");
516
517
      opt->equivalent_pos = read_automaton(arg, opt->dict);
      opt->equivalent_neg =
518
        spot::dtwa_complement(ensure_deterministic(opt->equivalent_pos));
519
      break;
520
521
522
523
524
525
526
527
528
529
530
531
    case OPT_HIGHLIGHT_NONDET:
      {
        int v = arg ? to_pos_int(arg) : 1;
        opt_highlight_nondet_edges = opt_highlight_nondet_states = v;
        break;
      }
    case OPT_HIGHLIGHT_NONDET_STATES:
      opt_highlight_nondet_states = arg ? to_pos_int(arg) : 1;
      break;
    case OPT_HIGHLIGHT_NONDET_EDGES:
      opt_highlight_nondet_edges = arg ? to_pos_int(arg) : 1;
      break;
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
    case OPT_HIGHLIGHT_WORD:
      {
        char* endptr;
        int res = strtol(arg, &endptr, 10);
        if (endptr == arg)
          {
            res = 1;
          }
        else
          {
            if (res < 0)
              error(2, 0, "failed to parse the argument of --highlight-word: "
                    "%d is not positive", res);
            while (std::isspace(*endptr))
              ++endptr;
            if (*endptr != ',')
              error(2, 0, "failed to parse the argument of --highlight-word: "
                    "%d should be followed by a comma and WORD", res);
            arg = endptr + 1;
          }
        try
          {
            opt->hl_words.emplace_back(spot::parse_word(arg, opt->dict)
                                       ->as_automaton(), res);
          }
        catch (const spot::parse_error& e)
          {
            error(2, 0, "failed to parse the argument of --highlight-word:\n%s",
                  e.what());
          }
      }
      break;

565
    case OPT_INSTUT:
566
      if (!arg || (arg[0] == '1' && arg[1] == 0))
567
        opt_instut = 1;
568
      else if (arg[0] == '2' && arg[1] == 0)
569
        opt_instut = 2;
570
      else
571
        error(2, 0, "unknown argument for --instut: %s", arg);
572
      break;
573
574
    case OPT_INCLUDED_IN:
      {
575
576
577
578
579
580
        auto aut = ensure_deterministic(read_automaton(arg, opt->dict));
        aut = spot::dtwa_complement(aut);
        if (!opt->included_in)
          opt->included_in = aut;
        else
          opt->included_in = spot::product_or(opt->included_in, aut);
581
582
      }
      break;
583
584
585
586
587
    case OPT_INHERENTLY_WEAK_SCCS:
      opt_inhweak_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_inhweak_sccs_set = true;
      opt_art_sccs_set = true;
      break;
588
    case OPT_INTERSECT:
589
      opt->intersect = read_automaton(arg, opt->dict);
590
      break;
591
592
593
594
595
596
    case OPT_IS_COMPLETE:
      opt_is_complete = true;
      break;
    case OPT_IS_DETERMINISTIC:
      opt_is_deterministic = true;
      break;
597
598
599
    case OPT_IS_EMPTY:
      opt_is_empty = true;
      break;
600
601
602
    case OPT_IS_INHERENTLY_WEAK:
      opt_is_inherently_weak = true;
      break;
603
604
    case OPT_IS_STUTTER_INVARIANT:
      opt_is_stutter_invariant = true;
605
      break;
606
607
608
    case OPT_IS_TERMINAL:
      opt_is_terminal = true;
      break;
609
610
611
    case OPT_IS_UNAMBIGUOUS:
      opt_is_unambiguous = true;
      break;
612
613
614
    case OPT_IS_WEAK:
      opt_is_weak = true;
      break;
615
616
617
618
619
620
    case OPT_KEEP_STATES:
      {
        std::vector<long> values = to_longs(arg);
        if (!values.empty())
          opt_keep_states_initial = values[0];
        for (auto res : values)
621
622
623
624
          {
            if (res < 0)
              error(2, 0, "state ids should be non-negative:"
                    " --mask-acc=%ld", res);
625
626
627
            // We don't know yet how many states the automata contain.
            if (opt_keep_states.size() <= static_cast<unsigned long>(res))
              opt_keep_states.resize(res + 1, false);
628
629
630
631
            opt_keep_states[res] = true;
          }
        opt_rem_unreach = true;
        break;
632
      }
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
    case OPT_MERGE:
      opt_merge = true;
      break;
    case OPT_MASK_ACC:
      {
        for (auto res : to_longs(arg))
          {
            if (res < 0)
              error(2, 0, "acceptance sets should be non-negative:"
                    " --mask-acc=%ld", res);
            if (static_cast<unsigned long>(res)
                > sizeof(spot::acc_cond::mark_t::value_t))
              error(2, 0, "this implementation does not support that many"
                    " acceptance sets: --mask-acc=%ld", res);
            opt_mask_acc.set(res);
          }
        break;
      }
    case OPT_NONDET_STATES:
      opt_nondet_states = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_nondet_states_set = true;
      break;
655
    case OPT_PRODUCT_AND:
656
      {
657
658
659
660
661
662
        auto a = read_automaton(arg, opt->dict);
        if (!opt->product_and)
          opt->product_and = std::move(a);
        else
          opt->product_and = spot::product(std::move(opt->product_and),
                                           std::move(a));
663
664
665
666
      }
      break;
    case OPT_PRODUCT_OR:
      {
667
668
669
670
671
672
        auto a = read_automaton(arg, opt->dict);
        if (!opt->product_or)
          opt->product_or = std::move(a);
        else
          opt->product_or = spot::product_or(std::move(opt->product_or),
                                             std::move(a));
673
674
      }
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
675
676
    case OPT_RANDOMIZE:
      if (arg)
677
678
679
680
681
682
683
684
685
686
687
688
689
690
        {
          for (auto p = arg; *p; ++p)
            switch (*p)
              {
              case 's':
                randomize_st = true;
                break;
              case 't':
                randomize_tr = true;
                break;
              default:
                error(2, 0, "unknown argument for --randomize: '%c'", *p);
              }
        }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
691
      else
692
693
694
695
        {
          randomize_tr = true;
          randomize_st = true;
        }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
696
      break;
697
698
699
700
    case OPT_REJ_SCCS:
      opt_rej_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_art_sccs_set = true;
      break;
701
702
    case OPT_REJECT_WORD:
      try
703
704
705
706
        {
          opt->rej_words.push_back(spot::parse_word(arg, opt->dict)
                                   ->as_automaton());
        }
707
      catch (const spot::parse_error& e)
708
709
710
711
        {
          error(2, 0, "failed to parse the argument of --reject-word:\n%s",
                e.what());
        }
712
      break;
713
    case OPT_REM_AP:
714
      opt->rem_ap.add_ap(arg);
715
      break;
716
717
718
    case OPT_REM_DEAD:
      opt_rem_dead = true;
      break;
719
720
721
    case OPT_REM_FIN:
      opt_rem_fin = true;
      break;
722
723
724
    case OPT_REM_UNREACH:
      opt_rem_unreach = true;
      break;
725
726
727
    case OPT_REM_UNUSED_AP:
      opt_rem_unused_ap = true;
      break;
728
729
730
    case OPT_SAT_MINIMIZE:
      opt_sat_minimize = arg ? arg : "";
      break;
731
732
733
734
    case OPT_SCCS:
      opt_sccs_set = true;
      opt_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
735
736
737
    case OPT_SEED:
      opt_seed = to_int(arg);
      break;
738
739
740
    case OPT_SEP_SETS:
      opt_sep_sets = true;
      break;
741
742
743
744
    case OPT_SIMPLIFY_EXCLUSIVE_AP:
      opt_simplify_exclusive_ap = true;
      opt_merge = true;
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
745
746
747
    case OPT_STATES:
      opt_states = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
748
749
750
    case OPT_STRIPACC:
      opt_stripacc = true;
      break;
751
752
753
754
755
756
757
758
759
    case OPT_TERMINAL_SCCS:
      opt_terminal_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_terminal_sccs_set = true;
      opt_art_sccs_set = true;
      break;
    case OPT_TRIV_SCCS:
      opt_triv_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_art_sccs_set = true;
      break;
760
761
762
763
764
765
766
767
    case OPT_USED_AP_N:
      opt_used_ap_n = parse_range(arg, 0, std::numeric_limits<int>::max());
      need_unused_ap_count = true;
      break;
    case OPT_UNUSED_AP_N:
      opt_unused_ap_n = parse_range(arg, 0, std::numeric_limits<int>::max());
      need_unused_ap_count = true;
      break;
768
769
770
771
772
    case OPT_WEAK_SCCS:
      opt_weak_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_weak_sccs_set = true;
      opt_art_sccs_set = true;
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
773
774
775
776
777
778
779
780
781
782
    case ARGP_KEY_ARG:
      jobs.emplace_back(arg, true);
      break;

    default:
      return ARGP_ERR_UNKNOWN;
    }
  return 0;
}

783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
static int unused_ap(const spot::const_twa_graph_ptr& aut)
{
  bdd all = aut->ap_vars();
  for (auto& e: aut->edges())
    {
      all = bdd_exist(all, bdd_support(e.cond));
      if (all == bddtrue)    // All APs are used.
        return 0;
    }
  int count = 0;
  while (all != bddtrue)
    {
      ++count;
      all = bdd_high(all);
    }
  return count;
}
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
800
801
802

namespace
{
803
  class hoa_processor final: public job_processor
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
804
  {
805
  private:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
806
    spot::postprocessor& post;
807
    automaton_printer printer;
808
  public:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
809
810

    hoa_processor(spot::postprocessor& post)
811
      : post(post), printer(aut_input)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
812
813
814
815
    {
    }

    int
816
    process_formula(spot::formula, const char*, int) override
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
817
818
819
820
821
    {
      SPOT_UNREACHABLE();
    }

    int
822
    process_automaton(const spot::const_parsed_aut_ptr& haut,
823
                      const char* filename)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
824
825
826
    {
      spot::stopwatch sw;
      sw.start();
827

828
829
      // If --stats or --name is used, duplicate the automaton so we
      // never modify the original automaton (e.g. with
830
      // merge_edges()) and the statistics about it make sense.
831
      auto aut = ((automaton_format == Stats) || opt_name)
832
833
        ? spot::make_twa_graph(haut->aut, spot::twa::prop_set::all())
        : haut->aut;
834

835
836
      // Preprocessing.

837
      if (opt_stripacc)
838
        spot::strip_acceptance_here(aut);
839
      if (opt_merge)
840
        aut->merge_edges();
841
      if (opt_clean_acc || opt_rem_fin)
842
        cleanup_acceptance_here(aut);
843
      if (opt_sep_sets)
844
        separate_sets_here(aut);
845
      if (opt_complement_acc)
846
847
        aut->set_acceptance(aut->acc().num_sets(),
                            aut->get_acceptance().complement());
848
      if (opt_rem_fin)
849
        aut = remove_fin(aut);
850
      if (opt_dnf_acc)
851
852
        aut->set_acceptance(aut->acc().num_sets(),
                            aut->get_acceptance().to_dnf());
853
      if (opt_cnf_acc)
854
855
        aut->set_acceptance(aut->acc().num_sets(),
                            aut->get_acceptance().to_cnf());
856

857
858
859
860
      // Filters.

      bool matched = true;

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
861
      matched &= opt_states.contains(aut->num_states());
862
      matched &= opt_edges.contains(aut->num_edges());
863
      matched &= opt_accsets.contains(aut->acc().num_sets());
864
      matched &= opt_ap_n.contains(aut->ap().size());
865
866
867
868
869
870
871
      if (matched && need_unused_ap_count)
        {
          int unused = unused_ap(aut);
          matched &= opt_unused_ap_n.contains(unused);
          matched &= opt_used_ap_n.contains(aut->ap().size() - unused);
        }
      if (matched && opt_is_complete)
872
        matched &= is_complete(aut);
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
      if (matched && (opt_sccs_set | opt_art_sccs_set))
        {
          spot::scc_info si(aut);
          unsigned n = si.scc_count();
          matched = opt_sccs.contains(n);

          if (opt_art_sccs_set && matched)
            {
              si.determine_unknown_acceptance();
              unsigned triv = 0;
              unsigned acc = 0;
              unsigned rej = 0;
              unsigned inhweak = 0;
              unsigned weak = 0;
              unsigned terminal = 0;
              for (unsigned s = 0; s < n; ++s)
                if (si.is_trivial(s))
                  {
                    ++triv;
                  }
                else if (si.is_rejecting_scc(s))
                  {
                    ++rej;
                  }
                else
                  {
                    ++acc;
                    if (opt_inhweak_sccs_set)
                      inhweak += is_inherently_weak_scc(si, s);
                    if (opt_weak_sccs_set)
                      weak += is_weak_scc(si, s);
                    if (opt_terminal_sccs_set)
                      terminal += is_terminal_scc(si, s);
                  }
              matched &= opt_acc_sccs.contains(acc);
              matched &= opt_rej_sccs.contains(rej);
              matched &= opt_triv_sccs.contains(triv);
              matched &= opt_inhweak_sccs.contains(inhweak);
              matched &= opt_weak_sccs.contains(weak);
              matched &= opt_terminal_sccs.contains(terminal);
            }
        }
915
916
      if (opt_nondet_states_set)
        matched &= opt_nondet_states.contains(spot::count_nondet_states(aut));
917
      if (opt_is_deterministic)
918
        matched &= is_deterministic(aut);
919
      else if (opt_is_unambiguous)
920
        matched &= is_unambiguous(aut);
921
      if (opt_is_terminal)
922
        matched &= is_terminal_automaton(aut);
923
      else if (opt_is_weak)
924
        matched &= is_weak_automaton(aut);
925
      else if (opt_is_inherently_weak)
926
        matched &= is_inherently_weak_automaton(aut);
927
928
      if (opt->are_isomorphic)
        matched &= opt->isomorphism_checker->is_isomorphic(aut);
929
      if (opt_is_empty)
930
        matched &= aut->is_empty();
931
      if (opt->intersect)
932
        matched &= !spot::product(aut, opt->intersect)->is_empty();
933
      if (opt->included_in)
934
        matched &= spot::product(aut, opt->included_in)->is_empty();
935
      if (opt->equivalent_pos)
936
937
938
        matched &= spot::product(aut, opt->equivalent_neg)->is_empty()
          && spot::product(dtwa_complement(ensure_deterministic(aut)),
                           opt->equivalent_pos)->is_empty();
939
940

      if (matched && !opt->acc_words.empty())
941
942
943
944
945
946
        for (auto& word_aut: opt->acc_words)
          if (spot::product(aut, word_aut)->is_empty())
            {
              matched = false;
              break;
            }
947
      if (matched && !opt->rej_words.empty())
948
949
950
951
952
953
        for (auto& word_aut: opt->rej_words)
          if (!spot::product(aut, word_aut)->is_empty())
            {
              matched = false;
              break;
            }
954
955
956
957
958
959
      if (opt_is_stutter_invariant)
        {
          check_stutter_invariance(aut);
          assert(aut->prop_stutter_invariant().is_known());
          matched &= aut->prop_stutter_invariant().is_true();
        }
960

961
962
      // Drop or keep matched automata depending on the --invert option
      if (matched == opt_invert)
963
964
        return 0;

965
966
      // Postprocessing.

967
      if (opt_mask_acc)
968
        aut = mask_acc_sets(aut, opt_mask_acc & aut->acc().all_sets());
969

970
      if (!opt->rem_ap.empty())
971
        aut = opt->rem_ap.strip(aut);
972

973
974
975
976
977
      // opt_simplify_exclusive_ap is handled only after
      // post-processing.
      if (!opt->excl_ap.empty())
        aut = opt->excl_ap.constrain(aut, false);

978
      if (opt_destut)
979
        aut = spot::closure(std::move(aut));
980
      if (opt_instut == 1)
981
        aut = spot::sl(std::move(aut));
982
      else if (opt_instut == 2)
983
        aut = spot::sl2(std::move(aut));
984

985
      if (!opt_keep_states.empty())
986
        aut = mask_keep_states(aut, opt_keep_states, opt_keep_states_initial);
987
      if (opt_rem_dead)
988
        aut->purge_dead_states();
989
      else if (opt_rem_unreach)
990
        aut->purge_unreachable_states();
991

992
      if (opt->product_and)
993
        aut = spot::product(std::move(aut), opt->product_and);
994
      if (opt->product_or)
995
        aut = spot::product_or(std::move(aut), opt->product_or);
996

997
      if (opt_decompose_strength)
998
999
1000
1001
1002
        {
          aut = decompose_strength(aut, opt_decompose_strength);
          if (!aut)
            return 0;
        }
1003

1004
      if (opt_sat_minimize)
1005
1006
1007
1008
1009
        {
          aut = spot::sat_minimize(aut, opt_sat_minimize, sbacc);
          if (!aut)
            return 0;
        }
1010

1011
      if (opt_complement)
1012
        aut = spot::dtwa_complement(ensure_deterministic(aut));
1013

1014
      aut = post.run(aut, nullptr);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1015

1016
      if (opt_simplify_exclusive_ap && !opt->excl_ap.empty())
1017
1018
1019
        aut = opt->excl_ap.constrain(aut, true);
      else if (opt_rem_unused_ap) // constrain(aut, true) already does that
        aut->remove_unused_ap();
1020

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1021
      if (randomize_st || randomize_tr)
1022
        spot::randomize(aut, randomize_st, randomize_tr);
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1023

1024
1025
1026
1027
1028
      if (opt_highlight_nondet_states >= 0)
        spot::highlight_nondet_states(aut, opt_highlight_nondet_states);
      if (opt_highlight_nondet_edges >= 0)
        spot::highlight_nondet_edges(aut, opt_highlight_nondet_edges);

Alexandre Duret-Lutz's avatar