Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020100316.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyB-PT-B05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 7 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 11:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyB-PT-B05-LTLFireability-00
FORMULA_NAME MedleyB-PT-B05-LTLFireability-01
FORMULA_NAME MedleyB-PT-B05-LTLFireability-02
FORMULA_NAME MedleyB-PT-B05-LTLFireability-03
FORMULA_NAME MedleyB-PT-B05-LTLFireability-04
FORMULA_NAME MedleyB-PT-B05-LTLFireability-05
FORMULA_NAME MedleyB-PT-B05-LTLFireability-06
FORMULA_NAME MedleyB-PT-B05-LTLFireability-07
FORMULA_NAME MedleyB-PT-B05-LTLFireability-08
FORMULA_NAME MedleyB-PT-B05-LTLFireability-09
FORMULA_NAME MedleyB-PT-B05-LTLFireability-10
FORMULA_NAME MedleyB-PT-B05-LTLFireability-11
FORMULA_NAME MedleyB-PT-B05-LTLFireability-12
FORMULA_NAME MedleyB-PT-B05-LTLFireability-13
FORMULA_NAME MedleyB-PT-B05-LTLFireability-14
FORMULA_NAME MedleyB-PT-B05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779706188379

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 10:49:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 10:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:49:50] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2026-05-25 10:49:50] [INFO ] Transformed 1831 places.
[2026-05-25 10:49:50] [INFO ] Transformed 3454 transitions.
[2026-05-25 10:49:50] [INFO ] Found NUPN structural information;
[2026-05-25 10:49:50] [INFO ] Parsed PT model containing 1831 places and 3454 transitions and 22350 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyB-PT-B05-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 1831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1831/1831 places, 3454/3454 transitions.
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 144 place count 1687 transition count 3310
Iterating global reduction 0 with 144 rules applied. Total rules applied 288 place count 1687 transition count 3310
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 377 place count 1598 transition count 3221
Iterating global reduction 0 with 89 rules applied. Total rules applied 466 place count 1598 transition count 3221
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 520 place count 1544 transition count 3167
Iterating global reduction 0 with 54 rules applied. Total rules applied 574 place count 1544 transition count 3167
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 621 place count 1497 transition count 3120
Iterating global reduction 0 with 47 rules applied. Total rules applied 668 place count 1497 transition count 3120
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 709 place count 1456 transition count 3079
Iterating global reduction 0 with 41 rules applied. Total rules applied 750 place count 1456 transition count 3079
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 791 place count 1415 transition count 3038
Iterating global reduction 0 with 41 rules applied. Total rules applied 832 place count 1415 transition count 3038
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 871 place count 1376 transition count 2999
Iterating global reduction 0 with 39 rules applied. Total rules applied 910 place count 1376 transition count 2999
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 948 place count 1338 transition count 2961
Iterating global reduction 0 with 38 rules applied. Total rules applied 986 place count 1338 transition count 2961
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 1019 place count 1305 transition count 2928
Iterating global reduction 0 with 33 rules applied. Total rules applied 1052 place count 1305 transition count 2928
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1079 place count 1278 transition count 2901
Iterating global reduction 0 with 27 rules applied. Total rules applied 1106 place count 1278 transition count 2901
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 1111 place count 1278 transition count 2896
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1121 place count 1268 transition count 2886
Iterating global reduction 1 with 10 rules applied. Total rules applied 1131 place count 1268 transition count 2886
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1141 place count 1258 transition count 2876
Iterating global reduction 1 with 10 rules applied. Total rules applied 1151 place count 1258 transition count 2876
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1155 place count 1254 transition count 2872
Iterating global reduction 1 with 4 rules applied. Total rules applied 1159 place count 1254 transition count 2872
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1163 place count 1250 transition count 2868
Iterating global reduction 1 with 4 rules applied. Total rules applied 1167 place count 1250 transition count 2868
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1170 place count 1247 transition count 2865
Iterating global reduction 1 with 3 rules applied. Total rules applied 1173 place count 1247 transition count 2865
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1176 place count 1244 transition count 2862
Iterating global reduction 1 with 3 rules applied. Total rules applied 1179 place count 1244 transition count 2862
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1182 place count 1241 transition count 2859
Iterating global reduction 1 with 3 rules applied. Total rules applied 1185 place count 1241 transition count 2859
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1188 place count 1238 transition count 2856
Iterating global reduction 1 with 3 rules applied. Total rules applied 1191 place count 1238 transition count 2856
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1194 place count 1235 transition count 2853
Iterating global reduction 1 with 3 rules applied. Total rules applied 1197 place count 1235 transition count 2853
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1200 place count 1232 transition count 2850
Iterating global reduction 1 with 3 rules applied. Total rules applied 1203 place count 1232 transition count 2850
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1206 place count 1229 transition count 2847
Iterating global reduction 1 with 3 rules applied. Total rules applied 1209 place count 1229 transition count 2847
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1212 place count 1226 transition count 2844
Iterating global reduction 1 with 3 rules applied. Total rules applied 1215 place count 1226 transition count 2844
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1218 place count 1226 transition count 2841
Applied a total of 1218 rules in 1948 ms. Remains 1226 /1831 variables (removed 605) and now considering 2841/3454 (removed 613) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2134975789881325783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12185984870899769066.kers'
[2026-05-25 10:49:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2134975789881325783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12185984870899769066.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2841 rows 1226 cols 21086 entries
Finished phase 1 with 1219 SingleSign rule and 0 generalized
[2026-05-25 10:49:52] [INFO ] Computed 7 invariants in 17 ms
Computed 7 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-12185984870899769066.kers
Total runtime 22 ms.
[2026-05-25 10:49:53] [INFO ] Implicit Places using invariants in 777 ms returned []
[2026-05-25 10:49:53] [INFO ] Invariant cache hit.
[2026-05-25 10:49:55] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2621 ms to find 0 implicit places.
Running 2840 sub problems to find dead transitions.
[2026-05-25 10:49:55] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1225/4067 variables, and 0 constraints, problems are : Problem set: 0 solved, 2840 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1226 constraints, PredecessorRefiner: 2840/1371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2840 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1225/4067 variables, and 0 constraints, problems are : Problem set: 0 solved, 2840 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1226 constraints, PredecessorRefiner: 1469/1371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63381ms problems are : Problem set: 0 solved, 2840 unsolved
Search for dead transitions found 0 dead transitions in 63424ms
Starting structural reductions in LTL mode, iteration 1 : 1226/1831 places, 2841/3454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68068 ms. Remains : 1226/1831 places, 2841/3454 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Applied a total of 0 rules in 43 ms. Remains 1226 /1226 variables (removed 0) and now considering 2841/2841 (removed 0) transitions.
[2026-05-25 10:50:58] [INFO ] Invariant cache hit.
[2026-05-25 10:50:59] [INFO ] Implicit Places using invariants in 464 ms returned []
[2026-05-25 10:50:59] [INFO ] Invariant cache hit.
[2026-05-25 10:51:00] [INFO ] Implicit Places using invariants and state equation in 1330 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1855 ms. Remains : 1226/1226 places, 2841/2841 transitions.
Support contains 66 out of 1226 places after structural reductions.
[2026-05-25 10:51:01] [INFO ] Flatten gal took : 251 ms
[2026-05-25 10:51:01] [INFO ] Flatten gal took : 217 ms
[2026-05-25 10:51:01] [INFO ] Input system was already deterministic with 2841 transitions.
Support contains 65 out of 1226 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (353 resets) in 1864 ms. (21 steps per ms) remains 33/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
[2026-05-25 10:51:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 1155/1212 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 32 unsolved
SMT process timed out in 5141ms, After SMT, problems are : Problem set: 1 solved, 32 unsolved
Fused 32 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 56 out of 1226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Graph (trivial) has 1126 edges and 1226 vertex of which 89 / 1226 are part of one of the 17 SCC in 10 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Graph (complete) has 2104 edges and 1154 vertex of which 1148 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.16 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 786 transitions
Trivial Post-agglo rules discarded 786 transitions
Performed 786 trivial Post agglomeration. Transition count delta: 786
Iterating post reduction 0 with 792 rules applied. Total rules applied 794 place count 1148 transition count 1951
Reduce places removed 786 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 804 rules applied. Total rules applied 1598 place count 362 transition count 1933
Reduce places removed 7 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 34 rules applied. Total rules applied 1632 place count 355 transition count 1906
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 29 rules applied. Total rules applied 1661 place count 328 transition count 1904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1662 place count 327 transition count 1904
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 63 Pre rules applied. Total rules applied 1662 place count 327 transition count 1841
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 1788 place count 264 transition count 1841
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1882 place count 217 transition count 1794
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1891 place count 217 transition count 1785
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1909 place count 199 transition count 1756
Iterating global reduction 6 with 18 rules applied. Total rules applied 1927 place count 199 transition count 1756
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1932 place count 199 transition count 1751
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1945 place count 186 transition count 1738
Iterating global reduction 7 with 13 rules applied. Total rules applied 1958 place count 186 transition count 1738
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1969 place count 175 transition count 1727
Iterating global reduction 7 with 11 rules applied. Total rules applied 1980 place count 175 transition count 1727
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1985 place count 175 transition count 1722
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 2001 place count 167 transition count 1714
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2009 place count 163 transition count 1729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2010 place count 163 transition count 1728
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2012 place count 163 transition count 1726
Free-agglomeration rule applied 19 times.
Iterating global reduction 9 with 19 rules applied. Total rules applied 2031 place count 163 transition count 1707
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 2050 place count 144 transition count 1707
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 2056 place count 138 transition count 1701
Iterating global reduction 10 with 6 rules applied. Total rules applied 2062 place count 138 transition count 1701
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 2063 place count 138 transition count 1700
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2065 place count 138 transition count 1698
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2067 place count 136 transition count 1698
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2068 place count 136 transition count 1697
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 11 with 17 rules applied. Total rules applied 2085 place count 136 transition count 1697
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 2087 place count 136 transition count 1695
Applied a total of 2087 rules in 686 ms. Remains 136 /1226 variables (removed 1090) and now considering 1695/2841 (removed 1146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 136/1226 places, 1695/2841 transitions.
RANDOM walk for 40000 steps (1517 resets) in 954 ms. (41 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (17 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (15 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (19 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (18 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5797436031903843149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18348766709503039222.kers'
[2026-05-25 10:51:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5797436031903843149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18348766709503039222.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1695 rows 135 cols 18602 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-25 10:51:08] [INFO ] Computed 7 invariants in 7 ms
Computed 7 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-18348766709503039222.kers
Total runtime 10 ms.
[2026-05-25 10:51:08] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 93/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1695/1831 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1831 variables, 90/233 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1831 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/1831 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1831/1831 variables, and 233 constraints, problems are : Problem set: 0 solved, 23 unsolved in 4170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 23/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 93/135 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1695/1831 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1831 variables, 90/233 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1831 variables, 5/238 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1831 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/1831 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1831/1831 variables, and 238 constraints, problems are : Problem set: 0 solved, 23 unsolved in 4689 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 23/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8960ms problems are : Problem set: 0 solved, 23 unsolved
Parikh walk visited 7 properties in 303 ms.
Support contains 35 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 1695/1695 transitions.
Graph (trivial) has 70 edges and 136 vertex of which 6 / 136 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 133 transition count 1679
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 123 transition count 1678
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 122 transition count 1678
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 26 place count 119 transition count 1675
Iterating global reduction 3 with 3 rules applied. Total rules applied 29 place count 119 transition count 1675
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 117 transition count 1673
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 117 transition count 1673
Performed 10 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 53 place count 107 transition count 1662
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 57 place count 107 transition count 1658
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 61 place count 103 transition count 1654
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 103 transition count 1654
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 103 transition count 1653
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 102 transition count 1652
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 102 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 101 transition count 1651
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 101 transition count 1651
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 78 place count 101 transition count 1643
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 82 place count 101 transition count 1639
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 100 transition count 1637
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 100 transition count 1637
Free-agglomeration rule applied 31 times.
Iterating global reduction 6 with 31 rules applied. Total rules applied 115 place count 100 transition count 1606
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 146 place count 69 transition count 1606
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 7 with 62 rules applied. Total rules applied 208 place count 69 transition count 1544
Applied a total of 208 rules in 511 ms. Remains 69 /136 variables (removed 67) and now considering 1544/1695 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 69/136 places, 1544/1695 transitions.
RANDOM walk for 40000 steps (2163 resets) in 410 ms. (97 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (24 resets) in 8 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4004 steps (25 resets) in 5 ms. (667 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 2/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14499699561968986291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2067684061340040345.kers'
[2026-05-25 10:51:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14499699561968986291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2067684061340040345.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1544 rows 68 cols 16300 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-25 10:51:18] [INFO ] Computed 7 invariants in 7 ms
Computed 7 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2067684061340040345.kers
Total runtime 12 ms.
[2026-05-25 10:51:18] [INFO ] State equation strengthened by 673 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1544/1613 variables, 69/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1613 variables, 673/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1613 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1613 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1613/1613 variables, and 749 constraints, problems are : Problem set: 0 solved, 2 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 673/673 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1544/1613 variables, 69/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1613 variables, 673/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1613 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1613 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1613 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1613/1613 variables, and 751 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 673/673 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2526ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 341 steps, including 54 resets, run visited all 2 properties in 5 ms. (steps per millisecond=68 )
Parikh walk visited 2 properties in 15 ms.
FORMULA MedleyB-PT-B05-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA MedleyB-PT-B05-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 248 stabilizing places and 260 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))) U (G((X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))||(X((!p1&&X(!p2)))&&(X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))))))'
Support contains 13 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1214 transition count 2829
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1214 transition count 2829
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1204 transition count 2819
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1204 transition count 2819
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1198 transition count 2813
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1198 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 1193 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 1193 transition count 2808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 1193 transition count 2807
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 1189 transition count 2803
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 1189 transition count 2803
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 1186 transition count 2800
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 1186 transition count 2800
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 1183 transition count 2797
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 1183 transition count 2797
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 1180 transition count 2794
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 1180 transition count 2794
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 1180 transition count 2793
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 1178 transition count 2791
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 1178 transition count 2791
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 1176 transition count 2789
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 1176 transition count 2789
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 1174 transition count 2787
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 1174 transition count 2787
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 1172 transition count 2785
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 1172 transition count 2785
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 1172 transition count 2783
Applied a total of 112 rules in 664 ms. Remains 1172 /1226 variables (removed 54) and now considering 2783/2841 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7606677062436172901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14417763675524280491.kers'
[2026-05-25 10:51:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7606677062436172901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14417763675524280491.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2783 rows 1172 cols 20960 entries
Finished phase 1 with 1165 SingleSign rule and 0 generalized
[2026-05-25 10:51:22] [INFO ] Computed 7 invariants in 27 ms
Computed 7 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-14417763675524280491.kers
Total runtime 36 ms.
[2026-05-25 10:51:23] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2026-05-25 10:51:23] [INFO ] Invariant cache hit.
[2026-05-25 10:51:25] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2800 ms to find 0 implicit places.
Running 2782 sub problems to find dead transitions.
[2026-05-25 10:51:25] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1171/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2782 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1172 constraints, PredecessorRefiner: 2782/1312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2782 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1171/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2782 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1172 constraints, PredecessorRefiner: 1470/1312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62787ms problems are : Problem set: 0 solved, 2782 unsolved
Search for dead transitions found 0 dead transitions in 62794ms
Starting structural reductions in LTL mode, iteration 1 : 1172/1226 places, 2783/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66281 ms. Remains : 1172/1226 places, 2783/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0)) U (X(X(G(p0)))||(p0&&X(X(p0))))) U (G((X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))||(X((!p1&&X(!p2)))&&(X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))))))'
Stuttering acceptance computed with spot in 814 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), true]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 497 ms.
Product exploration explored 100000 steps with 25000 reset in 422 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge based reduction with 6 factoid took 69 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (356 resets) in 428 ms. (93 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (58 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (58 resets) in 317 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (59 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (55 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (60 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (59 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (56 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
[2026-05-25 10:52:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 1145/1158 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/1172 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2783/3955 variables, 1172/1179 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3955/3955 variables, and 1179 constraints, problems are : Problem set: 4 solved, 3 unsolved in 3785 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1172/1172 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1146/1158 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 14/1172 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2783/3955 variables, 1172/1179 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3955/3955 variables, and 1179 constraints, problems are : Problem set: 4 solved, 3 unsolved in 3086 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1172/1172 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6929ms problems are : Problem set: 4 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 308 ms.
Support contains 12 out of 1172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1172/1172 places, 2783/2783 transitions.
Graph (trivial) has 1159 edges and 1172 vertex of which 96 / 1172 are part of one of the 18 SCC in 3 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Graph (complete) has 2026 edges and 1094 vertex of which 1088 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 813 transitions
Trivial Post-agglo rules discarded 813 transitions
Performed 813 trivial Post agglomeration. Transition count delta: 813
Iterating post reduction 0 with 819 rules applied. Total rules applied 821 place count 1088 transition count 1856
Reduce places removed 813 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 831 rules applied. Total rules applied 1652 place count 275 transition count 1838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1658 place count 269 transition count 1838
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 1658 place count 269 transition count 1771
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 1792 place count 202 transition count 1771
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1793 place count 202 transition count 1770
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1879 place count 159 transition count 1727
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1891 place count 159 transition count 1715
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1926 place count 124 transition count 429
Iterating global reduction 5 with 35 rules applied. Total rules applied 1961 place count 124 transition count 429
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1978 place count 124 transition count 412
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1996 place count 106 transition count 394
Iterating global reduction 6 with 18 rules applied. Total rules applied 2014 place count 106 transition count 394
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2026 place count 94 transition count 382
Iterating global reduction 6 with 12 rules applied. Total rules applied 2038 place count 94 transition count 382
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2044 place count 94 transition count 376
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 11 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 2056 place count 88 transition count 370
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2062 place count 85 transition count 378
Free-agglomeration rule applied 33 times.
Iterating global reduction 7 with 33 rules applied. Total rules applied 2095 place count 85 transition count 345
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 2130 place count 52 transition count 343
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2136 place count 46 transition count 337
Iterating global reduction 8 with 6 rules applied. Total rules applied 2142 place count 46 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 8 with 64 rules applied. Total rules applied 2206 place count 46 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2208 place count 45 transition count 272
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2212 place count 43 transition count 290
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2214 place count 43 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2216 place count 41 transition count 288
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2220 place count 41 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2223 place count 41 transition count 285
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2225 place count 39 transition count 281
Iterating global reduction 9 with 2 rules applied. Total rules applied 2227 place count 39 transition count 281
Applied a total of 2227 rules in 298 ms. Remains 39 /1172 variables (removed 1133) and now considering 281/2783 (removed 2502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 39/1172 places, 281/2783 transitions.
RANDOM walk for 19772 steps (1072 resets) in 96 ms. (203 steps per ms) remains 0/3 properties
Found 4 invariant AP formulas.
Knowledge based reduction with 10 factoid took 158 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 8599 ms.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 1172 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1172/1172 places, 2783/2783 transitions.
Applied a total of 0 rules in 119 ms. Remains 1172 /1172 variables (removed 0) and now considering 2783/2783 (removed 0) transitions.
[2026-05-25 10:52:39] [INFO ] Invariant cache hit.
[2026-05-25 10:52:39] [INFO ] Implicit Places using invariants in 739 ms returned []
[2026-05-25 10:52:39] [INFO ] Invariant cache hit.
[2026-05-25 10:52:41] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2551 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2672 ms. Remains : 1172/1172 places, 2783/2783 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (360 resets) in 176 ms. (225 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (59 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (59 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
[2026-05-25 10:52:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1151/1158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/1172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2783/3955 variables, 1172/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3955/3955 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2912 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1172/1172 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1151/1158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/1172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2783/3955 variables, 1172/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3955/3955 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1172/1172 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5238ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 145 ms.
Support contains 7 out of 1172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1172/1172 places, 2783/2783 transitions.
Graph (trivial) has 1163 edges and 1172 vertex of which 96 / 1172 are part of one of the 18 SCC in 2 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Graph (complete) has 2026 edges and 1094 vertex of which 1088 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 816 transitions
Trivial Post-agglo rules discarded 816 transitions
Performed 816 trivial Post agglomeration. Transition count delta: 816
Iterating post reduction 0 with 822 rules applied. Total rules applied 824 place count 1088 transition count 1853
Reduce places removed 816 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 834 rules applied. Total rules applied 1658 place count 272 transition count 1835
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 1665 place count 266 transition count 1834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1666 place count 265 transition count 1834
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 1666 place count 265 transition count 1767
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 1800 place count 198 transition count 1767
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1801 place count 198 transition count 1766
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1887 place count 155 transition count 1723
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1899 place count 155 transition count 1711
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1936 place count 118 transition count 345
Iterating global reduction 6 with 37 rules applied. Total rules applied 1973 place count 118 transition count 345
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 1992 place count 118 transition count 326
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2010 place count 100 transition count 308
Iterating global reduction 7 with 18 rules applied. Total rules applied 2028 place count 100 transition count 308
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2040 place count 88 transition count 296
Iterating global reduction 7 with 12 rules applied. Total rules applied 2052 place count 88 transition count 296
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2058 place count 88 transition count 290
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 2070 place count 82 transition count 284
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2076 place count 79 transition count 292
Free-agglomeration rule applied 31 times.
Iterating global reduction 8 with 31 rules applied. Total rules applied 2107 place count 79 transition count 261
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 33 rules applied. Total rules applied 2140 place count 48 transition count 259
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2146 place count 42 transition count 253
Iterating global reduction 9 with 6 rules applied. Total rules applied 2152 place count 42 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 67 transitions
Redundant transition composition rules discarded 67 transitions
Iterating global reduction 9 with 67 rules applied. Total rules applied 2219 place count 42 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2221 place count 41 transition count 185
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2225 place count 39 transition count 203
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2227 place count 39 transition count 201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2229 place count 37 transition count 201
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2233 place count 37 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2236 place count 37 transition count 198
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2238 place count 35 transition count 194
Iterating global reduction 10 with 2 rules applied. Total rules applied 2240 place count 35 transition count 194
Applied a total of 2240 rules in 163 ms. Remains 35 /1172 variables (removed 1137) and now considering 194/2783 (removed 2589) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 35/1172 places, 194/2783 transitions.
RANDOM walk for 195 steps (5 resets) in 6 ms. (27 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 6165 ms.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 311 ms.
Product exploration explored 100000 steps with 25000 reset in 266 ms.
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13914012441900456325
[2026-05-25 10:52:48] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13914012441900456325
Running compilation step : cd /tmp/ltsmin13914012441900456325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13914012441900456325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13914012441900456325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 1172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1172/1172 places, 2783/2783 transitions.
Applied a total of 0 rules in 79 ms. Remains 1172 /1172 variables (removed 0) and now considering 2783/2783 (removed 0) transitions.
[2026-05-25 10:52:52] [INFO ] Invariant cache hit.
[2026-05-25 10:52:52] [INFO ] Implicit Places using invariants in 888 ms returned []
[2026-05-25 10:52:52] [INFO ] Invariant cache hit.
[2026-05-25 10:52:54] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 2739 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2820 ms. Remains : 1172/1172 places, 2783/2783 transitions.
Built C files in :
/tmp/ltsmin7549482069955353068
[2026-05-25 10:52:54] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7549482069955353068
Running compilation step : cd /tmp/ltsmin7549482069955353068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7549482069955353068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7549482069955353068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 10:52:58] [INFO ] Flatten gal took : 101 ms
[2026-05-25 10:52:58] [INFO ] Flatten gal took : 100 ms
[2026-05-25 10:52:58] [INFO ] Time to serialize gal into /tmp/LTL10727243635215842484.gal : 46 ms
[2026-05-25 10:52:58] [INFO ] Time to serialize properties into /tmp/LTL14732730851829157160.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10727243635215842484.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18216530555698511573.hoa' '-atoms' '/tmp/LTL14732730851829157160.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14732730851829157160.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18216530555698511573.hoa
Detected timeout of ITS tools.
[2026-05-25 10:53:13] [INFO ] Flatten gal took : 79 ms
[2026-05-25 10:53:13] [INFO ] Flatten gal took : 103 ms
[2026-05-25 10:53:13] [INFO ] Time to serialize gal into /tmp/LTL10575657405845055414.gal : 26 ms
[2026-05-25 10:53:13] [INFO ] Time to serialize properties into /tmp/LTL16530291490888795204.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10575657405845055414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16530291490888795204.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(((X(X("(p1251!=1)")))U((X(X(G("(p1251!=1)"))))||(("(p1251!=1)")&&(X(X("(p1251!=1)"))))))U((G((X(X("(p1251!=1)")))U((X(X(G("(p1251...479
Formula 0 simplified : X(X("((((p74==1)&&(p330==1))&&((p631==1)&&(p932==1)))&&((p1255==1)&&(p1534==1)))" | X"((((p96==1)&&(p397==1))&&((p698==1)&&(p999==1)...264
Detected timeout of ITS tools.
[2026-05-25 10:53:29] [INFO ] Flatten gal took : 124 ms
[2026-05-25 10:53:29] [INFO ] Applying decomposition
[2026-05-25 10:53:29] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5120919508530467541.txt' '-o' '/tmp/graph5120919508530467541.bin' '-w' '/tmp/graph5120919508530467541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5120919508530467541.bin' '-l' '-1' '-v' '-w' '/tmp/graph5120919508530467541.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:53:29] [INFO ] Decomposing Gal with order
[2026-05-25 10:53:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:53:30] [INFO ] Removed a total of 9320 redundant transitions.
[2026-05-25 10:53:30] [INFO ] Flatten gal took : 391 ms
[2026-05-25 10:53:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 105 ms.
[2026-05-25 10:53:30] [INFO ] Time to serialize gal into /tmp/LTL3842802525341841810.gal : 41 ms
[2026-05-25 10:53:30] [INFO ] Time to serialize properties into /tmp/LTL15761778861690047185.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3842802525341841810.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15761778861690047185.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(((X(X("(i25.i1.i1.u337.p1251!=1)")))U((X(X(G("(i25.i1.i1.u337.p1251!=1)"))))||(("(i25.i1.i1.u337.p1251!=1)")&&(X(X("(i25.i1.i1.u3...752
Formula 0 simplified : X(X("((((i0.u26.p74==1)&&(i0.u87.p330==1))&&((i0.u167.p631==1)&&(i0.u248.p932==1)))&&((i0.u323.p1255==1)&&(i0.u410.p1534==1)))" | X"...417
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B05-LTLFireability-00 finished in 143716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X((F(p2) U !p0)))))'
Support contains 8 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1215 transition count 2830
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1215 transition count 2830
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 1205 transition count 2820
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 1205 transition count 2820
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1199 transition count 2814
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1199 transition count 2814
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1194 transition count 2809
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1194 transition count 2809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 1194 transition count 2808
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 1190 transition count 2804
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 1190 transition count 2804
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 1187 transition count 2801
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 1187 transition count 2801
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 1184 transition count 2798
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 1184 transition count 2798
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 1181 transition count 2795
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 1181 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 1181 transition count 2794
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 1179 transition count 2792
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 1179 transition count 2792
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 1177 transition count 2790
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1177 transition count 2790
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 1175 transition count 2788
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 1175 transition count 2788
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 1173 transition count 2786
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 1173 transition count 2786
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 1173 transition count 2784
Applied a total of 110 rules in 771 ms. Remains 1173 /1226 variables (removed 53) and now considering 2784/2841 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15707208948007284934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17797558888706129137.kers'
[2026-05-25 10:53:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15707208948007284934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17797558888706129137.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2784 rows 1173 cols 20962 entries
Finished phase 1 with 1166 SingleSign rule and 0 generalized
[2026-05-25 10:53:46] [INFO ] Computed 7 invariants in 17 ms
Computed 7 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-17797558888706129137.kers
Total runtime 20 ms.
[2026-05-25 10:53:47] [INFO ] Implicit Places using invariants in 955 ms returned []
[2026-05-25 10:53:47] [INFO ] Invariant cache hit.
[2026-05-25 10:53:49] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
Running 2783 sub problems to find dead transitions.
[2026-05-25 10:53:49] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1172/3957 variables, and 0 constraints, problems are : Problem set: 0 solved, 2783 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1173 constraints, PredecessorRefiner: 2783/1314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2783 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s42 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1172/3957 variables, and 0 constraints, problems are : Problem set: 0 solved, 2783 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1173 constraints, PredecessorRefiner: 1469/1314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63404ms problems are : Problem set: 0 solved, 2783 unsolved
Search for dead transitions found 0 dead transitions in 63419ms
Starting structural reductions in LTL mode, iteration 1 : 1173/1226 places, 2784/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67083 ms. Remains : 1173/1226 places, 2784/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X((F(p2) U !p0)))))'
Stuttering acceptance computed with spot in 431 ms :[p0, p0, false, p0, p0, (NOT p2), false, p0, false, p0, (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 462 ms.
Product exploration explored 100000 steps with 33333 reset in 404 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 24 ms. Proved property starting from automaton with 11 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 60 ms.
FORMULA MedleyB-PT-B05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B05-LTLFireability-01 finished in 68536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p1))))'
Support contains 2 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1216 transition count 2831
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1216 transition count 2831
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 1208 transition count 2823
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 1208 transition count 2823
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1203 transition count 2818
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1203 transition count 2818
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1199 transition count 2814
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1199 transition count 2814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1199 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1196 transition count 2810
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1196 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 1193 transition count 2807
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 1193 transition count 2807
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 1190 transition count 2804
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 1190 transition count 2804
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 1187 transition count 2801
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 1187 transition count 2801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 1187 transition count 2800
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 1185 transition count 2798
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 1185 transition count 2798
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 1183 transition count 2796
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 1183 transition count 2796
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 1181 transition count 2794
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 1181 transition count 2794
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 1179 transition count 2792
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 1179 transition count 2792
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 1179 transition count 2790
Applied a total of 98 rules in 788 ms. Remains 1179 /1226 variables (removed 47) and now considering 2790/2841 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13569830865544837166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1024213259592919730.kers'
[2026-05-25 10:54:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13569830865544837166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1024213259592919730.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2790 rows 1179 cols 20974 entries
Finished phase 1 with 1172 SingleSign rule and 0 generalized
[2026-05-25 10:54:55] [INFO ] Computed 7 invariants in 41 ms
Computed 7 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-1024213259592919730.kers
Total runtime 59 ms.
[2026-05-25 10:54:56] [INFO ] Implicit Places using invariants in 1139 ms returned []
[2026-05-25 10:54:56] [INFO ] Invariant cache hit.
[2026-05-25 10:54:58] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 3538 ms to find 0 implicit places.
Running 2789 sub problems to find dead transitions.
[2026-05-25 10:54:58] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1178/3969 variables, and 0 constraints, problems are : Problem set: 0 solved, 2789 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1179 constraints, PredecessorRefiner: 2789/1319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2789 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1178/3969 variables, and 0 constraints, problems are : Problem set: 0 solved, 2789 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1179 constraints, PredecessorRefiner: 1470/1319 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62981ms problems are : Problem set: 0 solved, 2789 unsolved
Search for dead transitions found 0 dead transitions in 63000ms
Starting structural reductions in LTL mode, iteration 1 : 1179/1226 places, 2790/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67347 ms. Remains : 1179/1226 places, 2790/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p1))))'
Stuttering acceptance computed with spot in 95 ms :[p1, p1, true]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-02
Product exploration explored 100000 steps with 888 reset in 256 ms.
Product exploration explored 100000 steps with 897 reset in 295 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge based reduction with 9 factoid took 62 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (353 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 341444 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 341444 steps, saw 70506 distinct states, run finished after 3034 ms. (steps per millisecond=112 ) properties seen :0
[2026-05-25 10:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 395/397 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 782/1179 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1179 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1179 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2790/3969 variables, 1179/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3969 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3969 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3969/3969 variables, and 1188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1179/1179 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 395/397 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 782/1179 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1179 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1179 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1179 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2790/3969 variables, 1179/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3969 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3969 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/3969 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3969/3969 variables, and 1191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3746 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1179/1179 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6767ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 2 out of 1179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1179/1179 places, 2790/2790 transitions.
Graph (trivial) has 1174 edges and 1179 vertex of which 96 / 1179 are part of one of the 18 SCC in 1 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Graph (complete) has 2034 edges and 1101 vertex of which 1095 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 827 transitions
Trivial Post-agglo rules discarded 827 transitions
Performed 827 trivial Post agglomeration. Transition count delta: 827
Iterating post reduction 0 with 833 rules applied. Total rules applied 835 place count 1095 transition count 1850
Reduce places removed 827 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 845 rules applied. Total rules applied 1680 place count 268 transition count 1832
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1686 place count 262 transition count 1832
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 1686 place count 262 transition count 1764
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 1822 place count 194 transition count 1764
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1823 place count 194 transition count 1763
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1907 place count 152 transition count 1721
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1918 place count 152 transition count 1710
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1953 place count 117 transition count 346
Iterating global reduction 5 with 35 rules applied. Total rules applied 1988 place count 117 transition count 346
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2006 place count 117 transition count 328
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2023 place count 100 transition count 311
Iterating global reduction 6 with 17 rules applied. Total rules applied 2040 place count 100 transition count 311
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2052 place count 88 transition count 299
Iterating global reduction 6 with 12 rules applied. Total rules applied 2064 place count 88 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2070 place count 88 transition count 293
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2084 place count 81 transition count 286
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2092 place count 77 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2093 place count 77 transition count 293
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2125 place count 77 transition count 261
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 65 rules applied. Total rules applied 2190 place count 45 transition count 228
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2196 place count 39 transition count 222
Iterating global reduction 9 with 6 rules applied. Total rules applied 2202 place count 39 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 9 with 68 rules applied. Total rules applied 2270 place count 39 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2272 place count 38 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2276 place count 36 transition count 171
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2278 place count 36 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2280 place count 34 transition count 169
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2284 place count 34 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2287 place count 34 transition count 166
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2289 place count 32 transition count 162
Iterating global reduction 10 with 2 rules applied. Total rules applied 2291 place count 32 transition count 162
Applied a total of 2291 rules in 165 ms. Remains 32 /1179 variables (removed 1147) and now considering 162/2790 (removed 2628) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 32/1179 places, 162/2790 transitions.
RANDOM walk for 81 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G (NOT p1))
Knowledge based reduction with 9 factoid took 46 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 10268 ms.
FORMULA MedleyB-PT-B05-LTLFireability-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyB-PT-B05-LTLFireability-02 finished in 78324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(!p1)&&p0)) U (G(p2) U X(p3))))'
Support contains 11 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1216 transition count 2831
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1216 transition count 2831
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 1208 transition count 2823
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 1208 transition count 2823
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1203 transition count 2818
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1203 transition count 2818
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1199 transition count 2814
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1199 transition count 2814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1199 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1196 transition count 2810
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1196 transition count 2810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 1194 transition count 2808
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 1194 transition count 2808
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1192 transition count 2806
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1192 transition count 2806
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1190 transition count 2804
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1190 transition count 2804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 1190 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1189 transition count 2802
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1189 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1188 transition count 2801
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1188 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1187 transition count 2800
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1187 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1186 transition count 2799
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1186 transition count 2799
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 1186 transition count 2798
Applied a total of 83 rules in 793 ms. Remains 1186 /1226 variables (removed 40) and now considering 2798/2841 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1900462553849059413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18000649425785863513.kers'
[2026-05-25 10:56:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1900462553849059413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18000649425785863513.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2798 rows 1186 cols 20994 entries
Finished phase 1 with 1179 SingleSign rule and 0 generalized
[2026-05-25 10:56:13] [INFO ] Computed 7 invariants in 18 ms
Computed 7 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-18000649425785863513.kers
Total runtime 37 ms.
[2026-05-25 10:56:14] [INFO ] Implicit Places using invariants in 789 ms returned []
[2026-05-25 10:56:14] [INFO ] Invariant cache hit.
[2026-05-25 10:56:15] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2650 ms to find 0 implicit places.
Running 2797 sub problems to find dead transitions.
[2026-05-25 10:56:15] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/3984 variables, and 0 constraints, problems are : Problem set: 0 solved, 2797 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1186 constraints, PredecessorRefiner: 2797/1327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2797 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1185/3984 variables, and 0 constraints, problems are : Problem set: 0 solved, 2797 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1186 constraints, PredecessorRefiner: 1470/1327 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63097ms problems are : Problem set: 0 solved, 2797 unsolved
Search for dead transitions found 0 dead transitions in 63104ms
Starting structural reductions in LTL mode, iteration 1 : 1186/1226 places, 2798/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66559 ms. Remains : 1186/1226 places, 2798/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(!p1)&&p0)) U (G(p2) U X(p3))))'
Stuttering acceptance computed with spot in 689 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), true, p1, (NOT p2), (AND p1 (NOT p2)), (AND (NOT p3) p0 (NOT p1)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p2 (NOT p3)))]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-03
Product exploration explored 100000 steps with 886 reset in 221 ms.
Product exploration explored 100000 steps with 891 reset in 286 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge based reduction with 29 factoid took 113 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 19 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (351 resets) in 424 ms. (94 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (56 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (58 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (57 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (56 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (59 resets) in 455 ms. (87 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (57 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (59 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (59 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (58 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (56 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (57 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (58 resets) in 50 ms. (784 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (56 resets) in 50 ms. (784 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 203333 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 13
Probabilistic random walk after 203333 steps, saw 44315 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
[2026-05-25 10:57:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 1161/1172 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1172 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/1186 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1186 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2798/3984 variables, 1186/1193 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3984/3984 variables, and 1193 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1186/1186 constraints, PredecessorRefiner: 13/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1161/1172 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1172 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/1186 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1186 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 12 unsolved
SMT process timed out in 10361ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 1186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1186/1186 places, 2798/2798 transitions.
Graph (trivial) has 1171 edges and 1186 vertex of which 96 / 1186 are part of one of the 18 SCC in 3 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Graph (complete) has 2045 edges and 1108 vertex of which 1102 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 823 transitions
Trivial Post-agglo rules discarded 823 transitions
Performed 823 trivial Post agglomeration. Transition count delta: 823
Iterating post reduction 0 with 829 rules applied. Total rules applied 831 place count 1102 transition count 1861
Reduce places removed 823 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 841 rules applied. Total rules applied 1672 place count 279 transition count 1843
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1678 place count 273 transition count 1843
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 1678 place count 273 transition count 1776
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 1812 place count 206 transition count 1776
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1813 place count 206 transition count 1775
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1901 place count 162 transition count 1731
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1913 place count 162 transition count 1719
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1944 place count 131 transition count 776
Iterating global reduction 5 with 31 rules applied. Total rules applied 1975 place count 131 transition count 776
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1988 place count 131 transition count 763
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2006 place count 113 transition count 745
Iterating global reduction 6 with 18 rules applied. Total rules applied 2024 place count 113 transition count 745
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2036 place count 101 transition count 733
Iterating global reduction 6 with 12 rules applied. Total rules applied 2048 place count 101 transition count 733
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2054 place count 101 transition count 727
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 2066 place count 95 transition count 721
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2072 place count 92 transition count 729
Free-agglomeration rule applied 38 times.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2110 place count 92 transition count 691
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 2153 place count 54 transition count 686
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2159 place count 48 transition count 680
Iterating global reduction 8 with 6 rules applied. Total rules applied 2165 place count 48 transition count 680
Drop transitions (Redundant composition of simpler transitions.) removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 8 with 100 rules applied. Total rules applied 2265 place count 48 transition count 580
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2267 place count 47 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2271 place count 45 transition count 597
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2273 place count 45 transition count 595
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2275 place count 43 transition count 595
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2279 place count 43 transition count 595
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2282 place count 43 transition count 592
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2283 place count 42 transition count 590
Iterating global reduction 9 with 1 rules applied. Total rules applied 2284 place count 42 transition count 590
Applied a total of 2284 rules in 433 ms. Remains 42 /1186 variables (removed 1144) and now considering 590/2798 (removed 2208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 42/1186 places, 590/2798 transitions.
RANDOM walk for 15542 steps (2 resets) in 163 ms. (94 steps per ms) remains 0/12 properties
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G (NOT p1))
Knowledge based reduction with 30 factoid took 73 ms. Proved property starting from automaton with 8 states, 19 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 14587 ms.
FORMULA MedleyB-PT-B05-LTLFireability-03 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyB-PT-B05-LTLFireability-03 finished in 82430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F((p2||X(p3)))))))'
Support contains 9 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1215 transition count 2830
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1215 transition count 2830
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 1206 transition count 2821
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 1206 transition count 2821
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 1201 transition count 2816
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 1201 transition count 2816
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1197 transition count 2812
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1197 transition count 2812
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1197 transition count 2811
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 1194 transition count 2808
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 1194 transition count 2808
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 1192 transition count 2806
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 1192 transition count 2806
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 1190 transition count 2804
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 1190 transition count 2804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 1188 transition count 2802
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 1188 transition count 2802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 1188 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1187 transition count 2800
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1187 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1186 transition count 2799
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1186 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1185 transition count 2798
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1185 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1184 transition count 2797
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1184 transition count 2797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 1184 transition count 2796
Applied a total of 87 rules in 668 ms. Remains 1184 /1226 variables (removed 42) and now considering 2796/2841 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4505099101169274434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12917035373097443331.kers'
[2026-05-25 10:57:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4505099101169274434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12917035373097443331.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2796 rows 1184 cols 20990 entries
Finished phase 1 with 1177 SingleSign rule and 0 generalized
[2026-05-25 10:57:35] [INFO ] Computed 7 invariants in 18 ms
Computed 7 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-12917035373097443331.kers
Total runtime 26 ms.
[2026-05-25 10:57:36] [INFO ] Implicit Places using invariants in 902 ms returned []
[2026-05-25 10:57:36] [INFO ] Invariant cache hit.
[2026-05-25 10:57:38] [INFO ] Implicit Places using invariants and state equation in 1984 ms returned []
Implicit Place search using SMT with State Equation took 2891 ms to find 0 implicit places.
Running 2795 sub problems to find dead transitions.
[2026-05-25 10:57:38] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1183/3980 variables, and 0 constraints, problems are : Problem set: 0 solved, 2795 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 2795/1325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2795 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1183/3980 variables, and 0 constraints, problems are : Problem set: 0 solved, 2795 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 1470/1325 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62726ms problems are : Problem set: 0 solved, 2795 unsolved
Search for dead transitions found 0 dead transitions in 62734ms
Starting structural reductions in LTL mode, iteration 1 : 1184/1226 places, 2796/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66300 ms. Remains : 1184/1226 places, 2796/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F((p2||X(p3)))))))'
Stuttering acceptance computed with spot in 252 ms :[true, (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLFireability-04 finished in 66593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U ((X(p1) U p2)||p2)))||X(p3)))'
Support contains 14 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1214 transition count 2829
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1214 transition count 2829
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1204 transition count 2819
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1204 transition count 2819
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1198 transition count 2813
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1198 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 1193 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 1193 transition count 2808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 1193 transition count 2807
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 1189 transition count 2803
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 1189 transition count 2803
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 1186 transition count 2800
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 1186 transition count 2800
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 1183 transition count 2797
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 1183 transition count 2797
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 1180 transition count 2794
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 1180 transition count 2794
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 1180 transition count 2793
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 1178 transition count 2791
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 1178 transition count 2791
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 1176 transition count 2789
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 1176 transition count 2789
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 1174 transition count 2787
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 1174 transition count 2787
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 1172 transition count 2785
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 1172 transition count 2785
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 1172 transition count 2783
Applied a total of 112 rules in 677 ms. Remains 1172 /1226 variables (removed 54) and now considering 2783/2841 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3731358464060497405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10209514731773792176.kers'
[2026-05-25 10:58:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3731358464060497405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10209514731773792176.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2783 rows 1172 cols 20960 entries
Finished phase 1 with 1165 SingleSign rule and 0 generalized
[2026-05-25 10:58:42] [INFO ] Computed 7 invariants in 18 ms
Computed 7 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-10209514731773792176.kers
Total runtime 26 ms.
[2026-05-25 10:58:42] [INFO ] Implicit Places using invariants in 752 ms returned []
[2026-05-25 10:58:42] [INFO ] Invariant cache hit.
[2026-05-25 10:58:44] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
Running 2782 sub problems to find dead transitions.
[2026-05-25 10:58:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1171/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2782 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1172 constraints, PredecessorRefiner: 2782/1312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2782 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1171/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2782 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1172 constraints, PredecessorRefiner: 1470/1312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63048ms problems are : Problem set: 0 solved, 2782 unsolved
Search for dead transitions found 0 dead transitions in 63054ms
Starting structural reductions in LTL mode, iteration 1 : 1172/1226 places, 2783/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66160 ms. Remains : 1172/1226 places, 2783/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U ((X(p1) U p2)||p2)))||X(p3)))'
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-05
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLFireability-05 finished in 66497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&(!p1 U G(p2)))))))'
Support contains 8 out of 1226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Graph (trivial) has 1186 edges and 1226 vertex of which 98 / 1226 are part of one of the 18 SCC in 1 ms
Free SCC test removed 80 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 822 transitions
Trivial Post-agglo rules discarded 822 transitions
Performed 822 trivial Post agglomeration. Transition count delta: 822
Iterating post reduction 0 with 822 rules applied. Total rules applied 823 place count 1145 transition count 1927
Reduce places removed 822 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 840 rules applied. Total rules applied 1663 place count 323 transition count 1909
Reduce places removed 7 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 31 rules applied. Total rules applied 1694 place count 316 transition count 1885
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1718 place count 292 transition count 1885
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 1718 place count 292 transition count 1825
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 1838 place count 232 transition count 1825
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1850 place count 220 transition count 1813
Iterating global reduction 4 with 12 rules applied. Total rules applied 1862 place count 220 transition count 1813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1862 place count 220 transition count 1812
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1864 place count 219 transition count 1812
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1868 place count 215 transition count 1808
Iterating global reduction 4 with 4 rules applied. Total rules applied 1872 place count 215 transition count 1808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1873 place count 215 transition count 1807
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1876 place count 212 transition count 1804
Iterating global reduction 5 with 3 rules applied. Total rules applied 1879 place count 212 transition count 1804
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1881 place count 212 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1882 place count 211 transition count 1801
Iterating global reduction 6 with 1 rules applied. Total rules applied 1883 place count 211 transition count 1801
Performed 46 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 1975 place count 165 transition count 1753
Discarding 34 places :
Symmetric choice reduction at 6 with 34 rule applications. Total rules 2009 place count 131 transition count 396
Iterating global reduction 6 with 34 rules applied. Total rules applied 2043 place count 131 transition count 396
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 2061 place count 131 transition count 378
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2076 place count 116 transition count 359
Iterating global reduction 7 with 15 rules applied. Total rules applied 2091 place count 116 transition count 359
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 2106 place count 101 transition count 340
Iterating global reduction 7 with 15 rules applied. Total rules applied 2121 place count 101 transition count 340
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2127 place count 101 transition count 334
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 2151 place count 89 transition count 341
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2152 place count 88 transition count 325
Iterating global reduction 8 with 1 rules applied. Total rules applied 2153 place count 88 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2154 place count 88 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 2161 place count 88 transition count 317
Applied a total of 2161 rules in 279 ms. Remains 88 /1226 variables (removed 1138) and now considering 317/2841 (removed 2524) transitions.
[2026-05-25 10:59:48] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11126785150685302992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16592553509766615964.kers'
[2026-05-25 10:59:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11126785150685302992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16592553509766615964.kers]
Normalized transition count is 309 out of 310 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 309 rows 87 cols 2498 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-25 10:59:48] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16592553509766615964.kers
Total runtime 2 ms.
[2026-05-25 10:59:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 10:59:48] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2026-05-25 10:59:48] [INFO ] Invariant cache hit.
[2026-05-25 10:59:48] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 10:59:48] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2026-05-25 10:59:48] [INFO ] Redundant transitions in 9 ms returned []
Running 300 sub problems to find dead transitions.
[2026-05-25 10:59:48] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2026-05-25 10:59:48] [INFO ] Invariant cache hit.
[2026-05-25 10:59:48] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 309/397 variables, 88/126 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 48/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (OVERLAPS) 1/398 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/398 variables, and 175 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 309/397 variables, 88/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 48/177 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 300/477 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/398 variables, and 478 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 48/49 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/1226 places, 317/2841 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60966 ms. Remains : 88/1226 places, 317/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&(!p1 U G(p2)))))))'
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-06
Stuttering criterion allowed to conclude after 78125 steps with 6144 reset in 289 ms.
FORMULA MedleyB-PT-B05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLFireability-06 finished in 61527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 7 out of 1226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Graph (trivial) has 1216 edges and 1226 vertex of which 99 / 1226 are part of one of the 18 SCC in 0 ms
Free SCC test removed 81 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 839 transitions
Trivial Post-agglo rules discarded 839 transitions
Performed 839 trivial Post agglomeration. Transition count delta: 839
Iterating post reduction 0 with 839 rules applied. Total rules applied 840 place count 1144 transition count 1908
Reduce places removed 839 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 857 rules applied. Total rules applied 1697 place count 305 transition count 1890
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1705 place count 298 transition count 1889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1706 place count 297 transition count 1889
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 1706 place count 297 transition count 1825
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 1834 place count 233 transition count 1825
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1846 place count 221 transition count 1813
Iterating global reduction 4 with 12 rules applied. Total rules applied 1858 place count 221 transition count 1813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1858 place count 221 transition count 1812
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1860 place count 220 transition count 1812
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1864 place count 216 transition count 1808
Iterating global reduction 4 with 4 rules applied. Total rules applied 1868 place count 216 transition count 1808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1869 place count 216 transition count 1807
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1872 place count 213 transition count 1804
Iterating global reduction 5 with 3 rules applied. Total rules applied 1875 place count 213 transition count 1804
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1877 place count 213 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1878 place count 212 transition count 1801
Iterating global reduction 6 with 1 rules applied. Total rules applied 1879 place count 212 transition count 1801
Performed 46 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 1971 place count 166 transition count 1753
Discarding 30 places :
Symmetric choice reduction at 6 with 30 rule applications. Total rules 2001 place count 136 transition count 816
Iterating global reduction 6 with 30 rules applied. Total rules applied 2031 place count 136 transition count 816
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2044 place count 136 transition count 803
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2061 place count 119 transition count 780
Iterating global reduction 7 with 17 rules applied. Total rules applied 2078 place count 119 transition count 780
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2095 place count 102 transition count 757
Iterating global reduction 7 with 17 rules applied. Total rules applied 2112 place count 102 transition count 757
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2118 place count 102 transition count 751
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 2138 place count 92 transition count 758
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2139 place count 91 transition count 746
Iterating global reduction 8 with 1 rules applied. Total rules applied 2140 place count 91 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2141 place count 91 transition count 745
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2147 place count 91 transition count 739
Applied a total of 2147 rules in 274 ms. Remains 91 /1226 variables (removed 1135) and now considering 739/2841 (removed 2102) transitions.
[2026-05-25 11:00:49] [INFO ] Flow matrix only has 732 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16712906307594818543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2156229043400545382.kers'
[2026-05-25 11:00:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16712906307594818543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2156229043400545382.kers]
Normalized transition count is 731 out of 732 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 731 rows 90 cols 7305 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-25 11:00:49] [INFO ] Computed 2 invariants in 11 ms
Computed 2 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-2156229043400545382.kers
Total runtime 14 ms.
[2026-05-25 11:00:50] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-25 11:00:50] [INFO ] Flow matrix only has 732 transitions (discarded 7 similar events)
[2026-05-25 11:00:50] [INFO ] Invariant cache hit.
[2026-05-25 11:00:50] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-25 11:00:50] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2026-05-25 11:00:50] [INFO ] Redundant transitions in 27 ms returned []
Running 722 sub problems to find dead transitions.
[2026-05-25 11:00:50] [INFO ] Flow matrix only has 732 transitions (discarded 7 similar events)
[2026-05-25 11:00:50] [INFO ] Invariant cache hit.
[2026-05-25 11:00:50] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 91/823 variables, and 20 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/91 constraints, ReadFeed: 0/63 constraints, PredecessorRefiner: 722/173 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 8 (OVERLAPS) 731/822 variables, 91/123 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 62/185 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 173/358 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/823 variables, and 358 constraints, problems are : Problem set: 0 solved, 722 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 722/173 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60998ms problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 61000ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/1226 places, 739/2841 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62075 ms. Remains : 91/1226 places, 739/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-08
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLFireability-08 finished in 62284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||((p2 U (p3||G(p2)))&&(X(p0) U ((p1&&X(p0))||X(G(p0))))))))))'
Support contains 4 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1216 transition count 2831
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1216 transition count 2831
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 1209 transition count 2824
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 1209 transition count 2824
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 1205 transition count 2820
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 1205 transition count 2820
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 1201 transition count 2816
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 1201 transition count 2816
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1197 transition count 2812
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1197 transition count 2812
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1194 transition count 2809
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1194 transition count 2809
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 1191 transition count 2806
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 1191 transition count 2806
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 1188 transition count 2803
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 1188 transition count 2803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 1188 transition count 2802
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 1186 transition count 2800
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 1186 transition count 2800
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 1184 transition count 2798
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 1184 transition count 2798
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 1182 transition count 2796
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 1182 transition count 2796
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 1180 transition count 2794
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 1180 transition count 2794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 1180 transition count 2792
Applied a total of 95 rules in 815 ms. Remains 1180 /1226 variables (removed 46) and now considering 2792/2841 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15792417246078381512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12963338358754616561.kers'
[2026-05-25 11:01:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15792417246078381512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12963338358754616561.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2792 rows 1180 cols 20978 entries
Finished phase 1 with 1173 SingleSign rule and 0 generalized
[2026-05-25 11:01:52] [INFO ] Computed 7 invariants in 19 ms
Computed 7 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-12963338358754616561.kers
Total runtime 36 ms.
[2026-05-25 11:01:53] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2026-05-25 11:01:53] [INFO ] Invariant cache hit.
[2026-05-25 11:01:55] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 3274 ms to find 0 implicit places.
Running 2791 sub problems to find dead transitions.
[2026-05-25 11:01:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1179/3972 variables, and 0 constraints, problems are : Problem set: 0 solved, 2791 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1180 constraints, PredecessorRefiner: 2791/1321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2791 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1179/3972 variables, and 0 constraints, problems are : Problem set: 0 solved, 2791 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1180 constraints, PredecessorRefiner: 1470/1321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62642ms problems are : Problem set: 0 solved, 2791 unsolved
Search for dead transitions found 0 dead transitions in 62648ms
Starting structural reductions in LTL mode, iteration 1 : 1180/1226 places, 2792/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66744 ms. Remains : 1180/1226 places, 2792/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(p0) U (X(G(p0))||(p1&&X(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||((p2 U (p3||G(p2)))&&(X(p0) U ((p1&&X(p0))||X(G(p0))))))))))'
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), false, (NOT p0), false, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), false]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-09
Product exploration explored 100000 steps with 28619 reset in 332 ms.
Product exploration explored 100000 steps with 28510 reset in 334 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge based reduction with 33 factoid took 492 ms. Reduced automaton from 7 states, 31 edges and 4 AP (stutter sensitive) to 7 states, 31 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (355 resets) in 390 ms. (102 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40002 steps (55 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (57 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (57 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 46 ms. (851 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (58 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (58 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (55 resets) in 45 ms. (869 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (57 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (58 resets) in 47 ms. (833 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (59 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (60 resets) in 41 ms. (952 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 43 ms. (909 steps per ms) remains 12/12 properties
[2026-05-25 11:03:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 584/588 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 592/1180 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 5633ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1180/1180 places, 2792/2792 transitions.
Graph (trivial) has 1172 edges and 1180 vertex of which 96 / 1180 are part of one of the 18 SCC in 1 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Graph (complete) has 2035 edges and 1102 vertex of which 1096 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 822 transitions
Trivial Post-agglo rules discarded 822 transitions
Performed 822 trivial Post agglomeration. Transition count delta: 822
Iterating post reduction 0 with 828 rules applied. Total rules applied 830 place count 1096 transition count 1856
Reduce places removed 822 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 839 rules applied. Total rules applied 1669 place count 274 transition count 1839
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 1677 place count 268 transition count 1837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1679 place count 266 transition count 1837
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 1679 place count 266 transition count 1770
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 1813 place count 199 transition count 1770
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1814 place count 199 transition count 1769
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1904 place count 154 transition count 1724
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1915 place count 154 transition count 1713
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 1951 place count 118 transition count 348
Iterating global reduction 6 with 36 rules applied. Total rules applied 1987 place count 118 transition count 348
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2006 place count 118 transition count 329
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2023 place count 101 transition count 312
Iterating global reduction 7 with 17 rules applied. Total rules applied 2040 place count 101 transition count 312
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2052 place count 89 transition count 300
Iterating global reduction 7 with 12 rules applied. Total rules applied 2064 place count 89 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2070 place count 89 transition count 294
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 2082 place count 83 transition count 288
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2088 place count 80 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2089 place count 80 transition count 295
Free-agglomeration rule applied 33 times.
Iterating global reduction 8 with 33 rules applied. Total rules applied 2122 place count 80 transition count 262
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 50 rules applied. Total rules applied 2172 place count 47 transition count 245
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2178 place count 41 transition count 239
Iterating global reduction 9 with 6 rules applied. Total rules applied 2184 place count 41 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 9 with 70 rules applied. Total rules applied 2254 place count 41 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2256 place count 40 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2260 place count 38 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2262 place count 38 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2264 place count 36 transition count 184
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2268 place count 36 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2271 place count 36 transition count 181
Applied a total of 2271 rules in 187 ms. Remains 36 /1180 variables (removed 1144) and now considering 181/2792 (removed 2611) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 36/1180 places, 181/2792 transitions.
RANDOM walk for 2321 steps (0 resets) in 12 ms. (178 steps per ms) remains 0/12 properties
Knowledge based reduction with 33 factoid took 606 ms. Reduced automaton from 7 states, 31 edges and 4 AP (stutter sensitive) to 7 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 468 ms :[(NOT p0), false, (NOT p0), false, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), false]
Knowledge-based reduction took 7783 ms.
Stuttering acceptance computed with spot in 551 ms :[(NOT p0), false, (NOT p0), false, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), false]
Support contains 4 out of 1180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 2792/2792 transitions.
Applied a total of 0 rules in 75 ms. Remains 1180 /1180 variables (removed 0) and now considering 2792/2792 (removed 0) transitions.
[2026-05-25 11:03:08] [INFO ] Invariant cache hit.
[2026-05-25 11:03:08] [INFO ] Implicit Places using invariants in 905 ms returned []
[2026-05-25 11:03:08] [INFO ] Invariant cache hit.
[2026-05-25 11:03:11] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned []
Implicit Place search using SMT with State Equation took 3413 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3489 ms. Remains : 1180/1180 places, 2792/2792 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge based reduction with 33 factoid took 432 ms. Reduced automaton from 7 states, 31 edges and 4 AP (stutter sensitive) to 7 states, 31 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (356 resets) in 389 ms. (102 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40002 steps (58 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (61 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 46 ms. (851 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (57 resets) in 49 ms. (800 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (58 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (55 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (55 resets) in 54 ms. (727 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 56 ms. (701 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
[2026-05-25 11:03:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 584/588 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 592/1180 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 5804ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1180/1180 places, 2792/2792 transitions.
Graph (trivial) has 1172 edges and 1180 vertex of which 96 / 1180 are part of one of the 18 SCC in 1 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Graph (complete) has 2035 edges and 1102 vertex of which 1096 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 822 transitions
Trivial Post-agglo rules discarded 822 transitions
Performed 822 trivial Post agglomeration. Transition count delta: 822
Iterating post reduction 0 with 828 rules applied. Total rules applied 830 place count 1096 transition count 1856
Reduce places removed 822 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 839 rules applied. Total rules applied 1669 place count 274 transition count 1839
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 1677 place count 268 transition count 1837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1679 place count 266 transition count 1837
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 1679 place count 266 transition count 1770
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 1813 place count 199 transition count 1770
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1814 place count 199 transition count 1769
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1904 place count 154 transition count 1724
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1915 place count 154 transition count 1713
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 1951 place count 118 transition count 348
Iterating global reduction 6 with 36 rules applied. Total rules applied 1987 place count 118 transition count 348
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2006 place count 118 transition count 329
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2023 place count 101 transition count 312
Iterating global reduction 7 with 17 rules applied. Total rules applied 2040 place count 101 transition count 312
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2052 place count 89 transition count 300
Iterating global reduction 7 with 12 rules applied. Total rules applied 2064 place count 89 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2070 place count 89 transition count 294
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 2082 place count 83 transition count 288
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2088 place count 80 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2089 place count 80 transition count 295
Free-agglomeration rule applied 33 times.
Iterating global reduction 8 with 33 rules applied. Total rules applied 2122 place count 80 transition count 262
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 50 rules applied. Total rules applied 2172 place count 47 transition count 245
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2178 place count 41 transition count 239
Iterating global reduction 9 with 6 rules applied. Total rules applied 2184 place count 41 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 9 with 70 rules applied. Total rules applied 2254 place count 41 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2256 place count 40 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2260 place count 38 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2262 place count 38 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2264 place count 36 transition count 184
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2268 place count 36 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2271 place count 36 transition count 181
Applied a total of 2271 rules in 146 ms. Remains 36 /1180 variables (removed 1144) and now considering 181/2792 (removed 2611) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 36/1180 places, 181/2792 transitions.
RANDOM walk for 1908 steps (0 resets) in 21 ms. (86 steps per ms) remains 0/12 properties
Knowledge based reduction with 33 factoid took 846 ms. Reduced automaton from 7 states, 31 edges and 4 AP (stutter sensitive) to 7 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[(NOT p0), false, (NOT p0), false, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), false]
Knowledge-based reduction took 8217 ms.
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), false, (NOT p0), false, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), false]
Stuttering acceptance computed with spot in 395 ms :[(NOT p0), false, (NOT p0), false, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), false]
Product exploration explored 100000 steps with 28459 reset in 344 ms.
Product exploration explored 100000 steps with 28729 reset in 343 ms.
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9655845422930856374
[2026-05-25 11:03:21] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9655845422930856374
Running compilation step : cd /tmp/ltsmin9655845422930856374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9655845422930856374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9655845422930856374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1180/1180 places, 2792/2792 transitions.
Applied a total of 0 rules in 52 ms. Remains 1180 /1180 variables (removed 0) and now considering 2792/2792 (removed 0) transitions.
[2026-05-25 11:03:24] [INFO ] Invariant cache hit.
[2026-05-25 11:03:25] [INFO ] Implicit Places using invariants in 988 ms returned []
[2026-05-25 11:03:25] [INFO ] Invariant cache hit.
[2026-05-25 11:03:27] [INFO ] Implicit Places using invariants and state equation in 2357 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3413 ms. Remains : 1180/1180 places, 2792/2792 transitions.
Built C files in :
/tmp/ltsmin12074506323226148666
[2026-05-25 11:03:27] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12074506323226148666
Running compilation step : cd /tmp/ltsmin12074506323226148666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12074506323226148666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12074506323226148666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 11:03:31] [INFO ] Flatten gal took : 71 ms
[2026-05-25 11:03:31] [INFO ] Flatten gal took : 80 ms
[2026-05-25 11:03:31] [INFO ] Time to serialize gal into /tmp/LTL17015441295914328575.gal : 20 ms
[2026-05-25 11:03:31] [INFO ] Time to serialize properties into /tmp/LTL14394453798665183173.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17015441295914328575.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13930395439367111775.hoa' '-atoms' '/tmp/LTL14394453798665183173.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14394453798665183173.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13930395439367111775.hoa
Detected timeout of ITS tools.
[2026-05-25 11:03:46] [INFO ] Flatten gal took : 80 ms
[2026-05-25 11:03:46] [INFO ] Flatten gal took : 75 ms
[2026-05-25 11:03:46] [INFO ] Time to serialize gal into /tmp/LTL11030252620892099623.gal : 20 ms
[2026-05-25 11:03:46] [INFO ] Time to serialize properties into /tmp/LTL3304826975425327129.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11030252620892099623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3304826975425327129.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((X("(p1451!=1)"))U((X(G("(p1451!=1)")))||(("(p995==1)")&&(X("(p1451!=1)")))))U((G((X("(p1451!=1)"))U((X(G("(p1451!=1)")))||(("...344
Formula 0 simplified : FG((!"(p1608!=1)" M !"((p1672!=1)&&(p1608!=1))") U (X!"(p1451!=1)" R (XF!"(p1451!=1)" & (!"(p995==1)" | X!"(p1451!=1)"))))
Detected timeout of ITS tools.
[2026-05-25 11:04:01] [INFO ] Flatten gal took : 104 ms
[2026-05-25 11:04:01] [INFO ] Applying decomposition
[2026-05-25 11:04:01] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4014966462466054322.txt' '-o' '/tmp/graph4014966462466054322.bin' '-w' '/tmp/graph4014966462466054322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4014966462466054322.bin' '-l' '-1' '-v' '-w' '/tmp/graph4014966462466054322.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:04:02] [INFO ] Decomposing Gal with order
[2026-05-25 11:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:04:02] [INFO ] Removed a total of 9318 redundant transitions.
[2026-05-25 11:04:02] [INFO ] Flatten gal took : 192 ms
[2026-05-25 11:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 38 ms.
[2026-05-25 11:04:02] [INFO ] Time to serialize gal into /tmp/LTL14258841914342708218.gal : 27 ms
[2026-05-25 11:04:02] [INFO ] Time to serialize properties into /tmp/LTL10943553920995010366.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14258841914342708218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10943553920995010366.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F(((X("(i24.i1.i5.u386.p1451!=1)"))U((X(G("(i24.i1.i5.u386.p1451!=1)")))||(("(i18.i0.i2.u271.p995==1)")&&(X("(i24.i1.i5.u386.p145...566
Formula 0 simplified : FG((!"(i32.u440.p1608!=1)" M !"((i34.i1.i2.u460.p1672!=1)&&(i32.u440.p1608!=1))") U (X!"(i24.i1.i5.u386.p1451!=1)" R (XF!"(i24.i1.i5...238
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B05-LTLFireability-09 finished in 145774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U G(p1)) U (X((X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))) U (X(G((X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))||(!p2&&X((X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))))'
Support contains 14 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1215 transition count 2830
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1215 transition count 2830
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 1206 transition count 2821
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 1206 transition count 2821
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1200 transition count 2815
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1200 transition count 2815
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1195 transition count 2810
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1195 transition count 2810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 1195 transition count 2809
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 1191 transition count 2805
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 1191 transition count 2805
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 1188 transition count 2802
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 1188 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 1185 transition count 2799
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 1185 transition count 2799
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 1182 transition count 2796
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 1182 transition count 2796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 1182 transition count 2795
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 1180 transition count 2793
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 1180 transition count 2793
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 1178 transition count 2791
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 1178 transition count 2791
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 1176 transition count 2789
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 1176 transition count 2789
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 1174 transition count 2787
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 1174 transition count 2787
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 1174 transition count 2785
Applied a total of 108 rules in 804 ms. Remains 1174 /1226 variables (removed 52) and now considering 2785/2841 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16584719178567726426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4515316374263665999.kers'
[2026-05-25 11:04:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16584719178567726426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4515316374263665999.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 2785 rows 1174 cols 20964 entries
Finished phase 1 with 1167 SingleSign rule and 0 generalized
[2026-05-25 11:04:18] [INFO ] Computed 7 invariants in 53 ms
Computed 7 P flows in 54 ms.
Exported basis to /tmp/petrispot-output-4515316374263665999.kers
Total runtime 57 ms.
[2026-05-25 11:04:19] [INFO ] Implicit Places using invariants in 788 ms returned []
[2026-05-25 11:04:19] [INFO ] Invariant cache hit.
[2026-05-25 11:04:21] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 2830 ms to find 0 implicit places.
Running 2784 sub problems to find dead transitions.
[2026-05-25 11:04:21] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1173/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2784 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1174 constraints, PredecessorRefiner: 2784/1314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2784 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1173/3959 variables, and 0 constraints, problems are : Problem set: 0 solved, 2784 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1174 constraints, PredecessorRefiner: 1470/1314 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62752ms problems are : Problem set: 0 solved, 2784 unsolved
Search for dead transitions found 0 dead transitions in 62758ms
Starting structural reductions in LTL mode, iteration 1 : 1174/1226 places, 2785/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66398 ms. Remains : 1174/1226 places, 2785/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U G(p1)) U (X((X(!p2) U (X(G(!p2))||(!p3&&X(!p2))))) U (X(G((X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))||(!p2&&X((X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))))'
Stuttering acceptance computed with spot in 934 ms :[p2, false, (AND (NOT p1) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p1) p2), p2, p2, (AND (NOT p0) p1 p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-10
Product exploration explored 100000 steps with 36316 reset in 448 ms.
Product exploration explored 100000 steps with 36306 reset in 419 ms.
Computed a total of 248 stabilizing places and 260 stable transitions
Computed a total of 248 stabilizing places and 260 stable transitions
Detected a total of 248/1174 stabilizing places and 260/2785 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 48 factoid took 14 ms. Proved property starting from automaton with 17 states, 77 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 86 ms.
FORMULA MedleyB-PT-B05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B05-LTLFireability-10 finished in 68452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 1226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Graph (trivial) has 1218 edges and 1226 vertex of which 99 / 1226 are part of one of the 18 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 842 transitions
Trivial Post-agglo rules discarded 842 transitions
Performed 842 trivial Post agglomeration. Transition count delta: 842
Iterating post reduction 0 with 842 rules applied. Total rules applied 843 place count 1144 transition count 1905
Reduce places removed 842 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 860 rules applied. Total rules applied 1703 place count 302 transition count 1887
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1710 place count 295 transition count 1887
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 1710 place count 295 transition count 1823
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 1838 place count 231 transition count 1823
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1850 place count 219 transition count 1811
Iterating global reduction 3 with 12 rules applied. Total rules applied 1862 place count 219 transition count 1811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1862 place count 219 transition count 1810
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1864 place count 218 transition count 1810
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1868 place count 214 transition count 1806
Iterating global reduction 3 with 4 rules applied. Total rules applied 1872 place count 214 transition count 1806
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1873 place count 214 transition count 1805
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1876 place count 211 transition count 1802
Iterating global reduction 4 with 3 rules applied. Total rules applied 1879 place count 211 transition count 1802
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1881 place count 211 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1882 place count 210 transition count 1799
Iterating global reduction 5 with 1 rules applied. Total rules applied 1883 place count 210 transition count 1799
Performed 46 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 1975 place count 164 transition count 1751
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 2006 place count 133 transition count 652
Iterating global reduction 5 with 31 rules applied. Total rules applied 2037 place count 133 transition count 652
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2051 place count 133 transition count 638
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2068 place count 116 transition count 615
Iterating global reduction 6 with 17 rules applied. Total rules applied 2085 place count 116 transition count 615
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2102 place count 99 transition count 592
Iterating global reduction 6 with 17 rules applied. Total rules applied 2119 place count 99 transition count 592
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2125 place count 99 transition count 586
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 2145 place count 89 transition count 593
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2146 place count 88 transition count 581
Iterating global reduction 7 with 1 rules applied. Total rules applied 2147 place count 88 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2148 place count 88 transition count 580
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2154 place count 88 transition count 574
Applied a total of 2154 rules in 205 ms. Remains 88 /1226 variables (removed 1138) and now considering 574/2841 (removed 2267) transitions.
[2026-05-25 11:05:26] [INFO ] Flow matrix only has 567 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8925784002022895522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3434591280723732854.kers'
[2026-05-25 11:05:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8925784002022895522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3434591280723732854.kers]
Normalized transition count is 566 out of 567 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 566 rows 87 cols 5355 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-25 11:05:26] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3434591280723732854.kers
Total runtime 3 ms.
[2026-05-25 11:05:26] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-25 11:05:26] [INFO ] Flow matrix only has 567 transitions (discarded 7 similar events)
[2026-05-25 11:05:26] [INFO ] Invariant cache hit.
[2026-05-25 11:05:26] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-25 11:05:27] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2026-05-25 11:05:27] [INFO ] Redundant transitions in 34 ms returned []
Running 557 sub problems to find dead transitions.
[2026-05-25 11:05:27] [INFO ] Flow matrix only has 567 transitions (discarded 7 similar events)
[2026-05-25 11:05:27] [INFO ] Invariant cache hit.
[2026-05-25 11:05:27] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (OVERLAPS) 566/654 variables, 88/108 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 62/170 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/655 variables, and 170 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 557/170 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (OVERLAPS) 566/654 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 62/173 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 170/343 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/655 variables, and 343 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 557/170 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60803ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60805ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/1226 places, 574/2841 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62001 ms. Remains : 88/1226 places, 574/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-11
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLFireability-11 finished in 62174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(X(G(!(p0 U p1))))||F(p0))) U p0))'
Support contains 6 out of 1226 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Graph (trivial) has 1217 edges and 1226 vertex of which 99 / 1226 are part of one of the 18 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 842 transitions
Trivial Post-agglo rules discarded 842 transitions
Performed 842 trivial Post agglomeration. Transition count delta: 842
Iterating post reduction 0 with 842 rules applied. Total rules applied 843 place count 1144 transition count 1905
Reduce places removed 842 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 860 rules applied. Total rules applied 1703 place count 302 transition count 1887
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1710 place count 295 transition count 1887
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 1710 place count 295 transition count 1824
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 1836 place count 232 transition count 1824
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1847 place count 221 transition count 1813
Iterating global reduction 3 with 11 rules applied. Total rules applied 1858 place count 221 transition count 1813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1858 place count 221 transition count 1812
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1860 place count 220 transition count 1812
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1863 place count 217 transition count 1809
Iterating global reduction 3 with 3 rules applied. Total rules applied 1866 place count 217 transition count 1809
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1869 place count 214 transition count 1806
Iterating global reduction 3 with 3 rules applied. Total rules applied 1872 place count 214 transition count 1806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1874 place count 214 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1875 place count 213 transition count 1803
Iterating global reduction 4 with 1 rules applied. Total rules applied 1876 place count 213 transition count 1803
Performed 47 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1970 place count 166 transition count 1754
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 2001 place count 135 transition count 655
Iterating global reduction 4 with 31 rules applied. Total rules applied 2032 place count 135 transition count 655
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2046 place count 135 transition count 641
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2063 place count 118 transition count 618
Iterating global reduction 5 with 17 rules applied. Total rules applied 2080 place count 118 transition count 618
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2097 place count 101 transition count 595
Iterating global reduction 5 with 17 rules applied. Total rules applied 2114 place count 101 transition count 595
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2120 place count 101 transition count 589
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2140 place count 91 transition count 596
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2141 place count 90 transition count 584
Iterating global reduction 6 with 1 rules applied. Total rules applied 2142 place count 90 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2143 place count 90 transition count 583
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 2149 place count 90 transition count 577
Applied a total of 2149 rules in 183 ms. Remains 90 /1226 variables (removed 1136) and now considering 577/2841 (removed 2264) transitions.
[2026-05-25 11:06:28] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5819693910811248339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16493185982493691802.kers'
[2026-05-25 11:06:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5819693910811248339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16493185982493691802.kers]
Normalized transition count is 569 out of 570 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 569 rows 89 cols 5361 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-25 11:06:28] [INFO ] Computed 2 invariants in 10 ms
Computed 2 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-16493185982493691802.kers
Total runtime 13 ms.
[2026-05-25 11:06:28] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-05-25 11:06:28] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2026-05-25 11:06:28] [INFO ] Invariant cache hit.
[2026-05-25 11:06:28] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-25 11:06:29] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2026-05-25 11:06:29] [INFO ] Redundant transitions in 3 ms returned []
Running 560 sub problems to find dead transitions.
[2026-05-25 11:06:29] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2026-05-25 11:06:29] [INFO ] Invariant cache hit.
[2026-05-25 11:06:29] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (OVERLAPS) 569/659 variables, 90/108 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 62/170 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 659/660 variables, and 173 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 560/173 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (OVERLAPS) 569/659 variables, 90/112 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 62/174 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 173/347 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 347 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 560/173 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60701ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 60702ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/1226 places, 577/2841 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61614 ms. Remains : 90/1226 places, 577/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(X(G(!(p0 U p1))))||F(p0))) U p0))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-12
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLFireability-12 finished in 61718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Support contains 12 out of 1226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1226/1226 places, 2841/2841 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1214 transition count 2829
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1214 transition count 2829
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 1204 transition count 2819
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 1204 transition count 2819
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1198 transition count 2813
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1198 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 1193 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 1193 transition count 2808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 1193 transition count 2807
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 1189 transition count 2803
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 1189 transition count 2803
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 1186 transition count 2800
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 1186 transition count 2800
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 1183 transition count 2797
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 1183 transition count 2797
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 1180 transition count 2794
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 1180 transition count 2794
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 1180 transition count 2793
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 1178 transition count 2791
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 1178 transition count 2791
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 1176 transition count 2789
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 1176 transition count 2789
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 1174 transition count 2787
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 1174 transition count 2787
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 1172 transition count 2785
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 1172 transition count 2785
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 1172 transition count 2783
Applied a total of 112 rules in 684 ms. Remains 1172 /1226 variables (removed 54) and now considering 2783/2841 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10492786658956222030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12440317319694357879.kers'
[2026-05-25 11:07:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10492786658956222030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12440317319694357879.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2783 rows 1172 cols 20960 entries
Finished phase 1 with 1165 SingleSign rule and 0 generalized
[2026-05-25 11:07:30] [INFO ] Computed 7 invariants in 19 ms
Computed 7 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-12440317319694357879.kers
Total runtime 40 ms.
[2026-05-25 11:07:31] [INFO ] Implicit Places using invariants in 860 ms returned []
[2026-05-25 11:07:31] [INFO ] Invariant cache hit.
[2026-05-25 11:07:33] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2824 ms to find 0 implicit places.
Running 2782 sub problems to find dead transitions.
[2026-05-25 11:07:33] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1171/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2782 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1172 constraints, PredecessorRefiner: 2782/1312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1171/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2782 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1172 constraints, PredecessorRefiner: 1470/1312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62697ms problems are : Problem set: 0 solved, 2782 unsolved
Search for dead transitions found 0 dead transitions in 62720ms
Starting structural reductions in LTL mode, iteration 1 : 1172/1226 places, 2783/2841 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66237 ms. Remains : 1172/1226 places, 2783/2841 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B05-LTLFireability-15
Product exploration explored 100000 steps with 885 reset in 237 ms.
Product exploration explored 100000 steps with 892 reset in 293 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (357 resets) in 220 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (61 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (54 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 316352 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 2
Probabilistic random walk after 316352 steps, saw 65838 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2026-05-25 11:08:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1146/1158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/1172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2783/3955 variables, 1172/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3955/3955 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1172/1172 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1146/1158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/1172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2783/3955 variables, 1172/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3955/3955 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2876 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1172/1172 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4366ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 306 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=76 )
Parikh walk visited 2 properties in 3 ms.
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 7820 ms.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 12 out of 1172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1172/1172 places, 2783/2783 transitions.
Applied a total of 0 rules in 86 ms. Remains 1172 /1172 variables (removed 0) and now considering 2783/2783 (removed 0) transitions.
[2026-05-25 11:08:45] [INFO ] Invariant cache hit.
[2026-05-25 11:08:45] [INFO ] Implicit Places using invariants in 735 ms returned []
[2026-05-25 11:08:45] [INFO ] Invariant cache hit.
[2026-05-25 11:08:47] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2556 ms. Remains : 1172/1172 places, 2783/2783 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (352 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (56 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (57 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 313722 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 313722 steps, saw 65318 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2026-05-25 11:08:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1146/1158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/1172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2783/3955 variables, 1172/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3955/3955 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1172/1172 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1146/1158 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/1172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2783/3955 variables, 1172/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3955 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3955/3955 variables, and 1179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2786 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1172/1172 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4160ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 306 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 11 ms.
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 7781 ms.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 894 reset in 284 ms.
Product exploration explored 100000 steps with 894 reset in 244 ms.
Spot run failed in 86 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin3829241213209316599
[2026-05-25 11:08:56] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3829241213209316599
Running compilation step : cd /tmp/ltsmin3829241213209316599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3829241213209316599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3829241213209316599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 12 out of 1172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1172/1172 places, 2783/2783 transitions.
Applied a total of 0 rules in 94 ms. Remains 1172 /1172 variables (removed 0) and now considering 2783/2783 (removed 0) transitions.
[2026-05-25 11:08:59] [INFO ] Invariant cache hit.
[2026-05-25 11:09:00] [INFO ] Implicit Places using invariants in 871 ms returned []
[2026-05-25 11:09:00] [INFO ] Invariant cache hit.
[2026-05-25 11:09:02] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 2828 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2922 ms. Remains : 1172/1172 places, 2783/2783 transitions.
Built C files in :
/tmp/ltsmin16891478936914646358
[2026-05-25 11:09:02] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16891478936914646358
Running compilation step : cd /tmp/ltsmin16891478936914646358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16891478936914646358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16891478936914646358;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 11:09:05] [INFO ] Flatten gal took : 64 ms
[2026-05-25 11:09:05] [INFO ] Flatten gal took : 65 ms
[2026-05-25 11:09:05] [INFO ] Time to serialize gal into /tmp/LTL9084615659345008756.gal : 19 ms
[2026-05-25 11:09:05] [INFO ] Time to serialize properties into /tmp/LTL1642746434703454849.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9084615659345008756.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10633849704382837632.hoa' '-atoms' '/tmp/LTL1642746434703454849.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1642746434703454849.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10633849704382837632.hoa
Detected timeout of ITS tools.
[2026-05-25 11:09:21] [INFO ] Flatten gal took : 70 ms
[2026-05-25 11:09:21] [INFO ] Flatten gal took : 74 ms
[2026-05-25 11:09:21] [INFO ] Time to serialize gal into /tmp/LTL17006644587964096037.gal : 27 ms
[2026-05-25 11:09:21] [INFO ] Time to serialize properties into /tmp/LTL4651907243156761302.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17006644587964096037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4651907243156761302.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((((p141==0)||(p397==0))||((p698==0)||(p1044==0)))||((p1322==0)||(p1601==0)))&&((((p74==0)||(p375==0))||((p631==0)||(p932=...284
Formula 0 simplified : XX(F!"(((((p141==0)||(p397==0))||((p698==0)||(p1044==0)))||((p1322==0)||(p1601==0)))&&((((p74==0)||(p375==0))||((p631==0)||(p932==0)...272
Detected timeout of ITS tools.
[2026-05-25 11:09:36] [INFO ] Flatten gal took : 63 ms
[2026-05-25 11:09:36] [INFO ] Applying decomposition
[2026-05-25 11:09:36] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17513693172143627552.txt' '-o' '/tmp/graph17513693172143627552.bin' '-w' '/tmp/graph17513693172143627552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17513693172143627552.bin' '-l' '-1' '-v' '-w' '/tmp/graph17513693172143627552.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:09:36] [INFO ] Decomposing Gal with order
[2026-05-25 11:09:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:09:36] [INFO ] Removed a total of 9317 redundant transitions.
[2026-05-25 11:09:36] [INFO ] Flatten gal took : 128 ms
[2026-05-25 11:09:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 49 ms.
[2026-05-25 11:09:37] [INFO ] Time to serialize gal into /tmp/LTL828637854460376693.gal : 19 ms
[2026-05-25 11:09:37] [INFO ] Time to serialize properties into /tmp/LTL6150302563020443270.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL828637854460376693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6150302563020443270.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((((i3.u4.p141==0)||(i3.u112.p397==0))||((i3.u194.p698==0)||(i3.u246.p1044==0)))||((i3.u342.p1322==0)||(i3.u437.p1601==0))...422
Formula 0 simplified : XX(F!"(((((i3.u4.p141==0)||(i3.u112.p397==0))||((i3.u194.p698==0)||(i3.u246.p1044==0)))||((i3.u342.p1322==0)||(i3.u437.p1601==0)))&&...410
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B05-LTLFireability-15 finished in 142142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))) U (G((X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))||(X((!p1&&X(!p2)))&&(X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))))))'
Spot run failed in 39 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||((p2 U (p3||G(p2)))&&(X(p0) U ((p1&&X(p0))||X(G(p0))))))))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Spot run failed in 34 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 11:09:52] [INFO ] Flatten gal took : 97 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin104945612059238202
[2026-05-25 11:09:52] [INFO ] Too many transitions (2841) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:09:52] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin104945612059238202
Running compilation step : cd /tmp/ltsmin104945612059238202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 11:09:52] [INFO ] Applying decomposition
[2026-05-25 11:09:52] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9558517292099915129.txt' '-o' '/tmp/graph9558517292099915129.bin' '-w' '/tmp/graph9558517292099915129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9558517292099915129.bin' '-l' '-1' '-v' '-w' '/tmp/graph9558517292099915129.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:09:52] [INFO ] Decomposing Gal with order
[2026-05-25 11:09:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:09:53] [INFO ] Removed a total of 9361 redundant transitions.
[2026-05-25 11:09:53] [INFO ] Flatten gal took : 130 ms
[2026-05-25 11:09:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 32 ms.
[2026-05-25 11:09:53] [INFO ] Time to serialize gal into /tmp/LTLFireability10105169018128689740.gal : 17 ms
[2026-05-25 11:09:53] [INFO ] Time to serialize properties into /tmp/LTLFireability7153436854746036400.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10105169018128689740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7153436854746036400.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(((X(X("(i31.i1.i1.u355.p1251!=1)")))U((("(i31.i1.i1.u355.p1251!=1)")&&(X(X("(i31.i1.i1.u355.p1251!=1)"))))||(X(X(G("(i31.i1.i1.u3...752
Formula 0 simplified : X(X("((((i2.u26.p74==1)&&(i2.u90.p330==1))&&((i2.u179.p631==1)&&(i2.u261.p932==1)))&&((i2.u357.p1255==1)&&(i2.u434.p1534==1)))" | X"...417
Compilation finished in 8131 ms.
Running link step : cd /tmp/ltsmin104945612059238202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin104945612059238202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((X(X((LTLAPp0==true))) U (((LTLAPp0==true)&&X(X((LTLAPp0==true))))||X(X([]((LTLAPp0==true)))))) U ([]((X(X((LTLAPp0==true))) U (((LTLAPp0==true)&&X(X((LTLAPp0==true))))||X(X([]((LTLAPp0==true)))))))||(X((!(LTLAPp1==true)&&X(!(LTLAPp2==true))))&&(X(X((LTLAPp0==true))) U (((LTLAPp0==true)&&X(X((LTLAPp0==true))))||X(X([]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
LTSmin run took 395 ms.
FORMULA MedleyB-PT-B05-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin104945612059238202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))) U ([]((X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))))||(((LTLAPp5==true) U ((LTLAPp6==true)||[]((LTLAPp5==true))))&&(X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t92, t178, t235, t269, t307, t419, t453, t601, t637, t719, t775, t809, t903, t959, t992, t107...958
Computing Next relation with stutter on 1.48139e+07 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
21497 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,215.207,3716260,1,0,3.05889e+06,3301,34940,3.54276e+07,205,5044,23036962
no accepting run found
Formula 0 is TRUE no accepting run found.
Checking formula 1 : !((G(F(((X("(i36.u407.p1451!=1)"))U((("(i22.i1.i1.u286.p995==1)")&&(X("(i36.u407.p1451!=1)")))||(X(G("(i36.u407.p1451!=1)")))))U((G((X...530
Formula 1 simplified : FG((!"(i41.i0.i1.u462.p1608!=1)" M !"((i43.i1.i3.u483.p1672!=1)&&(i41.i0.i1.u462.p1608!=1))") U (X!"(i36.u407.p1451!=1)" R (XF!"(i36...232
Computing Next relation with stutter on 1.48139e+07 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin104945612059238202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))) U ([]((X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))))||(((LTLAPp5==true) U ((LTLAPp6==true)||[]((LTLAPp5==true))))&&(X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin104945612059238202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(([]((LTLAPp7==true))||<>([]((LTLAPp8==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin104945612059238202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(([]((LTLAPp7==true))||<>([]((LTLAPp8==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin104945612059238202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))) U ([]((X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))))||(((LTLAPp5==true) U ((LTLAPp6==true)||[]((LTLAPp5==true))))&&(X((LTLAPp3==true)) U (((LTLAPp4==true)&&X((LTLAPp3==true)))||X([]((LTLAPp3==true))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 11:36:33] [INFO ] Applying decomposition
[2026-05-25 11:36:33] [INFO ] Flatten gal took : 70 ms
[2026-05-25 11:36:33] [INFO ] Decomposing Gal with order
[2026-05-25 11:36:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:36:34] [INFO ] Removed a total of 9182 redundant transitions.
[2026-05-25 11:36:34] [INFO ] Flatten gal took : 312 ms
[2026-05-25 11:36:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 497 labels/synchronizations in 31 ms.
[2026-05-25 11:36:34] [INFO ] Time to serialize gal into /tmp/LTLFireability16403537578275198801.gal : 4 ms
[2026-05-25 11:36:34] [INFO ] Time to serialize properties into /tmp/LTLFireability9329105346681498818.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16403537578275198801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9329105346681498818.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F(((X("(i0.i0.u10.p1451!=1)"))U((("(i0.i0.i0.u9.p995==1)")&&(X("(i0.i0.u10.p1451!=1)")))||(X(G("(i0.i0.u10.p1451!=1)")))))U((G((X...498
Formula 0 simplified : FG((!"(i0.u11.p1608!=1)" M !"((i0.u11.p1672!=1)&&(i0.u11.p1608!=1))") U (X!"(i0.i0.u10.p1451!=1)" R (XF!"(i0.i0.u10.p1451!=1)" & (!"...208
Reverse transition relation is NOT exact ! Due to transitions t1189, i0.u11.t92, i0.u11.t95, i0.u11.t115, i0.u11.t121, i0.u11.t123, i0.u11.t176, i0.u11.t17...1291
Computing Next relation with stutter on 1.48139e+07 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B05.tgz
mv MedleyB-PT-B05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;