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.r114-smll-177955740600460.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 ErlangenMainframeV0-PT-1005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 28M
-rw-r--r-- 1 mcc users 7.7K Mar 7 05:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 05:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 05:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 05:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Mar 7 05:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 05:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 05:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Mar 7 05:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 27M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779877119247

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 10:18:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 10:18:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 10:18:44] [INFO ] Load time of PNML (sax parser for PT used): 2084 ms
[2026-05-27 10:18:44] [INFO ] Transformed 273 places.
[2026-05-27 10:18:44] [INFO ] Transformed 23608 transitions.
[2026-05-27 10:18:44] [INFO ] Found NUPN structural information;
[2026-05-27 10:18:44] [INFO ] Parsed PT model containing 273 places and 23608 transitions and 545089 arcs in 2667 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 58 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 23608/23608 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 205 transition count 23540
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 205 transition count 23540
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 174 place count 167 transition count 23502
Iterating global reduction 0 with 38 rules applied. Total rules applied 212 place count 167 transition count 23502
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 215 place count 164 transition count 23499
Iterating global reduction 0 with 3 rules applied. Total rules applied 218 place count 164 transition count 23499
Applied a total of 218 rules in 815 ms. Remains 164 /273 variables (removed 109) and now considering 23499/23608 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1710450070051692684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2269945705847006025.kers'
[2026-05-27 10:18:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1710450070051692684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2269945705847006025.kers]
Culled 0 columns in 158 ms.
// Phase 1: matrix 23499 rows 164 cols 544871 entries
Finished phase 1 with 135 SingleSign rule and 3 generalized
[2026-05-27 10:18:47] [INFO ] Computed 26 invariants in 538 ms
Computed 26 P flows in 540 ms.
Exported basis to /tmp/petrispot-output-2269945705847006025.kers
Total runtime 657 ms.
[2026-05-27 10:18:47] [INFO ] Implicit Places using invariants in 1366 ms returned []
Implicit Place search using SMT only with invariants took 1415 ms to find 0 implicit places.
Running 23498 sub problems to find dead transitions.
[2026-05-27 10:18:48] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 163/23663 variables, and 10 constraints, problems are : Problem set: 0 solved, 23498 unsolved in 30874 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 23498/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23498 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/23663 variables, and 10 constraints, problems are : Problem set: 0 solved, 23498 unsolved in 30485 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 23379/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122026ms problems are : Problem set: 0 solved, 23498 unsolved
Search for dead transitions found 0 dead transitions in 122475ms
Starting structural reductions in LTL mode, iteration 1 : 164/273 places, 23499/23608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124973 ms. Remains : 164/273 places, 23499/23608 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Applied a total of 0 rules in 123 ms. Remains 164 /164 variables (removed 0) and now considering 23499/23499 (removed 0) transitions.
[2026-05-27 10:20:50] [INFO ] Invariant cache hit.
[2026-05-27 10:20:50] [INFO ] Implicit Places using invariants in 126 ms returned []
Implicit Place search using SMT only with invariants took 128 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 164/164 places, 23499/23499 transitions.
Support contains 54 out of 164 places after structural reductions.
[2026-05-27 10:20:55] [INFO ] Flatten gal took : 3953 ms
[2026-05-27 10:20:58] [INFO ] Flatten gal took : 3035 ms
[2026-05-27 10:21:03] [INFO ] Input system was already deterministic with 23499 transitions.
RANDOM walk for 40000 steps (8 resets) in 10144 ms. (3 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 47957 steps, run timeout after 9001 ms. (steps per millisecond=5 ) properties seen :0 out of 31
Probabilistic random walk after 47957 steps, saw 31882 distinct states, run finished after 9011 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-27 10:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (OVERLAPS) 73/127 variables, 12/22 constraints. Problems are: Problem set: 2 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 127/23663 variables, and 22 constraints, problems are : Problem set: 2 solved, 29 unsolved in 5118 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 31/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 73/126 variables, 12/21 constraints. Problems are: Problem set: 2 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/23663 variables, and 21 constraints, problems are : Problem set: 2 solved, 29 unsolved in 5116 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/164 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10691ms problems are : Problem set: 2 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Graph (trivial) has 81 edges and 164 vertex of which 4 / 164 are part of one of the 2 SCC in 18 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 162 transition count 23482
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 149 transition count 23482
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 27 place count 149 transition count 23464
Deduced a syphon composed of 18 places in 27 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 63 place count 131 transition count 23464
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 129 transition count 23447
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 129 transition count 23447
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 129 transition count 23445
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 8 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 131 place count 98 transition count 23414
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 96 transition count 23431
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 140 place count 96 transition count 23426
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 147 place count 91 transition count 23424
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 91 transition count 23424
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 159 place count 91 transition count 23424
Applied a total of 159 rules in 4781 ms. Remains 91 /164 variables (removed 73) and now considering 23424/23499 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4783 ms. Remains : 91/164 places, 23424/23499 transitions.
RANDOM walk for 40000 steps (8 resets) in 16453 ms. (2 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 197 ms. (20 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 188 ms. (21 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 229 ms. (17 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 477 ms. (8 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 210 ms. (18 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 199 ms. (20 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 257 ms. (15 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 244 ms. (16 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 258 ms. (15 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 232 ms. (17 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 230 ms. (17 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 218 ms. (18 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 217 ms. (18 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 213 ms. (18 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 220 ms. (18 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 242 ms. (16 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 195 ms. (20 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 179 ms. (22 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 182 ms. (21 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 202 ms. (19 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 186 ms. (21 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 204 ms. (19 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 236 ms. (16 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 131369 steps, run timeout after 15001 ms. (steps per millisecond=8 ) properties seen :0 out of 28
Probabilistic random walk after 131369 steps, saw 20678 distinct states, run finished after 15001 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-27 10:21:52] [INFO ] Flow matrix only has 23407 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3194642915042379003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10894903158118506447.kers'
[2026-05-27 10:21:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3194642915042379003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10894903158118506447.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 93 ms.
// Phase 1: matrix 23407 rows 90 cols 544618 entries
Finished phase 1 with 62 SingleSign rule and 3 generalized
[2026-05-27 10:21:53] [INFO ] Computed 26 invariants in 357 ms
Computed 26 P flows in 357 ms.
Exported basis to /tmp/petrispot-output-10894903158118506447.kers
Total runtime 433 ms.
[2026-05-27 10:21:53] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 10/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 24/91 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 23407/23498 variables, 91/117 constraints. Problems are: Problem set: 0 solved, 28 unsolved
SMT process timed out in 45934ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 24 different solutions.
Parikh walk visited 3 properties in 2852 ms.
Support contains 50 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 23424/23424 transitions.
Applied a total of 0 rules in 511 ms. Remains 91 /91 variables (removed 0) and now considering 23424/23424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 91/91 places, 23424/23424 transitions.
RANDOM walk for 40000 steps (8 resets) in 14625 ms. (2 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 161 ms. (24 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 165 ms. (24 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 158 ms. (25 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 160 ms. (24 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 153 ms. (25 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 144 ms. (27 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 174 ms. (22 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 240 ms. (16 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 254 ms. (15 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 248 ms. (16 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 251 ms. (15 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 270 ms. (14 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 229 ms. (17 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 240 ms. (16 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 222 ms. (17 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 241 ms. (16 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 245 ms. (16 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 259 ms. (15 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 269 ms. (14 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 223 ms. (17 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 132321 steps, run timeout after 15001 ms. (steps per millisecond=8 ) properties seen :0 out of 25
Probabilistic random walk after 132321 steps, saw 20794 distinct states, run finished after 15001 ms. (steps per millisecond=8 ) properties seen :0
[2026-05-27 10:23:02] [INFO ] Flow matrix only has 23407 transitions (discarded 17 similar events)
[2026-05-27 10:23:02] [INFO ] Invariant cache hit.
[2026-05-27 10:23:02] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 10/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 24/91 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 23407/23498 variables, 91/117 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23498 variables, 34/151 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 23498/23498 variables, and 151 constraints, problems are : Problem set: 0 solved, 25 unsolved in 75028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 25/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 10/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 24/91 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 23407/23498 variables, 91/117 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23498 variables, 34/151 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 23498/23498 variables, and 151 constraints, problems are : Problem set: 0 solved, 25 unsolved in 75096 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 91/91 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 25/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 150482ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 23424/23424 transitions.
Applied a total of 0 rules in 754 ms. Remains 91 /91 variables (removed 0) and now considering 23424/23424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 754 ms. Remains : 91/91 places, 23424/23424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 23424/23424 transitions.
Applied a total of 0 rules in 505 ms. Remains 91 /91 variables (removed 0) and now considering 23424/23424 (removed 0) transitions.
[2026-05-27 10:25:33] [INFO ] Flow matrix only has 23407 transitions (discarded 17 similar events)
[2026-05-27 10:25:33] [INFO ] Invariant cache hit.
[2026-05-27 10:25:34] [INFO ] Implicit Places using invariants in 833 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 890 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/91 places, 23424/23424 transitions.
Applied a total of 0 rules in 698 ms. Remains 90 /90 variables (removed 0) and now considering 23424/23424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2102 ms. Remains : 90/91 places, 23424/23424 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 22 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' '!(F((p0||X(F((X(F(p1))&&(p2 U p3)))))))'
Support contains 34 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 159 transition count 16747
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 159 transition count 16747
Applied a total of 10 rules in 588 ms. Remains 159 /164 variables (removed 5) and now considering 16747/23499 (removed 6752) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18264946837676752132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3404515143163963479.kers'
[2026-05-27 10:25:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18264946837676752132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3404515143163963479.kers]
Culled 0 columns in 65 ms.
// Phase 1: matrix 16747 rows 159 cols 396327 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-05-27 10:25:37] [INFO ] Computed 26 invariants in 238 ms
Computed 26 P flows in 239 ms.
Exported basis to /tmp/petrispot-output-3404515143163963479.kers
Total runtime 295 ms.
[2026-05-27 10:25:40] [INFO ] Implicit Places using invariants in 3350 ms returned []
Implicit Place search using SMT only with invariants took 3352 ms to find 0 implicit places.
Running 16746 sub problems to find dead transitions.
[2026-05-27 10:25:40] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/16906 variables, and 10 constraints, problems are : Problem set: 0 solved, 16746 unsolved in 30472 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/159 constraints, PredecessorRefiner: 16746/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16746 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16746 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 158/16906 variables, and 10 constraints, problems are : Problem set: 0 solved, 16746 unsolved in 30480 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/159 constraints, PredecessorRefiner: 16627/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99288ms problems are : Problem set: 0 solved, 16746 unsolved
Search for dead transitions found 0 dead transitions in 99425ms
Starting structural reductions in LTL mode, iteration 1 : 159/164 places, 16747/23499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103486 ms. Remains : 159/164 places, 16747/23499 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F((X(F(p0))&&(p1 U p2))))||p3)))'
Stuttering acceptance computed with spot in 523 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-00
Product exploration timeout after 65050 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 3 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-00 finished in 114239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 12 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Graph (trivial) has 97 edges and 164 vertex of which 4 / 164 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 161 transition count 23484
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 149 transition count 23484
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 149 transition count 23466
Deduced a syphon composed of 18 places in 27 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 131 transition count 23466
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 78 place count 114 transition count 15674
Ensure Unique test removed 10 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 105 place count 104 transition count 15674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 104 transition count 15672
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 99 transition count 2168
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 99 transition count 2168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 97 transition count 2164
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 97 transition count 2164
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 199 place count 58 transition count 2125
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 205 place count 55 transition count 2136
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 208 place count 55 transition count 2133
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 213 place count 55 transition count 2133
Applied a total of 213 rules in 4059 ms. Remains 55 /164 variables (removed 109) and now considering 2133/23499 (removed 21366) transitions.
[2026-05-27 10:27:34] [INFO ] Flow matrix only has 2113 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14532362014512279908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12851064479797528296.kers'
[2026-05-27 10:27:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14532362014512279908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12851064479797528296.kers]
Normalized transition count is 2112 out of 2113 initially.
Culled 0 columns in 8 ms.
// Phase 1: matrix 2112 rows 55 cols 47390 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-27 10:27:34] [INFO ] Computed 16 invariants in 23 ms
Computed 16 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-12851064479797528296.kers
Total runtime 30 ms.
[2026-05-27 10:27:35] [INFO ] Implicit Places using invariants in 860 ms returned []
[2026-05-27 10:27:35] [INFO ] Flow matrix only has 2113 transitions (discarded 20 similar events)
[2026-05-27 10:27:35] [INFO ] Invariant cache hit.
[2026-05-27 10:27:36] [INFO ] State equation strengthened by 1035 read => feed constraints.
[2026-05-27 10:27:37] [INFO ] Implicit Places using invariants and state equation in 2638 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
[2026-05-27 10:27:38] [INFO ] Redundant transitions in 528 ms returned []
Running 2131 sub problems to find dead transitions.
[2026-05-27 10:27:38] [INFO ] Flow matrix only has 2113 transitions (discarded 20 similar events)
[2026-05-27 10:27:38] [INFO ] Invariant cache hit.
[2026-05-27 10:27:38] [INFO ] State equation strengthened by 1035 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2131 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2131 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 55/2168 variables, and 16 constraints, problems are : Problem set: 0 solved, 2131 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/55 constraints, ReadFeed: 0/1035 constraints, PredecessorRefiner: 2131/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2131 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 55/2168 variables, and 16 constraints, problems are : Problem set: 0 solved, 2131 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/55 constraints, ReadFeed: 0/1035 constraints, PredecessorRefiner: 2098/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63219ms problems are : Problem set: 0 solved, 2131 unsolved
Search for dead transitions found 0 dead transitions in 63233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/164 places, 2133/23499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71343 ms. Remains : 55/164 places, 2133/23499 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 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-02 finished in 71517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Graph (trivial) has 97 edges and 164 vertex of which 4 / 164 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 161 transition count 23484
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 149 transition count 23484
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 149 transition count 23466
Deduced a syphon composed of 18 places in 28 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 131 transition count 23466
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 78 place count 114 transition count 15674
Ensure Unique test removed 10 places
Iterating global reduction 2 with 27 rules applied. Total rules applied 105 place count 104 transition count 15674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 104 transition count 15672
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 99 transition count 2168
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 99 transition count 2168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 95 transition count 2160
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 95 transition count 2160
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 193 place count 61 transition count 2126
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 56 transition count 2137
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 56 transition count 2136
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 210 place count 56 transition count 2136
Applied a total of 210 rules in 3907 ms. Remains 56 /164 variables (removed 108) and now considering 2136/23499 (removed 21363) transitions.
[2026-05-27 10:28:45] [INFO ] Flow matrix only has 2116 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-368208969256609525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2239566077879515094.kers'
[2026-05-27 10:28:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-368208969256609525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2239566077879515094.kers]
Normalized transition count is 2115 out of 2116 initially.
Culled 0 columns in 7 ms.
// Phase 1: matrix 2115 rows 56 cols 47402 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-27 10:28:45] [INFO ] Computed 16 invariants in 26 ms
Computed 16 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-2239566077879515094.kers
Total runtime 32 ms.
[2026-05-27 10:28:46] [INFO ] Implicit Places using invariants in 677 ms returned []
[2026-05-27 10:28:46] [INFO ] Flow matrix only has 2116 transitions (discarded 20 similar events)
[2026-05-27 10:28:46] [INFO ] Invariant cache hit.
[2026-05-27 10:28:47] [INFO ] State equation strengthened by 1035 read => feed constraints.
[2026-05-27 10:28:48] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2664 ms to find 0 implicit places.
[2026-05-27 10:28:48] [INFO ] Redundant transitions in 427 ms returned []
Running 2134 sub problems to find dead transitions.
[2026-05-27 10:28:48] [INFO ] Flow matrix only has 2116 transitions (discarded 20 similar events)
[2026-05-27 10:28:48] [INFO ] Invariant cache hit.
[2026-05-27 10:28:48] [INFO ] State equation strengthened by 1035 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2134 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2134 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 56/2172 variables, and 16 constraints, problems are : Problem set: 0 solved, 2134 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/56 constraints, ReadFeed: 0/1035 constraints, PredecessorRefiner: 2134/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2134 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 56/2172 variables, and 16 constraints, problems are : Problem set: 0 solved, 2134 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/56 constraints, ReadFeed: 0/1035 constraints, PredecessorRefiner: 2100/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63144ms problems are : Problem set: 0 solved, 2134 unsolved
Search for dead transitions found 0 dead transitions in 63159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/164 places, 2136/23499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70189 ms. Remains : 56/164 places, 2136/23499 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-03 finished in 70296 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(p0))&&F(p1))))'
Support contains 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Graph (trivial) has 97 edges and 164 vertex of which 4 / 164 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 161 transition count 23484
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 149 transition count 23484
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 149 transition count 23466
Deduced a syphon composed of 18 places in 26 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 131 transition count 23466
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 124 transition count 16697
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 124 transition count 16697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 124 transition count 16695
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 121 transition count 5751
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 121 transition count 5751
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 161 place count 82 transition count 5712
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 81 transition count 5723
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 166 place count 81 transition count 5720
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 174 place count 81 transition count 5720
Applied a total of 174 rules in 7475 ms. Remains 81 /164 variables (removed 83) and now considering 5720/23499 (removed 17779) transitions.
[2026-05-27 10:29:59] [INFO ] Flow matrix only has 5700 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16776698312994731953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12945818612916160385.kers'
[2026-05-27 10:29:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16776698312994731953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12945818612916160385.kers]
Normalized transition count is 5699 out of 5700 initially.
Culled 0 columns in 21 ms.
// Phase 1: matrix 5699 rows 81 cols 128802 entries
Finished phase 1 with 53 SingleSign rule and 2 generalized
[2026-05-27 10:29:59] [INFO ] Computed 26 invariants in 74 ms
Computed 26 P flows in 74 ms.
Exported basis to /tmp/petrispot-output-12945818612916160385.kers
Total runtime 91 ms.
[2026-05-27 10:30:01] [INFO ] Implicit Places using invariants in 2329 ms returned []
[2026-05-27 10:30:01] [INFO ] Flow matrix only has 5700 transitions (discarded 20 similar events)
[2026-05-27 10:30:01] [INFO ] Invariant cache hit.
[2026-05-27 10:30:04] [INFO ] State equation strengthened by 2315 read => feed constraints.
[2026-05-27 10:30:08] [INFO ] Implicit Places using invariants and state equation in 6532 ms returned []
Implicit Place search using SMT with State Equation took 8864 ms to find 0 implicit places.
[2026-05-27 10:30:10] [INFO ] Redundant transitions in 1852 ms returned []
Running 5718 sub problems to find dead transitions.
[2026-05-27 10:30:10] [INFO ] Flow matrix only has 5700 transitions (discarded 20 similar events)
[2026-05-27 10:30:10] [INFO ] Invariant cache hit.
[2026-05-27 10:30:10] [INFO ] State equation strengthened by 2315 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 80/5781 variables, and 10 constraints, problems are : Problem set: 0 solved, 5718 unsolved in 30163 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/81 constraints, ReadFeed: 0/2315 constraints, PredecessorRefiner: 5718/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5718 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 80/5781 variables, and 10 constraints, problems are : Problem set: 0 solved, 5718 unsolved in 30163 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/81 constraints, ReadFeed: 0/2315 constraints, PredecessorRefiner: 5682/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69361ms problems are : Problem set: 0 solved, 5718 unsolved
Search for dead transitions found 0 dead transitions in 69387ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/164 places, 5720/23499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87600 ms. Remains : 81/164 places, 5720/23499 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(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-04 finished in 87831 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)&&F((G(F(!p1))||(!p2&&F(!p1)))))||G(F((G(F(!p1))||(!p2&&F(!p1))||p3)))))))'
Support contains 22 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 15724
Ensure Unique test removed 10 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 40 place count 139 transition count 15724
Applied a total of 40 rules in 1217 ms. Remains 139 /164 variables (removed 25) and now considering 15724/23499 (removed 7775) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14111850831170621036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8547736524127869614.kers'
[2026-05-27 10:31:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14111850831170621036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8547736524127869614.kers]
Culled 0 columns in 36 ms.
// Phase 1: matrix 15724 rows 139 cols 218291 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-27 10:31:21] [INFO ] Computed 16 invariants in 162 ms
Computed 16 P flows in 163 ms.
Exported basis to /tmp/petrispot-output-8547736524127869614.kers
Total runtime 191 ms.
[2026-05-27 10:31:24] [INFO ] Implicit Places using invariants in 3348 ms returned []
Implicit Place search using SMT only with invariants took 3350 ms to find 0 implicit places.
Running 15723 sub problems to find dead transitions.
[2026-05-27 10:31:24] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 138/15863 variables, and 0 constraints, problems are : Problem set: 0 solved, 15723 unsolved in 30413 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 15723/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15723 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/15863 variables, and 0 constraints, problems are : Problem set: 0 solved, 15723 unsolved in 30416 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 15593/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101017ms problems are : Problem set: 0 solved, 15723 unsolved
Search for dead transitions found 0 dead transitions in 101125ms
Starting structural reductions in LTL mode, iteration 1 : 139/164 places, 15724/23499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105773 ms. Remains : 139/164 places, 15724/23499 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((G(F((G(F(p1))||(p2&&F(p1))||p0)))||(X(p3)&&F((G(F(p1))||(p2&&F(p1)))))))))'
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 1152 ms.
Product exploration explored 100000 steps with 33333 reset in 1104 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 14 ms. Proved property starting from automaton with 6 states, 15 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 281 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-05 finished in 108828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(X(F(p0)))))&&G(p1))))'
Support contains 20 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 15724
Ensure Unique test removed 10 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 40 place count 139 transition count 15724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 137 transition count 7084
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 137 transition count 7084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 136 transition count 7082
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 136 transition count 7082
Applied a total of 46 rules in 1402 ms. Remains 136 /164 variables (removed 28) and now considering 7082/23499 (removed 16417) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18305430847097844155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7644721479011180853.kers'
[2026-05-27 10:33:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18305430847097844155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7644721479011180853.kers]
Culled 0 columns in 25 ms.
// Phase 1: matrix 7082 rows 136 cols 97327 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-27 10:33:10] [INFO ] Computed 16 invariants in 99 ms
Computed 16 P flows in 100 ms.
Exported basis to /tmp/petrispot-output-7644721479011180853.kers
Total runtime 113 ms.
[2026-05-27 10:33:11] [INFO ] Implicit Places using invariants in 1709 ms returned []
[2026-05-27 10:33:11] [INFO ] Invariant cache hit.
[2026-05-27 10:33:15] [INFO ] Implicit Places using invariants and state equation in 3747 ms returned []
Implicit Place search using SMT with State Equation took 5460 ms to find 0 implicit places.
Running 7081 sub problems to find dead transitions.
[2026-05-27 10:33:15] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/7218 variables, and 0 constraints, problems are : Problem set: 0 solved, 7081 unsolved in 30193 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/136 constraints, PredecessorRefiner: 7081/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7081 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/7218 variables, and 0 constraints, problems are : Problem set: 0 solved, 7081 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/136 constraints, PredecessorRefiner: 6953/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73590ms problems are : Problem set: 0 solved, 7081 unsolved
Search for dead transitions found 0 dead transitions in 73627ms
Starting structural reductions in LTL mode, iteration 1 : 136/164 places, 7082/23499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80536 ms. Remains : 136/164 places, 7082/23499 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(X(F(p0)))))&&G(p1))))'
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 6763 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-06 finished in 87565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(!p0)&&G(!p1))||G(!p0))))||(G(!p2)&&X(X(F(((X(!p0)&&G(!p1))||G(!p0)))))))))'
Support contains 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 15724
Ensure Unique test removed 10 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 40 place count 139 transition count 15724
Applied a total of 40 rules in 1101 ms. Remains 139 /164 variables (removed 25) and now considering 15724/23499 (removed 7775) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8065222529096798030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-872518765657942397.kers'
[2026-05-27 10:34:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8065222529096798030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-872518765657942397.kers]
Culled 0 columns in 35 ms.
// Phase 1: matrix 15724 rows 139 cols 218291 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-27 10:34:37] [INFO ] Computed 16 invariants in 149 ms
Computed 16 P flows in 153 ms.
Exported basis to /tmp/petrispot-output-872518765657942397.kers
Total runtime 180 ms.
[2026-05-27 10:34:40] [INFO ] Implicit Places using invariants in 3441 ms returned []
Implicit Place search using SMT only with invariants took 3444 ms to find 0 implicit places.
Running 15723 sub problems to find dead transitions.
[2026-05-27 10:34:41] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 138/15863 variables, and 0 constraints, problems are : Problem set: 0 solved, 15723 unsolved in 30414 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 15723/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/15863 variables, and 0 constraints, problems are : Problem set: 0 solved, 15723 unsolved in 30415 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 15593/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99165ms problems are : Problem set: 0 solved, 15723 unsolved
Search for dead transitions found 0 dead transitions in 99259ms
Starting structural reductions in LTL mode, iteration 1 : 139/164 places, 15724/23499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103846 ms. Remains : 139/164 places, 15724/23499 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(p0)&&G(p1))||G(p0))))||(G(p2)&&X(X(F(((X(p0)&&G(p1))||G(p0)))))))))'
Stuttering acceptance computed with spot in 688 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-09
Product exploration timeout after 53910 steps with 3 reset in 10001 ms.
Product exploration timeout after 67370 steps with 44 reset in 10005 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge based reduction with 37 factoid took 1675 ms. Reduced automaton from 12 states, 90 edges and 3 AP (stutter sensitive) to 12 states, 90 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 8005 ms. (4 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 40787 steps, run timeout after 6001 ms. (steps per millisecond=6 ) properties seen :0 out of 19
Probabilistic random walk after 40787 steps, saw 27223 distinct states, run finished after 6002 ms. (steps per millisecond=6 ) properties seen :0
[2026-05-27 10:36:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
Problem apf12 is UNSAT
Problem apf13 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 1 (OVERLAPS) 79/102 variables, 12/12 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 37/139 variables, 4/16 constraints. Problems are: Problem set: 6 solved, 13 unsolved
SMT process timed out in 9325ms, After SMT, problems are : Problem set: 6 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 15724/15724 transitions.
Graph (trivial) has 86 edges and 139 vertex of which 4 / 139 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 137 transition count 15707
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 124 transition count 15707
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 27 place count 124 transition count 15689
Deduced a syphon composed of 18 places in 15 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 63 place count 106 transition count 15689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 104 transition count 15672
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 104 transition count 15672
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 104 transition count 15670
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 7 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 139 place count 69 transition count 15635
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 67 transition count 15652
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 67 transition count 15651
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 151 place count 67 transition count 15644
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 160 place count 60 transition count 15642
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 176 place count 60 transition count 15626
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 60 transition count 15626
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 185 place count 60 transition count 15626
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 192 place count 60 transition count 15619
Applied a total of 192 rules in 76401 ms. Remains 60 /139 variables (removed 79) and now considering 15619/15724 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76401 ms. Remains : 60/139 places, 15619/15724 transitions.
RANDOM walk for 40000 steps (8 resets) in 14918 ms. (2 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2982 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2905 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2908 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2835 ms. (14 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2870 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2884 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2981 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2915 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2951 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2929 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2870 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2957 ms. (13 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2900 ms. (13 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 470108 steps, run timeout after 39001 ms. (steps per millisecond=12 ) properties seen :0 out of 13
Probabilistic random walk after 470108 steps, saw 65200 distinct states, run finished after 39001 ms. (steps per millisecond=12 ) 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-10797325898899624943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9344675348737891192.kers'
[2026-05-27 10:39:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10797325898899624943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9344675348737891192.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 58 ms.
// Phase 1: matrix 15619 rows 59 cols 347560 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-27 10:39:09] [INFO ] Computed 16 invariants in 177 ms
Computed 16 P flows in 178 ms.
Exported basis to /tmp/petrispot-output-9344675348737891192.kers
Total runtime 231 ms.
[2026-05-27 10:39:51] [INFO ] State equation strengthened by 10399 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 30/53 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 7/60 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15619/15679 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 86757ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3389 ms.
Support contains 23 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 15619/15619 transitions.
Applied a total of 0 rules in 14635 ms. Remains 60 /60 variables (removed 0) and now considering 15619/15619 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14635 ms. Remains : 60/60 places, 15619/15619 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 15619/15619 transitions.
Applied a total of 0 rules in 14497 ms. Remains 60 /60 variables (removed 0) and now considering 15619/15619 (removed 0) transitions.
[2026-05-27 10:41:08] [INFO ] Invariant cache hit.
[2026-05-27 10:41:11] [INFO ] Implicit Places using invariants in 2876 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2910 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 15619/15619 transitions.
Applied a total of 0 rules in 14606 ms. Remains 59 /59 variables (removed 0) and now considering 15619/15619 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32018 ms. Remains : 59/60 places, 15619/15619 transitions.
Found 6 invariant AP formulas.
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(p2&&p1&&p0)' '--given-formula=X(!(p1&&!p2))' '--given-formula=X(!(p1&&!p2&&p0))' '--given-formula=X(!(!p1&&p2))' '--given-formula=X(p2)' '--given-formula=X(!(!p1&&!p2))' '--given-formula=X(!(!p1&&!p2&&!p0))' '--given-formula=X((p1&&p2))' '--given-formula=X(!(!p1&&p2&&!p0))' '--given-formula=X(!(!p1&&!p0))' '--given-formula=X(!(!p1&&p2&&p0))' '--given-formula=X((p1&&p2&&p0))' '--given-formula=X(!(p1&&!p2&&!p0))' '--given-formula=X(p0)' '--given-formula=X(!(p1&&p2&&!p0))' '--given-formula=X(p1)' '--given-formula=X(!(!p1&&!p2&&p0))' '--given-formula=X(!(p1&&!p0))' '--given-formula=X(X(!(p1&&!p2)))' '--given-formula=X(X(!(p1&&!p2&&p0)))' '--given-formula=X(X(!(!p1&&p2)))' '--given-formula=X(X(p2))' '--given-formula=X(X(!(!p1&&!p2)))' '--given-formula=X(X(!(!p1&&!p2&&!p0)))' '--given-formula=X(X((p1&&p2)))' '--given-formula=X(X(!(!p1&&p2&&!p0)))' '--given-formula=X(X(!(!p1&&!p0)))' '--given-formula=X(X(!(!p1&&p2&&p0)))' '--given-formula=X(X((p1&&p2&&p0)))' '--given-formula=X(X((p1&&p0)))' '--given-formula=X(X(!(p1&&!p2&&!p0)))' '--given-formula=X(X(!(!p1&&p0)))' '--given-formula=X(X(p0))' '--given-formula=X(X(!(p1&&p2&&!p0)))' '--given-formula=X(X(p1))' '--given-formula=X(X(!(!p1&&!p2&&p0)))' '--given-formula=X(X(!(p1&&!p0)))' '--given-formula=G((p0||!p1||p2))' '--given-formula=G((p1||p2))' '--given-formula=G((p0||p1))' '--given-formula=G((p0||p1||!p2))' '--given-formula=G((!p0||p1||p2))' '--given-formula=G((p0||p1||p2))' '-F' '/tmp/b4k16729183144087533472.hoa' '--given-strategy=auto-small' killed by timeout after 10 SECONDS
Knowledge based reduction with 43 factoid took 20009 ms. Reduced automaton from 12 states, 90 edges and 3 AP (stutter sensitive) to 11 states, 48 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 505 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 305855 ms.
Stuttering acceptance computed with spot in 642 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 23 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 15724/15724 transitions.
Applied a total of 0 rules in 84 ms. Remains 139 /139 variables (removed 0) and now considering 15724/15724 (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-12801831772614478892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2940536965587388458.kers'
[2026-05-27 10:41:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12801831772614478892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2940536965587388458.kers]
Culled 0 columns in 62 ms.
// Phase 1: matrix 15724 rows 139 cols 218291 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-27 10:41:48] [INFO ] Computed 16 invariants in 258 ms
Computed 16 P flows in 259 ms.
Exported basis to /tmp/petrispot-output-2940536965587388458.kers
Total runtime 309 ms.
[2026-05-27 10:41:50] [INFO ] Implicit Places using invariants in 2837 ms returned []
Implicit Place search using SMT only with invariants took 2838 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2924 ms. Remains : 139/139 places, 15724/15724 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge based reduction with 12 factoid took 13393 ms. Reduced automaton from 11 states, 48 edges and 3 AP (stutter sensitive) to 11 states, 48 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 7688 ms. (5 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 483 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 473 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 417 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 419 ms. (95 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 43168 steps, run timeout after 6001 ms. (steps per millisecond=7 ) properties seen :0 out of 6
Probabilistic random walk after 43168 steps, saw 28753 distinct states, run finished after 6001 ms. (steps per millisecond=7 ) properties seen :0
[2026-05-27 10:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 79/102 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 37/139 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5090ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 15724/15724 transitions.
Graph (trivial) has 86 edges and 139 vertex of which 4 / 139 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 137 transition count 15707
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 124 transition count 15707
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 27 place count 124 transition count 15689
Deduced a syphon composed of 18 places in 15 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 63 place count 106 transition count 15689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 104 transition count 15672
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 104 transition count 15672
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 104 transition count 15670
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 9 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 139 place count 69 transition count 15635
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 67 transition count 15652
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 67 transition count 15651
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 151 place count 67 transition count 15644
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 160 place count 60 transition count 15642
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 176 place count 60 transition count 15626
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 60 transition count 15626
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 185 place count 60 transition count 15626
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 192 place count 60 transition count 15619
Applied a total of 192 rules in 75060 ms. Remains 60 /139 variables (removed 79) and now considering 15619/15724 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75060 ms. Remains : 60/139 places, 15619/15724 transitions.
RANDOM walk for 40000 steps (8 resets) in 14035 ms. (2 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2860 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2814 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3006 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2875 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2907 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2879 ms. (13 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 282067 steps, run timeout after 24001 ms. (steps per millisecond=11 ) properties seen :0 out of 6
Probabilistic random walk after 282067 steps, saw 40842 distinct states, run finished after 24001 ms. (steps per millisecond=11 ) 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-15718090474000056694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1029688142600979511.kers'
[2026-05-27 10:44:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15718090474000056694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1029688142600979511.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 95 ms.
// Phase 1: matrix 15619 rows 59 cols 347560 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-27 10:44:05] [INFO ] Computed 16 invariants in 247 ms
Computed 16 P flows in 247 ms.
Exported basis to /tmp/petrispot-output-1029688142600979511.kers
Total runtime 294 ms.
[2026-05-27 10:44:46] [INFO ] State equation strengthened by 10399 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 30/53 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/60 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 15619/15679 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 86689ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 4 properties in 3240 ms.
Support contains 18 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 15619/15619 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 60 transition count 15618
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 15618
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 56 transition count 15618
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 56 transition count 15615
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 15614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 55 transition count 15614
Applied a total of 13 rules in 47341 ms. Remains 55 /60 variables (removed 5) and now considering 15614/15619 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47342 ms. Remains : 55/60 places, 15614/15619 transitions.
Knowledge based reduction with 12 factoid took 13944 ms. Reduced automaton from 11 states, 48 edges and 3 AP (stutter sensitive) to 11 states, 48 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 450 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 286198 ms.
Stuttering acceptance computed with spot in 644 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 638 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 64440 steps with 7 reset in 10002 ms.
Product exploration timeout after 68950 steps with 4 reset in 10004 ms.
Spot run failed in 100 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/ltsmin831084031979057357
[2026-05-27 10:46:58] [INFO ] Built C files in 683ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin831084031979057357
Running compilation step : cd /tmp/ltsmin831084031979057357;'/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/ltsmin831084031979057357;'/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/ltsmin831084031979057357;'/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 23 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 15724/15724 transitions.
Applied a total of 0 rules in 55 ms. Remains 139 /139 variables (removed 0) and now considering 15724/15724 (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-12544661121145636153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3011780319990625848.kers'
[2026-05-27 10:47:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12544661121145636153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3011780319990625848.kers]
Culled 0 columns in 36 ms.
// Phase 1: matrix 15724 rows 139 cols 218291 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-27 10:47:02] [INFO ] Computed 16 invariants in 186 ms
Computed 16 P flows in 187 ms.
Exported basis to /tmp/petrispot-output-3011780319990625848.kers
Total runtime 215 ms.
[2026-05-27 10:47:05] [INFO ] Implicit Places using invariants in 3011 ms returned []
Implicit Place search using SMT only with invariants took 3012 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3069 ms. Remains : 139/139 places, 15724/15724 transitions.
Built C files in :
/tmp/ltsmin7370757767672369792
[2026-05-27 10:47:05] [INFO ] Built C files in 313ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7370757767672369792
Running compilation step : cd /tmp/ltsmin7370757767672369792;'/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/ltsmin7370757767672369792;'/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/ltsmin7370757767672369792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 10:47:12] [INFO ] Flatten gal took : 1589 ms
[2026-05-27 10:47:13] [INFO ] Flatten gal took : 936 ms
[2026-05-27 10:47:13] [INFO ] Time to serialize gal into /tmp/LTL17406170301665298779.gal : 316 ms
[2026-05-27 10:47:13] [INFO ] Time to serialize properties into /tmp/LTL16315149819564840901.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/LTL17406170301665298779.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2600874493172371122.hoa' '-atoms' '/tmp/LTL16315149819564840901.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/LTL16315149819564840901.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2600874493172371122.hoa
Detected timeout of ITS tools.
[2026-05-27 10:47:31] [INFO ] Flatten gal took : 932 ms
[2026-05-27 10:47:32] [INFO ] Flatten gal took : 1330 ms
[2026-05-27 10:47:32] [INFO ] Time to serialize gal into /tmp/LTL6553343260283479118.gal : 210 ms
[2026-05-27 10:47:32] [INFO ] Time to serialize properties into /tmp/LTL17159228707311096963.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/LTL6553343260283479118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17159228707311096963.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((((p17!=1)||(p34!=1))||((p43!=1)||(p56!=1)))||(((p69!=1)||(p92!=1))||((p101!=1)||(p130!=1))))||(((p149!=1)||(p162!=1))...1137
Formula 0 simplified : G(F!"(((((p17!=1)||(p34!=1))||((p43!=1)||(p56!=1)))||(((p69!=1)||(p92!=1))||((p101!=1)||(p130!=1))))||(((p149!=1)||(p162!=1))||((p20...1107
Detected timeout of ITS tools.
[2026-05-27 10:47:49] [INFO ] Flatten gal took : 916 ms
[2026-05-27 10:47:49] [INFO ] Applying decomposition
[2026-05-27 10:47:50] [INFO ] Flatten gal took : 1115 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/graph2547161367725919887.txt' '-o' '/tmp/graph2547161367725919887.bin' '-w' '/tmp/graph2547161367725919887.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2547161367725919887.bin' '-l' '-1' '-v' '-w' '/tmp/graph2547161367725919887.weights' '-q' '0' '-e' '0.001'
[2026-05-27 10:47:53] [INFO ] Decomposing Gal with order
[2026-05-27 10:47:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 10:48:03] [INFO ] Removed a total of 45410 redundant transitions.
[2026-05-27 10:48:04] [INFO ] Flatten gal took : 9864 ms
[2026-05-27 10:48:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2850 labels/synchronizations in 1488 ms.
[2026-05-27 10:48:07] [INFO ] Time to serialize gal into /tmp/LTL8840008486256287318.gal : 27 ms
[2026-05-27 10:48:07] [INFO ] Time to serialize properties into /tmp/LTL9222156354838336399.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/LTL8840008486256287318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9222156354838336399.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...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((((u33.p17!=1)||(i0.u20.p34!=1))||((i0.u20.p43!=1)||(i0.u20.p56!=1)))||(((i0.u34.p69!=1)||(i0.u34.p92!=1))||((i0.u34.p...1680
Formula 0 simplified : G(F!"(((((u33.p17!=1)||(i0.u20.p34!=1))||((i0.u20.p43!=1)||(i0.u20.p56!=1)))||(((i0.u34.p69!=1)||(i0.u34.p92!=1))||((i0.u34.p101!=1)...1650
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-09 finished in 826122 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(X(p1)))) U (p2 U X(p0))))'
Support contains 29 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 159 transition count 16747
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 159 transition count 16747
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 158 transition count 11563
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 158 transition count 11563
Applied a total of 12 rules in 820 ms. Remains 158 /164 variables (removed 6) and now considering 11563/23499 (removed 11936) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5716466713285294209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1234280088074935802.kers'
[2026-05-27 10:48:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5716466713285294209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1234280088074935802.kers]
Culled 0 columns in 46 ms.
// Phase 1: matrix 11563 rows 158 cols 271911 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-27 10:48:23] [INFO ] Computed 26 invariants in 167 ms
Computed 26 P flows in 168 ms.
Exported basis to /tmp/petrispot-output-1234280088074935802.kers
Total runtime 204 ms.
[2026-05-27 10:48:27] [INFO ] Implicit Places using invariants in 3710 ms returned []
Implicit Place search using SMT only with invariants took 3711 ms to find 0 implicit places.
Running 11562 sub problems to find dead transitions.
[2026-05-27 10:48:27] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/11721 variables, and 10 constraints, problems are : Problem set: 0 solved, 11562 unsolved in 30224 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 11562/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/11721 variables, and 10 constraints, problems are : Problem set: 0 solved, 11562 unsolved in 30194 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 11443/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84431ms problems are : Problem set: 0 solved, 11562 unsolved
Search for dead transitions found 0 dead transitions in 84500ms
Starting structural reductions in LTL mode, iteration 1 : 158/164 places, 11563/23499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89064 ms. Remains : 158/164 places, 11563/23499 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0))||p1)) U (p2 U X(p1))))'
Stuttering acceptance computed with spot in 431 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-12
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-12 finished in 89581 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||X(F((F(p2)&&p1)))))'
Support contains 21 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 149 transition count 15724
Ensure Unique test removed 10 places
Iterating global reduction 0 with 25 rules applied. Total rules applied 40 place count 139 transition count 15724
Applied a total of 40 rules in 893 ms. Remains 139 /164 variables (removed 25) and now considering 15724/23499 (removed 7775) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1758907771928492979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17478760844669636932.kers'
[2026-05-27 10:49:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1758907771928492979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17478760844669636932.kers]
Culled 0 columns in 36 ms.
// Phase 1: matrix 15724 rows 139 cols 218291 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-27 10:49:53] [INFO ] Computed 16 invariants in 165 ms
Computed 16 P flows in 167 ms.
Exported basis to /tmp/petrispot-output-17478760844669636932.kers
Total runtime 197 ms.
[2026-05-27 10:49:55] [INFO ] Implicit Places using invariants in 2646 ms returned []
Implicit Place search using SMT only with invariants took 2648 ms to find 0 implicit places.
Running 15723 sub problems to find dead transitions.
[2026-05-27 10:49:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 138/15863 variables, and 0 constraints, problems are : Problem set: 0 solved, 15723 unsolved in 30430 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 15723/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15723 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 138/15863 variables, and 0 constraints, problems are : Problem set: 0 solved, 15723 unsolved in 30427 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 15593/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100693ms problems are : Problem set: 0 solved, 15723 unsolved
Search for dead transitions found 0 dead transitions in 100822ms
Starting structural reductions in LTL mode, iteration 1 : 139/164 places, 15724/23499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104412 ms. Remains : 139/164 places, 15724/23499 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((F(p1)&&p0)))||p2))'
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-13
Product exploration timeout after 66320 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-13 finished in 114663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(p1)))'
Support contains 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Graph (trivial) has 97 edges and 164 vertex of which 4 / 164 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 161 transition count 23484
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 149 transition count 23484
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 149 transition count 23466
Deduced a syphon composed of 18 places in 23 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 131 transition count 23466
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 124 transition count 16697
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 124 transition count 16697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 124 transition count 16695
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 122 transition count 8055
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 122 transition count 8055
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 121 transition count 8053
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 121 transition count 8053
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 165 place count 80 transition count 8012
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 78 transition count 8023
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 78 transition count 8022
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 78 transition count 8022
Applied a total of 174 rules in 11043 ms. Remains 78 /164 variables (removed 86) and now considering 8022/23499 (removed 15477) transitions.
[2026-05-27 10:51:57] [INFO ] Flow matrix only has 8002 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1896782627292139199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1548410121382867588.kers'
[2026-05-27 10:51:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1896782627292139199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1548410121382867588.kers]
Normalized transition count is 8001 out of 8002 initially.
Culled 0 columns in 29 ms.
// Phase 1: matrix 8001 rows 78 cols 181800 entries
Finished phase 1 with 50 SingleSign rule and 2 generalized
[2026-05-27 10:51:57] [INFO ] Computed 26 invariants in 104 ms
Computed 26 P flows in 104 ms.
Exported basis to /tmp/petrispot-output-1548410121382867588.kers
Total runtime 128 ms.
[2026-05-27 10:52:01] [INFO ] Implicit Places using invariants in 4099 ms returned []
[2026-05-27 10:52:01] [INFO ] Flow matrix only has 8002 transitions (discarded 20 similar events)
[2026-05-27 10:52:01] [INFO ] Invariant cache hit.
[2026-05-27 10:52:05] [INFO ] State equation strengthened by 3467 read => feed constraints.
[2026-05-27 10:52:10] [INFO ] Implicit Places using invariants and state equation in 9062 ms returned []
Implicit Place search using SMT with State Equation took 13163 ms to find 0 implicit places.
[2026-05-27 10:52:14] [INFO ] Redundant transitions in 4030 ms returned []
Running 8020 sub problems to find dead transitions.
[2026-05-27 10:52:15] [INFO ] Flow matrix only has 8002 transitions (discarded 20 similar events)
[2026-05-27 10:52:15] [INFO ] Invariant cache hit.
[2026-05-27 10:52:15] [INFO ] State equation strengthened by 3467 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8020 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/8080 variables, and 10 constraints, problems are : Problem set: 0 solved, 8020 unsolved in 30229 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/78 constraints, ReadFeed: 0/3467 constraints, PredecessorRefiner: 8020/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8020 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8020 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 77/8080 variables, and 10 constraints, problems are : Problem set: 0 solved, 8020 unsolved in 30204 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/78 constraints, ReadFeed: 0/3467 constraints, PredecessorRefiner: 7988/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75145ms problems are : Problem set: 0 solved, 8020 unsolved
Search for dead transitions found 0 dead transitions in 75177ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/164 places, 8022/23499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103437 ms. Remains : 78/164 places, 8022/23499 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(p1)))'
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-14 finished in 103628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 11 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 23499/23499 transitions.
Graph (trivial) has 110 edges and 164 vertex of which 6 / 164 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 160 transition count 23483
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 148 transition count 23483
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 25 place count 148 transition count 23464
Deduced a syphon composed of 19 places in 25 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 129 transition count 23464
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 121 transition count 8915
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 121 transition count 8915
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 121 transition count 8912
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 87 place count 116 transition count 2160
Iterating global reduction 3 with 5 rules applied. Total rules applied 92 place count 116 transition count 2160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 114 transition count 2156
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 114 transition count 2156
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 182 place count 71 transition count 2113
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 68 transition count 2120
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 68 transition count 2117
Applied a total of 191 rules in 4539 ms. Remains 68 /164 variables (removed 96) and now considering 2117/23499 (removed 21382) transitions.
[2026-05-27 10:53:34] [INFO ] Flow matrix only has 2098 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15763808969132035306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17898841540943179166.kers'
[2026-05-27 10:53:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15763808969132035306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17898841540943179166.kers]
Normalized transition count is 2097 out of 2098 initially.
Culled 0 columns in 7 ms.
// Phase 1: matrix 2097 rows 68 cols 45258 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-27 10:53:34] [INFO ] Computed 26 invariants in 26 ms
Computed 26 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-17898841540943179166.kers
Total runtime 33 ms.
[2026-05-27 10:53:36] [INFO ] Implicit Places using invariants in 1377 ms returned []
[2026-05-27 10:53:36] [INFO ] Flow matrix only has 2098 transitions (discarded 19 similar events)
[2026-05-27 10:53:36] [INFO ] Invariant cache hit.
[2026-05-27 10:53:37] [INFO ] State equation strengthened by 1045 read => feed constraints.
[2026-05-27 10:53:40] [INFO ] Implicit Places using invariants and state equation in 3748 ms returned []
Implicit Place search using SMT with State Equation took 5128 ms to find 0 implicit places.
[2026-05-27 10:53:40] [INFO ] Redundant transitions in 225 ms returned []
Running 2115 sub problems to find dead transitions.
[2026-05-27 10:53:40] [INFO ] Flow matrix only has 2098 transitions (discarded 19 similar events)
[2026-05-27 10:53:40] [INFO ] Invariant cache hit.
[2026-05-27 10:53:40] [INFO ] State equation strengthened by 1045 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/2166 variables, and 26 constraints, problems are : Problem set: 0 solved, 2115 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/68 constraints, ReadFeed: 0/1045 constraints, PredecessorRefiner: 2115/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 68/2166 variables, and 26 constraints, problems are : Problem set: 0 solved, 2115 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/68 constraints, ReadFeed: 0/1045 constraints, PredecessorRefiner: 2088/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63104ms problems are : Problem set: 0 solved, 2115 unsolved
Search for dead transitions found 0 dead transitions in 63116ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/164 places, 2117/23499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73018 ms. Remains : 68/164 places, 2117/23499 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1005-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1005-LTLFireability-15 finished in 73118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(!p0)&&G(!p1))||G(!p0))))||(G(!p2)&&X(X(F(((X(!p0)&&G(!p1))||G(!p0)))))))))'
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 10:54:47] [INFO ] Flatten gal took : 3124 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1984788638585405748
[2026-05-27 10:54:48] [INFO ] Too many transitions (23499) to apply POR reductions. Disabling POR matrices.
[2026-05-27 10:54:49] [INFO ] Built C files in 754ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1984788638585405748
Running compilation step : cd /tmp/ltsmin1984788638585405748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-27 10:54:51] [INFO ] Applying decomposition
[2026-05-27 10:54:54] [INFO ] Flatten gal took : 3272 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/graph17971854050950422220.txt' '-o' '/tmp/graph17971854050950422220.bin' '-w' '/tmp/graph17971854050950422220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17971854050950422220.bin' '-l' '-1' '-v' '-w' '/tmp/graph17971854050950422220.weights' '-q' '0' '-e' '0.001'
[2026-05-27 10:55:03] [INFO ] Decomposing Gal with order
[2026-05-27 10:55:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 10:55:10] [INFO ] Removed a total of 311191 redundant transitions.
[2026-05-27 10:55:10] [INFO ] Flatten gal took : 5412 ms
[2026-05-27 10:55:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3700 ms.
[2026-05-27 10:55:15] [INFO ] Time to serialize gal into /tmp/LTLFireability15178683186267559807.gal : 200 ms
[2026-05-27 10:55:15] [INFO ] Time to serialize properties into /tmp/LTLFireability11600218061299642480.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/LTLFireability15178683186267559807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11600218061299642480.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 1 LTL properties
Checking formula 0 : !((F((G(F(((X(!("(((((i3.u7.p17==1)&&(i3.u11.p34==1))&&((i3.u13.p43==1)&&(i3.u15.p56==1)))&&(((i0.u18.p69==1)&&(i0.u24.p92==1))&&((i0....1739
Formula 0 simplified : G(F"(((((i3.u7.p17==1)&&(i3.u11.p34==1))&&((i3.u13.p43==1)&&(i3.u15.p56==1)))&&(((i0.u18.p69==1)&&(i0.u24.p92==1))&&((i0.u26.p101==1...1681
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/ltsmin1984788638585405748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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 720 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1984788638585405748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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 720 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)

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="ErlangenMainframeV0-PT-1005"
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 ErlangenMainframeV0-PT-1005, 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 r114-smll-177955740600460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1005.tgz
mv ErlangenMainframeV0-PT-1005 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 ;