About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1006
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16138.592 | 3600000.00 | 4745782.00 | 15128.60 | TFF?FFFFFFFFFFFF | normal |
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-177955740600468.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-1006, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 6.9K Mar 7 05:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 05:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 05:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 28K 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 19K Mar 15 09:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 7 05:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 05:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 7 05:09 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 41M 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-1006-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-1006-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779883148471
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-1006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 11:59:10] [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 11:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 11:59:13] [INFO ] Load time of PNML (sax parser for PT used): 2876 ms
[2026-05-27 11:59:13] [INFO ] Transformed 279 places.
[2026-05-27 11:59:14] [INFO ] Transformed 35278 transitions.
[2026-05-27 11:59:14] [INFO ] Found NUPN structural information;
[2026-05-27 11:59:14] [INFO ] Parsed PT model containing 279 places and 35278 transitions and 817267 arcs in 3454 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 35278/35278 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 209 transition count 35208
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 209 transition count 35208
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 179 place count 170 transition count 35169
Iterating global reduction 0 with 39 rules applied. Total rules applied 218 place count 170 transition count 35169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 221 place count 167 transition count 35166
Iterating global reduction 0 with 3 rules applied. Total rules applied 224 place count 167 transition count 35166
Applied a total of 224 rules in 1197 ms. Remains 167 /279 variables (removed 112) and now considering 35166/35278 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6042349980683961173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4641162187027884381.kers'
[2026-05-27 11:59:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6042349980683961173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4641162187027884381.kers]
Culled 0 columns in 138 ms.
// Phase 1: matrix 35166 rows 167 cols 817043 entries
Finished phase 1 with 138 SingleSign rule and 3 generalized
[2026-05-27 11:59:17] [INFO ] Computed 26 invariants in 632 ms
Computed 26 P flows in 634 ms.
Exported basis to /tmp/petrispot-output-4641162187027884381.kers
Total runtime 747 ms.
[2026-05-27 11:59:17] [INFO ] Implicit Places using invariants in 1421 ms returned []
Implicit Place search using SMT only with invariants took 1468 ms to find 0 implicit places.
Running 35165 sub problems to find dead transitions.
[2026-05-27 11:59:18] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 35165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 166/35333 variables, and 10 constraints, problems are : Problem set: 0 solved, 35165 unsolved in 31389 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 35165/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 35165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 166/35333 variables, and 10 constraints, problems are : Problem set: 0 solved, 35165 unsolved in 30807 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 35044/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 192258ms problems are : Problem set: 0 solved, 35165 unsolved
Search for dead transitions found 0 dead transitions in 192721ms
Starting structural reductions in LTL mode, iteration 1 : 167/279 places, 35166/35278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195635 ms. Remains : 167/279 places, 35166/35278 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Applied a total of 0 rules in 201 ms. Remains 167 /167 variables (removed 0) and now considering 35166/35166 (removed 0) transitions.
[2026-05-27 12:02:30] [INFO ] Invariant cache hit.
[2026-05-27 12:02:30] [INFO ] Implicit Places using invariants in 190 ms returned []
Implicit Place search using SMT only with invariants took 192 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 167/167 places, 35166/35166 transitions.
Support contains 57 out of 167 places after structural reductions.
[2026-05-27 12:02:37] [INFO ] Flatten gal took : 5543 ms
[2026-05-27 12:02:41] [INFO ] Flatten gal took : 4542 ms
[2026-05-27 12:02:50] [INFO ] Input system was already deterministic with 35166 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 17155 ms. (2 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 488 ms. (8 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 57481 steps, run timeout after 15002 ms. (steps per millisecond=3 ) properties seen :0 out of 30
Probabilistic random walk after 57481 steps, saw 38431 distinct states, run finished after 15014 ms. (steps per millisecond=3 ) properties seen :0
[2026-05-27 12:03:11] [INFO ] Invariant cache hit.
Problem AtomicPropp27 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (OVERLAPS) 74/130 variables, 12/22 constraints. Problems are: Problem set: 2 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/35333 variables, and 22 constraints, problems are : Problem set: 2 solved, 28 unsolved in 5148 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 74/130 variables, 12/22 constraints. Problems are: Problem set: 2 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/35333 variables, and 22 constraints, problems are : Problem set: 2 solved, 28 unsolved in 5214 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 28/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11085ms problems are : Problem set: 2 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Graph (trivial) has 82 edges and 167 vertex of which 4 / 167 are part of one of the 2 SCC in 17 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 165 transition count 35149
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 152 transition count 35149
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 152 transition count 35131
Deduced a syphon composed of 18 places in 43 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 63 place count 134 transition count 35131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 132 transition count 35114
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 132 transition count 35114
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 132 transition count 35112
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 19 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 131 place count 101 transition count 35081
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 99 transition count 35099
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 140 place count 99 transition count 35094
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 94 transition count 35092
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 94 transition count 35092
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 94 transition count 35092
Applied a total of 159 rules in 7530 ms. Remains 94 /167 variables (removed 73) and now considering 35092/35166 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7533 ms. Remains : 94/167 places, 35092/35166 transitions.
RANDOM walk for 40000 steps (8 resets) in 27367 ms. (1 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 203 ms. (19 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 269 ms. (14 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 258 ms. (15 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 281 ms. (14 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 330 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 322 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 337 ms. (11 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 350 ms. (11 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 271 ms. (14 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 279 ms. (14 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 292 ms. (13 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 272 ms. (14 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 300 ms. (13 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 330 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 312 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 271 ms. (14 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 312 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 295 ms. (13 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 312 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 277 ms. (14 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 312 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 282 ms. (14 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 287 ms. (13 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 308 ms. (12 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 226 ms. (17 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 298 ms. (13 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 252 ms. (15 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 236 ms. (16 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 153152 steps, run timeout after 27001 ms. (steps per millisecond=5 ) properties seen :0 out of 28
Probabilistic random walk after 153152 steps, saw 23792 distinct states, run finished after 27002 ms. (steps per millisecond=5 ) properties seen :0
[2026-05-27 12:04:06] [INFO ] Flow matrix only has 35075 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-15105261154907023380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4156153157403418109.kers'
[2026-05-27 12:04:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15105261154907023380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4156153157403418109.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 139 ms.
// Phase 1: matrix 35075 rows 93 cols 816792 entries
Finished phase 1 with 65 SingleSign rule and 3 generalized
[2026-05-27 12:04:07] [INFO ] Computed 26 invariants in 563 ms
Computed 26 P flows in 563 ms.
Exported basis to /tmp/petrispot-output-4156153157403418109.kers
Total runtime 752 ms.
[2026-05-27 12:04:07] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 6/62 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 7/69 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 25/94 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 35169/35169 variables, and 120 constraints, problems are : Problem set: 0 solved, 28 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 28/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 6/62 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 7/69 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 25/94 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 35169/35169 variables, and 120 constraints, problems are : Problem set: 0 solved, 28 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 28/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91392ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 35092/35092 transitions.
Applied a total of 0 rules in 887 ms. Remains 94 /94 variables (removed 0) and now considering 35092/35092 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 887 ms. Remains : 94/94 places, 35092/35092 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 35092/35092 transitions.
Applied a total of 0 rules in 877 ms. Remains 94 /94 variables (removed 0) and now considering 35092/35092 (removed 0) transitions.
[2026-05-27 12:05:39] [INFO ] Flow matrix only has 35075 transitions (discarded 17 similar events)
[2026-05-27 12:05:39] [INFO ] Invariant cache hit.
[2026-05-27 12:05:40] [INFO ] Implicit Places using invariants in 196 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 93/94 places, 35092/35092 transitions.
Applied a total of 0 rules in 942 ms. Remains 93 /93 variables (removed 0) and now considering 35092/35092 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2092 ms. Remains : 93/94 places, 35092/35092 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
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' '!(G((p0||X((X(X(p1))||(G(p3)&&p2))))))'
Support contains 28 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 164 transition count 26958
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 164 transition count 26958
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 162 transition count 13998
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 162 transition count 13998
Applied a total of 10 rules in 2251 ms. Remains 162 /167 variables (removed 5) and now considering 13998/35166 (removed 21168) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4317705547181108537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7749866317375478214.kers'
[2026-05-27 12:05:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4317705547181108537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7749866317375478214.kers]
Culled 0 columns in 57 ms.
// Phase 1: matrix 13998 rows 162 cols 325427 entries
Finished phase 1 with 133 SingleSign rule and 3 generalized
[2026-05-27 12:05:44] [INFO ] Computed 26 invariants in 233 ms
Computed 26 P flows in 234 ms.
Exported basis to /tmp/petrispot-output-7749866317375478214.kers
Total runtime 289 ms.
[2026-05-27 12:05:50] [INFO ] Implicit Places using invariants in 6157 ms returned []
Implicit Place search using SMT only with invariants took 6164 ms to find 0 implicit places.
Running 13997 sub problems to find dead transitions.
[2026-05-27 12:05:50] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/14160 variables, and 10 constraints, problems are : Problem set: 0 solved, 13997 unsolved in 30437 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/162 constraints, PredecessorRefiner: 13997/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13997 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13997 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/14160 variables, and 10 constraints, problems are : Problem set: 0 solved, 13997 unsolved in 30398 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/162 constraints, PredecessorRefiner: 13876/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 93451ms problems are : Problem set: 0 solved, 13997 unsolved
Search for dead transitions found 0 dead transitions in 93578ms
Starting structural reductions in LTL mode, iteration 1 : 162/167 places, 13998/35166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102126 ms. Remains : 162/167 places, 13998/35166 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(X(p0))||(G(p2)&&p1)))||p3)))'
Stuttering acceptance computed with spot in 674 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 7 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-01 finished in 103052 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)&&((((p1 U p0) U p2) U p3)||X(p1))))'
Support contains 24 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 23503
Ensure Unique test removed 10 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 42 place count 141 transition count 23503
Applied a total of 42 rules in 2698 ms. Remains 141 /167 variables (removed 26) and now considering 23503/35166 (removed 11663) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18070105592987992221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-611670676199945322.kers'
[2026-05-27 12:07:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18070105592987992221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-611670676199945322.kers]
Culled 0 columns in 95 ms.
// Phase 1: matrix 23503 rows 141 cols 327167 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-27 12:07:28] [INFO ] Computed 16 invariants in 452 ms
Computed 16 P flows in 454 ms.
Exported basis to /tmp/petrispot-output-611670676199945322.kers
Total runtime 504 ms.
[2026-05-27 12:07:31] [INFO ] Implicit Places using invariants in 3998 ms returned []
Implicit Place search using SMT only with invariants took 4000 ms to find 0 implicit places.
Running 23502 sub problems to find dead transitions.
[2026-05-27 12:07:31] [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 140/23644 variables, and 0 constraints, problems are : Problem set: 0 solved, 23502 unsolved in 30564 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 23502/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23502 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 140/23644 variables, and 0 constraints, problems are : Problem set: 0 solved, 23502 unsolved in 30389 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 23370/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 130419ms problems are : Problem set: 0 solved, 23502 unsolved
Search for dead transitions found 0 dead transitions in 130519ms
Starting structural reductions in LTL mode, iteration 1 : 141/167 places, 23503/35166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137282 ms. Remains : 141/167 places, 23503/35166 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&((((p1 U p0) U p2) U p3)||X(p1))))'
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND p0 (NOT p1)), (AND p3 (NOT p2) p0 (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) (NOT p3))), true, (NOT p2), (NOT p0), (NOT p3)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 2 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-02 finished in 137924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Support contains 23 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 161 transition count 24526
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 161 transition count 24526
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 158 transition count 8110
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 158 transition count 8110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 157 transition count 8108
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 157 transition count 8108
Applied a total of 20 rules in 2434 ms. Remains 157 /167 variables (removed 10) and now considering 8108/35166 (removed 27058) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14450739702081423730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16200678327515612976.kers'
[2026-05-27 12:09:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14450739702081423730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16200678327515612976.kers]
Culled 0 columns in 31 ms.
// Phase 1: matrix 8108 rows 157 cols 188975 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-27 12:09:45] [INFO ] Computed 26 invariants in 116 ms
Computed 26 P flows in 116 ms.
Exported basis to /tmp/petrispot-output-16200678327515612976.kers
Total runtime 144 ms.
[2026-05-27 12:09:48] [INFO ] Implicit Places using invariants in 3393 ms returned []
[2026-05-27 12:09:48] [INFO ] Invariant cache hit.
[2026-05-27 12:09:57] [INFO ] Implicit Places using invariants and state equation in 8630 ms returned []
Implicit Place search using SMT with State Equation took 12032 ms to find 0 implicit places.
Running 8107 sub problems to find dead transitions.
[2026-05-27 12:09:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/8265 variables, and 10 constraints, problems are : Problem set: 0 solved, 8107 unsolved in 30184 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 8107/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/8265 variables, and 10 constraints, problems are : Problem set: 0 solved, 8107 unsolved in 30235 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 7988/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 75089ms problems are : Problem set: 0 solved, 8107 unsolved
Search for dead transitions found 0 dead transitions in 75142ms
Starting structural reductions in LTL mode, iteration 1 : 157/167 places, 8108/35166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89636 ms. Remains : 157/167 places, 8108/35166 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 7988 ms.
Product exploration explored 100000 steps with 0 reset in 7178 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 8 factoid took 104 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 5207 ms. (7 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 796 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 817 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 787 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 86445 steps, run timeout after 6001 ms. (steps per millisecond=14 ) properties seen :0 out of 6
Probabilistic random walk after 86445 steps, saw 57150 distinct states, run finished after 6002 ms. (steps per millisecond=14 ) properties seen :0
[2026-05-27 12:11:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 88/111 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 37/148 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/157 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8265/8265 variables, and 183 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 88/111 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 37/148 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/157 variables, 9/26 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8265/8265 variables, and 183 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10143ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 8108/8108 transitions.
Graph (trivial) has 97 edges and 157 vertex of which 4 / 157 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 155 transition count 8091
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 142 transition count 8091
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 142 transition count 8072
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 123 transition count 8072
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 121 transition count 8055
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 121 transition count 8055
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 121 transition count 8053
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 151 place count 81 transition count 8013
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 157 place count 78 transition count 8036
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 162 place count 78 transition count 8031
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 172 place count 78 transition count 8021
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 184 place count 68 transition count 8019
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 209 place count 68 transition count 7994
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 68 transition count 7994
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 214 place count 68 transition count 7994
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 68 transition count 7990
Applied a total of 218 rules in 26339 ms. Remains 68 /157 variables (removed 89) and now considering 7990/8108 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26340 ms. Remains : 68/157 places, 7990/8108 transitions.
RANDOM walk for 40000 steps (8 resets) in 9667 ms. (4 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 498 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 490 ms. (81 steps per ms) remains 2/2 properties
[2026-05-27 12:12:16] [INFO ] Flow matrix only has 7986 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15970582521445392013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-912369410539336270.kers'
[2026-05-27 12:12:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15970582521445392013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-912369410539336270.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 41 ms.
// Phase 1: matrix 7986 rows 67 cols 181696 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-27 12:12:16] [INFO ] Computed 26 invariants in 149 ms
Computed 26 P flows in 149 ms.
Exported basis to /tmp/petrispot-output-912369410539336270.kers
Total runtime 180 ms.
[2026-05-27 12:12:16] [INFO ] State equation strengthened by 3485 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/39 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/46 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/68 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7986/8054 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8054 variables, 3485/3579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8054 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/8054 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8054/8054 variables, and 3579 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4444 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 68/68 constraints, ReadFeed: 3485/3485 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/39 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/46 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/68 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7986/8054 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8054 variables, 3485/3579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8054 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/8054 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8054/8054 variables, and 3579 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8183 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 68/68 constraints, ReadFeed: 3485/3485 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12962ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=1 )
Parikh walk visited 2 properties in 31 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 9 factoid took 143 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 61653 ms.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 23 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 8108/8108 transitions.
Applied a total of 0 rules in 82 ms. Remains 157 /157 variables (removed 0) and now considering 8108/8108 (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-1171168900225891650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16726539944129402405.kers'
[2026-05-27 12:12:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1171168900225891650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16726539944129402405.kers]
Culled 0 columns in 54 ms.
// Phase 1: matrix 8108 rows 157 cols 188975 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-27 12:12:30] [INFO ] Computed 26 invariants in 183 ms
Computed 26 P flows in 184 ms.
Exported basis to /tmp/petrispot-output-16726539944129402405.kers
Total runtime 224 ms.
[2026-05-27 12:12:34] [INFO ] Implicit Places using invariants in 4091 ms returned []
[2026-05-27 12:12:34] [INFO ] Invariant cache hit.
[2026-05-27 12:12:43] [INFO ] Implicit Places using invariants and state equation in 9035 ms returned []
Implicit Place search using SMT with State Equation took 13132 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 13217 ms. Remains : 157/157 places, 8108/8108 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 4 factoid took 70 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 3870 ms. (10 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 186 ms. (213 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 40483 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :0 out of 3
Probabilistic random walk after 40483 steps, saw 26997 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
[2026-05-27 12:12:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/111 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/148 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/157 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8265/8265 variables, and 183 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 88/111 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 37/148 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/157 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8265/8265 variables, and 183 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10090ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 8108/8108 transitions.
Graph (trivial) has 97 edges and 157 vertex of which 4 / 157 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 155 transition count 8091
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 142 transition count 8091
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 27 place count 142 transition count 8072
Deduced a syphon composed of 19 places in 9 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 65 place count 123 transition count 8072
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 121 transition count 8055
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 121 transition count 8055
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 121 transition count 8053
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 151 place count 81 transition count 8013
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 157 place count 78 transition count 8036
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 162 place count 78 transition count 8031
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 172 place count 78 transition count 8021
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 184 place count 68 transition count 8019
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 209 place count 68 transition count 7994
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 68 transition count 7994
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 214 place count 68 transition count 7994
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 68 transition count 7990
Applied a total of 218 rules in 23752 ms. Remains 68 /157 variables (removed 89) and now considering 7990/8108 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23752 ms. Remains : 68/157 places, 7990/8108 transitions.
RANDOM walk for 40000 steps (8 resets) in 6936 ms. (5 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 1/1 properties
[2026-05-27 12:13:23] [INFO ] Flow matrix only has 7986 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9362978571659971139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5302443400309727161.kers'
[2026-05-27 12:13:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9362978571659971139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5302443400309727161.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 29 ms.
// Phase 1: matrix 7986 rows 67 cols 181696 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-27 12:13:23] [INFO ] Computed 26 invariants in 105 ms
Computed 26 P flows in 106 ms.
Exported basis to /tmp/petrispot-output-5302443400309727161.kers
Total runtime 131 ms.
[2026-05-27 12:13:23] [INFO ] State equation strengthened by 3485 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/36 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/68 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7986/8054 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8054 variables, 3485/3579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8054 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/8054 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8054/8054 variables, and 3579 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4290 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 68/68 constraints, ReadFeed: 3485/3485 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/25 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/36 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/68 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7986/8054 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8054 variables, 3485/3579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8054 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/8054 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8054/8054 variables, and 3579 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6367 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 68/68 constraints, ReadFeed: 3485/3485 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10894ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 9 ms.
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 51629 ms.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 7330 ms.
Product exploration explored 100000 steps with 0 reset in 6721 ms.
Spot run failed in 109 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/ltsmin8346678094980451299
[2026-05-27 12:13:49] [INFO ] Built C files in 329ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8346678094980451299
Running compilation step : cd /tmp/ltsmin8346678094980451299;'/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/ltsmin8346678094980451299;'/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/ltsmin8346678094980451299;'/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 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 8108/8108 transitions.
Applied a total of 0 rules in 42 ms. Remains 157 /157 variables (removed 0) and now considering 8108/8108 (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-18207236185048646906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16797414647824334654.kers'
[2026-05-27 12:13:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18207236185048646906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16797414647824334654.kers]
Culled 0 columns in 32 ms.
// Phase 1: matrix 8108 rows 157 cols 188975 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-27 12:13:53] [INFO ] Computed 26 invariants in 119 ms
Computed 26 P flows in 120 ms.
Exported basis to /tmp/petrispot-output-16797414647824334654.kers
Total runtime 146 ms.
[2026-05-27 12:13:57] [INFO ] Implicit Places using invariants in 4092 ms returned []
[2026-05-27 12:13:57] [INFO ] Invariant cache hit.
[2026-05-27 12:14:05] [INFO ] Implicit Places using invariants and state equation in 7879 ms returned []
Implicit Place search using SMT with State Equation took 11974 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 12017 ms. Remains : 157/157 places, 8108/8108 transitions.
Built C files in :
/tmp/ltsmin14006099633348080034
[2026-05-27 12:14:05] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14006099633348080034
Running compilation step : cd /tmp/ltsmin14006099633348080034;'/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/ltsmin14006099633348080034;'/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/ltsmin14006099633348080034;'/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 12:14:13] [INFO ] Flatten gal took : 978 ms
[2026-05-27 12:14:14] [INFO ] Flatten gal took : 963 ms
[2026-05-27 12:14:14] [INFO ] Time to serialize gal into /tmp/LTL1121438626625821259.gal : 287 ms
[2026-05-27 12:14:14] [INFO ] Time to serialize properties into /tmp/LTL8995193608046257273.prop : 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/LTL1121438626625821259.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13156252703601417145.hoa' '-atoms' '/tmp/LTL8995193608046257273.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8995193608046257273.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13156252703601417145.hoa
Detected timeout of ITS tools.
[2026-05-27 12:14:34] [INFO ] Flatten gal took : 2087 ms
[2026-05-27 12:14:35] [INFO ] Flatten gal took : 959 ms
[2026-05-27 12:14:35] [INFO ] Time to serialize gal into /tmp/LTL1148325542038273085.gal : 160 ms
[2026-05-27 12:14:35] [INFO ] Time to serialize properties into /tmp/LTL106624181370065893.ltl : 5 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/LTL1148325542038273085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL106624181370065893.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...274
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((p21==0)||(p30==0))||((p47==0)||(p56==0)))||(((p69==0)||(p88==0))||((p117==0)||(p136==0))))||(((p145==0)||(p168==0))||((p...327
Formula 0 simplified : X(F!"(((((p21==0)||(p30==0))||((p47==0)||(p56==0)))||(((p69==0)||(p88==0))||((p117==0)||(p136==0))))||(((p145==0)||(p168==0))||((p21...317
Detected timeout of ITS tools.
[2026-05-27 12:14:52] [INFO ] Flatten gal took : 1214 ms
[2026-05-27 12:14:52] [INFO ] Applying decomposition
[2026-05-27 12:14:53] [INFO ] Flatten gal took : 982 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/graph13003956763320327411.txt' '-o' '/tmp/graph13003956763320327411.bin' '-w' '/tmp/graph13003956763320327411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13003956763320327411.bin' '-l' '-1' '-v' '-w' '/tmp/graph13003956763320327411.weights' '-q' '0' '-e' '0.001'
[2026-05-27 12:14:57] [INFO ] Decomposing Gal with order
[2026-05-27 12:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 12:15:00] [INFO ] Removed a total of 99955 redundant transitions.
[2026-05-27 12:15:00] [INFO ] Flatten gal took : 2525 ms
[2026-05-27 12:15:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 1091 ms.
[2026-05-27 12:15:02] [INFO ] Time to serialize gal into /tmp/LTL14873847920595061046.gal : 64 ms
[2026-05-27 12:15:02] [INFO ] Time to serialize properties into /tmp/LTL10609047923226503183.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/LTL14873847920595061046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10609047923226503183.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((i3.u7.p21==0)||(i3.u9.p30==0))||((i1.u14.p47==0)||(i3.u16.p56==0)))||(((i3.u40.p69==0)||(i3.u21.p88==0))||((i3.u25.p117=...485
Formula 0 simplified : X(F!"(((((i3.u7.p21==0)||(i3.u9.p30==0))||((i1.u14.p47==0)||(i3.u16.p56==0)))||(((i3.u40.p69==0)||(i3.u21.p88==0))||((i3.u25.p117==0...475
Detected timeout of ITS tools.
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-03 finished in 334918 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 U p1))))'
Support contains 19 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Graph (trivial) has 92 edges and 167 vertex of which 4 / 167 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 164 transition count 35151
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 152 transition count 35151
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 25 place count 152 transition count 35134
Deduced a syphon composed of 17 places in 39 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 59 place count 135 transition count 35134
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 77 place count 117 transition count 23454
Ensure Unique test removed 10 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 105 place count 107 transition count 23454
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 107 transition count 23452
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 105 transition count 10492
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 105 transition count 10492
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 5 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 189 place count 66 transition count 10453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 191 place count 65 transition count 10464
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 65 transition count 10462
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 65 transition count 10462
Applied a total of 203 rules in 7089 ms. Remains 65 /167 variables (removed 102) and now considering 10462/35166 (removed 24704) transitions.
[2026-05-27 12:15:24] [INFO ] Flow matrix only has 10441 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-295584864456568282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-270752570792495915.kers'
[2026-05-27 12:15:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-295584864456568282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-270752570792495915.kers]
Normalized transition count is 10440 out of 10441 initially.
Culled 0 columns in 43 ms.
// Phase 1: matrix 10440 rows 65 cols 249140 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-27 12:15:25] [INFO ] Computed 16 invariants in 137 ms
Computed 16 P flows in 138 ms.
Exported basis to /tmp/petrispot-output-270752570792495915.kers
Total runtime 174 ms.
[2026-05-27 12:15:28] [INFO ] Implicit Places using invariants in 3203 ms returned []
Implicit Place search using SMT only with invariants took 3205 ms to find 0 implicit places.
Running 10460 sub problems to find dead transitions.
[2026-05-27 12:15:28] [INFO ] Flow matrix only has 10441 transitions (discarded 21 similar events)
[2026-05-27 12:15:28] [INFO ] Invariant cache hit.
[2026-05-27 12:15:28] [INFO ] State equation strengthened by 11 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 64/10506 variables, and 0 constraints, problems are : Problem set: 0 solved, 10460 unsolved in 30205 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/65 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 10460/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 64/10506 variables, and 0 constraints, problems are : Problem set: 0 solved, 10460 unsolved in 30334 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/65 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 10430/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83809ms problems are : Problem set: 0 solved, 10460 unsolved
Search for dead transitions found 0 dead transitions in 83868ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/167 places, 10462/35166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94363 ms. Remains : 65/167 places, 10462/35166 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 U p1))))'
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-04 finished in 94562 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((F((F(X(F(p0))) U p1))&&X(G(p2)))))'
Support contains 16 out of 167 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Graph (trivial) has 92 edges and 167 vertex of which 4 / 167 are part of one of the 2 SCC in 3 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 164 transition count 35151
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 152 transition count 35151
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 152 transition count 35133
Deduced a syphon composed of 18 places in 45 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 134 transition count 35133
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 79 place count 116 transition count 23453
Ensure Unique test removed 10 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 107 place count 106 transition count 23453
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 106 transition count 23451
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 105 transition count 15675
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 105 transition count 15675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 104 transition count 15673
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 104 transition count 15673
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 9 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 185 place count 68 transition count 15637
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 189 place count 66 transition count 15648
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 200 place count 66 transition count 15648
Applied a total of 200 rules in 19665 ms. Remains 66 /167 variables (removed 101) and now considering 15648/35166 (removed 19518) transitions.
[2026-05-27 12:17:12] [INFO ] Flow matrix only has 15627 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16763366268316035609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10288441877422995268.kers'
[2026-05-27 12:17:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16763366268316035609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10288441877422995268.kers]
Normalized transition count is 15626 out of 15627 initially.
Culled 0 columns in 60 ms.
// Phase 1: matrix 15626 rows 66 cols 358020 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-27 12:17:12] [INFO ] Computed 16 invariants in 205 ms
Computed 16 P flows in 206 ms.
Exported basis to /tmp/petrispot-output-10288441877422995268.kers
Total runtime 301 ms.
[2026-05-27 12:17:16] [INFO ] Implicit Places using invariants in 4181 ms returned []
Implicit Place search using SMT only with invariants took 4184 ms to find 0 implicit places.
Running 15646 sub problems to find dead transitions.
[2026-05-27 12:17:16] [INFO ] Flow matrix only has 15627 transitions (discarded 21 similar events)
[2026-05-27 12:17:16] [INFO ] Invariant cache hit.
[2026-05-27 12:17:17] [INFO ] State equation strengthened by 7787 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 65/15693 variables, and 0 constraints, problems are : Problem set: 0 solved, 15646 unsolved in 30488 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/66 constraints, ReadFeed: 0/7787 constraints, PredecessorRefiner: 15646/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 65/15693 variables, and 0 constraints, problems are : Problem set: 0 solved, 15646 unsolved in 30267 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/66 constraints, ReadFeed: 0/7787 constraints, PredecessorRefiner: 15607/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101405ms problems are : Problem set: 0 solved, 15646 unsolved
Search for dead transitions found 0 dead transitions in 101588ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/167 places, 15648/35166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125603 ms. Remains : 66/167 places, 15648/35166 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((F((F(X(F(p0))) U p1))&&X(G(p2)))))'
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-05 finished in 125973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(F(G((p1 U p2))) U (p3 U p0)))))'
Support contains 26 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 151 transition count 23503
Ensure Unique test removed 10 places
Iterating global reduction 0 with 26 rules applied. Total rules applied 42 place count 141 transition count 23503
Applied a total of 42 rules in 2382 ms. Remains 141 /167 variables (removed 26) and now considering 23503/35166 (removed 11663) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1777144071151707136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13387145485970770479.kers'
[2026-05-27 12:19:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1777144071151707136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13387145485970770479.kers]
Culled 0 columns in 60 ms.
// Phase 1: matrix 23503 rows 141 cols 327167 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-27 12:19:01] [INFO ] Computed 16 invariants in 420 ms
Computed 16 P flows in 422 ms.
Exported basis to /tmp/petrispot-output-13387145485970770479.kers
Total runtime 467 ms.
[2026-05-27 12:19:03] [INFO ] Implicit Places using invariants in 2626 ms returned []
Implicit Place search using SMT only with invariants took 2628 ms to find 0 implicit places.
Running 23502 sub problems to find dead transitions.
[2026-05-27 12:19:03] [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 140/23644 variables, and 0 constraints, problems are : Problem set: 0 solved, 23502 unsolved in 30492 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 23502/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23502 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 140/23644 variables, and 0 constraints, problems are : Problem set: 0 solved, 23502 unsolved in 30385 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/141 constraints, PredecessorRefiner: 23370/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138715ms problems are : Problem set: 0 solved, 23502 unsolved
Search for dead transitions found 0 dead transitions in 138925ms
Starting structural reductions in LTL mode, iteration 1 : 141/167 places, 23503/35166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144165 ms. Remains : 141/167 places, 23503/35166 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(F(G((p1 U p2))) U (p3 U p0)))))'
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p3), (NOT p2), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-06
Product exploration timeout after 45800 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 123 steps with 0 reset with depth 124 and stack size 124 in 18 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-06 finished in 154963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((p1||X(p1)))))'
Support contains 23 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 161 transition count 24526
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 161 transition count 24526
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 158 transition count 8110
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 158 transition count 8110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 157 transition count 8108
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 157 transition count 8108
Applied a total of 20 rules in 2194 ms. Remains 157 /167 variables (removed 10) and now considering 8108/35166 (removed 27058) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7879574254390129827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16940533523811283393.kers'
[2026-05-27 12:21:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7879574254390129827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16940533523811283393.kers]
Culled 0 columns in 33 ms.
// Phase 1: matrix 8108 rows 157 cols 188975 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-27 12:21:36] [INFO ] Computed 26 invariants in 133 ms
Computed 26 P flows in 134 ms.
Exported basis to /tmp/petrispot-output-16940533523811283393.kers
Total runtime 165 ms.
[2026-05-27 12:21:39] [INFO ] Implicit Places using invariants in 4078 ms returned []
[2026-05-27 12:21:39] [INFO ] Invariant cache hit.
[2026-05-27 12:21:47] [INFO ] Implicit Places using invariants and state equation in 8157 ms returned []
Implicit Place search using SMT with State Equation took 12245 ms to find 0 implicit places.
Running 8107 sub problems to find dead transitions.
[2026-05-27 12:21:48] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/8265 variables, and 10 constraints, problems are : Problem set: 0 solved, 8107 unsolved in 30223 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 8107/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8107 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/8265 variables, and 10 constraints, problems are : Problem set: 0 solved, 8107 unsolved in 30239 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 7988/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76421ms problems are : Problem set: 0 solved, 8107 unsolved
Search for dead transitions found 0 dead transitions in 76521ms
Starting structural reductions in LTL mode, iteration 1 : 157/167 places, 8108/35166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91043 ms. Remains : 157/167 places, 8108/35166 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((X(p1)||p1))))'
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-07 finished in 91474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 23 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Graph (trivial) has 99 edges and 167 vertex of which 4 / 167 are part of one of the 2 SCC in 22 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 164 transition count 35151
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 152 transition count 35151
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 152 transition count 35133
Deduced a syphon composed of 18 places in 50 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 134 transition count 35133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 69 place count 126 transition count 24476
Iterating global reduction 2 with 8 rules applied. Total rules applied 77 place count 126 transition count 24476
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 126 transition count 24474
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 125 transition count 16698
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 125 transition count 16698
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 8 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 167 place count 82 transition count 16655
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 81 transition count 16666
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 81 transition count 16665
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 175 place count 81 transition count 16665
Applied a total of 175 rules in 36171 ms. Remains 81 /167 variables (removed 86) and now considering 16665/35166 (removed 18501) transitions.
[2026-05-27 12:23:41] [INFO ] Flow matrix only has 16644 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6834861586110587728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10202763477259208592.kers'
[2026-05-27 12:23:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6834861586110587728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10202763477259208592.kers]
Normalized transition count is 16643 out of 16644 initially.
Culled 0 columns in 66 ms.
// Phase 1: matrix 16643 rows 81 cols 380530 entries
Finished phase 1 with 53 SingleSign rule and 2 generalized
[2026-05-27 12:23:41] [INFO ] Computed 26 invariants in 282 ms
Computed 26 P flows in 283 ms.
Exported basis to /tmp/petrispot-output-10202763477259208592.kers
Total runtime 345 ms.
[2026-05-27 12:23:48] [INFO ] Implicit Places using invariants in 7857 ms returned []
Implicit Place search using SMT only with invariants took 7869 ms to find 0 implicit places.
Running 16663 sub problems to find dead transitions.
[2026-05-27 12:23:49] [INFO ] Flow matrix only has 16644 transitions (discarded 21 similar events)
[2026-05-27 12:23:49] [INFO ] Invariant cache hit.
[2026-05-27 12:23:49] [INFO ] State equation strengthened by 7787 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, 16663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 80/16725 variables, and 10 constraints, problems are : Problem set: 0 solved, 16663 unsolved in 30292 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/81 constraints, ReadFeed: 0/7787 constraints, PredecessorRefiner: 16663/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 16663 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 80/16725 variables, and 10 constraints, problems are : Problem set: 0 solved, 16663 unsolved in 30280 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/81 constraints, ReadFeed: 0/7787 constraints, PredecessorRefiner: 16630/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101825ms problems are : Problem set: 0 solved, 16663 unsolved
Search for dead transitions found 0 dead transitions in 101920ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/167 places, 16665/35166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145992 ms. Remains : 81/167 places, 16665/35166 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-11 finished in 146213 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 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Graph (trivial) has 112 edges and 167 vertex of which 6 / 167 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 163 transition count 35150
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 151 transition count 35150
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 151 transition count 35131
Deduced a syphon composed of 19 places in 50 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 63 place count 132 transition count 35131
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 72 place count 123 transition count 12806
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 123 transition count 12806
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 123 transition count 12803
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 90 place count 117 transition count 2163
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 117 transition count 2163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 115 transition count 2159
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 115 transition count 2159
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 188 place count 71 transition count 2115
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 194 place count 68 transition count 2122
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 198 place count 68 transition count 2118
Applied a total of 198 rules in 8657 ms. Remains 68 /167 variables (removed 99) and now considering 2118/35166 (removed 33048) transitions.
[2026-05-27 12:25:39] [INFO ] Flow matrix only has 2098 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-8059658135140838515.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9671620888078086540.kers'
[2026-05-27 12:25:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8059658135140838515.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9671620888078086540.kers]
Normalized transition count is 2097 out of 2098 initially.
Culled 0 columns in 7 ms.
// Phase 1: matrix 2097 rows 68 cols 45260 entries
Finished phase 1 with 40 SingleSign rule and 2 generalized
[2026-05-27 12:25:39] [INFO ] Computed 26 invariants in 29 ms
Computed 26 P flows in 30 ms.
Exported basis to /tmp/petrispot-output-9671620888078086540.kers
Total runtime 36 ms.
[2026-05-27 12:25:41] [INFO ] Implicit Places using invariants in 1516 ms returned []
[2026-05-27 12:25:41] [INFO ] Flow matrix only has 2098 transitions (discarded 20 similar events)
[2026-05-27 12:25:41] [INFO ] Invariant cache hit.
[2026-05-27 12:25:42] [INFO ] State equation strengthened by 1045 read => feed constraints.
[2026-05-27 12:25:44] [INFO ] Implicit Places using invariants and state equation in 3362 ms returned []
Implicit Place search using SMT with State Equation took 4887 ms to find 0 implicit places.
[2026-05-27 12:25:44] [INFO ] Redundant transitions in 276 ms returned []
Running 2116 sub problems to find dead transitions.
[2026-05-27 12:25:44] [INFO ] Flow matrix only has 2098 transitions (discarded 20 similar events)
[2026-05-27 12:25:44] [INFO ] Invariant cache hit.
[2026-05-27 12:25:44] [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, 2116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2116 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2116 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, 2116 unsolved in 30068 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: 2116/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2116 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2116 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, 2116 unsolved in 30051 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: 2089/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63347ms problems are : Problem set: 0 solved, 2116 unsolved
Search for dead transitions found 0 dead transitions in 63360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/167 places, 2118/35166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77194 ms. Remains : 68/167 places, 2118/35166 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 45 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-12 finished in 77302 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)&&X(X(F(!p0)))))'
Support contains 11 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 161 transition count 24526
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 161 transition count 24526
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 155 transition count 3246
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 155 transition count 3246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 154 transition count 3244
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 154 transition count 3244
Applied a total of 26 rules in 3090 ms. Remains 154 /167 variables (removed 13) and now considering 3244/35166 (removed 31922) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4713607891321491926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9296258620406571000.kers'
[2026-05-27 12:26:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4713607891321491926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9296258620406571000.kers]
Culled 0 columns in 19 ms.
// Phase 1: matrix 3244 rows 154 cols 72239 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-27 12:26:51] [INFO ] Computed 26 invariants in 74 ms
Computed 26 P flows in 75 ms.
Exported basis to /tmp/petrispot-output-9296258620406571000.kers
Total runtime 85 ms.
[2026-05-27 12:26:53] [INFO ] Implicit Places using invariants in 2021 ms returned []
[2026-05-27 12:26:53] [INFO ] Invariant cache hit.
[2026-05-27 12:26:57] [INFO ] Implicit Places using invariants and state equation in 4350 ms returned []
Implicit Place search using SMT with State Equation took 6374 ms to find 0 implicit places.
Running 3243 sub problems to find dead transitions.
[2026-05-27 12:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3243 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 153/3398 variables, and 10 constraints, problems are : Problem set: 0 solved, 3243 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 3243/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3243 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 153/3398 variables, and 10 constraints, problems are : Problem set: 0 solved, 3243 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 3124/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65259ms problems are : Problem set: 0 solved, 3243 unsolved
Search for dead transitions found 0 dead transitions in 65272ms
Starting structural reductions in LTL mode, iteration 1 : 154/167 places, 3244/35166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74742 ms. Remains : 154/167 places, 3244/35166 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(X(F(!p0)))))'
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), p0, p0]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 3164 ms.
Stack based approach found an accepted trace after 81 steps with 3 reset with depth 73 and stack size 73 in 2 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-13 finished in 78145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p1)))&&(!p1 U !p2))))'
Support contains 30 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 161 transition count 24526
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 161 transition count 24526
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 159 transition count 11566
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 159 transition count 11566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 158 transition count 11564
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 158 transition count 11564
Applied a total of 18 rules in 1781 ms. Remains 158 /167 variables (removed 9) and now considering 11564/35166 (removed 23602) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18430160489558596220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10044095478344235812.kers'
[2026-05-27 12:28:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18430160489558596220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10044095478344235812.kers]
Culled 0 columns in 62 ms.
// Phase 1: matrix 11564 rows 158 cols 271919 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-27 12:28:08] [INFO ] Computed 26 invariants in 248 ms
Computed 26 P flows in 249 ms.
Exported basis to /tmp/petrispot-output-10044095478344235812.kers
Total runtime 292 ms.
[2026-05-27 12:28:11] [INFO ] Implicit Places using invariants in 3433 ms returned []
Implicit Place search using SMT only with invariants took 3444 ms to find 0 implicit places.
Running 11563 sub problems to find dead transitions.
[2026-05-27 12:28:11] [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, 11563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 157/11722 variables, and 10 constraints, problems are : Problem set: 0 solved, 11563 unsolved in 30193 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 11563/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11563 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 157/11722 variables, and 10 constraints, problems are : Problem set: 0 solved, 11563 unsolved in 30318 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/158 constraints, PredecessorRefiner: 11444/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85590ms problems are : Problem set: 0 solved, 11563 unsolved
Search for dead transitions found 0 dead transitions in 85638ms
Starting structural reductions in LTL mode, iteration 1 : 158/167 places, 11564/35166 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90887 ms. Remains : 158/167 places, 11564/35166 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(p1)))&&(!p1 U !p2))))'
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) p2), (OR p2 (AND (NOT p0) (NOT p1))), true, (OR p2 (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-14 finished in 91241 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 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 35166/35166 transitions.
Graph (trivial) has 99 edges and 167 vertex of which 4 / 167 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 164 transition count 35151
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 152 transition count 35151
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 152 transition count 35133
Deduced a syphon composed of 18 places in 55 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 134 transition count 35133
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 79 place count 116 transition count 23453
Ensure Unique test removed 10 places
Iterating global reduction 2 with 28 rules applied. Total rules applied 107 place count 106 transition count 23453
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 106 transition count 23451
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 115 place count 100 transition count 2171
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 100 transition count 2171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 98 transition count 2167
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 98 transition count 2167
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 201 place count 60 transition count 2129
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 207 place count 57 transition count 2140
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 57 transition count 2136
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 218 place count 57 transition count 2136
Applied a total of 218 rules in 6839 ms. Remains 57 /167 variables (removed 110) and now considering 2136/35166 (removed 33030) transitions.
[2026-05-27 12:29:44] [INFO ] Flow matrix only has 2115 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11303576587741696140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6211354328668246670.kers'
[2026-05-27 12:29:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11303576587741696140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6211354328668246670.kers]
Normalized transition count is 2114 out of 2115 initially.
Culled 0 columns in 13 ms.
// Phase 1: matrix 2114 rows 57 cols 47392 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-27 12:29:44] [INFO ] Computed 16 invariants in 42 ms
Computed 16 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-6211354328668246670.kers
Total runtime 49 ms.
[2026-05-27 12:29:45] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2026-05-27 12:29:45] [INFO ] Flow matrix only has 2115 transitions (discarded 21 similar events)
[2026-05-27 12:29:45] [INFO ] Invariant cache hit.
[2026-05-27 12:29:46] [INFO ] State equation strengthened by 1035 read => feed constraints.
[2026-05-27 12:29:47] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2778 ms to find 0 implicit places.
[2026-05-27 12:29:47] [INFO ] Redundant transitions in 245 ms returned []
Running 2134 sub problems to find dead transitions.
[2026-05-27 12:29:47] [INFO ] Flow matrix only has 2115 transitions (discarded 21 similar events)
[2026-05-27 12:29:47] [INFO ] Invariant cache hit.
[2026-05-27 12:29:47] [INFO ] State equation strengthened by 1035 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2134 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 57/2172 variables, and 16 constraints, problems are : Problem set: 0 solved, 2134 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/57 constraints, ReadFeed: 0/1035 constraints, PredecessorRefiner: 2134/35 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/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2134 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 57/2172 variables, and 16 constraints, problems are : Problem set: 0 solved, 2134 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/57 constraints, ReadFeed: 0/1035 constraints, PredecessorRefiner: 2099/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63033ms problems are : Problem set: 0 solved, 2134 unsolved
Search for dead transitions found 0 dead transitions in 63042ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/167 places, 2136/35166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72917 ms. Remains : 57/167 places, 2136/35166 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 119 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-1006-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV0-PT-1006-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-1006-LTLFireability-15 finished in 73096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(G(p1)))))'
Spot run failed in 92 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 12:30:57] [INFO ] Flatten gal took : 5968 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11863100727550218948
[2026-05-27 12:31:01] [INFO ] Too many transitions (35166) to apply POR reductions. Disabling POR matrices.
[2026-05-27 12:31:02] [INFO ] Built C files in 1042ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11863100727550218948
Running compilation step : cd /tmp/ltsmin11863100727550218948;'/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 12:31:03] [INFO ] Applying decomposition
[2026-05-27 12:31:09] [INFO ] Flatten gal took : 5840 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/graph6238395398051879402.txt' '-o' '/tmp/graph6238395398051879402.bin' '-w' '/tmp/graph6238395398051879402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6238395398051879402.bin' '-l' '-1' '-v' '-w' '/tmp/graph6238395398051879402.weights' '-q' '0' '-e' '0.001'
[2026-05-27 12:31:26] [INFO ] Decomposing Gal with order
[2026-05-27 12:31:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 12:31:39] [INFO ] Removed a total of 466703 redundant transitions.
[2026-05-27 12:31:40] [INFO ] Flatten gal took : 9642 ms
[2026-05-27 12:31:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 8657 ms.
[2026-05-27 12:31:50] [INFO ] Time to serialize gal into /tmp/LTLFireability14716493707456196590.gal : 376 ms
[2026-05-27 12:31:50] [INFO ] Time to serialize properties into /tmp/LTLFireability16528932451070342785.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14716493707456196590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16528932451070342785.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 : !((X((G("(((((i2.u7.p21==0)||(i1.u8.p30==0))||((i0.u13.p47==0)||(i0.u15.p56==0)))||(((i0.u18.p69==0)||(i0.u22.p88==0))||((i0.u28.p117=...484
Formula 0 simplified : X(F!"(((((i2.u7.p21==0)||(i1.u8.p30==0))||((i0.u13.p47==0)||(i0.u15.p56==0)))||(((i0.u18.p69==0)||(i0.u22.p88==0))||((i0.u28.p117==0...474
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/ltsmin11863100727550218948;'/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/ltsmin11863100727550218948;'/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-1006"
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-1006, 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-177955740600468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1006.tgz
mv ErlangenMainframeV0-PT-1006 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 '
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 ;
