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-177969020100315.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100315
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779706130284

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-05-25 10:48:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 10:48:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:48:51] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2026-05-25 10:48:51] [INFO ] Transformed 1831 places.
[2026-05-25 10:48:51] [INFO ] Transformed 3454 transitions.
[2026-05-25 10:48:51] [INFO ] Found NUPN structural information;
[2026-05-25 10:48:51] [INFO ] Parsed PT model containing 1831 places and 3454 transitions and 22350 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyB-PT-B05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B05-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 1831 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1831/1831 places, 3454/3454 transitions.
Discarding 143 places :
Symmetric choice reduction at 0 with 143 rule applications. Total rules 143 place count 1688 transition count 3311
Iterating global reduction 0 with 143 rules applied. Total rules applied 286 place count 1688 transition count 3311
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 375 place count 1599 transition count 3222
Iterating global reduction 0 with 89 rules applied. Total rules applied 464 place count 1599 transition count 3222
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 516 place count 1547 transition count 3170
Iterating global reduction 0 with 52 rules applied. Total rules applied 568 place count 1547 transition count 3170
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 614 place count 1501 transition count 3124
Iterating global reduction 0 with 46 rules applied. Total rules applied 660 place count 1501 transition count 3124
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 700 place count 1461 transition count 3084
Iterating global reduction 0 with 40 rules applied. Total rules applied 740 place count 1461 transition count 3084
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 780 place count 1421 transition count 3044
Iterating global reduction 0 with 40 rules applied. Total rules applied 820 place count 1421 transition count 3044
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 860 place count 1381 transition count 3004
Iterating global reduction 0 with 40 rules applied. Total rules applied 900 place count 1381 transition count 3004
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 940 place count 1341 transition count 2964
Iterating global reduction 0 with 40 rules applied. Total rules applied 980 place count 1341 transition count 2964
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 1013 place count 1308 transition count 2931
Iterating global reduction 0 with 33 rules applied. Total rules applied 1046 place count 1308 transition count 2931
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1073 place count 1281 transition count 2904
Iterating global reduction 0 with 27 rules applied. Total rules applied 1100 place count 1281 transition count 2904
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1106 place count 1281 transition count 2898
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1116 place count 1271 transition count 2888
Iterating global reduction 1 with 10 rules applied. Total rules applied 1126 place count 1271 transition count 2888
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1136 place count 1261 transition count 2878
Iterating global reduction 1 with 10 rules applied. Total rules applied 1146 place count 1261 transition count 2878
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1151 place count 1256 transition count 2873
Iterating global reduction 1 with 5 rules applied. Total rules applied 1156 place count 1256 transition count 2873
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1161 place count 1251 transition count 2868
Iterating global reduction 1 with 5 rules applied. Total rules applied 1166 place count 1251 transition count 2868
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1171 place count 1246 transition count 2863
Iterating global reduction 1 with 5 rules applied. Total rules applied 1176 place count 1246 transition count 2863
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1181 place count 1241 transition count 2858
Iterating global reduction 1 with 5 rules applied. Total rules applied 1186 place count 1241 transition count 2858
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1191 place count 1236 transition count 2853
Iterating global reduction 1 with 5 rules applied. Total rules applied 1196 place count 1236 transition count 2853
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1201 place count 1231 transition count 2848
Iterating global reduction 1 with 5 rules applied. Total rules applied 1206 place count 1231 transition count 2848
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1211 place count 1226 transition count 2843
Iterating global reduction 1 with 5 rules applied. Total rules applied 1216 place count 1226 transition count 2843
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1221 place count 1221 transition count 2838
Iterating global reduction 1 with 5 rules applied. Total rules applied 1226 place count 1221 transition count 2838
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1231 place count 1216 transition count 2833
Iterating global reduction 1 with 5 rules applied. Total rules applied 1236 place count 1216 transition count 2833
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1240 place count 1212 transition count 2829
Iterating global reduction 1 with 4 rules applied. Total rules applied 1244 place count 1212 transition count 2829
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 1248 place count 1212 transition count 2825
Applied a total of 1248 rules in 2021 ms. Remains 1212 /1831 variables (removed 619) and now considering 2825/3454 (removed 629) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6042943629621891136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16508391516539935408.kers'
[2026-05-25 10:48:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6042943629621891136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16508391516539935408.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2825 rows 1212 cols 21052 entries
Finished phase 1 with 1205 SingleSign rule and 0 generalized
[2026-05-25 10:48:54] [INFO ] Computed 7 invariants in 18 ms
Computed 7 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-16508391516539935408.kers
Total runtime 36 ms.
[2026-05-25 10:48:56] [INFO ] Implicit Places using invariants in 1767 ms returned []
[2026-05-25 10:48:56] [INFO ] Invariant cache hit.
[2026-05-25 10:48:58] [INFO ] Implicit Places using invariants and state equation in 2581 ms returned []
Implicit Place search using SMT with State Equation took 4422 ms to find 0 implicit places.
Running 2824 sub problems to find dead transitions.
[2026-05-25 10:48:58] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/4037 variables, and 0 constraints, problems are : Problem set: 0 solved, 2824 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 2824/1354 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2824 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/4037 variables, and 0 constraints, problems are : Problem set: 0 solved, 2824 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1212 constraints, PredecessorRefiner: 1470/1354 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63725ms problems are : Problem set: 0 solved, 2824 unsolved
Search for dead transitions found 0 dead transitions in 63778ms
Starting structural reductions in LTL mode, iteration 1 : 1212/1831 places, 2825/3454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70316 ms. Remains : 1212/1831 places, 2825/3454 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1212/1212 places, 2825/2825 transitions.
Applied a total of 0 rules in 38 ms. Remains 1212 /1212 variables (removed 0) and now considering 2825/2825 (removed 0) transitions.
[2026-05-25 10:50:02] [INFO ] Invariant cache hit.
[2026-05-25 10:50:03] [INFO ] Implicit Places using invariants in 913 ms returned []
[2026-05-25 10:50:03] [INFO ] Invariant cache hit.
[2026-05-25 10:50:05] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 3071 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3111 ms. Remains : 1212/1212 places, 2825/2825 transitions.
Support contains 20 out of 1212 places after structural reductions.
[2026-05-25 10:50:06] [INFO ] Flatten gal took : 266 ms
[2026-05-25 10:50:06] [INFO ] Flatten gal took : 165 ms
[2026-05-25 10:50:06] [INFO ] Input system was already deterministic with 2825 transitions.
RANDOM walk for 40000 steps (354 resets) in 1911 ms. (20 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40003 steps (57 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (58 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (58 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (56 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (56 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (58 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (58 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
[2026-05-25 10:50:07] [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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1186/1198 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1198 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/1212 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2825/4037 variables, 1212/1219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4037 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/4037 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4037/4037 variables, and 1219 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1212/1212 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1186/1198 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 7606ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 1212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1212/1212 places, 2825/2825 transitions.
Graph (trivial) has 1186 edges and 1212 vertex of which 89 / 1212 are part of one of the 17 SCC in 21 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Graph (complete) has 2084 edges and 1140 vertex of which 1134 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 835 transitions
Trivial Post-agglo rules discarded 835 transitions
Performed 835 trivial Post agglomeration. Transition count delta: 835
Iterating post reduction 0 with 841 rules applied. Total rules applied 843 place count 1134 transition count 1884
Reduce places removed 835 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 857 rules applied. Total rules applied 1700 place count 299 transition count 1862
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 1713 place count 290 transition count 1858
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1717 place count 286 transition count 1858
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 1717 place count 286 transition count 1788
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 1857 place count 216 transition count 1788
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 1945 place count 172 transition count 1744
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1956 place count 172 transition count 1733
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 1991 place count 137 transition count 369
Iterating global reduction 5 with 35 rules applied. Total rules applied 2026 place count 137 transition count 369
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 2043 place count 137 transition count 352
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 2059 place count 121 transition count 336
Iterating global reduction 6 with 16 rules applied. Total rules applied 2075 place count 121 transition count 336
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 2084 place count 112 transition count 327
Iterating global reduction 6 with 9 rules applied. Total rules applied 2093 place count 112 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2096 place count 112 transition count 324
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 2108 place count 106 transition count 318
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2116 place count 102 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2117 place count 102 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2119 place count 102 transition count 330
Free-agglomeration rule applied 37 times.
Iterating global reduction 8 with 37 rules applied. Total rules applied 2156 place count 102 transition count 293
Reduce places removed 37 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 54 rules applied. Total rules applied 2210 place count 65 transition count 276
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2215 place count 60 transition count 271
Iterating global reduction 9 with 5 rules applied. Total rules applied 2220 place count 60 transition count 271
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 2287 place count 60 transition count 204
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 2289 place count 59 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 2291 place count 58 transition count 206
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2292 place count 58 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2293 place count 57 transition count 205
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2298 place count 57 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2300 place count 57 transition count 203
Applied a total of 2300 rules in 466 ms. Remains 57 /1212 variables (removed 1155) and now considering 203/2825 (removed 2622) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 57/1212 places, 203/2825 transitions.
RANDOM walk for 40000 steps (8 resets) in 759 ms. (52 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10497818063738023039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8778170996606455035.kers'
[2026-05-25 10:50:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10497818063738023039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8778170996606455035.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 203 rows 56 cols 1086 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 10:50:16] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8778170996606455035.kers
Total runtime 1 ms.
[2026-05-25 10:50:16] [INFO ] State equation strengthened by 144 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/57 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 203/260 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 144/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 26/260 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/57 constraints, ReadFeed: 0/144 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA MedleyB-PT-B05-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA MedleyB-PT-B05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 256 stabilizing places and 268 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1212/1212 places, 2825/2825 transitions.
Graph (trivial) has 1203 edges and 1212 vertex of which 96 / 1212 are part of one of the 18 SCC in 2 ms
Free SCC test removed 78 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 838 transitions
Trivial Post-agglo rules discarded 838 transitions
Performed 838 trivial Post agglomeration. Transition count delta: 838
Iterating post reduction 0 with 838 rules applied. Total rules applied 839 place count 1133 transition count 1896
Reduce places removed 838 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 1696 place count 295 transition count 1877
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 1704 place count 288 transition count 1876
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1705 place count 287 transition count 1876
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 1705 place count 287 transition count 1814
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 1829 place count 225 transition count 1814
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1837 place count 217 transition count 1806
Iterating global reduction 4 with 8 rules applied. Total rules applied 1845 place count 217 transition count 1806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1845 place count 217 transition count 1805
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1847 place count 216 transition count 1805
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1849 place count 214 transition count 1803
Iterating global reduction 4 with 2 rules applied. Total rules applied 1851 place count 214 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1852 place count 213 transition count 1802
Iterating global reduction 4 with 1 rules applied. Total rules applied 1853 place count 213 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1854 place count 212 transition count 1801
Iterating global reduction 4 with 1 rules applied. Total rules applied 1855 place count 212 transition count 1801
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1856 place count 212 transition count 1800
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
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 1948 place count 166 transition count 1754
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1984 place count 130 transition count 394
Iterating global reduction 5 with 36 rules applied. Total rules applied 2020 place count 130 transition count 394
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2038 place count 130 transition count 376
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2055 place count 113 transition count 354
Iterating global reduction 6 with 17 rules applied. Total rules applied 2072 place count 113 transition count 354
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2089 place count 96 transition count 332
Iterating global reduction 6 with 17 rules applied. Total rules applied 2106 place count 96 transition count 332
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2112 place count 96 transition count 326
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 2132 place count 86 transition count 333
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2133 place count 85 transition count 320
Iterating global reduction 7 with 1 rules applied. Total rules applied 2134 place count 85 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2135 place count 85 transition count 319
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 2141 place count 85 transition count 313
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2145 place count 85 transition count 313
Applied a total of 2145 rules in 336 ms. Remains 85 /1212 variables (removed 1127) and now considering 313/2825 (removed 2512) transitions.
[2026-05-25 10:50:16] [INFO ] Flow matrix only has 306 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-3855840417261906849.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7032805574921662351.kers'
[2026-05-25 10:50:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3855840417261906849.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7032805574921662351.kers]
Normalized transition count is 305 out of 306 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 305 rows 84 cols 2235 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-25 10:50:17] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7032805574921662351.kers
Total runtime 3 ms.
[2026-05-25 10:50:17] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 10:50:17] [INFO ] Flow matrix only has 306 transitions (discarded 7 similar events)
[2026-05-25 10:50:17] [INFO ] Invariant cache hit.
[2026-05-25 10:50:17] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-25 10:50:17] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2026-05-25 10:50:17] [INFO ] Redundant transitions in 9 ms returned []
Running 296 sub problems to find dead transitions.
[2026-05-25 10:50:17] [INFO ] Flow matrix only has 306 transitions (discarded 7 similar events)
[2026-05-25 10:50:17] [INFO ] Invariant cache hit.
[2026-05-25 10:50:17] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 305/390 variables, 85/122 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 62/184 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 14 (OVERLAPS) 1/391 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/391 variables, and 190 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 305/390 variables, 85/127 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 62/189 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 296/485 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/391 variables, and 485 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/1212 places, 313/2825 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61073 ms. Remains : 85/1212 places, 313/2825 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 352 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B05-LTLCardinality-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLCardinality-00 finished in 61597 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 3 out of 1212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1212/1212 places, 2825/2825 transitions.
Graph (trivial) has 1203 edges and 1212 vertex of which 96 / 1212 are part of one of the 18 SCC in 1 ms
Free SCC test removed 78 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 835 transitions
Trivial Post-agglo rules discarded 835 transitions
Performed 835 trivial Post agglomeration. Transition count delta: 835
Iterating post reduction 0 with 835 rules applied. Total rules applied 836 place count 1133 transition count 1899
Reduce places removed 835 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 856 rules applied. Total rules applied 1692 place count 298 transition count 1878
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 1702 place count 290 transition count 1876
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1704 place count 288 transition count 1876
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 1704 place count 288 transition count 1815
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 1826 place count 227 transition count 1815
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1834 place count 219 transition count 1807
Iterating global reduction 4 with 8 rules applied. Total rules applied 1842 place count 219 transition count 1807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1842 place count 219 transition count 1806
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 1844 place count 218 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1846 place count 216 transition count 1804
Iterating global reduction 4 with 2 rules applied. Total rules applied 1848 place count 216 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1849 place count 215 transition count 1803
Iterating global reduction 4 with 1 rules applied. Total rules applied 1850 place count 215 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1851 place count 214 transition count 1802
Iterating global reduction 4 with 1 rules applied. Total rules applied 1852 place count 214 transition count 1802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1853 place count 214 transition count 1801
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 1947 place count 167 transition count 1754
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1983 place count 131 transition count 394
Iterating global reduction 5 with 36 rules applied. Total rules applied 2019 place count 131 transition count 394
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 2036 place count 131 transition count 377
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2053 place count 114 transition count 354
Iterating global reduction 6 with 17 rules applied. Total rules applied 2070 place count 114 transition count 354
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2087 place count 97 transition count 331
Iterating global reduction 6 with 17 rules applied. Total rules applied 2104 place count 97 transition count 331
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2109 place count 97 transition count 326
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 2129 place count 87 transition count 333
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2130 place count 86 transition count 321
Iterating global reduction 7 with 1 rules applied. Total rules applied 2131 place count 86 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2132 place count 86 transition count 320
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 2138 place count 86 transition count 314
Applied a total of 2138 rules in 243 ms. Remains 86 /1212 variables (removed 1126) and now considering 314/2825 (removed 2511) transitions.
[2026-05-25 10:51:18] [INFO ] Flow matrix only has 307 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-2566491706897915850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12466138734799862628.kers'
[2026-05-25 10:51:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2566491706897915850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12466138734799862628.kers]
Normalized transition count is 306 out of 307 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 306 rows 85 cols 2235 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-25 10:51:18] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-12466138734799862628.kers
Total runtime 11 ms.
[2026-05-25 10:51:18] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-25 10:51:18] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2026-05-25 10:51:18] [INFO ] Invariant cache hit.
[2026-05-25 10:51:18] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-25 10:51:19] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2026-05-25 10:51:19] [INFO ] Redundant transitions in 4 ms returned []
Running 297 sub problems to find dead transitions.
[2026-05-25 10:51:19] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2026-05-25 10:51:19] [INFO ] Invariant cache hit.
[2026-05-25 10:51:19] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (OVERLAPS) 306/392 variables, 86/120 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 62/182 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 297 unsolved
SMT process timed out in 30232ms, After SMT, problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 30244ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/1212 places, 314/2825 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31222 ms. Remains : 86/1212 places, 314/2825 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 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B05-LTLCardinality-02
Product exploration explored 100000 steps with 9179 reset in 294 ms.
Stuttering criterion allowed to conclude after 19793 steps with 1796 reset in 56 ms.
FORMULA MedleyB-PT-B05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLCardinality-02 finished in 31692 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(X(G(p0))))))'
Support contains 1 out of 1212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1212/1212 places, 2825/2825 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1204 transition count 2817
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1204 transition count 2817
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 1204 transition count 2816
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 1201 transition count 2813
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 1201 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 1198 transition count 2810
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 1198 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 1195 transition count 2807
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 1195 transition count 2807
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 1193 transition count 2805
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 1193 transition count 2805
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 1191 transition count 2803
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 1191 transition count 2803
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 1189 transition count 2801
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 1187 transition count 2799
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 1185 transition count 2797
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 1185 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1184 transition count 2796
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1184 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1183 transition count 2795
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1182 transition count 2794
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1181 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1180 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1179 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1178 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1178 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1177 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1177 transition count 2789
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1176 transition count 2788
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1176 transition count 2788
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 1175 transition count 2787
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 1175 transition count 2787
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 1174 transition count 2786
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 1174 transition count 2786
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 1173 transition count 2785
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 1173 transition count 2785
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 1172 transition count 2784
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 1172 transition count 2784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 1172 transition count 2783
Applied a total of 82 rules in 1221 ms. Remains 1172 /1212 variables (removed 40) and now considering 2783/2825 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5809335733088357048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7994200844083823627.kers'
[2026-05-25 10:51:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5809335733088357048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7994200844083823627.kers]
Culled 0 columns in 3 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:51] [INFO ] Computed 7 invariants in 35 ms
Computed 7 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-7994200844083823627.kers
Total runtime 39 ms.
[2026-05-25 10:51:52] [INFO ] Implicit Places using invariants in 1039 ms returned []
[2026-05-25 10:51:52] [INFO ] Invariant cache hit.
[2026-05-25 10:51:54] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 3248 ms to find 0 implicit places.
Running 2782 sub problems to find dead transitions.
[2026-05-25 10:51:54] [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 1171/3955 variables, and 0 constraints, problems are : Problem set: 0 solved, 2782 unsolved in 30057 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 30081 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 62880ms problems are : Problem set: 0 solved, 2782 unsolved
Search for dead transitions found 0 dead transitions in 62901ms
Starting structural reductions in LTL mode, iteration 1 : 1172/1212 places, 2783/2825 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67396 ms. Remains : 1172/1212 places, 2783/2825 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(X(G(p0))))))'
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B05-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLCardinality-05 finished in 67614 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 X(p1)))'
Support contains 3 out of 1212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1212/1212 places, 2825/2825 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1206 transition count 2819
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1206 transition count 2819
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 1206 transition count 2818
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1204 transition count 2816
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1204 transition count 2816
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 1202 transition count 2814
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 1202 transition count 2814
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1200 transition count 2812
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1200 transition count 2812
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 1198 transition count 2810
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 1198 transition count 2810
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1196 transition count 2808
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1196 transition count 2808
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1194 transition count 2806
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1194 transition count 2806
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 1192 transition count 2804
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 1192 transition count 2804
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 1190 transition count 2802
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 1190 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1189 transition count 2801
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1189 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1188 transition count 2800
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1188 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1187 transition count 2799
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1187 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1186 transition count 2798
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1186 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1185 transition count 2797
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1185 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1184 transition count 2796
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1184 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1183 transition count 2795
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1182 transition count 2794
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1181 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 1180 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 1179 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1178 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1178 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1177 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1177 transition count 2789
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 1177 transition count 2788
Applied a total of 72 rules in 1244 ms. Remains 1177 /1212 variables (removed 35) and now considering 2788/2825 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11740900294933598873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7865004908934284609.kers'
[2026-05-25 10:52:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11740900294933598873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7865004908934284609.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2788 rows 1177 cols 20972 entries
Finished phase 1 with 1170 SingleSign rule and 0 generalized
[2026-05-25 10:52:58] [INFO ] Computed 7 invariants in 18 ms
Computed 7 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-7865004908934284609.kers
Total runtime 25 ms.
[2026-05-25 10:52:59] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2026-05-25 10:52:59] [INFO ] Invariant cache hit.
[2026-05-25 10:53:01] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 3118 ms to find 0 implicit places.
Running 2787 sub problems to find dead transitions.
[2026-05-25 10:53:01] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1176/3965 variables, and 0 constraints, problems are : Problem set: 0 solved, 2787 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1177 constraints, PredecessorRefiner: 2787/1317 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2787 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1176/3965 variables, and 0 constraints, problems are : Problem set: 0 solved, 2787 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1177 constraints, PredecessorRefiner: 1470/1317 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63119ms problems are : Problem set: 0 solved, 2787 unsolved
Search for dead transitions found 0 dead transitions in 63125ms
Starting structural reductions in LTL mode, iteration 1 : 1177/1212 places, 2788/2825 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67495 ms. Remains : 1177/1212 places, 2788/2825 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 X(p1)))'
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : MedleyB-PT-B05-LTLCardinality-09
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLCardinality-09 finished in 67733 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(G(p0)))'
Support contains 2 out of 1212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1212/1212 places, 2825/2825 transitions.
Graph (trivial) has 1205 edges and 1212 vertex of which 96 / 1212 are part of one of the 18 SCC in 1 ms
Free SCC test removed 78 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 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 1133 transition count 1895
Reduce places removed 839 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 860 rules applied. Total rules applied 1700 place count 294 transition count 1874
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 1709 place count 286 transition count 1873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1710 place count 285 transition count 1873
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 1710 place count 285 transition count 1812
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 1832 place count 224 transition count 1812
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1840 place count 216 transition count 1804
Iterating global reduction 4 with 8 rules applied. Total rules applied 1848 place count 216 transition count 1804
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1848 place count 216 transition count 1803
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 1850 place count 215 transition count 1803
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1852 place count 213 transition count 1801
Iterating global reduction 4 with 2 rules applied. Total rules applied 1854 place count 213 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1855 place count 212 transition count 1800
Iterating global reduction 4 with 1 rules applied. Total rules applied 1856 place count 212 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1857 place count 211 transition count 1799
Iterating global reduction 4 with 1 rules applied. Total rules applied 1858 place count 211 transition count 1799
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1859 place count 211 transition count 1798
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 1953 place count 164 transition count 1751
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 1989 place count 128 transition count 391
Iterating global reduction 5 with 36 rules applied. Total rules applied 2025 place count 128 transition count 391
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 2042 place count 128 transition count 374
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2059 place count 111 transition count 352
Iterating global reduction 6 with 17 rules applied. Total rules applied 2076 place count 111 transition count 352
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2093 place count 94 transition count 330
Iterating global reduction 6 with 17 rules applied. Total rules applied 2110 place count 94 transition count 330
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2116 place count 94 transition count 324
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 2136 place count 84 transition count 331
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2137 place count 83 transition count 318
Iterating global reduction 7 with 1 rules applied. Total rules applied 2138 place count 83 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2139 place count 83 transition count 317
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 2145 place count 83 transition count 311
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2146 place count 83 transition count 311
Applied a total of 2146 rules in 249 ms. Remains 83 /1212 variables (removed 1129) and now considering 311/2825 (removed 2514) transitions.
[2026-05-25 10:54:05] [INFO ] Flow matrix only has 304 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-12409852362410290082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5166711145097591063.kers'
[2026-05-25 10:54:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12409852362410290082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5166711145097591063.kers]
Normalized transition count is 303 out of 304 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 303 rows 82 cols 2231 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-25 10:54:05] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5166711145097591063.kers
Total runtime 2 ms.
[2026-05-25 10:54:05] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-25 10:54:05] [INFO ] Flow matrix only has 304 transitions (discarded 7 similar events)
[2026-05-25 10:54:05] [INFO ] Invariant cache hit.
[2026-05-25 10:54:05] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-25 10:54:05] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2026-05-25 10:54:05] [INFO ] Redundant transitions in 10 ms returned []
Running 294 sub problems to find dead transitions.
[2026-05-25 10:54:05] [INFO ] Flow matrix only has 304 transitions (discarded 7 similar events)
[2026-05-25 10:54:05] [INFO ] Invariant cache hit.
[2026-05-25 10:54:05] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 303/386 variables, 83/109 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 62/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 294 unsolved
SMT process timed out in 30271ms, After SMT, problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 30274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/1212 places, 311/2825 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30981 ms. Remains : 83/1212 places, 311/2825 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(G(p0)))'
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B05-LTLCardinality-10
Product exploration explored 100000 steps with 9467 reset in 200 ms.
Product exploration explored 100000 steps with 9526 reset in 347 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (3790 resets) in 468 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (368 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1393693 steps, run visited all 1 properties in 2308 ms. (steps per millisecond=603 )
Probabilistic random walk after 1393693 steps, saw 268743 distinct states, run finished after 2313 ms. (steps per millisecond=602 ) properties seen :1
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Knowledge-based reduction took 2703 ms.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 311/311 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2026-05-25 10:54:39] [INFO ] Flow matrix only has 304 transitions (discarded 7 similar events)
[2026-05-25 10:54:39] [INFO ] Invariant cache hit.
[2026-05-25 10:54:39] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-25 10:54:39] [INFO ] Flow matrix only has 304 transitions (discarded 7 similar events)
[2026-05-25 10:54:39] [INFO ] Invariant cache hit.
[2026-05-25 10:54:39] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-25 10:54:39] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2026-05-25 10:54:39] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 83/83 places, 311/311 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (3791 resets) in 451 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (363 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1393693 steps, run visited all 1 properties in 1885 ms. (steps per millisecond=739 )
Probabilistic random walk after 1393693 steps, saw 268743 distinct states, run finished after 1886 ms. (steps per millisecond=738 ) properties seen :1
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Knowledge-based reduction took 2220 ms.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9469 reset in 202 ms.
Product exploration explored 100000 steps with 9521 reset in 190 ms.
Built C files in :
/tmp/ltsmin3562134500309259231
[2026-05-25 10:54:42] [INFO ] Computing symmetric may disable matrix : 311 transitions.
[2026-05-25 10:54:42] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:54:42] [INFO ] Computing symmetric may enable matrix : 311 transitions.
[2026-05-25 10:54:42] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:54:42] [INFO ] Computing Do-Not-Accords matrix : 311 transitions.
[2026-05-25 10:54:42] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:54:42] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3562134500309259231
Running compilation step : cd /tmp/ltsmin3562134500309259231;'/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'
Compilation finished in 1035 ms.
Running link step : cd /tmp/ltsmin3562134500309259231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin3562134500309259231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2060802523922370602.hoa' '--buchi-type=spotba'
LTSmin run took 10787 ms.
FORMULA MedleyB-PT-B05-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B05-LTLCardinality-10 finished in 49641 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(p0)||(p0&&G(p1)&&F(p2))) U X(!p2)))'
Support contains 3 out of 1212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1212/1212 places, 2825/2825 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1205 transition count 2818
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1205 transition count 2818
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 1205 transition count 2817
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1203 transition count 2815
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1203 transition count 2815
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1201 transition count 2813
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1201 transition count 2813
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1199 transition count 2811
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1199 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1198 transition count 2810
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1198 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1197 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1197 transition count 2809
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1196 transition count 2808
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1196 transition count 2808
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1195 transition count 2807
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1195 transition count 2807
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1194 transition count 2806
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1194 transition count 2806
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1193 transition count 2805
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1193 transition count 2805
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1192 transition count 2804
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1192 transition count 2804
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1191 transition count 2803
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1191 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1190 transition count 2802
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1190 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1189 transition count 2801
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1189 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1188 transition count 2800
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1188 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1187 transition count 2799
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1187 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1186 transition count 2798
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1186 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1185 transition count 2797
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1185 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1184 transition count 2796
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1184 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1183 transition count 2795
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1182 transition count 2794
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1181 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1181 transition count 2793
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 1181 transition count 2792
Applied a total of 64 rules in 1418 ms. Remains 1181 /1212 variables (removed 31) and now considering 2792/2825 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-467146033994627433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10966677236114479028.kers'
[2026-05-25 10:54:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-467146033994627433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10966677236114479028.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 2792 rows 1181 cols 20978 entries
Finished phase 1 with 1174 SingleSign rule and 0 generalized
[2026-05-25 10:54:56] [INFO ] Computed 7 invariants in 51 ms
Computed 7 P flows in 52 ms.
Exported basis to /tmp/petrispot-output-10966677236114479028.kers
Total runtime 60 ms.
[2026-05-25 10:54:57] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2026-05-25 10:54:57] [INFO ] Invariant cache hit.
[2026-05-25 10:54:59] [INFO ] Implicit Places using invariants and state equation in 2351 ms returned []
Implicit Place search using SMT with State Equation took 3468 ms to find 0 implicit places.
Running 2791 sub problems to find dead transitions.
[2026-05-25 10:54:59] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1180/3973 variables, and 0 constraints, problems are : Problem set: 0 solved, 2791 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1181 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 1180/3973 variables, and 0 constraints, problems are : Problem set: 0 solved, 2791 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 1470/1321 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63075ms problems are : Problem set: 0 solved, 2791 unsolved
Search for dead transitions found 0 dead transitions in 63082ms
Starting structural reductions in LTL mode, iteration 1 : 1181/1212 places, 2792/2825 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67978 ms. Remains : 1181/1212 places, 2792/2825 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(p0)||(p0&&G(p1)&&F(p2))) U X(!p2)))'
Stuttering acceptance computed with spot in 271 ms :[p2, p2, (AND (NOT p0) p2), p2, (AND (NOT p0) (NOT p1) p2), true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B05-LTLCardinality-14
Product exploration explored 100000 steps with 890 reset in 281 ms.
Product exploration explored 100000 steps with 882 reset in 289 ms.
Computed a total of 255 stabilizing places and 267 stable transitions
Computed a total of 255 stabilizing places and 267 stable transitions
Detected a total of 255/1181 stabilizing places and 267/2792 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 24 factoid took 100 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (351 resets) in 289 ms. (137 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (56 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (55 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (59 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (58 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (60 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 145 ms. (274 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (57 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
[2026-05-25 10:56:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 395/398 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem apf13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 783/1181 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1181/3973 variables, and 12 constraints, problems are : Problem set: 2 solved, 8 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 395/398 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 783/1181 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1181 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1181 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2792/3973 variables, 1181/1194 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3973 variables, 8/1202 constraints. Problems are: Problem set: 2 solved, 8 unsolved
SMT process timed out in 10913ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 2792/2792 transitions.
Graph (trivial) has 1174 edges and 1181 vertex of which 96 / 1181 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 2035 edges and 1103 vertex of which 1097 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 825 transitions
Trivial Post-agglo rules discarded 825 transitions
Performed 825 trivial Post agglomeration. Transition count delta: 825
Iterating post reduction 0 with 831 rules applied. Total rules applied 833 place count 1097 transition count 1853
Reduce places removed 825 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 844 rules applied. Total rules applied 1677 place count 272 transition count 1834
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1686 place count 265 transition count 1832
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1688 place count 263 transition count 1832
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 1688 place count 263 transition count 1764
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 1824 place count 195 transition count 1764
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 1825 place count 195 transition count 1763
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1909 place count 153 transition count 1721
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1921 place count 153 transition count 1709
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 1957 place count 117 transition count 344
Iterating global reduction 6 with 36 rules applied. Total rules applied 1993 place count 117 transition count 344
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2010 place count 117 transition count 327
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2027 place count 100 transition count 310
Iterating global reduction 7 with 17 rules applied. Total rules applied 2044 place count 100 transition count 310
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2055 place count 89 transition count 299
Iterating global reduction 7 with 11 rules applied. Total rules applied 2066 place count 89 transition count 299
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2071 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 2083 place count 83 transition count 288
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2089 place count 80 transition count 303
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2121 place count 80 transition count 271
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 65 rules applied. Total rules applied 2186 place count 48 transition count 238
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2192 place count 42 transition count 232
Iterating global reduction 9 with 6 rules applied. Total rules applied 2198 place count 42 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 97 transitions
Redundant transition composition rules discarded 97 transitions
Iterating global reduction 9 with 97 rules applied. Total rules applied 2295 place count 42 transition count 135
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 2297 place count 41 transition count 134
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 2301 place count 39 transition count 152
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2303 place count 39 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2305 place count 37 transition count 150
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2308 place count 37 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2310 place count 37 transition count 148
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2311 place count 36 transition count 146
Iterating global reduction 10 with 1 rules applied. Total rules applied 2312 place count 36 transition count 146
Applied a total of 2312 rules in 148 ms. Remains 36 /1181 variables (removed 1145) and now considering 146/2792 (removed 2646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 36/1181 places, 146/2792 transitions.
RANDOM walk for 40000 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/8 properties
BEST_FIRST walk for 36784 steps (8 resets) in 39 ms. (919 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge based reduction with 26 factoid took 425 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 509 ms :[(OR (NOT p0) p2), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) (NOT p1)), (OR p2 (AND (NOT p0) (NOT p1))), true, (OR p2 (AND (NOT p0) (NOT p1)))]
[2026-05-25 10:56:16] [INFO ] Invariant cache hit.
[2026-05-25 10:56:17] [INFO ] [Real]Absence check using 7 positive place invariants in 72 ms returned sat
[2026-05-25 10:56:27] [INFO ] [Real]Absence check using state equation in 10316 ms returned sat
[2026-05-25 10:56:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:56:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 39 ms returned sat
[2026-05-25 10:56:35] [INFO ] [Nat]Absence check using state equation in 6832 ms returned sat
[2026-05-25 10:56:36] [INFO ] Computed and/alt/rep : 2741/10506/2741 causal constraints (skipped 50 transitions) in 252 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:593)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
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)
[2026-05-25 10:56:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG p2
Could not prove EG p2
Knowledge-based reduction took 39112 ms.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) p2), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) (NOT p1)), (OR p2 (AND (NOT p0) (NOT p1))), true, (OR p2 (AND (NOT p0) (NOT p1)))]
Support contains 3 out of 1181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1181/1181 places, 2792/2792 transitions.
Applied a total of 0 rules in 52 ms. Remains 1181 /1181 variables (removed 0) and now considering 2792/2792 (removed 0) transitions.
[2026-05-25 10:56:43] [INFO ] Invariant cache hit.
[2026-05-25 10:56:44] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2026-05-25 10:56:44] [INFO ] Invariant cache hit.
[2026-05-25 10:56:46] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 3131 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3184 ms. Remains : 1181/1181 places, 2792/2792 transitions.
Computed a total of 255 stabilizing places and 267 stable transitions
Computed a total of 255 stabilizing places and 267 stable transitions
Detected a total of 255/1181 stabilizing places and 267/2792 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (351 resets) in 242 ms. (164 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (57 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (57 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (58 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (58 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
[2026-05-25 10:56:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 395/398 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 783/1181 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1181 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2792/3973 variables, 1181/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3973 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/3973 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Real declared 3973/3973 variables, and 1190 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1181/1181 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 395/398 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 783/1181 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1181 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1181 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1181 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2792/3973 variables, 1181/1192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3973 variables, 5/1197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 11067ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 2792/2792 transitions.
Graph (trivial) has 1174 edges and 1181 vertex of which 96 / 1181 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 1103 vertex of which 1097 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 825 transitions
Trivial Post-agglo rules discarded 825 transitions
Performed 825 trivial Post agglomeration. Transition count delta: 825
Iterating post reduction 0 with 831 rules applied. Total rules applied 833 place count 1097 transition count 1853
Reduce places removed 825 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 844 rules applied. Total rules applied 1677 place count 272 transition count 1834
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1686 place count 265 transition count 1832
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1688 place count 263 transition count 1832
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 1688 place count 263 transition count 1764
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 1824 place count 195 transition count 1764
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 1825 place count 195 transition count 1763
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1909 place count 153 transition count 1721
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1921 place count 153 transition count 1709
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 1957 place count 117 transition count 344
Iterating global reduction 6 with 36 rules applied. Total rules applied 1993 place count 117 transition count 344
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2010 place count 117 transition count 327
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 2027 place count 100 transition count 310
Iterating global reduction 7 with 17 rules applied. Total rules applied 2044 place count 100 transition count 310
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2055 place count 89 transition count 299
Iterating global reduction 7 with 11 rules applied. Total rules applied 2066 place count 89 transition count 299
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2071 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 2083 place count 83 transition count 288
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
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 2089 place count 80 transition count 303
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2121 place count 80 transition count 271
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 65 rules applied. Total rules applied 2186 place count 48 transition count 238
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2192 place count 42 transition count 232
Iterating global reduction 9 with 6 rules applied. Total rules applied 2198 place count 42 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 97 transitions
Redundant transition composition rules discarded 97 transitions
Iterating global reduction 9 with 97 rules applied. Total rules applied 2295 place count 42 transition count 135
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 2297 place count 41 transition count 134
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 2301 place count 39 transition count 152
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2303 place count 39 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2305 place count 37 transition count 150
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2308 place count 37 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2310 place count 37 transition count 148
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2311 place count 36 transition count 146
Iterating global reduction 10 with 1 rules applied. Total rules applied 2312 place count 36 transition count 146
Applied a total of 2312 rules in 194 ms. Remains 36 /1181 variables (removed 1145) and now considering 146/2792 (removed 2646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 36/1181 places, 146/2792 transitions.
RANDOM walk for 23424 steps (5 resets) in 212 ms. (109 steps per ms) remains 0/5 properties
Knowledge based reduction with 9 factoid took 188 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 482 ms :[(OR (NOT p0) p2), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) (NOT p1)), (OR p2 (AND (NOT p0) (NOT p1))), true, (OR p2 (AND (NOT p0) (NOT p1)))]
[2026-05-25 10:56:58] [INFO ] Invariant cache hit.
[2026-05-25 10:56:59] [INFO ] [Real]Absence check using 7 positive place invariants in 73 ms returned sat
[2026-05-25 10:57:09] [INFO ] [Real]Absence check using state equation in 9718 ms returned sat
[2026-05-25 10:57:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:57:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 37 ms returned sat
[2026-05-25 10:57:17] [INFO ] [Nat]Absence check using state equation in 6899 ms returned sat
[2026-05-25 10:57:17] [INFO ] Computed and/alt/rep : 2741/10506/2741 causal constraints (skipped 50 transitions) in 350 ms.
[2026-05-25 10:57:24] [INFO ] Added : 185 causal constraints over 37 iterations in 7125 ms. Result :unknown
Could not prove EG p2
Knowledge-based reduction took 38204 ms.
Stuttering acceptance computed with spot in 606 ms :[(OR (NOT p0) p2), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) (NOT p1)), (OR p2 (AND (NOT p0) (NOT p1))), true, (OR p2 (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 547 ms :[(OR (NOT p0) p2), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) (NOT p1)), (OR p2 (AND (NOT p0) (NOT p1))), true, (OR p2 (AND (NOT p0) (NOT p1)))]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B05-LTLCardinality-14 finished in 150973 ms.
All properties solved by simple procedures.
Total runtime 514247 ms.

BK_STOP 1779706645900

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-177969020100315"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;