2a38328a5c
Because the loops iterate in the opposite order, multiple test cases need to be adjusted. * spot/taalgos/tgba2ta.cc, spot/twaalgos/alternation.cc, spot/twaalgos/dualize.cc, spot/twaalgos/ltl2tgba_fm.cc, spot/twaalgos/simulation.cc, spot/twaalgos/stutter.cc, spot/twaalgos/toweak.cc: Replace loops based on bdd_satonest(x,y,bddtrue) by loops based on minterms_of(x,y). * tests/core/degenscc.test, tests/core/dualize.test, tests/core/genltl.test, tests/core/readsave.test, tests/python/alternation.ipynb, tests/python/automata.ipynb, tests/python/decompose.ipynb, tests/python/decompose_scc.py, tests/python/dualize.py, tests/python/sccinfo.py, tests/python/simstate.py, tests/python/testingaut.ipynb, tests/python/word.ipynb: Adjust expected test cases. The only regression is in genltl.test, but the worsened case should eventually be fixed as discussed in issue #425 anyway.
106 lines
2.3 KiB
Python
106 lines
2.3 KiB
Python
# -*- mode: python; coding: utf-8 -*-
|
|
# Copyright (C) 2017, 2021 Laboratoire de Recherche et
|
|
# Développement de l'Epita
|
|
#
|
|
# 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/>.
|
|
|
|
import spot
|
|
|
|
aut = spot.translate('(Ga -> Gb) W c')
|
|
si = spot.scc_info(aut)
|
|
|
|
# Extract the only rejecting SCC. Its number might differ
|
|
# if the generation of the automaton changes, so just scan
|
|
# for it.
|
|
rej = [j for j in range(si.scc_count()) if si.is_rejecting_scc(j)]
|
|
assert len(rej) == 1
|
|
s = spot.decompose_scc(si, rej[0]).to_str('hoa', '1.1')
|
|
|
|
assert (s == """HOA: v1.1
|
|
States: 3
|
|
Start: 0
|
|
AP: 3 "b" "a" "c"
|
|
acc-name: Buchi
|
|
Acceptance: 1 Inf(0)
|
|
properties: trans-labels explicit-labels state-acc !complete
|
|
properties: deterministic terminal
|
|
--BODY--
|
|
State: 0
|
|
[!1&!2] 0
|
|
[1&!2] 1
|
|
State: 1
|
|
[!1&!2] 0
|
|
[1&!2] 1
|
|
[1&2] 2
|
|
State: 2
|
|
[1] 2
|
|
--END--""")
|
|
|
|
try:
|
|
spot.decompose_scc(si, 4)
|
|
except RuntimeError:
|
|
pass
|
|
else:
|
|
raise AssertionError
|
|
|
|
assert (spot.decompose_scc(si, 0, True).to_str('hoa', '1.1') == """HOA: v1.1
|
|
States: 4
|
|
Start: 0
|
|
AP: 3 "b" "a" "c"
|
|
acc-name: Buchi
|
|
Acceptance: 1 Inf(0)
|
|
properties: trans-labels explicit-labels state-acc complete
|
|
properties: deterministic terminal
|
|
--BODY--
|
|
State: 0
|
|
[!1&!2] 0
|
|
[2] 1
|
|
[1&!2] 2
|
|
State: 1 {0}
|
|
[t] 1
|
|
State: 2
|
|
[!1&!2] 0
|
|
[!1&2] 1
|
|
[1&!2] 2
|
|
[1&2] 3
|
|
State: 3
|
|
[!1] 1
|
|
[1] 3
|
|
--END--""")
|
|
|
|
assert (spot.decompose_scc(si, 2, True).to_str('hoa', '1.1') == """HOA: v1.1
|
|
States: 2
|
|
Start: 0
|
|
AP: 3 "b" "a" "c"
|
|
acc-name: Buchi
|
|
Acceptance: 1 Inf(0)
|
|
properties: trans-labels explicit-labels trans-acc !complete
|
|
properties: deterministic !weak
|
|
--BODY--
|
|
State: 0
|
|
[!1&!2] 0 {0}
|
|
[1&!2] 1
|
|
State: 1
|
|
[!1&!2] 0 {0}
|
|
[1&!2] 1
|
|
--END--""")
|
|
|
|
try:
|
|
spot.decompose_scc(si, 3, True)
|
|
except RuntimeError:
|
|
pass
|
|
else:
|
|
raise AssertionError
|