autfilt.cc 44.6 KB
Newer Older
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1
// -*- coding: utf-8 -*-
2
3
// Copyright (C) 2013, 2014, 2015, 2016, 2017 Laboratoire de Recherche
// et 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>
27
28
#include <sys/stat.h>
#include <unistd.h>
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
29
30
31

#include <argp.h>
#include "error.h"
32
#include "argmatch.h"
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
33
34
35
36

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

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

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
73
static const char argp_program_doc[] ="\
74
Convert, transform, and filter omega-automata.\v\
75
76
77
78
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
79

80
81
// Keep this list sorted
enum {
82
83
  OPT_ACC_SCCS = 256,
  OPT_ACC_SETS,
84
  OPT_ACCEPT_WORD,
85
  OPT_AP_N,
86
87
  OPT_ARE_ISOMORPHIC,
  OPT_CLEAN_ACC,
88
  OPT_CNF_ACC,
89
  OPT_COMPLEMENT,
90
91
  OPT_COMPLEMENT_ACC,
  OPT_COUNT,
92
  OPT_DECOMPOSE_SCC,
93
  OPT_DESTUT,
Thomas Medioni's avatar
Thomas Medioni committed
94
  OPT_DUALIZE,
95
96
  OPT_DNF_ACC,
  OPT_EDGES,
97
  OPT_EQUIVALENT_TO,
98
  OPT_EXCLUSIVE_AP,
99
100
  OPT_GENERALIZED_RABIN,
  OPT_GENERALIZED_STREETT,
101
102
103
  OPT_HIGHLIGHT_NONDET,
  OPT_HIGHLIGHT_NONDET_EDGES,
  OPT_HIGHLIGHT_NONDET_STATES,
104
  OPT_HIGHLIGHT_WORD,
105
  OPT_HIGHLIGHT_LANGUAGES,
106
  OPT_INSTUT,
107
  OPT_INCLUDED_IN,
108
  OPT_INHERENTLY_WEAK_SCCS,
109
  OPT_INTERSECT,
110
  OPT_IS_ALTERNATING,
111
112
113
  OPT_IS_COMPLETE,
  OPT_IS_DETERMINISTIC,
  OPT_IS_EMPTY,
114
  OPT_IS_INHERENTLY_WEAK,
115
  OPT_IS_SEMI_DETERMINISTIC,
116
  OPT_IS_STUTTER_INVARIANT,
117
  OPT_IS_TERMINAL,
118
  OPT_IS_UNAMBIGUOUS,
119
  OPT_IS_VERY_WEAK,
120
  OPT_IS_WEAK,
121
122
123
  OPT_KEEP_STATES,
  OPT_MASK_ACC,
  OPT_MERGE,
124
  OPT_NONDET_STATES,
125
126
  OPT_PRODUCT_AND,
  OPT_PRODUCT_OR,
127
  OPT_RANDOMIZE,
128
  OPT_REJ_SCCS,
129
  OPT_REJECT_WORD,
130
  OPT_REM_AP,
131
132
  OPT_REM_DEAD,
  OPT_REM_UNREACH,
133
  OPT_REM_UNUSED_AP,
134
  OPT_REM_FIN,
135
  OPT_SAT_MINIMIZE,
136
  OPT_SCCS,
137
  OPT_SEED,
138
  OPT_SEP_SETS,
139
  OPT_SIMPL_ACC,
140
  OPT_SIMPLIFY_EXCLUSIVE_AP,
141
  OPT_SPLIT_EDGES,
142
143
  OPT_STATES,
  OPT_STRIPACC,
144
145
  OPT_SUM_OR,
  OPT_SUM_AND,
146
147
  OPT_TERMINAL_SCCS,
  OPT_TRIV_SCCS,
148
149
  OPT_USED_AP_N,
  OPT_UNUSED_AP_N,
150
  OPT_WEAK_SCCS,
151
};
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
152

