Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499200252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 ErlangenMainframeV2-PT-bP06C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.2K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 27 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 7.5K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.9M May 26 18:17 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 ErlangenMainframeV2-PT-bP06C06-LTLFireability-00
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-01
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-02
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-03
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-04
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-05
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-06
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-07
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-08
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-09
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-10
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-11
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-12
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-13
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-14
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780381958302

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 06:32:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 06:32:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 06:32:41] [INFO ] Load time of PNML (sax parser for PT used): 593 ms
[2026-06-02 06:32:41] [INFO ] Transformed 279 places.
[2026-06-02 06:32:41] [INFO ] Transformed 2491 transitions.
[2026-06-02 06:32:41] [INFO ] Found NUPN structural information;
[2026-06-02 06:32:41] [INFO ] Parsed PT model containing 279 places and 2491 transitions and 38716 arcs in 847 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 2491/2491 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 216 transition count 2428
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 216 transition count 2428
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 161 place count 181 transition count 2393
Iterating global reduction 0 with 35 rules applied. Total rules applied 196 place count 181 transition count 2393
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 198 place count 179 transition count 2391
Iterating global reduction 0 with 2 rules applied. Total rules applied 200 place count 179 transition count 2391
Applied a total of 200 rules in 231 ms. Remains 179 /279 variables (removed 100) and now considering 2391/2491 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17993104217508824119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7154587622361178728.kers'
[2026-06-02 06:32:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17993104217508824119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7154587622361178728.kers]
Culled 0 columns in 10 ms.
// Phase 1: matrix 2391 rows 179 cols 38516 entries
Finished phase 1 with 156 SingleSign rule and 3 generalized
[2026-06-02 06:32:42] [INFO ] Computed 20 invariants in 36 ms
Computed 20 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-7154587622361178728.kers
Total runtime 48 ms.
[2026-06-02 06:32:43] [INFO ] Implicit Places using invariants in 701 ms returned []
[2026-06-02 06:32:43] [INFO ] Invariant cache hit.
[2026-06-02 06:32:45] [INFO ] Implicit Places using invariants and state equation in 1898 ms returned []
Implicit Place search using SMT with State Equation took 2672 ms to find 0 implicit places.
Running 2390 sub problems to find dead transitions.
[2026-06-02 06:32:45] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 178/2570 variables, and 7 constraints, problems are : Problem set: 0 solved, 2390 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/179 constraints, PredecessorRefiner: 2390/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2390 unsolved
SMT process timed out in 64714ms, After SMT, problems are : Problem set: 0 solved, 2390 unsolved
Search for dead transitions found 0 dead transitions in 64834ms
Starting structural reductions in LTL mode, iteration 1 : 179/279 places, 2391/2491 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67842 ms. Remains : 179/279 places, 2391/2491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Applied a total of 0 rules in 15 ms. Remains 179 /179 variables (removed 0) and now considering 2391/2391 (removed 0) transitions.
[2026-06-02 06:33:49] [INFO ] Invariant cache hit.
[2026-06-02 06:33:50] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-06-02 06:33:50] [INFO ] Invariant cache hit.
[2026-06-02 06:33:51] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1142 ms. Remains : 179/179 places, 2391/2391 transitions.
Support contains 50 out of 179 places after structural reductions.
[2026-06-02 06:33:52] [INFO ] Flatten gal took : 930 ms
[2026-06-02 06:33:52] [INFO ] Flatten gal took : 344 ms
[2026-06-02 06:33:53] [INFO ] Input system was already deterministic with 2391 transitions.
RANDOM walk for 40000 steps (8 resets) in 6507 ms. (6 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
[2026-06-02 06:33:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/110 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 33/143 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 36/179 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 2391/2570 variables, 179/199 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2570 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/2570 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2570/2570 variables, and 199 constraints, problems are : Problem set: 1 solved, 28 unsolved in 4338 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 66/110 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 33/143 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 36/179 variables, 7/21 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 2391/2570 variables, 179/200 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2570/2570 variables, and 200 constraints, problems are : Problem set: 1 solved, 28 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 28/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9529ms problems are : Problem set: 1 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Graph (trivial) has 123 edges and 179 vertex of which 9 / 179 are part of one of the 4 SCC in 8 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 174 transition count 2350
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 51 rules applied. Total rules applied 83 place count 143 transition count 2330
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 94 place count 132 transition count 2330
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 94 place count 132 transition count 2319
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 116 place count 121 transition count 2319
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 118 transition count 2303
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 118 transition count 2303
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 117 transition count 2299
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 117 transition count 2299
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 172 place count 93 transition count 2275
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 91 transition count 2269
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 91 transition count 2269
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 188 place count 85 transition count 2280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 193 place count 85 transition count 2275
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 195 place count 83 transition count 2269
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 83 transition count 2269
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 201 place count 83 transition count 2265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 82 transition count 2270
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 82 transition count 2268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 81 transition count 2280
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 210 place count 81 transition count 2277
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 213 place count 78 transition count 2277
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 78 transition count 2276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 215 place count 78 transition count 2290
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 218 place count 77 transition count 2288
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 239 place count 77 transition count 2267
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 251 place count 77 transition count 2267
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 257 place count 77 transition count 2261
Applied a total of 257 rules in 2574 ms. Remains 77 /179 variables (removed 102) and now considering 2261/2391 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2576 ms. Remains : 77/179 places, 2261/2391 transitions.
RANDOM walk for 40000 steps (8 resets) in 4222 ms. (9 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4000 steps (8 resets) in 81 ms. (48 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 89 ms. (44 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 104 ms. (38 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 114 ms. (34 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 103 ms. (38 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 90 ms. (43 steps per ms) remains 24/24 properties
[2026-06-02 06:34:09] [INFO ] Flow matrix only has 2254 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-17482851471145483204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15476181510934157103.kers'
[2026-06-02 06:34:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17482851471145483204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15476181510934157103.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2254 rows 77 cols 38140 entries
Finished phase 1 with 54 SingleSign rule and 3 generalized
[2026-06-02 06:34:09] [INFO ] Computed 20 invariants in 23 ms
Computed 20 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-15476181510934157103.kers
Total runtime 31 ms.
[2026-06-02 06:34:09] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 3/58 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 19/77 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 2254/2331 variables, 77/97 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2331 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/2331 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2331/2331 variables, and 127 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4918 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 11/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 3/58 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 19/77 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 2254/2331 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2331/2331 variables, and 128 constraints, problems are : Problem set: 0 solved, 24 unsolved in 19101 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24195ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 1321 ms.
Support contains 44 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 2261/2261 transitions.
Applied a total of 0 rules in 172 ms. Remains 77 /77 variables (removed 0) and now considering 2261/2261 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 77/77 places, 2261/2261 transitions.
RANDOM walk for 40000 steps (8 resets) in 1732 ms. (23 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 135905 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :1 out of 23
Probabilistic random walk after 135905 steps, saw 28822 distinct states, run finished after 3011 ms. (steps per millisecond=45 ) properties seen :1
[2026-06-02 06:34:39] [INFO ] Flow matrix only has 2254 transitions (discarded 7 similar events)
[2026-06-02 06:34:39] [INFO ] Invariant cache hit.
[2026-06-02 06:34:39] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 3/58 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 19/77 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2254/2331 variables, 77/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2331 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/2331 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2331/2331 variables, and 127 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4126 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 22/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 3/58 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 19/77 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 2254/2331 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2331/2331 variables, and 128 constraints, problems are : Problem set: 0 solved, 22 unsolved in 17526 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 22/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21715ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 1465 ms.
Support contains 40 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 2261/2261 transitions.
Applied a total of 0 rules in 276 ms. Remains 77 /77 variables (removed 0) and now considering 2261/2261 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 77/77 places, 2261/2261 transitions.
RANDOM walk for 40000 steps (8 resets) in 2065 ms. (19 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 146454 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 22
Probabilistic random walk after 146454 steps, saw 30604 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
[2026-06-02 06:35:06] [INFO ] Flow matrix only has 2254 transitions (discarded 7 similar events)
[2026-06-02 06:35:06] [INFO ] Invariant cache hit.
[2026-06-02 06:35:06] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 3/58 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 19/77 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2254/2331 variables, 77/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2331 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/2331 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2331/2331 variables, and 127 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4970 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 22/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 3/58 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 19/77 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 2254/2331 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2331/2331 variables, and 128 constraints, problems are : Problem set: 0 solved, 22 unsolved in 18260 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 22/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23284ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 1 properties in 1282 ms.
Support contains 40 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 2261/2261 transitions.
Applied a total of 0 rules in 176 ms. Remains 77 /77 variables (removed 0) and now considering 2261/2261 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 77/77 places, 2261/2261 transitions.
RANDOM walk for 40000 steps (8 resets) in 1656 ms. (24 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 132060 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 20
Probabilistic random walk after 132060 steps, saw 28041 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2026-06-02 06:35:35] [INFO ] Flow matrix only has 2254 transitions (discarded 7 similar events)
[2026-06-02 06:35:35] [INFO ] Invariant cache hit.
[2026-06-02 06:35:35] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 3/58 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 19/77 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2254/2331 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2331/2331 variables, and 128 constraints, problems are : Problem set: 0 solved, 20 unsolved in 7012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 3/58 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 19/77 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2254/2331 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2331 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/2331 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2331/2331 variables, and 128 constraints, problems are : Problem set: 0 solved, 20 unsolved in 13005 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 20/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20061ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 1 properties in 1074 ms.
Support contains 40 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 2261/2261 transitions.
Applied a total of 0 rules in 183 ms. Remains 77 /77 variables (removed 0) and now considering 2261/2261 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 77/77 places, 2261/2261 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 18 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)))'
Support contains 9 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Graph (trivial) has 138 edges and 179 vertex of which 9 / 179 are part of one of the 4 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 173 transition count 2355
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 49 rules applied. Total rules applied 79 place count 144 transition count 2335
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 90 place count 133 transition count 2335
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 90 place count 133 transition count 2324
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 113 place count 121 transition count 2324
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 130 place count 104 transition count 1578
Ensure Unique test removed 6 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 153 place count 98 transition count 1578
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 153 place count 98 transition count 1577
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 97 transition count 1577
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 162 place count 90 transition count 243
Iterating global reduction 3 with 7 rules applied. Total rules applied 169 place count 90 transition count 243
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 87 transition count 237
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 87 transition count 237
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 229 place count 60 transition count 210
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 232 place count 57 transition count 203
Iterating global reduction 3 with 3 rules applied. Total rules applied 235 place count 57 transition count 203
Performed 9 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 253 place count 48 transition count 221
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 265 place count 48 transition count 209
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 267 place count 46 transition count 205
Iterating global reduction 4 with 2 rules applied. Total rules applied 269 place count 46 transition count 205
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 279 place count 46 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 281 place count 45 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 292 place count 45 transition count 197
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 295 place count 45 transition count 197
Applied a total of 295 rules in 341 ms. Remains 45 /179 variables (removed 134) and now considering 197/2391 (removed 2194) transitions.
[2026-06-02 06:35:57] [INFO ] Flow matrix only has 184 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10648935118429683123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11129325515435752119.kers'
[2026-06-02 06:35:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10648935118429683123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11129325515435752119.kers]
Normalized transition count is 183 out of 184 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 45 cols 2580 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-06-02 06:35:57] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11129325515435752119.kers
Total runtime 4 ms.
[2026-06-02 06:35:57] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-06-02 06:35:57] [INFO ] Flow matrix only has 184 transitions (discarded 13 similar events)
[2026-06-02 06:35:57] [INFO ] Invariant cache hit.
[2026-06-02 06:35:57] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 06:35:57] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2026-06-02 06:35:57] [INFO ] Redundant transitions in 9 ms returned []
Running 189 sub problems to find dead transitions.
[2026-06-02 06:35:57] [INFO ] Flow matrix only has 184 transitions (discarded 13 similar events)
[2026-06-02 06:35:57] [INFO ] Invariant cache hit.
[2026-06-02 06:35:57] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 183/228 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 1/229 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 0/229 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 70 constraints, problems are : Problem set: 0 solved, 189 unsolved in 13519 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 189/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 183/228 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 61/129 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 1/229 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/229 variables, and 131 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 45/45 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 189/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43819ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 43820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/179 places, 197/2391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44509 ms. Remains : 45/179 places, 197/2391 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 382 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1028 ms.
Product exploration explored 100000 steps with 0 reset in 543 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1417 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 309 ms. (129 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1277761 steps, run visited all 1 properties in 2100 ms. (steps per millisecond=608 )
Probabilistic random walk after 1277761 steps, saw 179707 distinct states, run finished after 2104 ms. (steps per millisecond=607 ) properties seen :1
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 2851 ms.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 197/197 transitions.
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2026-06-02 06:36:46] [INFO ] Flow matrix only has 184 transitions (discarded 13 similar events)
[2026-06-02 06:36:46] [INFO ] Invariant cache hit.
[2026-06-02 06:36:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-06-02 06:36:46] [INFO ] Flow matrix only has 184 transitions (discarded 13 similar events)
[2026-06-02 06:36:46] [INFO ] Invariant cache hit.
[2026-06-02 06:36:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 06:36:46] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2026-06-02 06:36:46] [INFO ] Redundant transitions in 14 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 45/45 places, 197/197 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 703 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 421 ms. (94 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1277761 steps, run visited all 1 properties in 2414 ms. (steps per millisecond=529 )
Probabilistic random walk after 1277761 steps, saw 179707 distinct states, run finished after 2415 ms. (steps per millisecond=529 ) properties seen :1
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 3024 ms.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 786 ms.
Product exploration explored 100000 steps with 0 reset in 490 ms.
Built C files in :
/tmp/ltsmin1366029129295502856
[2026-06-02 06:36:51] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2026-06-02 06:36:51] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 06:36:51] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2026-06-02 06:36:51] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 06:36:51] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2026-06-02 06:36:51] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 06:36:51] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1366029129295502856
Running compilation step : cd /tmp/ltsmin1366029129295502856;'/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 1573 ms.
Running link step : cd /tmp/ltsmin1366029129295502856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin1366029129295502856;'/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/stateBased16560475659425357640.hoa' '--buchi-type=spotba'
LTSmin run took 12339 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-03 finished in 68630 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((G((F(p1)&&F(G(p2))))||p0))))'
Support contains 17 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Graph (trivial) has 137 edges and 179 vertex of which 9 / 179 are part of one of the 4 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 173 transition count 2355
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 49 rules applied. Total rules applied 79 place count 144 transition count 2335
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 90 place count 133 transition count 2335
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 90 place count 133 transition count 2325
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 110 place count 123 transition count 2325
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 121 place count 112 transition count 1642
Iterating global reduction 3 with 11 rules applied. Total rules applied 132 place count 112 transition count 1642
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 132 place count 112 transition count 1641
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 111 transition count 1641
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 108 transition count 827
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 108 transition count 827
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 107 transition count 825
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 107 transition count 825
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 200 place count 78 transition count 796
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 203 place count 75 transition count 789
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 75 transition count 789
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 220 place count 68 transition count 807
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 232 place count 68 transition count 795
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 66 transition count 791
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 66 transition count 791
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 246 place count 66 transition count 781
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 248 place count 65 transition count 794
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 257 place count 65 transition count 785
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 65 transition count 785
Applied a total of 261 rules in 342 ms. Remains 65 /179 variables (removed 114) and now considering 785/2391 (removed 1606) transitions.
[2026-06-02 06:37:05] [INFO ] Flow matrix only has 772 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1365446545859937570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5568565656218188161.kers'
[2026-06-02 06:37:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1365446545859937570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5568565656218188161.kers]
Normalized transition count is 771 out of 772 initially.
Culled 0 columns in 4 ms.
// Phase 1: matrix 771 rows 65 cols 12982 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-06-02 06:37:05] [INFO ] Computed 20 invariants in 15 ms
Computed 20 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-5568565656218188161.kers
Total runtime 20 ms.
[2026-06-02 06:37:06] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-06-02 06:37:06] [INFO ] Flow matrix only has 772 transitions (discarded 13 similar events)
[2026-06-02 06:37:06] [INFO ] Invariant cache hit.
[2026-06-02 06:37:06] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-06-02 06:37:06] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2026-06-02 06:37:06] [INFO ] Redundant transitions in 63 ms returned []
Running 777 sub problems to find dead transitions.
[2026-06-02 06:37:06] [INFO ] Flow matrix only has 772 transitions (discarded 13 similar events)
[2026-06-02 06:37:06] [INFO ] Invariant cache hit.
[2026-06-02 06:37:06] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 5 (OVERLAPS) 771/836 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 10/96 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/837 variables, and 96 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 777/32 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 777 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 5 (OVERLAPS) 771/836 variables, 65/86 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 10/96 constraints. Problems are: Problem set: 0 solved, 777 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 32/128 constraints. Problems are: Problem set: 0 solved, 777 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/837 variables, and 128 constraints, problems are : Problem set: 0 solved, 777 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 777/32 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61241ms problems are : Problem set: 0 solved, 777 unsolved
Search for dead transitions found 0 dead transitions in 61246ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/179 places, 785/2391 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62533 ms. Remains : 65/179 places, 785/2391 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((G((F(p1)&&F(G(p2))))||p0))))'
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 1877 ms.
Product exploration explored 100000 steps with 0 reset in 1866 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 13 factoid took 79 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 1299 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 1033 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 932 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 804 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 812 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 808 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 811 ms. (49 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 360741 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 6
Probabilistic random walk after 360741 steps, saw 63195 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
[2026-06-02 06:38:16] [INFO ] Flow matrix only has 772 transitions (discarded 13 similar events)
[2026-06-02 06:38:16] [INFO ] Invariant cache hit.
[2026-06-02 06:38:16] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 13/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 21/65 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 771/836 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/837 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/837 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/837 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 837/837 variables, and 96 constraints, problems are : Problem set: 0 solved, 6 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/30 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 14/44 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 21/65 variables, 7/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 771/836 variables, 65/86 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 10/96 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/836 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/837 variables, 1/97 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/837 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/837 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 837/837 variables, and 97 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 65/65 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1802ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 149 ms.
Support contains 17 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 785/785 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 779
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 63 transition count 779
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 62 transition count 792
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 62 transition count 791
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 18 place count 62 transition count 784
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 55 transition count 784
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 39 place count 55 transition count 770
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 55 transition count 776
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 43 place count 54 transition count 774
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 56 place count 54 transition count 761
Applied a total of 56 rules in 180 ms. Remains 54 /65 variables (removed 11) and now considering 761/785 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 54/65 places, 761/785 transitions.
RANDOM walk for 40000 steps (8 resets) in 1034 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 24957 steps (4 resets) in 184 ms. (134 steps per ms) remains 0/3 properties
Found 2 invariant AP formulas.
Knowledge based reduction with 15 factoid took 117 ms. Proved property starting from automaton with 3 states, 6 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 7665 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-04 finished in 74173 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&&F((p1||G(p2))))) U X(X(X(!p1)))))'
Support contains 13 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 163 transition count 1659
Ensure Unique test removed 6 places
Iterating global reduction 0 with 22 rules applied. Total rules applied 38 place count 157 transition count 1659
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 150 transition count 320
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 150 transition count 320
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 148 transition count 317
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 148 transition count 317
Applied a total of 56 rules in 36 ms. Remains 148 /179 variables (removed 31) and now considering 317/2391 (removed 2074) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7128969018320353634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3211297564575923959.kers'
[2026-06-02 06:38:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7128969018320353634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3211297564575923959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 148 cols 2086 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-06-02 06:38:19] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3211297564575923959.kers
Total runtime 4 ms.
[2026-06-02 06:38:19] [INFO ] Implicit Places using invariants in 137 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/179 places, 317/2391 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 147/179 places, 317/2391 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&&F((p1||G(p2))))) U X(X(X(!p1)))))'
Stuttering acceptance computed with spot in 382 ms :[p1, p1, p1, p1, p1, true, p1, p1, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 177 ms.
Product exploration explored 100000 steps with 25000 reset in 221 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37146 steps (8 resets) in 152 ms. (242 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p1, p1, p1, p1, true]
Knowledge-based reduction took 492 ms.
Stuttering acceptance computed with spot in 177 ms :[p1, p1, p1, p1, true]
Support contains 3 out of 147 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 317/317 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11367186801267409540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7898171706142161801.kers'
[2026-06-02 06:38:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11367186801267409540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7898171706142161801.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 147 cols 1957 entries
Finished phase 1 with 134 SingleSign rule and 0 generalized
[2026-06-02 06:38:21] [INFO ] Computed 13 invariants in 3 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7898171706142161801.kers
Total runtime 4 ms.
[2026-06-02 06:38:21] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-06-02 06:38:21] [INFO ] Invariant cache hit.
[2026-06-02 06:38:21] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-06-02 06:38:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 317/464 variables, 147/160 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 0/464 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 160 constraints, problems are : Problem set: 0 solved, 316 unsolved in 25105 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 317/464 variables, 147/160 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 316/476 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 477 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55528ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 55529ms
Finished structural reductions in LTL mode , in 1 iterations and 55918 ms. Remains : 147/147 places, 317/317 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33753 steps (7 resets) in 141 ms. (237 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[p1, p1, p1, p1, true]
Knowledge-based reduction took 523 ms.
Stuttering acceptance computed with spot in 192 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 211 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 25000 reset in 446 ms.
Product exploration explored 100000 steps with 25000 reset in 243 ms.
Spot run failed in 153 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin814791421834930590
[2026-06-02 06:39:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin814791421834930590
Running compilation step : cd /tmp/ltsmin814791421834930590;'/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 1033 ms.
Running link step : cd /tmp/ltsmin814791421834930590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin814791421834930590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16935922972159629853.hoa' '--buchi-type=spotba'
LTSmin run took 40 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-05 finished in 60565 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((X(p1)||p0))||(p2 U (X(p4)&&p3))))'
Support contains 18 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 161 transition count 1644
Ensure Unique test removed 6 places
Iterating global reduction 0 with 24 rules applied. Total rules applied 42 place count 155 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 151 transition count 1152
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 151 transition count 1152
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 148 transition count 1149
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 148 transition count 1149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 147 transition count 1148
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 147 transition count 1148
Applied a total of 58 rules in 34 ms. Remains 147 /179 variables (removed 32) and now considering 1148/2391 (removed 1243) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3407187393247430341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2128845195535976263.kers'
[2026-06-02 06:39:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3407187393247430341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2128845195535976263.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1148 rows 147 cols 12148 entries
Finished phase 1 with 132 SingleSign rule and 1 generalized
[2026-06-02 06:39:20] [INFO ] Computed 14 invariants in 8 ms
Computed 14 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2128845195535976263.kers
Total runtime 12 ms.
[2026-06-02 06:39:20] [INFO ] Implicit Places using invariants in 226 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 229 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/179 places, 1148/2391 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 1148/1148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 146/179 places, 1148/2391 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((X(p1)||p0))||(p2 U (X(p4)&&p3))))'
Stuttering acceptance computed with spot in 611 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (OR (NOT p3) (NOT p4)), (NOT p4), (NOT p4)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 2623 ms.
Product exploration explored 100000 steps with 0 reset in 2658 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 113 factoid took 382 ms. Reduced automaton from 12 states, 60 edges and 5 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1978 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1223 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 998 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 770 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 900 ms. (44 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 341058 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 4
Probabilistic random walk after 341058 steps, saw 51768 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10634697862875503094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6893146184412530018.kers'
[2026-06-02 06:39:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10634697862875503094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6893146184412530018.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1148 rows 146 cols 11175 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-06-02 06:39:31] [INFO ] Computed 13 invariants in 12 ms
Computed 13 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6893146184412530018.kers
Total runtime 15 ms.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 77/86 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 60/146 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1148/1294 variables, 146/159 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1294 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1294 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1294 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1294/1294 variables, and 160 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1621 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 77/86 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 60/146 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1148/1294 variables, 146/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1294 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1294 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1294/1294 variables, and 160 constraints, problems are : Problem set: 1 solved, 3 unsolved in 896 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2561ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 91 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 15 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 114 factoid took 275 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 8241 ms.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 146 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 1148/1148 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 1148/1148 (removed 0) transitions.
[2026-06-02 06:39:34] [INFO ] Invariant cache hit.
[2026-06-02 06:39:34] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-06-02 06:39:34] [INFO ] Invariant cache hit.
[2026-06-02 06:39:35] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 1147 sub problems to find dead transitions.
[2026-06-02 06:39:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 146/1294 variables, and 14 constraints, problems are : Problem set: 0 solved, 1147 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 1147/155 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 4 (OVERLAPS) 1148/1294 variables, 146/160 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1294 variables, 155/315 constraints. Problems are: Problem set: 0 solved, 1147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1294/1294 variables, and 315 constraints, problems are : Problem set: 0 solved, 1147 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 1147/155 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61658ms problems are : Problem set: 0 solved, 1147 unsolved
Search for dead transitions found 0 dead transitions in 61663ms
Finished structural reductions in LTL mode , in 1 iterations and 62437 ms. Remains : 146/146 places, 1148/1148 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1929 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1252 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 855 ms. (46 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 369517 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 2
Probabilistic random walk after 369517 steps, saw 55741 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2026-06-02 06:40:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/86 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/146 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1148/1294 variables, 146/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1294 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1294 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1294/1294 variables, and 159 constraints, problems are : Problem set: 0 solved, 2 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/86 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/146 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1148/1294 variables, 146/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1294 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1294 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1294 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1294/1294 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1502 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2475ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 91 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 4 ms.
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 6994 ms.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2589 ms.
Product exploration explored 100000 steps with 0 reset in 2602 ms.
Spot run failed in 87 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15223251470083489978
[2026-06-02 06:40:49] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15223251470083489978
Running compilation step : cd /tmp/ltsmin15223251470083489978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15223251470083489978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15223251470083489978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 9 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 1148/1148 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 303
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 139 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 139 transition count 301
Applied a total of 14 rules in 8 ms. Remains 139 /146 variables (removed 7) and now considering 301/1148 (removed 847) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3126706233743173854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6980723807266240300.kers'
[2026-06-02 06:40:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3126706233743173854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6980723807266240300.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 139 cols 1885 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-06-02 06:40:52] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6980723807266240300.kers
Total runtime 3 ms.
[2026-06-02 06:40:53] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-06-02 06:40:53] [INFO ] Invariant cache hit.
[2026-06-02 06:40:53] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2026-06-02 06:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 301/440 variables, 139/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 0/440 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 152 constraints, problems are : Problem set: 0 solved, 300 unsolved in 24360 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 301/440 variables, 139/152 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 300/452 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 460 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54633ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 54635ms
Starting structural reductions in LTL mode, iteration 1 : 139/146 places, 301/1148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55015 ms. Remains : 139/146 places, 301/1148 transitions.
Built C files in :
/tmp/ltsmin1330049176137215045
[2026-06-02 06:41:47] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1330049176137215045
Running compilation step : cd /tmp/ltsmin1330049176137215045;'/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 1316 ms.
Running link step : cd /tmp/ltsmin1330049176137215045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1330049176137215045;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased18356718866780000915.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-02 06:42:03] [INFO ] Flatten gal took : 25 ms
[2026-06-02 06:42:03] [INFO ] Flatten gal took : 17 ms
[2026-06-02 06:42:03] [INFO ] Time to serialize gal into /tmp/LTL12204297065155546231.gal : 12 ms
[2026-06-02 06:42:03] [INFO ] Time to serialize properties into /tmp/LTL15682327815503702574.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12204297065155546231.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12239529660105087202.hoa' '-atoms' '/tmp/LTL15682327815503702574.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15682327815503702574.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12239529660105087202.hoa
Reverse transition relation is NOT exact ! Due to transitions t14, t19, t22, t30, t75, t78, t86, t93, t97, t99, t100, t101, t104, t105, t109, t111, t114, t...1228
Detected timeout of ITS tools.
[2026-06-02 06:42:18] [INFO ] Flatten gal took : 91 ms
[2026-06-02 06:42:19] [INFO ] Flatten gal took : 87 ms
[2026-06-02 06:42:19] [INFO ] Time to serialize gal into /tmp/LTL12197098000147454051.gal : 45 ms
[2026-06-02 06:42:19] [INFO ] Time to serialize properties into /tmp/LTL12159756022392911129.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12197098000147454051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12159756022392911129.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(("((((p2==0)||(p23==0))||((p49==0)||(p61==0)))||(((p76==0)||(p99==0))||((p125==0)||(p165==0))))")||(("(p261==0)")||(X("(((((p2==...522
Formula 0 simplified : F(!"((((p2==0)||(p23==0))||((p49==0)||(p61==0)))||(((p76==0)||(p99==0))||((p125==0)||(p165==0))))" & !"(p261==0)" & X!"(((((p2==1)&&...509
Detected timeout of ITS tools.
[2026-06-02 06:42:34] [INFO ] Flatten gal took : 85 ms
[2026-06-02 06:42:34] [INFO ] Applying decomposition
[2026-06-02 06:42:34] [INFO ] Flatten gal took : 109 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17088790957199101482.txt' '-o' '/tmp/graph17088790957199101482.bin' '-w' '/tmp/graph17088790957199101482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17088790957199101482.bin' '-l' '-1' '-v' '-w' '/tmp/graph17088790957199101482.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:42:34] [INFO ] Decomposing Gal with order
[2026-06-02 06:42:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:42:35] [INFO ] Removed a total of 2744 redundant transitions.
[2026-06-02 06:42:35] [INFO ] Flatten gal took : 665 ms
[2026-06-02 06:42:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 31 ms.
[2026-06-02 06:42:35] [INFO ] Time to serialize gal into /tmp/LTL13637134450039184536.gal : 8 ms
[2026-06-02 06:42:35] [INFO ] Time to serialize properties into /tmp/LTL7193170265898651442.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13637134450039184536.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7193170265898651442.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(("((((i1.u21.p2==0)||(i1.u21.p23==0))||((i1.u21.p49==0)||(i1.u21.p61==0)))||(((i1.u38.p76==0)||(i1.u39.p99==0))||((i1.u39.p125==...800
Formula 0 simplified : F(!"((((i1.u21.p2==0)||(i1.u21.p23==0))||((i1.u21.p49==0)||(i1.u21.p61==0)))||(((i1.u38.p76==0)||(i1.u39.p99==0))||((i1.u39.p125==0)...787
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-06 finished in 210646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(X(!p1) U ((X(!p1)&&(!p2 U (G(!p2)||(!p2&&(!p1||G(!p3))))))||X(G(!p1)))))))'
Support contains 25 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 172 transition count 2129
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 172 transition count 2129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 168 transition count 1637
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 168 transition count 1637
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 165 transition count 1634
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 165 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 164 transition count 1633
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 164 transition count 1633
Applied a total of 30 rules in 42 ms. Remains 164 /179 variables (removed 15) and now considering 1633/2391 (removed 758) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17633832136670282089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15901791075077077098.kers'
[2026-06-02 06:42:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17633832136670282089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15901791075077077098.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1633 rows 164 cols 25746 entries
Finished phase 1 with 141 SingleSign rule and 3 generalized
[2026-06-02 06:42:50] [INFO ] Computed 20 invariants in 15 ms
Computed 20 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-15901791075077077098.kers
Total runtime 22 ms.
[2026-06-02 06:42:51] [INFO ] Implicit Places using invariants in 498 ms returned []
[2026-06-02 06:42:51] [INFO ] Invariant cache hit.
[2026-06-02 06:42:52] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
Running 1632 sub problems to find dead transitions.
[2026-06-02 06:42:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/1797 variables, and 20 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 1632/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 164/1797 variables, and 20 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 1488/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62615ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 62627ms
Starting structural reductions in LTL mode, iteration 1 : 164/179 places, 1633/2391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64532 ms. Remains : 164/179 places, 1633/2391 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(!p0) U ((X(!p0)&&(!p1 U (G(!p1)||(!p1&&(!p0||G(!p2))))))||X(G(!p0))))&&p3)))'
Stuttering acceptance computed with spot in 380 ms :[true, p0, (OR (NOT p3) p0), (OR (NOT p3) p0), p0, (AND p0 p2), (AND p2 p0), p0, p0, p2]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 682 ms.
Product exploration explored 100000 steps with 33333 reset in 1203 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 16 factoid took 32 ms. Proved property starting from automaton with 10 states, 26 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 64 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-07 finished in 66946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(X(p1))))))'
Support contains 17 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 166 transition count 1706
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 166 transition count 1706
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 161 transition count 890
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 161 transition count 890
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 157 transition count 885
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 157 transition count 885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 156 transition count 884
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 156 transition count 884
Applied a total of 46 rules in 54 ms. Remains 156 /179 variables (removed 23) and now considering 884/2391 (removed 1507) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4338945164496949747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12695156386114739570.kers'
[2026-06-02 06:43:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4338945164496949747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12695156386114739570.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 884 rows 156 cols 13156 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-06-02 06:43:57] [INFO ] Computed 20 invariants in 12 ms
Computed 20 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-12695156386114739570.kers
Total runtime 18 ms.
[2026-06-02 06:43:58] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-06-02 06:43:58] [INFO ] Invariant cache hit.
[2026-06-02 06:43:58] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Running 883 sub problems to find dead transitions.
[2026-06-02 06:43:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 883 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/1040 variables, and 20 constraints, problems are : Problem set: 0 solved, 883 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/156 constraints, PredecessorRefiner: 883/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 883 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 4 (OVERLAPS) 884/1040 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 883 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 149/325 constraints. Problems are: Problem set: 0 solved, 883 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 325 constraints, problems are : Problem set: 0 solved, 883 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 883/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61537ms problems are : Problem set: 0 solved, 883 unsolved
Search for dead transitions found 0 dead transitions in 61542ms
Starting structural reductions in LTL mode, iteration 1 : 156/179 places, 884/2391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62731 ms. Remains : 156/179 places, 884/2391 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p0))&&p1))))'
Stuttering acceptance computed with spot in 199 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-09 finished in 62978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(p1))) U X(X(X(!p0)))))'
Support contains 18 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 167 transition count 1707
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 167 transition count 1707
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 161 transition count 675
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 161 transition count 675
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 157 transition count 670
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 157 transition count 670
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 156 transition count 669
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 156 transition count 669
Applied a total of 46 rules in 41 ms. Remains 156 /179 variables (removed 23) and now considering 669/2391 (removed 1722) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14663898417138683079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4824616111245988141.kers'
[2026-06-02 06:45:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14663898417138683079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4824616111245988141.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 669 rows 156 cols 9270 entries
Finished phase 1 with 134 SingleSign rule and 2 generalized
[2026-06-02 06:45:00] [INFO ] Computed 20 invariants in 9 ms
Computed 20 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4824616111245988141.kers
Total runtime 12 ms.
[2026-06-02 06:45:01] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-06-02 06:45:01] [INFO ] Invariant cache hit.
[2026-06-02 06:45:01] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Running 668 sub problems to find dead transitions.
[2026-06-02 06:45:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 4 (OVERLAPS) 669/825 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/825 variables, and 176 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 668/152 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 668 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 4 (OVERLAPS) 669/825 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 668 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 152/328 constraints. Problems are: Problem set: 0 solved, 668 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 825/825 variables, and 338 constraints, problems are : Problem set: 0 solved, 668 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 668/152 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61092ms problems are : Problem set: 0 solved, 668 unsolved
Search for dead transitions found 0 dead transitions in 61096ms
Starting structural reductions in LTL mode, iteration 1 : 156/179 places, 669/2391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62047 ms. Remains : 156/179 places, 669/2391 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(p1))) U X(X(X(!p0)))))'
Stuttering acceptance computed with spot in 898 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, p0, p0, p0, p0, p0, p0, p0, true, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 1665 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-10 finished in 64682 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((F(p0)&&F((G(F((G(F(p1))||(F(p1)&&X(!p2)))))||(!p3&&F((G(F(p1))||(F(p1)&&X(!p2)))))))))))'
Support contains 23 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 167 transition count 1707
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 167 transition count 1707
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 165 transition count 1705
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 165 transition count 1705
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 163 transition count 1703
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 163 transition count 1703
Applied a total of 32 rules in 37 ms. Remains 163 /179 variables (removed 16) and now considering 1703/2391 (removed 688) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12120237822894183765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7016226611615297583.kers'
[2026-06-02 06:46:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12120237822894183765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7016226611615297583.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 1703 rows 163 cols 27770 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-06-02 06:46:05] [INFO ] Computed 20 invariants in 26 ms
Computed 20 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-7016226611615297583.kers
Total runtime 34 ms.
[2026-06-02 06:46:05] [INFO ] Implicit Places using invariants in 435 ms returned []
[2026-06-02 06:46:05] [INFO ] Invariant cache hit.
[2026-06-02 06:46:07] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
Running 1702 sub problems to find dead transitions.
[2026-06-02 06:46:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/1866 variables, and 7 constraints, problems are : Problem set: 0 solved, 1702 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 1702/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1702 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/1866 variables, and 20 constraints, problems are : Problem set: 0 solved, 1702 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 1544/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62965ms problems are : Problem set: 0 solved, 1702 unsolved
Search for dead transitions found 0 dead transitions in 62974ms
Starting structural reductions in LTL mode, iteration 1 : 163/179 places, 1703/2391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64815 ms. Remains : 163/179 places, 1703/2391 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((F(p0)&&F((G(F((G(F(p1))||(F(p1)&&X(p2)))))||(p3&&F((G(F(p1))||(F(p1)&&X(p2)))))))))))'
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 1097 ms.
Product exploration explored 100000 steps with 25000 reset in 787 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 2126 ms. (18 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1352 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1117 ms. (35 steps per ms) remains 2/2 properties
[2026-06-02 06:47:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 55/163 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1703/1866 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1866 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1866 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1649 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 55/163 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1703/1866 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1866 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1866 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2990ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 245 ms.
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 1703/1703 transitions.
Graph (trivial) has 137 edges and 163 vertex of which 11 / 163 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 157 transition count 1664
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 40 rules applied. Total rules applied 68 place count 130 transition count 1651
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 76 place count 122 transition count 1651
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 76 place count 122 transition count 1639
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 100 place count 110 transition count 1639
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 104 transition count 309
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 104 transition count 309
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 101 transition count 303
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 101 transition count 303
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 182 place count 69 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 186 place count 69 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 189 place count 66 transition count 257
Iterating global reduction 4 with 3 rules applied. Total rules applied 192 place count 66 transition count 257
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 210 place count 57 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 218 place count 57 transition count 275
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 219 place count 56 transition count 272
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 56 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 221 place count 56 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 55 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 242 place count 55 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 244 place count 54 transition count 275
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 253 place count 54 transition count 266
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 276 place count 45 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 286 place count 45 transition count 242
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 45 transition count 260
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 290 place count 44 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 304 place count 44 transition count 244
Applied a total of 304 rules in 242 ms. Remains 44 /163 variables (removed 119) and now considering 244/1703 (removed 1459) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 44/163 places, 244/1703 transitions.
RANDOM walk for 35146 steps (7 resets) in 571 ms. (61 steps per ms) remains 0/2 properties
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 5384 ms.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 9 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 1703/1703 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 1703/1703 (removed 0) transitions.
[2026-06-02 06:47:18] [INFO ] Invariant cache hit.
[2026-06-02 06:47:18] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-06-02 06:47:18] [INFO ] Invariant cache hit.
[2026-06-02 06:47:19] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1492 ms. Remains : 163/163 places, 1703/1703 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 3027 ms. (13 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1201 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1347 ms. (29 steps per ms) remains 2/2 properties
[2026-06-02 06:47:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 55/163 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1703/1866 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1866 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1866 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 55/163 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1703/1866 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1866 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1866 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2826ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 229 ms.
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 1703/1703 transitions.
Graph (trivial) has 137 edges and 163 vertex of which 11 / 163 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 157 transition count 1664
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 40 rules applied. Total rules applied 68 place count 130 transition count 1651
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 76 place count 122 transition count 1651
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 76 place count 122 transition count 1639
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 100 place count 110 transition count 1639
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 104 transition count 309
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 104 transition count 309
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 101 transition count 303
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 101 transition count 303
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 182 place count 69 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 186 place count 69 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 189 place count 66 transition count 257
Iterating global reduction 4 with 3 rules applied. Total rules applied 192 place count 66 transition count 257
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 210 place count 57 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 218 place count 57 transition count 275
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 219 place count 56 transition count 272
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 56 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 221 place count 56 transition count 271
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 55 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 242 place count 55 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 244 place count 54 transition count 275
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 253 place count 54 transition count 266
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 276 place count 45 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 286 place count 45 transition count 242
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 45 transition count 260
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 290 place count 44 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 304 place count 44 transition count 244
Applied a total of 304 rules in 231 ms. Remains 44 /163 variables (removed 119) and now considering 244/1703 (removed 1459) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 44/163 places, 244/1703 transitions.
RANDOM walk for 28153 steps (5 resets) in 338 ms. (83 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 5478 ms.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 850 ms.
Product exploration explored 100000 steps with 25000 reset in 667 ms.
Spot run failed in 89 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin11225762317332467947
[2026-06-02 06:47:27] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11225762317332467947
Running compilation step : cd /tmp/ltsmin11225762317332467947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11225762317332467947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11225762317332467947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 1703/1703 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 373
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 373
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 154 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 154 transition count 367
Applied a total of 18 rules in 16 ms. Remains 154 /163 variables (removed 9) and now considering 367/1703 (removed 1336) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1845482720771842832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13918078640993361122.kers'
[2026-06-02 06:47:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1845482720771842832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13918078640993361122.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 367 rows 154 cols 3818 entries
Finished phase 1 with 132 SingleSign rule and 2 generalized
[2026-06-02 06:47:30] [INFO ] Computed 20 invariants in 4 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13918078640993361122.kers
Total runtime 6 ms.
[2026-06-02 06:47:30] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-06-02 06:47:30] [INFO ] Invariant cache hit.
[2026-06-02 06:47:30] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2026-06-02 06:47:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/521 variables, 154/174 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 174 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 366/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (OVERLAPS) 367/521 variables, 154/174 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 302/476 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 479 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 366/302 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in LTL mode, iteration 1 : 154/163 places, 367/1703 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60990 ms. Remains : 154/163 places, 367/1703 transitions.
Built C files in :
/tmp/ltsmin707511556448534243
[2026-06-02 06:48:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin707511556448534243
Running compilation step : cd /tmp/ltsmin707511556448534243;'/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 1452 ms.
Running link step : cd /tmp/ltsmin707511556448534243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin707511556448534243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6137183774915680258.hoa' '--buchi-type=spotba'
LTSmin run took 41 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-11 finished in 147433 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(F(p0)))))'
Support contains 9 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 160 transition count 1643
Ensure Unique test removed 6 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 44 place count 154 transition count 1643
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 145 transition count 307
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 145 transition count 307
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 141 transition count 302
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 141 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 140 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 140 transition count 301
Applied a total of 72 rules in 36 ms. Remains 140 /179 variables (removed 39) and now considering 301/2391 (removed 2090) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-91695165665874656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13288092474764771625.kers'
[2026-06-02 06:48:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-91695165665874656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13288092474764771625.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 140 cols 2014 entries
Finished phase 1 with 125 SingleSign rule and 1 generalized
[2026-06-02 06:48:32] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13288092474764771625.kers
Total runtime 4 ms.
[2026-06-02 06:48:32] [INFO ] Implicit Places using invariants in 142 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/179 places, 301/2391 transitions.
Applied a total of 0 rules in 1 ms. Remains 139 /139 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 139/179 places, 301/2391 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(F(p0)))))'
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 826 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-12 finished in 1235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(!p1 U (G(!p1)||(!p1&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))))))))'
Support contains 22 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 171 transition count 2128
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 171 transition count 2128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 167 transition count 1636
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 167 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 164 transition count 1633
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 164 transition count 1633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 163 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 163 transition count 1632
Applied a total of 32 rules in 67 ms. Remains 163 /179 variables (removed 16) and now considering 1632/2391 (removed 759) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4908874488009899459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18056522512456709578.kers'
[2026-06-02 06:48:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4908874488009899459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18056522512456709578.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 1632 rows 163 cols 25744 entries
Finished phase 1 with 140 SingleSign rule and 3 generalized
[2026-06-02 06:48:34] [INFO ] Computed 20 invariants in 24 ms
Computed 20 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-18056522512456709578.kers
Total runtime 30 ms.
[2026-06-02 06:48:34] [INFO ] Implicit Places using invariants in 490 ms returned []
[2026-06-02 06:48:34] [INFO ] Invariant cache hit.
[2026-06-02 06:48:35] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
Running 1631 sub problems to find dead transitions.
[2026-06-02 06:48:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 162/1795 variables, and 7 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 1631/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1631 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/1795 variables, and 20 constraints, problems are : Problem set: 0 solved, 1631 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/163 constraints, PredecessorRefiner: 1488/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62824ms problems are : Problem set: 0 solved, 1631 unsolved
Search for dead transitions found 0 dead transitions in 62833ms
Starting structural reductions in LTL mode, iteration 1 : 163/179 places, 1632/2391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64765 ms. Remains : 163/179 places, 1632/2391 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(!p1 U (G(!p1)||(!p1&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))))))))'
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p3 p2 p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p3)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 1046 ms.
Product exploration explored 100000 steps with 33333 reset in 667 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 22 factoid took 16 ms. Proved property starting from automaton with 6 states, 28 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-13 finished in 66850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(F(G(!p1))&&(!p0 U (G(!p0)||(!p0&&((X(!p2)&&F(!p3))||X(G(!p2)))))))))))'
Support contains 23 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 2391/2391 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 166 transition count 1706
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 166 transition count 1706
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 162 transition count 1214
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 162 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 159 transition count 1211
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 159 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 158 transition count 1210
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 158 transition count 1210
Applied a total of 42 rules in 36 ms. Remains 158 /179 variables (removed 21) and now considering 1210/2391 (removed 1181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16544417347469519643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3171041645134822105.kers'
[2026-06-02 06:49:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16544417347469519643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3171041645134822105.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1210 rows 158 cols 18992 entries
Finished phase 1 with 136 SingleSign rule and 2 generalized
[2026-06-02 06:49:40] [INFO ] Computed 20 invariants in 15 ms
Computed 20 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-3171041645134822105.kers
Total runtime 19 ms.
[2026-06-02 06:49:41] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-06-02 06:49:41] [INFO ] Invariant cache hit.
[2026-06-02 06:49:42] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
Running 1209 sub problems to find dead transitions.
[2026-06-02 06:49:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/1368 variables, and 20 constraints, problems are : Problem set: 0 solved, 1209 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 1209/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/1368 variables, and 20 constraints, problems are : Problem set: 0 solved, 1209 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 1058/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61827ms problems are : Problem set: 0 solved, 1209 unsolved
Search for dead transitions found 0 dead transitions in 61833ms
Starting structural reductions in LTL mode, iteration 1 : 158/179 places, 1210/2391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63025 ms. Remains : 158/179 places, 1210/2391 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(F(G(p1))&&(p0 U (G(p0)||(p0&&((X(!p2)&&F(!p3))||X(G(!p2)))))))))))'
Stuttering acceptance computed with spot in 548 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2), (AND p3 p2 (NOT p0)), (NOT p1), p3, (AND p3 p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP06C06-LTLFireability-14
Product exploration explored 100000 steps with 1 reset in 2841 ms.
Product exploration explored 100000 steps with 0 reset in 2760 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 10 states, 20 edges and 4 AP (stutter sensitive) to 10 states, 18 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 2190 ms. (18 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 980 ms. (40 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 916 ms. (43 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 909 ms. (43 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 939 ms. (42 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 752 ms. (53 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 868 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 823 ms. (48 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 814 ms. (49 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 922 ms. (43 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 899 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 874 ms. (45 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 970 ms. (41 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 1403833 steps, run timeout after 12001 ms. (steps per millisecond=116 ) properties seen :0 out of 12
Probabilistic random walk after 1403833 steps, saw 182598 distinct states, run finished after 12001 ms. (steps per millisecond=116 ) properties seen :0
[2026-06-02 06:51:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/53 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 63/116 variables, 4/14 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 42/158 variables, 7/21 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1210/1368 variables, 158/179 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1368 variables, 0/179 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1368 variables, 0/179 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 179 constraints, problems are : Problem set: 5 solved, 7 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 30/53 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 63/116 variables, 4/14 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 42/158 variables, 7/21 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1210/1368 variables, 158/179 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1368 variables, 0/179 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1368 variables, 0/179 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 179 constraints, problems are : Problem set: 5 solved, 7 unsolved in 2249 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4743ms problems are : Problem set: 5 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 299 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=99 )
Parikh walk visited 7 properties in 354 ms.
Found 5 invariant AP formulas.
Knowledge based reduction with 9 factoid took 169 ms. Reduced automaton from 10 states, 18 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 21625 ms.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 17 out of 158 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 1210/1210 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 1210/1210 (removed 0) transitions.
[2026-06-02 06:51:11] [INFO ] Invariant cache hit.
[2026-06-02 06:51:12] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-06-02 06:51:12] [INFO ] Invariant cache hit.
[2026-06-02 06:51:12] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 158/158 places, 1210/1210 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1525 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 824 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 814 ms. (49 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 381843 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 2
Probabilistic random walk after 381843 steps, saw 57333 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
[2026-06-02 06:51:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 63/111 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 47/158 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1210/1368 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1368 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1368 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2151 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 63/111 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 47/158 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1210/1368 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1368 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1368 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3365ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 295 steps, including 3 resets, run visited all 1 properties in 4 ms. (steps per millisecond=73 )
Parikh walk visited 2 properties in 94 ms.
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 7922 ms.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 3060 ms.
Product exploration explored 100000 steps with 0 reset in 2803 ms.
Spot run failed in 69 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10027281260610424784
[2026-06-02 06:51:27] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10027281260610424784
Running compilation step : cd /tmp/ltsmin10027281260610424784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10027281260610424784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10027281260610424784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 17 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 1210/1210 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 155 transition count 526
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 155 transition count 526
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 153 transition count 522
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 153 transition count 522
Applied a total of 10 rules in 10 ms. Remains 153 /158 variables (removed 5) and now considering 522/1210 (removed 688) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13211086913997490775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5695474352465563514.kers'
[2026-06-02 06:51:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13211086913997490775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5695474352465563514.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 522 rows 153 cols 6672 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-06-02 06:51:30] [INFO ] Computed 20 invariants in 5 ms
Computed 20 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5695474352465563514.kers
Total runtime 7 ms.
[2026-06-02 06:51:30] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-06-02 06:51:30] [INFO ] Invariant cache hit.
[2026-06-02 06:51:30] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 521 sub problems to find dead transitions.
[2026-06-02 06:51:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (OVERLAPS) 522/675 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 675/675 variables, and 173 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 521/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 4 (OVERLAPS) 522/675 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 150/323 constraints. Problems are: Problem set: 0 solved, 521 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 6/329 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/675 variables, and 329 constraints, problems are : Problem set: 0 solved, 521 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 521/150 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60521ms problems are : Problem set: 0 solved, 521 unsolved
Search for dead transitions found 0 dead transitions in 60523ms
Starting structural reductions in LTL mode, iteration 1 : 153/158 places, 522/1210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61133 ms. Remains : 153/158 places, 522/1210 transitions.
Built C files in :
/tmp/ltsmin18376741494957289038
[2026-06-02 06:52:31] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18376741494957289038
Running compilation step : cd /tmp/ltsmin18376741494957289038;'/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 2432 ms.
Running link step : cd /tmp/ltsmin18376741494957289038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin18376741494957289038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9984294123079949475.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-02 06:52:46] [INFO ] Flatten gal took : 71 ms
[2026-06-02 06:52:46] [INFO ] Flatten gal took : 49 ms
[2026-06-02 06:52:46] [INFO ] Time to serialize gal into /tmp/LTL16723755878736223841.gal : 8 ms
[2026-06-02 06:52:46] [INFO ] Time to serialize properties into /tmp/LTL13973355764825525300.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16723755878736223841.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8210427011569495009.hoa' '-atoms' '/tmp/LTL13973355764825525300.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13973355764825525300.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8210427011569495009.hoa
Detected timeout of ITS tools.
[2026-06-02 06:53:02] [INFO ] Flatten gal took : 236 ms
[2026-06-02 06:53:02] [INFO ] Flatten gal took : 224 ms
[2026-06-02 06:53:02] [INFO ] Time to serialize gal into /tmp/LTL10190050711105143140.gal : 33 ms
[2026-06-02 06:53:02] [INFO ] Time to serialize properties into /tmp/LTL13462527423710515010.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10190050711105143140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13462527423710515010.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((((p4!=1)||(p29!=1))||((p37!=1)||(p67!=1)))||(((p86!=1)||(p94!=1))||((p124!=1)||(p171!=1))))"))||((F(G("(((((p2!=1)||(p23!...919
Formula 0 simplified : XX(F!"((((p4!=1)||(p29!=1))||((p37!=1)||(p67!=1)))||(((p86!=1)||(p94!=1))||((p124!=1)||(p171!=1))))" & (GF!"(((((p2!=1)||(p23!=1))||...683
Detected timeout of ITS tools.
[2026-06-02 06:53:17] [INFO ] Flatten gal took : 222 ms
[2026-06-02 06:53:17] [INFO ] Applying decomposition
[2026-06-02 06:53:18] [INFO ] Flatten gal took : 221 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8583598206525878719.txt' '-o' '/tmp/graph8583598206525878719.bin' '-w' '/tmp/graph8583598206525878719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8583598206525878719.bin' '-l' '-1' '-v' '-w' '/tmp/graph8583598206525878719.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:53:18] [INFO ] Decomposing Gal with order
[2026-06-02 06:53:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:53:18] [INFO ] Removed a total of 9990 redundant transitions.
[2026-06-02 06:53:18] [INFO ] Flatten gal took : 333 ms
[2026-06-02 06:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 131 ms.
[2026-06-02 06:53:19] [INFO ] Time to serialize gal into /tmp/LTL11352900211613938614.gal : 8 ms
[2026-06-02 06:53:19] [INFO ] Time to serialize properties into /tmp/LTL16090332132032235289.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11352900211613938614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16090332132032235289.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((((i2.u2.p4!=1)||(i2.u9.p29!=1))||((i2.u11.p37!=1)||(i2.u14.p67!=1)))||(((i2.u18.p86!=1)||(i2.u21.p94!=1))||((i2.u25.p124!...1371
Formula 0 simplified : XX(F!"((((i2.u2.p4!=1)||(i2.u9.p29!=1))||((i2.u11.p37!=1)||(i2.u14.p67!=1)))||(((i2.u18.p86!=1)||(i2.u21.p94!=1))||((i2.u25.p124!=1)...1029
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV2-PT-bP06C06-LTLFireability-14 finished in 233223 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((X(p1)||p0))||(p2 U (X(p4)&&p3))))'
Spot run failed in 54 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(F(G(!p1))&&(!p0 U (G(!p0)||(!p0&&((X(!p2)&&F(!p3))||X(G(!p2)))))))))))'
Spot run failed in 51 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-02 06:53:34] [INFO ] Flatten gal took : 264 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6404531869049172272
[2026-06-02 06:53:34] [INFO ] Too many transitions (2391) to apply POR reductions. Disabling POR matrices.
[2026-06-02 06:53:34] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6404531869049172272
Running compilation step : cd /tmp/ltsmin6404531869049172272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-06-02 06:53:34] [INFO ] Applying decomposition
[2026-06-02 06:53:35] [INFO ] Flatten gal took : 337 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11070186148450498058.txt' '-o' '/tmp/graph11070186148450498058.bin' '-w' '/tmp/graph11070186148450498058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11070186148450498058.bin' '-l' '-1' '-v' '-w' '/tmp/graph11070186148450498058.weights' '-q' '0' '-e' '0.001'
[2026-06-02 06:53:35] [INFO ] Decomposing Gal with order
[2026-06-02 06:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 06:53:36] [INFO ] Removed a total of 15392 redundant transitions.
[2026-06-02 06:53:36] [INFO ] Flatten gal took : 394 ms
[2026-06-02 06:53:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 89 ms.
[2026-06-02 06:53:36] [INFO ] Time to serialize gal into /tmp/LTLFireability3549203198955930759.gal : 8 ms
[2026-06-02 06:53:36] [INFO ] Time to serialize properties into /tmp/LTLFireability3915897766672579954.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3549203198955930759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3915897766672579954.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((G(("((((i2.u30.p2==0)||(i2.u6.p23==0))||((i2.u9.p49==0)||(i1.u29.p61==0)))||(((i2.u54.p76==0)||(i1.u18.p99==0))||((i2.u23.p125==0)...789
Formula 0 simplified : F(!"((((i2.u30.p2==0)||(i2.u6.p23==0))||((i2.u9.p49==0)||(i1.u29.p61==0)))||(((i2.u54.p76==0)||(i1.u18.p99==0))||((i2.u23.p125==0)||...776
Compilation finished in 16470 ms.
Running link step : cd /tmp/ltsmin6404531869049172272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin6404531869049172272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((X((LTLAPp1==true))||(LTLAPp0==true)))||((LTLAPp2==true) U (X((LTLAPp4==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6404531869049172272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((X((LTLAPp1==true))||(LTLAPp0==true)))||((LTLAPp2==true) U (X((LTLAPp4==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6404531869049172272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(([](!(LTLAPp5==true))||(<>([](!(LTLAPp6==true)))&&(!(LTLAPp5==true) U ([](!(LTLAPp5==true))||(!(LTLAPp5==true)&&((X(!(LTLAPp7==true))&&<>(!(LTLAPp8==true)))||X([](!(LTLAPp7==true)))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t14, t19, t75, t124, t463, t465, t466, t468, t472, t474, t476, t477, t493, t495, t502, t504, ...892
Detected timeout of ITS tools.
[2026-06-02 07:20:36] [INFO ] Applying decomposition
[2026-06-02 07:20:44] [INFO ] Flatten gal took : 7775 ms
[2026-06-02 07:20:46] [INFO ] Decomposing Gal with order
[2026-06-02 07:20:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 07:20:57] [INFO ] Removed a total of 19017 redundant transitions.
[2026-06-02 07:20:57] [INFO ] Flatten gal took : 7845 ms
[2026-06-02 07:20:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 244 ms.
[2026-06-02 07:20:58] [INFO ] Time to serialize gal into /tmp/LTLFireability16019848183921092624.gal : 67 ms
[2026-06-02 07:20:58] [INFO ] Time to serialize properties into /tmp/LTLFireability14049430639051312998.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16019848183921092624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14049430639051312998.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !(((G(("((((u1.p2==0)||(i1.i0.i0.i0.i0.i0.i0.u9.p23==0))||((i1.i0.i0.i0.i0.i0.i0.u10.p49==0)||(i1.i0.i0.i0.i0.i0.u11.p61==0)))||(((i1....1134
Formula 0 simplified : F(!"((((u1.p2==0)||(i1.i0.i0.i0.i0.i0.i0.u9.p23==0))||((i1.i0.i0.i0.i0.i0.i0.u10.p49==0)||(i1.i0.i0.i0.i0.i0.u11.p61==0)))||(((i1.i0...1121
Reverse transition relation is NOT exact ! Due to transitions t231, u1.t124, i1.i0.i0.t95, i1.i0.i0.u14.t99, i1.i0.i0.u14.t2366, i1.i0.i0.u14.t2367, i1.i0....935
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6404531869049172272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(([](!(LTLAPp5==true))||(<>([](!(LTLAPp6==true)))&&(!(LTLAPp5==true) U ([](!(LTLAPp5==true))||(!(LTLAPp5==true)&&((X(!(LTLAPp7==true))&&<>(!(LTLAPp8==true)))||X([](!(LTLAPp7==true)))))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6404531869049172272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([]((X((LTLAPp1==true))||(LTLAPp0==true)))||((LTLAPp2==true) U (X((LTLAPp4==true))&&(LTLAPp3==true))))' '--buchi-type=spotba'
33 unique states visited
33 strongly connected components in search stack
34 transitions explored
33 items max in DFS search stack
25643 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,256.541,2826256,1,0,3.56108e+06,167517,864,2.08381e+07,695,1.35028e+06,1572
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV2-PT-bP06C06-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X((G(!("((((u1.p4==1)&&(i1.i0.i0.i0.i0.i0.i0.u9.p29==1))&&((i1.i0.i0.i0.i0.i0.i0.u10.p37==1)&&(i1.i0.i0.i0.i0.i0.u11.p67==1)))&&(...2054
Formula 1 simplified : XX(F"((((u1.p4==1)&&(i1.i0.i0.i0.i0.i0.i0.u9.p29==1))&&((i1.i0.i0.i0.i0.i0.i0.u10.p37==1)&&(i1.i0.i0.i0.i0.i0.u11.p67==1)))&&(((i1.i...1530

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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