Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499200212.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ErlangenMainframeV2-PT-bP01C01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K May 27 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 27 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 09:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 09:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 27 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 09:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 09:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 54K May 26 18:17 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1780370472118

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP01C01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-02 03:21:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 03:21:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:21:15] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2026-06-02 03:21:15] [INFO ] Transformed 179 places.
[2026-06-02 03:21:15] [INFO ] Transformed 223 transitions.
[2026-06-02 03:21:15] [INFO ] Found NUPN structural information;
[2026-06-02 03:21:15] [INFO ] Parsed PT model containing 179 places and 223 transitions and 639 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 223/223 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 141 transition count 185
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 141 transition count 185
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 130 transition count 174
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 130 transition count 174
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 127 transition count 171
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 105 place count 126 transition count 171
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 124 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 124 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 111 place count 122 transition count 157
Iterating global reduction 0 with 2 rules applied. Total rules applied 113 place count 122 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 114 place count 121 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 115 place count 121 transition count 156
Applied a total of 115 rules in 136 ms. Remains 121 /179 variables (removed 58) and now considering 156/223 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13589506638424558333.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9193663601649213278.kers'
[2026-06-02 03:21:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13589506638424558333.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9193663601649213278.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 121 cols 444 entries
Finished phase 1 with 111 SingleSign rule and 1 generalized
[2026-06-02 03:21:15] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9193663601649213278.kers
Total runtime 3 ms.
[2026-06-02 03:21:16] [INFO ] Implicit Places using invariants in 427 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 501 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/179 places, 156/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 120 /120 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 678 ms. Remains : 120/179 places, 156/223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Applied a total of 0 rules in 16 ms. Remains 120 /120 variables (removed 0) and now considering 156/156 (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-12439452352301949764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5827450424255315574.kers'
[2026-06-02 03:21:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12439452352301949764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5827450424255315574.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 156 rows 120 cols 439 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-06-02 03:21:16] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5827450424255315574.kers
Total runtime 2 ms.
[2026-06-02 03:21:16] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-06-02 03:21:16] [INFO ] Invariant cache hit.
[2026-06-02 03:21:16] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2026-06-02 03:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 156/276 variables, 120/134 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 134 constraints, problems are : Problem set: 0 solved, 155 unsolved in 12563 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 156/276 variables, 120/137 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 155/292 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/276 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/276 variables, and 302 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42729ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 42753ms
Finished structural reductions in LTL mode , in 1 iterations and 43250 ms. Remains : 120/120 places, 156/156 transitions.
Support contains 31 out of 120 places after structural reductions.
[2026-06-02 03:21:59] [INFO ] Flatten gal took : 83 ms
[2026-06-02 03:21:59] [INFO ] Flatten gal took : 32 ms
[2026-06-02 03:21:59] [INFO ] Input system was already deterministic with 156 transitions.
RANDOM walk for 36944 steps (8 resets) in 2214 ms. (16 steps per ms) remains 0/29 properties
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 107 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 107 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 104 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 104 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 102 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 102 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 100 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 100 transition count 127
Applied a total of 40 rules in 23 ms. Remains 100 /120 variables (removed 20) and now considering 127/156 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13644377087085790426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7550415537431610196.kers'
[2026-06-02 03:22:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13644377087085790426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7550415537431610196.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 100 cols 333 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-06-02 03:22:01] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7550415537431610196.kers
Total runtime 2 ms.
[2026-06-02 03:22:01] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-06-02 03:22:01] [INFO ] Invariant cache hit.
[2026-06-02 03:22:01] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-06-02 03:22:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/227 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 110 constraints, problems are : Problem set: 0 solved, 126 unsolved in 9185 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/227 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 126/236 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 239 constraints, problems are : Problem set: 0 solved, 126 unsolved in 18874 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 28092ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 28094ms
Starting structural reductions in LTL mode, iteration 1 : 100/120 places, 127/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28430 ms. Remains : 100/120 places, 127/156 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||X(F(p1)))))'
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-01
Product exploration explored 100000 steps with 4 reset in 389 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-01 finished in 29217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Graph (trivial) has 112 edges and 120 vertex of which 9 / 120 are part of one of the 4 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 114 transition count 126
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 39 rules applied. Total rules applied 63 place count 91 transition count 110
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 72 place count 82 transition count 110
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 72 place count 82 transition count 99
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 94 place count 71 transition count 99
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 106 place count 59 transition count 86
Iterating global reduction 3 with 12 rules applied. Total rules applied 118 place count 59 transition count 86
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 118 place count 59 transition count 83
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 124 place count 56 transition count 83
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 53 transition count 69
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 53 transition count 69
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 162 place count 37 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 37 transition count 51
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 35 transition count 48
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 35 transition count 48
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 180 place count 29 transition count 61
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 186 place count 29 transition count 55
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 187 place count 28 transition count 53
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 28 transition count 53
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 194 place count 28 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 201 place count 28 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 203 place count 27 transition count 46
Applied a total of 203 rules in 77 ms. Remains 27 /120 variables (removed 93) and now considering 46/156 (removed 110) transitions.
[2026-06-02 03:22:30] [INFO ] Flow matrix only has 43 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15629583172914283124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3991150073388936199.kers'
[2026-06-02 03:22:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15629583172914283124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3991150073388936199.kers]
Normalized transition count is 42 out of 43 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 42 rows 26 cols 172 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-06-02 03:22:30] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3991150073388936199.kers
Total runtime 0 ms.
[2026-06-02 03:22:30] [INFO ] Implicit Places using invariants in 77 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/120 places, 46/156 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 24 transition count 60
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 24 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 23 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 23 transition count 50
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 23 transition count 42
Applied a total of 22 rules in 12 ms. Remains 23 /26 variables (removed 3) and now considering 42/46 (removed 4) transitions.
[2026-06-02 03:22:30] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6219227512994132777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1671089487330390120.kers'
[2026-06-02 03:22:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6219227512994132777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1671089487330390120.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 23 cols 154 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-06-02 03:22:30] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1671089487330390120.kers
Total runtime 0 ms.
[2026-06-02 03:22:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-06-02 03:22:30] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2026-06-02 03:22:30] [INFO ] Invariant cache hit.
[2026-06-02 03:22:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-02 03:22:30] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/120 places, 42/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 23/120 places, 42/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 378 ms.
Product exploration explored 100000 steps with 0 reset in 290 ms.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 23377 steps (5 resets) in 259 ms. (89 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Knowledge-based reduction took 287 ms.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2026-06-02 03:22:31] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2026-06-02 03:22:31] [INFO ] Invariant cache hit.
[2026-06-02 03:22:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-06-02 03:22:31] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2026-06-02 03:22:31] [INFO ] Invariant cache hit.
[2026-06-02 03:22:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-02 03:22:31] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2026-06-02 03:22:32] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2026-06-02 03:22:32] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2026-06-02 03:22:32] [INFO ] Invariant cache hit.
[2026-06-02 03:22:32] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 38/61 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 42 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 38/61 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 34/75 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/62 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 78 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2294 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3756ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 3759ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3879 ms. Remains : 23/23 places, 42/42 transitions.
Computed a total of 2 stabilizing places and 9 stable transitions
Computed a total of 2 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 26688 steps (6 resets) in 89 ms. (296 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Knowledge-based reduction took 249 ms.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 0 reset in 474 ms.
Built C files in :
/tmp/ltsmin5481674083906029609
[2026-06-02 03:22:36] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2026-06-02 03:22:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:22:36] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2026-06-02 03:22:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:22:36] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2026-06-02 03:22:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 03:22:36] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5481674083906029609
Running compilation step : cd /tmp/ltsmin5481674083906029609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin5481674083906029609;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin5481674083906029609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8103671796469086786.hoa' '--buchi-type=spotba'
LTSmin run took 99 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-02 finished in 6859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Graph (trivial) has 116 edges and 120 vertex of which 11 / 120 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 113 transition count 125
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 39 rules applied. Total rules applied 63 place count 90 transition count 109
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 72 place count 81 transition count 109
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 72 place count 81 transition count 98
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 94 place count 70 transition count 98
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 103 place count 61 transition count 88
Iterating global reduction 3 with 9 rules applied. Total rules applied 112 place count 61 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 112 place count 61 transition count 85
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 118 place count 58 transition count 85
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 121 place count 55 transition count 71
Iterating global reduction 3 with 3 rules applied. Total rules applied 124 place count 55 transition count 71
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 158 place count 38 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 160 place count 38 transition count 52
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 36 transition count 49
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 36 transition count 49
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 178 place count 29 transition count 67
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 190 place count 29 transition count 55
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 192 place count 27 transition count 51
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 27 transition count 51
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 204 place count 27 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 206 place count 26 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 216 place count 26 transition count 44
Applied a total of 216 rules in 46 ms. Remains 26 /120 variables (removed 94) and now considering 44/156 (removed 112) transitions.
[2026-06-02 03:22:37] [INFO ] Flow matrix only has 40 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-18401670941664250826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5824787870542367723.kers'
[2026-06-02 03:22:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18401670941664250826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5824787870542367723.kers]
Normalized transition count is 39 out of 40 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 39 rows 26 cols 166 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-06-02 03:22:37] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5824787870542367723.kers
Total runtime 1 ms.
[2026-06-02 03:22:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-06-02 03:22:37] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2026-06-02 03:22:37] [INFO ] Invariant cache hit.
[2026-06-02 03:22:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-02 03:22:37] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2026-06-02 03:22:37] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2026-06-02 03:22:37] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2026-06-02 03:22:37] [INFO ] Invariant cache hit.
[2026-06-02 03:22:37] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 39/65 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 49 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 39/65 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/66 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 86 constraints, problems are : Problem set: 0 solved, 36 unsolved in 2094 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 26/26 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3217ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 3219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/120 places, 44/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3413 ms. Remains : 26/120 places, 44/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-03 finished in 3635 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||G(p1))))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 107 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 107 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 105 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 105 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 104 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 104 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 103 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 103 transition count 133
Applied a total of 34 rules in 19 ms. Remains 103 /120 variables (removed 17) and now considering 133/156 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17786897689967561592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15615463864183960518.kers'
[2026-06-02 03:22:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17786897689967561592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15615463864183960518.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 103 cols 361 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-06-02 03:22:41] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15615463864183960518.kers
Total runtime 2 ms.
[2026-06-02 03:22:41] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-06-02 03:22:41] [INFO ] Invariant cache hit.
[2026-06-02 03:22:41] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-06-02 03:22:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 133/236 variables, 103/113 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 113 constraints, problems are : Problem set: 0 solved, 132 unsolved in 9534 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/236 variables, 103/113 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 132/245 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 248 constraints, problems are : Problem set: 0 solved, 132 unsolved in 19944 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 29502ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 29505ms
Starting structural reductions in LTL mode, iteration 1 : 103/120 places, 133/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29817 ms. Remains : 103/120 places, 133/156 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||G(p1))))'
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-04 finished in 30039 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)) U (F((p1&&X(p2)))&&X(p1))))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 107 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 107 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 104 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 104 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 102 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 102 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 100 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 100 transition count 127
Applied a total of 40 rules in 9 ms. Remains 100 /120 variables (removed 20) and now considering 127/156 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11323390150842016518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4416692728580088207.kers'
[2026-06-02 03:23:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11323390150842016518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4416692728580088207.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 100 cols 333 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-06-02 03:23:11] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4416692728580088207.kers
Total runtime 2 ms.
[2026-06-02 03:23:11] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-06-02 03:23:11] [INFO ] Invariant cache hit.
[2026-06-02 03:23:11] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-06-02 03:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/227 variables, 100/111 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 112 constraints, problems are : Problem set: 0 solved, 126 unsolved in 9174 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/227 variables, 100/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 126/238 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 244 constraints, problems are : Problem set: 0 solved, 126 unsolved in 16405 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 25611ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 25612ms
Starting structural reductions in LTL mode, iteration 1 : 100/120 places, 127/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25899 ms. Remains : 100/120 places, 127/156 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)) U (F((p1&&X(p2)))&&X(p1))))'
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 213 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-05 finished in 26425 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)||G(p1)))||((p2 U p3)&&X(p4))))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 107 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 107 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 106 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 106 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 105 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 105 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 104 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 104 transition count 134
Applied a total of 32 rules in 9 ms. Remains 104 /120 variables (removed 16) and now considering 134/156 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7046954659323491061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16753095547956169576.kers'
[2026-06-02 03:23:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7046954659323491061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16753095547956169576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 104 cols 363 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-06-02 03:23:37] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16753095547956169576.kers
Total runtime 2 ms.
[2026-06-02 03:23:37] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-06-02 03:23:37] [INFO ] Invariant cache hit.
[2026-06-02 03:23:37] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-06-02 03:23:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/238 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 0/238 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 112 constraints, problems are : Problem set: 0 solved, 133 unsolved in 7863 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/238 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 133/245 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 249 constraints, problems are : Problem set: 0 solved, 133 unsolved in 18275 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26157ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 26157ms
Starting structural reductions in LTL mode, iteration 1 : 104/120 places, 134/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26436 ms. Remains : 104/120 places, 134/156 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)||G(p1)))||((p2 U p3)&&X(p4))))'
Stuttering acceptance computed with spot in 371 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p4)), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 331 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 48 factoid took 181 ms. Reduced automaton from 10 states, 34 edges and 5 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 343 ms. (116 steps per ms) remains 1/6 properties
BEST_FIRST walk for 5704 steps (1 resets) in 22 ms. (248 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 48 factoid took 129 ms. Proved property starting from automaton with 4 states, 9 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 539 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-06 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-06 finished in 27875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((G(p0)||(p0&&G(F(!p0))))))) U G(p1)))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 106 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 106 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 103 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 103 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 101 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 101 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 99 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 126
Applied a total of 42 rules in 6 ms. Remains 99 /120 variables (removed 21) and now considering 126/156 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3189969120256947968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2043129151697440325.kers'
[2026-06-02 03:24:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3189969120256947968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2043129151697440325.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 99 cols 331 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-06-02 03:24:05] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2043129151697440325.kers
Total runtime 1 ms.
[2026-06-02 03:24:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-06-02 03:24:05] [INFO ] Invariant cache hit.
[2026-06-02 03:24:05] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-06-02 03:24:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/225 variables, 99/108 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/225 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 108 constraints, problems are : Problem set: 0 solved, 125 unsolved in 8341 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/225 variables, 99/108 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 125/233 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 237 constraints, problems are : Problem set: 0 solved, 125 unsolved in 13931 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 22287ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 22288ms
Starting structural reductions in LTL mode, iteration 1 : 99/120 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22537 ms. Remains : 99/120 places, 126/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((G(p0)||(p0&&G(F(!p0))))))) U G(p1)))'
Stuttering acceptance computed with spot in 701 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, false, (AND (NOT p0) (NOT p1)), p0, p0, (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, (AND p0 (NOT p1))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 131 ms.
Stack based approach found an accepted trace after 175 steps with 0 reset with depth 176 and stack size 164 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-07 finished in 23446 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 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Graph (trivial) has 113 edges and 120 vertex of which 8 / 120 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 115 transition count 127
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 40 rules applied. Total rules applied 65 place count 91 transition count 111
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 74 place count 82 transition count 111
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 74 place count 82 transition count 101
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 94 place count 72 transition count 101
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 105 place count 61 transition count 89
Iterating global reduction 3 with 11 rules applied. Total rules applied 116 place count 61 transition count 89
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 116 place count 61 transition count 86
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 122 place count 58 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 55 transition count 72
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 55 transition count 72
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 166 place count 36 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 169 place count 36 transition count 50
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 171 place count 34 transition count 47
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 34 transition count 47
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 187 place count 27 transition count 65
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 199 place count 27 transition count 53
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 201 place count 25 transition count 49
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 25 transition count 49
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 213 place count 25 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 24 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 225 place count 24 transition count 42
Applied a total of 225 rules in 31 ms. Remains 24 /120 variables (removed 96) and now considering 42/156 (removed 114) transitions.
[2026-06-02 03:24:28] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6058835249627689724.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9733783877150510406.kers'
[2026-06-02 03:24:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6058835249627689724.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9733783877150510406.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 38 rows 22 cols 142 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-06-02 03:24:28] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9733783877150510406.kers
Total runtime 1 ms.
[2026-06-02 03:24:28] [INFO ] Implicit Places using invariants in 65 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/120 places, 42/156 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 56
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 21 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 20 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 20 transition count 46
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 20 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 20 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 19 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 18 transition count 30
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 35 place count 18 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 38 place count 17 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 39 place count 16 transition count 24
Applied a total of 39 rules in 15 ms. Remains 16 /23 variables (removed 7) and now considering 24/42 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2714272850907744603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5505348401790156889.kers'
[2026-06-02 03:24:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2714272850907744603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5505348401790156889.kers]
Normalized transition count is 23 out of 24 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 23 rows 12 cols 46 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-06-02 03:24:28] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5505348401790156889.kers
Total runtime 1 ms.
[2026-06-02 03:24:28] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-06-02 03:24:28] [INFO ] Invariant cache hit.
[2026-06-02 03:24:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 03:24:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/120 places, 24/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 16/120 places, 24/156 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 49 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-08 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0)) U (p1&&X(X(X(p2)))))||X(G(p3)))))'
Support contains 7 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 107 transition count 143
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 107 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 104 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 104 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 102 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 102 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 100 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 100 transition count 128
Applied a total of 40 rules in 7 ms. Remains 100 /120 variables (removed 20) and now considering 128/156 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1988783203646716320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14122085179014419369.kers'
[2026-06-02 03:24:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1988783203646716320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14122085179014419369.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 100 cols 343 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-06-02 03:24:29] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14122085179014419369.kers
Total runtime 2 ms.
[2026-06-02 03:24:29] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-06-02 03:24:29] [INFO ] Invariant cache hit.
[2026-06-02 03:24:29] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2026-06-02 03:24:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/228 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 110 constraints, problems are : Problem set: 0 solved, 127 unsolved in 9085 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/228 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 127/237 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/228 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 242 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20541 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 29635ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 29636ms
Starting structural reductions in LTL mode, iteration 1 : 100/120 places, 128/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29890 ms. Remains : 100/120 places, 128/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0)) U (p1&&X(X(X(p2)))))||X(G(p3)))))'
Stuttering acceptance computed with spot in 1646 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 133 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-11 finished in 31791 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 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Graph (trivial) has 114 edges and 120 vertex of which 9 / 120 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 114 transition count 126
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 39 rules applied. Total rules applied 63 place count 91 transition count 110
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 73 place count 82 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 81 transition count 109
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 74 place count 81 transition count 99
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 94 place count 71 transition count 99
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 105 place count 60 transition count 87
Iterating global reduction 4 with 11 rules applied. Total rules applied 116 place count 60 transition count 87
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 116 place count 60 transition count 84
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 57 transition count 84
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 125 place count 54 transition count 70
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 54 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 164 place count 36 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 166 place count 36 transition count 50
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 168 place count 34 transition count 47
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 34 transition count 47
Performed 7 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 184 place count 27 transition count 65
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 196 place count 27 transition count 53
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 198 place count 25 transition count 49
Iterating global reduction 6 with 2 rules applied. Total rules applied 200 place count 25 transition count 49
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 210 place count 25 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 212 place count 24 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 222 place count 24 transition count 42
Applied a total of 222 rules in 30 ms. Remains 24 /120 variables (removed 96) and now considering 42/156 (removed 114) transitions.
[2026-06-02 03:25:00] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9209147958035331348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11704106995395942982.kers'
[2026-06-02 03:25:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9209147958035331348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11704106995395942982.kers]
Normalized transition count is 38 out of 39 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 38 rows 22 cols 142 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-06-02 03:25:00] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11704106995395942982.kers
Total runtime 2 ms.
[2026-06-02 03:25:00] [INFO ] Implicit Places using invariants in 63 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/120 places, 42/156 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 56
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 21 transition count 48
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 20 transition count 46
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 20 transition count 46
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 20 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 20 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 19 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 18 transition count 30
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 35 place count 18 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 38 place count 17 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 39 place count 16 transition count 24
Applied a total of 39 rules in 14 ms. Remains 16 /23 variables (removed 7) and now considering 24/42 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15188409537887404573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11400644135394329974.kers'
[2026-06-02 03:25:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15188409537887404573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11400644135394329974.kers]
Normalized transition count is 23 out of 24 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 23 rows 12 cols 46 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-06-02 03:25:00] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11400644135394329974.kers
Total runtime 0 ms.
[2026-06-02 03:25:01] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-06-02 03:25:01] [INFO ] Invariant cache hit.
[2026-06-02 03:25:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-06-02 03:25:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/120 places, 24/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 16/120 places, 24/156 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 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-12 finished in 351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))||X(X(F(p2)))))'
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 106 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 106 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 103 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 103 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 101 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 101 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 99 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 126
Applied a total of 42 rules in 7 ms. Remains 99 /120 variables (removed 21) and now considering 126/156 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15859066692731723533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4353721415146253212.kers'
[2026-06-02 03:25:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15859066692731723533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4353721415146253212.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 99 cols 331 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-06-02 03:25:01] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4353721415146253212.kers
Total runtime 2 ms.
[2026-06-02 03:25:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-06-02 03:25:01] [INFO ] Invariant cache hit.
[2026-06-02 03:25:01] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-06-02 03:25:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/225 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 0/225 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 107 constraints, problems are : Problem set: 0 solved, 125 unsolved in 7298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/225 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 125/232 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/225 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 236 constraints, problems are : Problem set: 0 solved, 125 unsolved in 16666 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23976ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 23978ms
Starting structural reductions in LTL mode, iteration 1 : 99/120 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24226 ms. Remains : 99/120 places, 126/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))||X(X(F(p2)))))'
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-13
Product exploration explored 100000 steps with 2721 reset in 283 ms.
Stack based approach found an accepted trace after 70 steps with 1 reset with depth 35 and stack size 35 in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-13 finished in 24779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 106 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 106 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 103 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 103 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 101 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 101 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 99 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 99 transition count 126
Applied a total of 42 rules in 7 ms. Remains 99 /120 variables (removed 21) and now considering 126/156 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5300376953128388771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4432692140510827650.kers'
[2026-06-02 03:25:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5300376953128388771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4432692140510827650.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 99 cols 331 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-06-02 03:25:26] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4432692140510827650.kers
Total runtime 1 ms.
[2026-06-02 03:25:26] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-06-02 03:25:26] [INFO ] Invariant cache hit.
[2026-06-02 03:25:26] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 99/120 places, 126/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 99/120 places, 126/156 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-14 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0))||(p1&&F(G(p2)))))||F(p3)))'
Support contains 4 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 156/156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 107 transition count 142
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 107 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 104 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 104 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 102 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 102 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 100 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 100 transition count 127
Applied a total of 40 rules in 5 ms. Remains 100 /120 variables (removed 20) and now considering 127/156 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5738439295855516872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8029926943777108465.kers'
[2026-06-02 03:25:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5738439295855516872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8029926943777108465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 100 cols 333 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-06-02 03:25:26] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8029926943777108465.kers
Total runtime 2 ms.
[2026-06-02 03:25:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-06-02 03:25:26] [INFO ] Invariant cache hit.
[2026-06-02 03:25:26] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-06-02 03:25:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/227 variables, 100/108 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 0/227 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 108 constraints, problems are : Problem set: 0 solved, 126 unsolved in 7413 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/227 variables, 100/109 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 126/235 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (OVERLAPS) 0/227 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 241 constraints, problems are : Problem set: 0 solved, 126 unsolved in 28429 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 35852ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 35853ms
Starting structural reductions in LTL mode, iteration 1 : 100/120 places, 127/156 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36111 ms. Remains : 100/120 places, 127/156 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(p0))||(p1&&F(G(p2)))))||F(p3)))'
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLFireability-15
Product exploration explored 100000 steps with 28564 reset in 86 ms.
Product exploration explored 100000 steps with 28568 reset in 107 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/100 stabilizing places and 14/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 13 factoid took 125 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 332 steps (0 resets) in 9 ms. (33 steps per ms) remains 0/9 properties
Knowledge based reduction with 13 factoid took 422 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 866 ms.
Stuttering acceptance computed with spot in 351 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2))]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2026-06-02 03:26:04] [INFO ] Invariant cache hit.
[2026-06-02 03:26:04] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-06-02 03:26:04] [INFO ] Invariant cache hit.
[2026-06-02 03:26:04] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 100/100 places, 127/127 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/100 stabilizing places and 14/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 10461 steps (3 resets) in 64 ms. (160 steps per ms) remains 0/9 properties
Knowledge based reduction with 13 factoid took 424 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 976 ms.
Stuttering acceptance computed with spot in 377 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 28573 reset in 122 ms.
Product exploration explored 100000 steps with 28615 reset in 161 ms.
Spot run failed in 305 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/ltsmin11077377071416506246
[2026-06-02 03:26:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11077377071416506246
Running compilation step : cd /tmp/ltsmin11077377071416506246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 491 ms.
Running link step : cd /tmp/ltsmin11077377071416506246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11077377071416506246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2638761882345603259.hoa' '--buchi-type=spotba'
LTSmin run took 35 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLFireability-15 finished in 41141 ms.
All properties solved by simple procedures.
Total runtime 292938 ms.

BK_STOP 1780370767672

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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