153
154
#define DOC(NAME, TXT) NAME, 0, nullptr, OPTION_DOC | OPTION_NO_USAGE, TXT, 0

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
155
156
157
static const argp_option options[] =
  {
    /**************************************************/
158
    { nullptr, 0, nullptr, 0, "Input:", 1 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
159
160
161
    { "file", 'F', "FILENAME", 0,
      "process the automaton in FILENAME", 0 },
    /**************************************************/
162
    { "count", 'c', nullptr, 0, "print only a count of matched automata", 3 },
163
    { "max-count", 'n', "NUM", 0, "output at most NUM automata", 3 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
164
    /**************************************************/
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
    { 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 },
184
185
    { "is-semi-deterministic", OPT_IS_SEMI_DETERMINISTIC, nullptr, 0,
      "keep semi-deterministic automata", 0 },
186
187
    { "is-empty", OPT_IS_EMPTY, nullptr, 0,
      "keep automata with an empty language", 0 },
188
189
    { "is-stutter-invariant", OPT_IS_STUTTER_INVARIANT, nullptr, 0,
      "keep automata representing stutter-invariant properties", 0 },
190
191
    { "is-terminal", OPT_IS_TERMINAL, nullptr, 0,
      "keep only terminal automata", 0 },
192
193
    { "is-unambiguous", OPT_IS_UNAMBIGUOUS, nullptr, 0,
      "keep only unambiguous automata", 0 },
194
195
196
197
    { "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 },
198
199
    { "is-very-weak", OPT_IS_VERY_WEAK, nullptr, 0,
      "keep only very-weak automata", 0 },
200
201
    { "is-alternating", OPT_IS_ALTERNATING, nullptr, 0,
      "keep only automata using universal branching", 0 },
202
203
204
205
206
207
208
209
210
211
212
213
214
215
    { "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 },
216
217
    { "nondet-states", OPT_NONDET_STATES, "RANGE", 0,
      "keep automata whose number of nondeterministic states is in RANGE", 0 },
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
    { "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 },
252
    { "merge-transitions", OPT_MERGE, nullptr, 0,
253
      "merge transitions with same destination and acceptance", 0 },
254
255
256
    { "product", OPT_PRODUCT_AND, "FILENAME", 0,
      "build the product with the automaton in FILENAME "
      "to intersect languages", 0 },
257
    { "product-and", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
258
259
260
    { "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
261
    { "randomize", OPT_RANDOMIZE, "s|t", OPTION_ARG_OPTIONAL,
262
      "randomize states and transitions (specify 's' or 't' to "
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
263
      "randomize only states or transitions)", 0 },
264
265
    { "instut", OPT_INSTUT, "1|2", OPTION_ARG_OPTIONAL,
      "allow more stuttering (two possible algorithms)", 0 },
266
    { "destut", OPT_DESTUT, nullptr, 0, "allow less stuttering", 0 },
267
268
    { "mask-acc", OPT_MASK_ACC, "NUM[,NUM...]", 0,
      "remove all transitions in specified acceptance sets", 0 },
269
    { "strip-acceptance", OPT_STRIPACC, nullptr, 0,
270
      "remove the acceptance condition and all acceptance sets", 0 },
271
272
    { "keep-states", OPT_KEEP_STATES, "NUM[,NUM...]", 0,
      "only keep specified states.  The first state will be the new "\
273
      "initial state.  Implies --remove-unreachable-states.", 0 },
274
    { "dnf-acceptance", OPT_DNF_ACC, nullptr, 0,
275
      "put the acceptance condition in Disjunctive Normal Form", 0 },
276
    { "cnf-acceptance", OPT_CNF_ACC, nullptr, 0,
277
      "put the acceptance condition in Conjunctive Normal Form", 0 },
278
    { "remove-fin", OPT_REM_FIN, nullptr, 0,
279
      "rewrite the automaton without using Fin acceptance", 0 },
280
281
282
283
284
285
286
287
288
289
290
291
292
293
    { "generalized-rabin", OPT_GENERALIZED_RABIN,
      "unique-inf|share-inf", OPTION_ARG_OPTIONAL,
      "rewrite the acceptance condition as generalized Rabin; the default "
      "\"unique-inf\" option uses the generalized Rabin definition from the "
      "HOA format; the \"share-inf\" option allows clauses to share Inf sets, "
      "therefore reducing the number of sets", 0 },
    { "gra", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
    { "generalized-streett", OPT_GENERALIZED_STREETT,
      "unique-fin|share-fin", OPTION_ARG_OPTIONAL,
      "rewrite the acceptance condition as generalized Streett;"
      " the \"share-fin\" option allows clauses to share Fin sets,"
      " therefore reducing the number of sets; the default"
      " \"unique-fin\" does not", 0 },
    { "gsa", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
294
    { "cleanup-acceptance", OPT_CLEAN_ACC, nullptr, 0,
295
      "remove unused acceptance sets from the automaton", 0 },
296
297
298
    { "complement", OPT_COMPLEMENT, nullptr, 0,
      "complement each automaton (currently support only deterministic "
      "automata)", 0 },
299
    { "complement-acceptance", OPT_COMPLEMENT_ACC, nullptr, 0,
300
301
      "complement the acceptance condition (without touching the automaton)",
      0 },
302
    { "decompose-scc", OPT_DECOMPOSE_SCC, "t|w|s|N|aN", 0,
303
      "extract the (t) terminal, (w) weak, or (s) strong part of an automaton"
304
305
306
307
      " or (N) the subautomaton leading to the Nth SCC, or (aN) to the Nth "
      "accepting SCC (option can be combined with ccomas to extract multiple "
      "parts)", 0 },
    { "decompose-strength", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
Thomas Medioni's avatar
Thomas Medioni committed
308
309
    { "dualize", OPT_DUALIZE, nullptr, 0,
      "dualize each automaton", 0 },
310
311
312
313
314
    { "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 },
315
    { "simplify-exclusive-ap", OPT_SIMPLIFY_EXCLUSIVE_AP, nullptr, 0,
316
317
318
      "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 },
319
320
321
    { "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 },
322
323
    { "remove-unused-ap", OPT_REM_UNUSED_AP, nullptr, 0,
      "remove declared atomic propositions that are not used", 0 },
324
    { "remove-unreachable-states", OPT_REM_UNREACH, nullptr, 0,
325
      "remove states that are unreachable from the initial state", 0 },
326
    { "remove-dead-states", OPT_REM_DEAD, nullptr, 0,
327
328
      "remove states that are unreachable, or that cannot belong to an "
      "infinite path", 0 },
329
330
331
    { "simplify-acceptance", OPT_SIMPL_ACC, nullptr, 0,
      "simplify the acceptance condition by merging identical acceptance sets "
      "and by simplifying some terms containing complementary sets", 0 },
332
333
334
    { "split-edges", OPT_SPLIT_EDGES, nullptr, 0,
      "split edges into transitions labeled by conjunctions of all atomic "
      "propositions, so they can be read as letters", 0 },
335
336
337
338
339
340
341
    { "sum", OPT_SUM_OR, "FILENAME", 0,
      "build the sum with the automaton in FILENAME "
      "to sum languages", 0 },
    { "sum-or", 0, nullptr, OPTION_ALIAS, nullptr, 0 },
    { "sum-and", OPT_SUM_AND, "FILENAME", 0,
      "build the sum with the automaton in FILENAME "
      "to intersect languages", 0 },
342
    { "separate-sets", OPT_SEP_SETS, nullptr, 0,
343
344
      "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 },
345
    { "sat-minimize", OPT_SAT_MINIMIZE, "options", OPTION_ARG_OPTIONAL,
Alexandre Duret-Lutz's avatar
typos    
Alexandre Duret-Lutz committed
346
      "minimize the automaton using a SAT solver (only works for deterministic"
347
348
349
350
351
352
353
      " automata). Supported options are acc=STRING, states=N, max-states=N, "
      "sat-incr=N, sat-incr-steps=N, sat-langmap, sat-naive, colored, preproc=N"
      ". Spot uses by default its PicoSAT distribution but an external SAT"
      "solver can be set thanks to the SPOT_SATSOLVER environment variable"
      "(see spot-x)."
      , 0 },
    { nullptr, 0, nullptr, 0, "Decorations (for -d and -H1.1 output):", 9 },
354
355
    { "highlight-nondet-states", OPT_HIGHLIGHT_NONDET_STATES, "NUM",
      OPTION_ARG_OPTIONAL, "highlight nondeterministic states with color NUM",
356
      0 },
357
358
    { "highlight-nondet-edges", OPT_HIGHLIGHT_NONDET_EDGES, "NUM",
      OPTION_ARG_OPTIONAL, "highlight nondeterministic edges with color NUM",
359
      0 },
360
361
362
    { "highlight-nondet", OPT_HIGHLIGHT_NONDET, "NUM",
      OPTION_ARG_OPTIONAL,
      "highlight nondeterministic states and edges with color NUM", 0},
363
364
    { "highlight-word", OPT_HIGHLIGHT_WORD, "[NUM,]WORD", 0,
      "highlight one run matching WORD using color NUM", 0},
365
    { "highlight-languages", OPT_HIGHLIGHT_LANGUAGES, nullptr, 0 ,
366
      "highlight states that recognize identical languages", 0},
367
    /**************************************************/
368
369
    { nullptr, 0, nullptr, 0,
      "If any option among --small, --deterministic, or --any is given, "
370
      "then the simplification level defaults to --high unless specified "
371
      "otherwise.  If any option among --low, --medium, or --high is given, "
372
      "then the simplification goal defaults to --small unless specified "
373
374
375
      "otherwise.  If none of those options are specified, then autfilt "
      "acts as is --any --low were given: these actually disable the "
      "simplification routines.", 22 },
376
    /**************************************************/
377
    { nullptr, 0, nullptr, 0, "Miscellaneous options:", -1 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
378
379
    { "extra-options", 'x', "OPTS", 0,
      "fine-tuning options (see spot-x (7))", 0 },
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
380
381
    { "seed", OPT_SEED, "INT", 0,
      "seed for the random number generator (0)", 0 },
382
    { nullptr, 0, nullptr, 0, nullptr, 0 }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
383
384
  };

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
385
static const struct argp_child children[] =
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
386
  {
387
    { &hoaread_argp, 0, nullptr, 0 },
388
389
    { &aoutput_argp, 0, nullptr, 0 },
    { &aoutput_io_format_argp, 0, nullptr, 4 },
390
    { &post_argp_disabled, 0, nullptr, 0 },
391
392
    { &misc_argp, 0, nullptr, -1 },
    { nullptr, 0, nullptr, 0 }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
393
394
  };

395

396
typedef spot::twa_graph::graph_t::edge_storage_t tr_t;
397
typedef std::set<std::vector<tr_t>> unique_aut_t;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
398
static long int match_count = 0;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
399
400
401
402
static spot::option_map extra_options;
static bool randomize_st = false;
static bool randomize_tr = false;
static int opt_seed = 0;
403

404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
enum gra_type { GRA_NO = 0, GRA_SHARE_INF = 1, GRA_UNIQUE_INF = 2 };
static gra_type opt_gra = GRA_NO;
static char const *const gra_args[] =
{
  "default", "share-inf", "hoa", "unique-inf", nullptr
};
static gra_type const gra_types[] =
{
  GRA_UNIQUE_INF, GRA_SHARE_INF, GRA_UNIQUE_INF, GRA_UNIQUE_INF
};
ARGMATCH_VERIFY(gra_args, gra_types);

enum gsa_type { GSA_NO = 0, GSA_SHARE_FIN = 1, GSA_UNIQUE_FIN = 2 };
static gsa_type opt_gsa = GSA_NO;
static char const *const gsa_args[] =
{
  "default", "share-fin", "unique-fin", nullptr
};
static gsa_type const gsa_types[] =
{
  GSA_UNIQUE_FIN, GSA_SHARE_FIN, GSA_UNIQUE_FIN
};
ARGMATCH_VERIFY(gsa_args, gsa_types);

428
// We want all these variables to be destroyed when we exit main, to
429
430
431
432
433
434
// 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();
435
436
  spot::twa_graph_ptr product_and = nullptr;
  spot::twa_graph_ptr product_or = nullptr;
437
438
  spot::twa_graph_ptr sum_and = nullptr;
  spot::twa_graph_ptr sum_or = nullptr;
439
  spot::twa_graph_ptr intersect = nullptr;
440
  spot::twa_graph_ptr included_in = nullptr;
441
442
  spot::twa_graph_ptr equivalent_pos = nullptr;
  spot::twa_graph_ptr equivalent_neg = nullptr;
443
  spot::twa_graph_ptr are_isomorphic = nullptr;
444
445
446
  std::unique_ptr<spot::isomorphism_checker>
                         isomorphism_checker = nullptr;
  std::unique_ptr<unique_aut_t> uniq = nullptr;
447
448
  spot::exclusive_ap excl_ap;
  spot::remove_ap rem_ap;
449
  std::vector<spot::twa_graph_ptr> acc_words;
450
  std::vector<spot::twa_graph_ptr> rej_words;
451
  std::vector<std::pair<spot::twa_graph_ptr, unsigned>> hl_words;
452
453
}* opt;

454
static bool opt_merge = false;
455
static bool opt_is_alternating = false;
456
457
static bool opt_is_complete = false;
static bool opt_is_deterministic = false;
458
static bool opt_is_semi_deterministic = false;
459
static bool opt_is_unambiguous = false;
460
461
static bool opt_is_terminal = false;
static bool opt_is_weak = false;
462
static bool opt_is_inherently_weak = false;
463
static bool opt_is_very_weak = false;
464
static bool opt_is_stutter_invariant = false;
465
static bool opt_invert = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
466
static range opt_states = { 0, std::numeric_limits<int>::max() };
467
468
static range opt_edges = { 0, std::numeric_limits<int>::max() };
static range opt_accsets = { 0, std::numeric_limits<int>::max() };
469
static range opt_ap_n = { 0, std::numeric_limits<int>::max() };
470
471
472
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;
473
474
475
476
477
478
479
480
481
482
483
484
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;
485
486
static range opt_nondet_states = { 0, std::numeric_limits<int>::max() };
static bool opt_nondet_states_set = false;
487
static int opt_max_count = -1;
488
static bool opt_destut = false;
489
static char opt_instut = 0;
490
static bool opt_is_empty = false;
491
static bool opt_stripacc = false;
492
static bool opt_dnf_acc = false;
493
static bool opt_cnf_acc = false;
494
static bool opt_rem_fin = false;
495
static bool opt_clean_acc = false;
496
static bool opt_complement = false;
497
static bool opt_complement_acc = false;
498
static char* opt_decompose_scc = nullptr;
Thomas Medioni's avatar
Thomas Medioni committed
499
static bool opt_dualize = false;
500
static spot::acc_cond::mark_t opt_mask_acc = 0U;
501
502
static std::vector<bool> opt_keep_states = {};
static unsigned int opt_keep_states_initial = 0;
503
static bool opt_simpl_acc = false;
504
static bool opt_simplify_exclusive_ap = false;
505
506
static bool opt_rem_dead = false;
static bool opt_rem_unreach = false;
507
static bool opt_rem_unused_ap = false;
508
static bool opt_sep_sets = false;
509
static bool opt_split_edges = false;
510
static const char* opt_sat_minimize = nullptr;
511
512
static int opt_highlight_nondet_states = -1;
static int opt_highlight_nondet_edges = -1;
513
static bool opt_highlight_languages = false;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
514

515
static spot::twa_graph_ptr
516
ensure_deterministic(const spot::twa_graph_ptr& aut, bool nonalt = false)
517
{
518
  if ((!nonalt || aut->is_existential()) && spot::is_deterministic(aut))
519
520
521
522
523
524
525
526
    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
527
528
529
530
531
532
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
533
    case 'c':
534
      automaton_format = Count;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
535
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
536
537
538
    case 'F':
      jobs.emplace_back(arg, true);
      break;
539
540
541
    case 'n':
      opt_max_count = to_pos_int(arg);
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
542
    case 'u':
543
      opt->uniq =
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
544
545
        std::unique_ptr<unique_aut_t>(new std::set<std::vector<tr_t>>());
      break;
546
547
548
    case 'v':
      opt_invert = true;
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
549
550
    case 'x':
      {
551
552
553
        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
554
555
      }
      break;
556
557
558
    case OPT_AP_N:
      opt_ap_n = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
559
560
561
    case OPT_ACC_SETS:
      opt_accsets = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
562
563
564
565
    case OPT_ACC_SCCS:
      opt_acc_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_art_sccs_set = true;
      break;
566
    case OPT_ACCEPT_WORD:
567
      try
568
569
570
571
        {
          opt->acc_words.push_back(spot::parse_word(arg, opt->dict)
                                   ->as_automaton());
        }
572
      catch (const spot::parse_error& e)
573
574
575
576
        {
          error(2, 0, "failed to parse the argument of --accept-word:\n%s",
                e.what());
        }
577
      break;
578
    case OPT_ARE_ISOMORPHIC:
579
      opt->are_isomorphic = read_automaton(arg, opt->dict);
580
      break;
581
582
583
    case OPT_CLEAN_ACC:
      opt_clean_acc = true;
      break;
584
585
586
587
    case OPT_CNF_ACC:
      opt_dnf_acc = false;
      opt_cnf_acc = true;
      break;
588
    case OPT_COMPLEMENT:
Thomas Medioni's avatar
Thomas Medioni committed
589
590
591
      if (opt_dualize)
        error(2, 0, "either --complement or --dualize options"
                    " can be given, not both");
592
593
      opt_complement = true;
      break;
594
595
596
    case OPT_COMPLEMENT_ACC:
      opt_complement_acc = true;
      break;
597
    case OPT_DECOMPOSE_SCC:
598
      opt_decompose_scc = arg;
599
      break;
600
601
602
    case OPT_DESTUT:
      opt_destut = true;
      break;
Thomas Medioni's avatar
Thomas Medioni committed
603
604
605
606
607
608
    case OPT_DUALIZE:
      if (opt_complement)
        error(2, 0, "either --complement or --dualize options"
                    " can be given, not both");
      opt_dualize = true;
      break;
609
610
    case OPT_DNF_ACC:
      opt_dnf_acc = true;
611
      opt_cnf_acc = false;
612
      break;
613
614
615
    case OPT_EDGES:
      opt_edges = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
616
    case OPT_EXCLUSIVE_AP:
617
      opt->excl_ap.add_group(arg);
618
      break;
619
620
    case OPT_EQUIVALENT_TO:
      if (opt->equivalent_pos)
621
        error(2, 0, "only one --equivalent-to option can be given");
622
623
      opt->equivalent_pos = read_automaton(arg, opt->dict);
      opt->equivalent_neg =
624
        spot::dualize(ensure_deterministic(opt->equivalent_pos, true));
625
      break;
626
627
628
629
630
631
632
633
634
635
636
637
638
639
    case OPT_GENERALIZED_RABIN:
      if (arg)
        opt_gra = XARGMATCH("--generalized-rabin", arg, gra_args, gra_types);
      else
        opt_gra = GRA_UNIQUE_INF;
      opt_gsa = GSA_NO;
      break;
    case OPT_GENERALIZED_STREETT:
      if (arg)
        opt_gsa = XARGMATCH("--generalized-streett", arg, gsa_args, gsa_types);
      else
        opt_gsa = GSA_UNIQUE_FIN;
      opt_gra = GRA_NO;
      break;
640
641
642
643
644
645
646
647
648
649
650
651
    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;
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
    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;
684
685
686
    case OPT_HIGHLIGHT_LANGUAGES:
      opt_highlight_languages = true;
      break;
687
    case OPT_INSTUT:
688
      if (!arg || (arg[0] == '1' && arg[1] == 0))
689
        opt_instut = 1;
690
      else if (arg[0] == '2' && arg[1] == 0)
691
        opt_instut = 2;
692
      else
693
        error(2, 0, "unknown argument for --instut: %s", arg);
694
      break;
695
696
    case OPT_INCLUDED_IN:
      {
697
        auto aut = ensure_deterministic(read_automaton(arg, opt->dict), true);
698
        aut = spot::dualize(aut);
699
700
701
702
        if (!opt->included_in)
          opt->included_in = aut;
        else
          opt->included_in = spot::product_or(opt->included_in, aut);
703
704
      }
      break;
705
706
707
708
709
    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;
710
    case OPT_INTERSECT:
711
      opt->intersect = read_automaton(arg, opt->dict);
712
      break;
713
714
715
    case OPT_IS_ALTERNATING:
      opt_is_alternating = true;
      break;
716
717
718
719
720
721
    case OPT_IS_COMPLETE:
      opt_is_complete = true;
      break;
    case OPT_IS_DETERMINISTIC:
      opt_is_deterministic = true;
      break;
722
723
724
    case OPT_IS_EMPTY:
      opt_is_empty = true;
      break;
725
726
727
    case OPT_IS_INHERENTLY_WEAK:
      opt_is_inherently_weak = true;
      break;
728
729
730
    case OPT_IS_VERY_WEAK:
      opt_is_very_weak = true;
      break;
731
732
733
    case OPT_IS_SEMI_DETERMINISTIC:
      opt_is_semi_deterministic = true;
      break;
734
735
    case OPT_IS_STUTTER_INVARIANT:
      opt_is_stutter_invariant = true;
736
      break;
737
738
739
    case OPT_IS_TERMINAL:
      opt_is_terminal = true;
      break;
740
741
742
    case OPT_IS_UNAMBIGUOUS:
      opt_is_unambiguous = true;
      break;
743
744
745
    case OPT_IS_WEAK:
      opt_is_weak = true;
      break;
746
747
748
749
750
751
    case OPT_KEEP_STATES:
      {
        std::vector<long> values = to_longs(arg);
        if (!values.empty())
          opt_keep_states_initial = values[0];
        for (auto res : values)
752
753
754
755
          {
            if (res < 0)
              error(2, 0, "state ids should be non-negative:"
                    " --mask-acc=%ld", res);
756
757
758
            // 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);
759
760
761
            opt_keep_states[res] = true;
          }
        break;
762
      }
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
    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;
785
    case OPT_PRODUCT_AND:
786
      {
787
788
789
790
791
792
        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));
793
794
795
796
      }
      break;
    case OPT_PRODUCT_OR:
      {
797
798
799
800
801
802
        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));
803
804
      }
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
805
806
    case OPT_RANDOMIZE:
      if (arg)
807
808
809
810
811
812
813
814
815
816
817
818
819
820
        {
          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
821
      else
822
823
824
825
        {
          randomize_tr = true;
          randomize_st = true;
        }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
826
      break;
827
828
829
830
    case OPT_REJ_SCCS:
      opt_rej_sccs = parse_range(arg, 0, std::numeric_limits<int>::max());
      opt_art_sccs_set = true;
      break;
831
832
    case OPT_REJECT_WORD:
      try
833
834
835
836
        {
          opt->rej_words.push_back(spot::parse_word(arg, opt->dict)
                                   ->as_automaton());
        }
837
      catch (const spot::parse_error& e)
838
839
840
841
        {
          error(2, 0, "failed to parse the argument of --reject-word:\n%s",
                e.what());
        }
842
      break;
843
    case OPT_REM_AP:
844
      opt->rem_ap.add_ap(arg);
845
      break;
846
847
848
    case OPT_REM_DEAD:
      opt_rem_dead = true;
      break;
849
850
851
    case OPT_REM_FIN:
      opt_rem_fin = true;
      break;
852
853
854
    case OPT_REM_UNREACH:
      opt_rem_unreach = true;
      break;
855
856
857
    case OPT_REM_UNUSED_AP:
      opt_rem_unused_ap = true;
      break;
858
859
860
    case OPT_SAT_MINIMIZE:
      opt_sat_minimize = arg ? arg : "";
      break;
861
862
863
864
    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
865
866
867
    case OPT_SEED:
      opt_seed = to_int(arg);
      break;
868
869
870
    case OPT_SEP_SETS:
      opt_sep_sets = true;
      break;
871
872
873
    case OPT_SIMPL_ACC:
      opt_simpl_acc = true;
      break;
874
875
876
877
    case OPT_SIMPLIFY_EXCLUSIVE_AP:
      opt_simplify_exclusive_ap = true;
      opt_merge = true;
      break;
878
879
880
    case OPT_SPLIT_EDGES:
      opt_split_edges = true;
      break;
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
881
882
883
    case OPT_STATES:
      opt_states = parse_range(arg, 0, std::numeric_limits<int>::max());
      break;
884
885
886
    case OPT_STRIPACC:
      opt_stripacc = true;
      break;
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
    case OPT_SUM_OR:
      {
        auto a = read_automaton(arg, opt->dict);
        if (!opt->sum_or)
          opt->sum_or = std::move(a);
        else
          opt->sum_or = spot::sum(std::move(opt->sum_or),
                                  std::move(a));
      }
      break;
    case OPT_SUM_AND:
      {
        auto a = read_automaton(arg, opt->dict);
        if (!opt->sum_and)
          opt->sum_and = std::move(a);
        else
          opt->sum_and = spot::sum_and(std::move(opt->sum_and),
                                       std::move(a));
      }
      break;
907
908
909
910
911
912
913
914
915
    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;
916
917
918
919
920
921
922
923
    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;
924
925
926
927
928
    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
929
930
931
932
933
934
935
936
937
938
    case ARGP_KEY_ARG:
      jobs.emplace_back(arg, true);
      break;

    default:
      return ARGP_ERR_UNKNOWN;
    }
  return 0;
}

939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
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
956
957
958

namespace
{
959
960

  struct autfilt_processor: hoa_processor
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
961
  {
962
  private:
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
963
    spot::postprocessor& post;
964
    automaton_printer printer;
965
  public:
966
967
    autfilt_processor(spot::postprocessor& post, spot::bdd_dict_ptr dict)
      : hoa_processor(dict), post(post), printer(aut_input)
968
969
970
    {
    }

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
971
    int
972
    process_automaton(const spot::const_parsed_aut_ptr& haut) override
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
973
    {
974
975
      process_timer timer;
      timer.start();
976

977
978
      // If --stats or --name is used, duplicate the automaton so we
      // never modify the original automaton (e.g. with
979
      // merge_edges()) and the statistics about it make sense.
980
      auto aut = ((automaton_format == Stats) || opt_name)
981
982
        ? spot::make_twa_graph(haut->aut, spot::twa::prop_set::all())
        : haut->aut;
983

984
985
      // Preprocessing.

986
      if (opt_stripacc)
987
        spot::strip_acceptance_here(aut);
988
      if (opt_merge)
989
        aut->merge_edges();
990
991
992
993

      if (opt_simpl_acc)
        simplify_acceptance_here(aut);
      else if (opt_clean_acc)
994
        cleanup_acceptance_here(aut);
995

996
      if (opt_sep_sets)
997
        separate_sets_here(aut);
998
      if (opt_complement_acc)
999
1000
        aut->set_acceptance(aut->acc().num_sets(),
                            aut->get_acceptance().complement());
1001
      if (opt_rem_fin)
1002
        aut = remove_fin(aut);
1003
      if (opt_dnf_acc)
1004
1005
        aut->set_acceptance(aut->acc().num_sets(),
                            aut->get_acceptance().to_dnf());
1006
      if (opt_cnf_acc)
1007
1008
        aut->set_acceptance(aut->acc().num_sets(),
                            aut->get_acceptance().to_cnf());
1009

1010
1011
1012
1013
      // Filters.

      bool matched = true;

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1014
      matched &= opt_states.contains(aut->num_states());
1015
      matched &= opt_edges.contains(aut->num_edges());
1016
      matched &= opt_accsets.contains(aut->acc().num_sets());
1017
      matched &= opt_ap_n.contains(aut->ap().size());
1018
1019
1020
1021
1022
1023
      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);
        }
1024
      if (matched && opt_is_alternating)
1025
        matched &= !aut->is_existential();
1026
      if (matched && opt_is_complete)
1027
        matched &= is_complete(aut);
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
      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);
            }
        }
1070
1071
      if (opt_nondet_states_set)
        matched