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-178021499000052.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 ErlangenMainframeV1-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-178021499000052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.9K May 27 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 27 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 27 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 14K May 27 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 27 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:30 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 52K 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 ErlangenMainframeV1-PT-bP01C01-LTLFireability-00
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-01
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-02
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-03
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-04
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-05
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-06
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-07
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-08
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-09
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-10
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-11
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-12
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-13
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-14
FORMULA_NAME ErlangenMainframeV1-PT-bP01C01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1780260067980

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP01C01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-31 20:41:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 20:41:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:41:10] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2026-05-31 20:41:10] [INFO ] Transformed 173 places.
[2026-05-31 20:41:10] [INFO ] Transformed 219 transitions.
[2026-05-31 20:41:10] [INFO ] Found NUPN structural information;
[2026-05-31 20:41:10] [INFO ] Parsed PT model containing 173 places and 219 transitions and 608 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Support contains 44 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 219/219 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 144 transition count 190
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 144 transition count 190
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 132 transition count 178
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 132 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 130 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 130 transition count 176
Applied a total of 86 rules in 78 ms. Remains 130 /173 variables (removed 43) and now considering 176/219 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4091517604735142827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12422557583588739423.kers'
[2026-05-31 20:41:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4091517604735142827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12422557583588739423.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 130 cols 520 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-31 20:41:11] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12422557583588739423.kers
Total runtime 3 ms.
[2026-05-31 20:41:11] [INFO ] Implicit Places using invariants in 393 ms returned []
[2026-05-31 20:41:11] [INFO ] Invariant cache hit.
[2026-05-31 20:41:11] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-31 20:41:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/306 variables, 130/144 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 146 constraints, problems are : Problem set: 0 solved, 175 unsolved in 25438 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/306 variables, 130/147 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 175/322 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 327 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55627ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 55653ms
Starting structural reductions in LTL mode, iteration 1 : 130/173 places, 176/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56623 ms. Remains : 130/173 places, 176/219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2026-05-31 20:42:07] [INFO ] Invariant cache hit.
[2026-05-31 20:42:07] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-31 20:42:07] [INFO ] Invariant cache hit.
[2026-05-31 20:42:07] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 130/130 places, 176/176 transitions.
Support contains 44 out of 130 places after structural reductions.
[2026-05-31 20:42:08] [INFO ] Flatten gal took : 82 ms
[2026-05-31 20:42:08] [INFO ] Flatten gal took : 34 ms
[2026-05-31 20:42:08] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 43 out of 130 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1971 ms. (20 steps per ms) remains 6/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
[2026-05-31 20:42:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/105 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/128 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/130 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 176/306 variables, 130/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 139 constraints, problems are : Problem set: 1 solved, 2 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/79 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/128 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/130 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 176/306 variables, 130/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 2/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 141 constraints, problems are : Problem set: 1 solved, 2 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 685ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 2 properties in 31 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 13 stabilizing places and 13 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 7 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Graph (trivial) has 118 edges and 130 vertex of which 9 / 130 are part of one of the 4 SCC in 5 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 124 transition count 135
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 46 rules applied. Total rules applied 81 place count 90 transition count 123
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 85 transition count 123
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 86 place count 85 transition count 114
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 104 place count 76 transition count 114
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 112 place count 68 transition count 106
Iterating global reduction 3 with 8 rules applied. Total rules applied 120 place count 68 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 68 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 121 place count 68 transition count 102
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 65 transition count 102
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 129 place count 63 transition count 92
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 62 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 61 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 61 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 60 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 60 transition count 88
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 168 place count 44 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 42 transition count 62
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 42 transition count 62
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
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 184 place count 36 transition count 86
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 195 place count 36 transition count 75
Applied a total of 195 rules in 92 ms. Remains 36 /130 variables (removed 94) and now considering 75/176 (removed 101) transitions.
[2026-05-31 20:42:11] [INFO ] Flow matrix only has 71 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-10813039029240097497.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5847617732123324494.kers'
[2026-05-31 20:42:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10813039029240097497.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5847617732123324494.kers]
Normalized transition count is 70 out of 71 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 36 cols 298 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-31 20:42:11] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5847617732123324494.kers
Total runtime 2 ms.
[2026-05-31 20:42:11] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-31 20:42:11] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
[2026-05-31 20:42:11] [INFO ] Invariant cache hit.
[2026-05-31 20:42:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-31 20:42:11] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2026-05-31 20:42:11] [INFO ] Redundant transitions in 3 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-31 20:42:11] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
[2026-05-31 20:42:11] [INFO ] Invariant cache hit.
[2026-05-31 20:42:11] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 70/106 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 56 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4889 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 70/106 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 72/125 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 128 constraints, problems are : Problem set: 0 solved, 72 unsolved in 6065 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 11005ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 11007ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/130 places, 75/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11308 ms. Remains : 36/130 places, 75/176 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 3 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-00 finished in 11804 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 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Graph (trivial) has 128 edges and 130 vertex of which 11 / 130 are part of one of the 5 SCC in 2 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 123 transition count 129
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 94 place count 84 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 78 transition count 114
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 100 place count 78 transition count 106
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 116 place count 70 transition count 106
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 123 place count 63 transition count 90
Iterating global reduction 3 with 7 rules applied. Total rules applied 130 place count 63 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 130 place count 63 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 61 transition count 88
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 58 transition count 77
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 57 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 56 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 56 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 55 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 55 transition count 73
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 3 with 36 rules applied. Total rules applied 181 place count 37 transition count 55
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 184 place count 34 transition count 48
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 34 transition count 48
Performed 9 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 205 place count 25 transition count 60
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 217 place count 25 transition count 48
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 220 place count 22 transition count 42
Iterating global reduction 4 with 3 rules applied. Total rules applied 223 place count 22 transition count 42
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 231 place count 22 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 21 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 21 transition count 35
Applied a total of 235 rules in 64 ms. Remains 21 /130 variables (removed 109) and now considering 35/176 (removed 141) transitions.
[2026-05-31 20:42:22] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13664048733793170448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3858371730941200091.kers'
[2026-05-31 20:42:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13664048733793170448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3858371730941200091.kers]
Normalized transition count is 29 out of 30 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 20 cols 86 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-31 20:42:22] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3858371730941200091.kers
Total runtime 1 ms.
[2026-05-31 20:42:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-31 20:42:22] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2026-05-31 20:42:22] [INFO ] Invariant cache hit.
[2026-05-31 20:42:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-31 20:42:22] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-31 20:42:22] [INFO ] Redundant transitions in 0 ms returned []
Running 33 sub problems to find dead transitions.
[2026-05-31 20:42:22] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2026-05-31 20:42:22] [INFO ] Invariant cache hit.
[2026-05-31 20:42:22] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 29/50 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 1/51 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 43 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 21/21 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 29/50 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 33/75 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/51 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/51 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 77 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1808 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 21/21 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2988ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2989ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/130 places, 35/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3193 ms. Remains : 21/130 places, 35/176 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 54 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-01 finished in 3289 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(X(!p1)))||G(p2)))'
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 115 transition count 160
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 115 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 112 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 112 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 109 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 109 transition count 154
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 107 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 107 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 105 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 105 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 104 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 104 transition count 139
Applied a total of 52 rules in 26 ms. Remains 104 /130 variables (removed 26) and now considering 139/176 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7651863651475353735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5695690877372091918.kers'
[2026-05-31 20:42:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7651863651475353735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5695690877372091918.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 104 cols 392 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-31 20:42:25] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5695690877372091918.kers
Total runtime 1 ms.
[2026-05-31 20:42:26] [INFO ] Implicit Places using invariants in 102 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/130 places, 139/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 103/130 places, 139/176 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(X(!p1)))||G(p2)))'
Stuttering acceptance computed with spot in 752 ms :[(AND p1 (NOT p2)), (AND (NOT p0) p1), p1, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 434 ms.
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 26 ms. Proved property starting from automaton with 13 states, 28 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 40 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-02 finished in 1726 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||G(p1)))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Graph (trivial) has 121 edges and 130 vertex of which 11 / 130 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 123 transition count 136
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 42 rules applied. Total rules applied 75 place count 91 transition count 126
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 87 transition count 126
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 79 place count 87 transition count 118
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 95 place count 79 transition count 118
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 105 place count 69 transition count 107
Iterating global reduction 3 with 10 rules applied. Total rules applied 115 place count 69 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 120 place count 69 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 67 transition count 102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 122 place count 67 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 128 place count 64 transition count 99
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 63 transition count 98
Ensure Unique test removed 1 places
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 62 transition count 98
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 61 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 61 transition count 96
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 60 transition count 94
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 60 transition count 94
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 5 with 36 rules applied. Total rules applied 171 place count 42 transition count 76
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 174 place count 39 transition count 57
Iterating global reduction 5 with 3 rules applied. Total rules applied 177 place count 39 transition count 57
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 193 place count 31 transition count 88
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 203 place count 31 transition count 78
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 205 place count 29 transition count 74
Iterating global reduction 6 with 2 rules applied. Total rules applied 207 place count 29 transition count 74
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 216 place count 29 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 29 transition count 63
Applied a total of 218 rules in 65 ms. Remains 29 /130 variables (removed 101) and now considering 63/176 (removed 113) transitions.
[2026-05-31 20:42:27] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5654098237709019606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9703919457943513289.kers'
[2026-05-31 20:42:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5654098237709019606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9703919457943513289.kers]
Normalized transition count is 57 out of 58 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 57 rows 28 cols 227 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-31 20:42:27] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9703919457943513289.kers
Total runtime 1 ms.
[2026-05-31 20:42:27] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-31 20:42:27] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2026-05-31 20:42:27] [INFO ] Invariant cache hit.
[2026-05-31 20:42:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-31 20:42:27] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2026-05-31 20:42:27] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-31 20:42:27] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2026-05-31 20:42:27] [INFO ] Invariant cache hit.
[2026-05-31 20:42:27] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 57/86 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/87 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/87 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 50 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2605 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 57/86 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 60/109 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 110 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3749 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 29/29 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6382ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6383ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/130 places, 63/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6597 ms. Remains : 29/130 places, 63/176 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||G(p1)))))'
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 409 ms.
Product exploration explored 100000 steps with 0 reset in 213 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1917 resets) in 412 ms. (96 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (267 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
[2026-05-31 20:42:35] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2026-05-31 20:42:35] [INFO ] Invariant cache hit.
[2026-05-31 20:42:35] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 17/87 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/29 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 18 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 432 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-03 finished in 7812 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 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Graph (trivial) has 127 edges and 130 vertex of which 11 / 130 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 123 transition count 131
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 52 rules applied. Total rules applied 90 place count 86 transition count 116
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 97 place count 80 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 79 transition count 115
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 98 place count 79 transition count 107
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 114 place count 71 transition count 107
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 121 place count 64 transition count 91
Iterating global reduction 4 with 7 rules applied. Total rules applied 128 place count 64 transition count 91
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 128 place count 64 transition count 89
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 62 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 60 transition count 82
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 59 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 58 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 58 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 57 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 57 transition count 78
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 4 with 38 rules applied. Total rules applied 179 place count 38 transition count 59
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 182 place count 35 transition count 49
Iterating global reduction 4 with 3 rules applied. Total rules applied 185 place count 35 transition count 49
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 201 place count 27 transition count 56
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 210 place count 27 transition count 47
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 212 place count 25 transition count 43
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 25 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 218 place count 25 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 220 place count 24 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 222 place count 24 transition count 41
Applied a total of 222 rules in 57 ms. Remains 24 /130 variables (removed 106) and now considering 41/176 (removed 135) transitions.
[2026-05-31 20:42:35] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18060456845568698657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18388421589408102848.kers'
[2026-05-31 20:42:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18060456845568698657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18388421589408102848.kers]
Normalized transition count is 35 out of 36 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 35 rows 23 cols 116 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-31 20:42:35] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18388421589408102848.kers
Total runtime 0 ms.
[2026-05-31 20:42:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-31 20:42:35] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2026-05-31 20:42:35] [INFO ] Invariant cache hit.
[2026-05-31 20:42:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-31 20:42:35] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2026-05-31 20:42:35] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2026-05-31 20:42:35] [INFO ] Flow matrix only has 36 transitions (discarded 5 similar events)
[2026-05-31 20:42:35] [INFO ] Invariant cache hit.
[2026-05-31 20:42:35] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 35/59 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 1/60 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 47 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 24/24 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 35/59 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 84 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 24/24 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3204ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 3205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/130 places, 41/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3412 ms. Remains : 24/130 places, 41/176 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 51 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-04 finished in 3500 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((G((p0||X((X(p1) U (p0&&X(p1)))))) U (p2||X(F((p2&&X(F(p1)))))))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 113 transition count 150
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 113 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 109 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 109 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 105 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 105 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 102 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 102 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 99 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 97 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 97 transition count 124
Applied a total of 66 rules in 19 ms. Remains 97 /130 variables (removed 33) and now considering 124/176 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12894940319756236820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17159151092599814863.kers'
[2026-05-31 20:42:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12894940319756236820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17159151092599814863.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 97 cols 322 entries
Finished phase 1 with 88 SingleSign rule and 1 generalized
[2026-05-31 20:42:39] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17159151092599814863.kers
Total runtime 1 ms.
[2026-05-31 20:42:39] [INFO ] Implicit Places using invariants in 98 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/130 places, 124/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 96/130 places, 124/176 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((G((p0||X((X(p1) U (p0&&X(p1)))))) U (p2||X(F((p2&&X(F(p1)))))))))'
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND p0 (NOT p1)))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 143 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-05 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Graph (trivial) has 122 edges and 130 vertex of which 11 / 130 are part of one of the 5 SCC in 0 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 123 transition count 133
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 49 rules applied. Total rules applied 85 place count 88 transition count 119
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 92 place count 83 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 81 transition count 117
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 94 place count 81 transition count 108
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 112 place count 72 transition count 108
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 119 place count 65 transition count 92
Iterating global reduction 4 with 7 rules applied. Total rules applied 126 place count 65 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 126 place count 65 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 63 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 61 transition count 80
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 61 transition count 80
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 170 place count 43 transition count 62
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 40 transition count 55
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 40 transition count 55
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 192 place count 32 transition count 75
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 206 place count 32 transition count 61
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 209 place count 29 transition count 53
Iterating global reduction 5 with 3 rules applied. Total rules applied 212 place count 29 transition count 53
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 223 place count 29 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 29 transition count 41
Applied a total of 224 rules in 32 ms. Remains 29 /130 variables (removed 101) and now considering 41/176 (removed 135) transitions.
[2026-05-31 20:42:39] [INFO ] Flow matrix only has 37 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-4204723289744543477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14855669081644187081.kers'
[2026-05-31 20:42:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4204723289744543477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14855669081644187081.kers]
Normalized transition count is 36 out of 37 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 36 rows 29 cols 122 entries
Finished phase 1 with 19 SingleSign rule and 2 generalized
[2026-05-31 20:42:39] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14855669081644187081.kers
Total runtime 0 ms.
[2026-05-31 20:42:39] [INFO ] Implicit Places using invariants in 65 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/130 places, 41/176 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 26 transition count 39
Applied a total of 4 rules in 4 ms. Remains 26 /28 variables (removed 2) and now considering 39/41 (removed 2) transitions.
[2026-05-31 20:42:39] [INFO ] Flow matrix only has 35 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-10515260243456020492.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9726585369907370676.kers'
[2026-05-31 20:42:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10515260243456020492.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9726585369907370676.kers]
Normalized transition count is 34 out of 35 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 26 cols 106 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-31 20:42:39] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9726585369907370676.kers
Total runtime 0 ms.
[2026-05-31 20:42:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-31 20:42:39] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
[2026-05-31 20:42:39] [INFO ] Invariant cache hit.
[2026-05-31 20:42:39] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-31 20:42:39] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/130 places, 39/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 26/130 places, 39/176 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
Stuttering acceptance computed with spot in 123 ms :[p1, true, p1]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-07 finished in 411 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(p1))||G(p2)||p0)))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 113 transition count 150
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 113 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 109 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 109 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 105 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 105 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 102 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 102 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 99 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 97 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 97 transition count 124
Applied a total of 66 rules in 7 ms. Remains 97 /130 variables (removed 33) and now considering 124/176 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1772898614789849744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9183585996312897997.kers'
[2026-05-31 20:42:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1772898614789849744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9183585996312897997.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 97 cols 322 entries
Finished phase 1 with 88 SingleSign rule and 1 generalized
[2026-05-31 20:42:40] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9183585996312897997.kers
Total runtime 1 ms.
[2026-05-31 20:42:40] [INFO ] Implicit Places using invariants in 96 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/130 places, 124/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 96/130 places, 124/176 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(p1))||G(p2)||p0)))'
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-08
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-08 finished in 403 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)||X(X(F(p1)))))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 112 transition count 149
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 112 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 108 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 108 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 104 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 104 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 101 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 101 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 98 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 98 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 96 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 96 transition count 123
Applied a total of 68 rules in 5 ms. Remains 96 /130 variables (removed 34) and now considering 123/176 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14047048354613853192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12289080412844317267.kers'
[2026-05-31 20:42:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14047048354613853192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12289080412844317267.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 96 cols 320 entries
Finished phase 1 with 87 SingleSign rule and 1 generalized
[2026-05-31 20:42:40] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12289080412844317267.kers
Total runtime 1 ms.
[2026-05-31 20:42:40] [INFO ] Implicit Places using invariants in 54 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/130 places, 123/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 95/130 places, 123/176 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)||X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 168 ms.
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 17 ms. Proved property starting from automaton with 5 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-10 finished in 692 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||F(p1)||X((G(p2) U X(!p3)))))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 114 transition count 151
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 114 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 112 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 112 transition count 149
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 110 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 110 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 109 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 109 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 108 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 108 transition count 143
Applied a total of 44 rules in 6 ms. Remains 108 /130 variables (removed 22) and now considering 143/176 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10922472935595348954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10915706929568437010.kers'
[2026-05-31 20:42:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10922472935595348954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10915706929568437010.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 108 cols 400 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-05-31 20:42:41] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10915706929568437010.kers
Total runtime 1 ms.
[2026-05-31 20:42:41] [INFO ] Implicit Places using invariants in 79 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/130 places, 143/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 107/130 places, 143/176 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||F(p1)||X((G(p2) U X(!p3)))))))'
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p0) (NOT p2) p3)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-11
Product exploration explored 100000 steps with 22220 reset in 108 ms.
Product exploration explored 100000 steps with 22115 reset in 133 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge based reduction with 23 factoid took 770 ms. Reduced automaton from 9 states, 31 edges and 4 AP (stutter sensitive) to 9 states, 30 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16123560331375547459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16052716336080354740.kers'
[2026-05-31 20:42:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16123560331375547459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16052716336080354740.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 107 cols 397 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-31 20:42:43] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16052716336080354740.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf13 is UNSAT
After SMT solving in domain Real declared 55/250 variables, and 2 constraints, problems are : Problem set: 3 solved, 0 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/107 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 26 factoid took 760 ms. Reduced automaton from 9 states, 30 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3)]
Knowledge-based reduction took 2115 ms.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3)]
Support contains 3 out of 107 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2026-05-31 20:42:44] [INFO ] Invariant cache hit.
[2026-05-31 20:42:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-31 20:42:44] [INFO ] Invariant cache hit.
[2026-05-31 20:42:44] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2026-05-31 20:42:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/250 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 116 constraints, problems are : Problem set: 0 solved, 142 unsolved in 9682 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/250 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 142/258 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 259 constraints, problems are : Problem set: 0 solved, 142 unsolved in 11370 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21076ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 21078ms
Finished structural reductions in LTL mode , in 1 iterations and 21372 ms. Remains : 107/107 places, 143/143 transitions.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 17356 steps (5 resets) in 44 ms. (385 steps per ms) remains 0/6 properties
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3)]
Knowledge-based reduction took 602 ms.
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3), (AND (NOT p1) (NOT p0) p3)]
Product exploration explored 100000 steps with 16633 reset in 143 ms.
Product exploration explored 100000 steps with 16668 reset in 166 ms.
Spot run failed in 138 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/ltsmin9093458498749773318
[2026-05-31 20:43:07] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9093458498749773318
Running compilation step : cd /tmp/ltsmin9093458498749773318;'/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 778 ms.
Running link step : cd /tmp/ltsmin9093458498749773318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin9093458498749773318;'/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/stateBased11452369866583259747.hoa' '--buchi-type=spotba'
LTSmin run took 347 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-11 finished in 27447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p1)))) U ((p2&&X(X((p0||X(p1)))))||X(X(G((p0||X(p1))))))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 114 transition count 151
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 114 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 110 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 110 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 106 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 106 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 103 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 103 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 101 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 99 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 99 transition count 127
Applied a total of 62 rules in 8 ms. Remains 99 /130 variables (removed 31) and now considering 127/176 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12186828577041011330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2744308115378230564.kers'
[2026-05-31 20:43:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12186828577041011330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2744308115378230564.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 99 cols 328 entries
Finished phase 1 with 90 SingleSign rule and 1 generalized
[2026-05-31 20:43:08] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2744308115378230564.kers
Total runtime 2 ms.
[2026-05-31 20:43:08] [INFO ] Implicit Places using invariants in 102 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/130 places, 127/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 98/130 places, 127/176 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(p1)))) U (X(X(G((p0||X(p1)))))||(p2&&X(X((p0||X(p1))))))))'
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 17 ms. Proved property starting from automaton with 6 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-12 finished in 715 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(p1))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Graph (trivial) has 124 edges and 130 vertex of which 11 / 130 are part of one of the 5 SCC in 0 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 123 transition count 131
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 51 rules applied. Total rules applied 89 place count 86 transition count 117
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 80 transition count 115
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 78 transition count 114
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 100 place count 78 transition count 108
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 112 place count 72 transition count 108
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 119 place count 65 transition count 92
Iterating global reduction 4 with 7 rules applied. Total rules applied 126 place count 65 transition count 92
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 126 place count 65 transition count 89
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 132 place count 62 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 60 transition count 82
Ensure Unique test removed 1 places
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 59 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 58 transition count 80
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 58 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 57 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 57 transition count 78
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 4 with 38 rules applied. Total rules applied 179 place count 38 transition count 59
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 182 place count 35 transition count 49
Iterating global reduction 4 with 3 rules applied. Total rules applied 185 place count 35 transition count 49
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
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 199 place count 28 transition count 56
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 28 transition count 50
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 207 place count 26 transition count 46
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 26 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 26 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 25 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 217 place count 25 transition count 45
Applied a total of 217 rules in 28 ms. Remains 25 /130 variables (removed 105) and now considering 45/176 (removed 131) transitions.
[2026-05-31 20:43:09] [INFO ] Flow matrix only has 41 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-17146488403110268310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7662632441648737332.kers'
[2026-05-31 20:43:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17146488403110268310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7662632441648737332.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 40 rows 24 cols 140 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-31 20:43:09] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7662632441648737332.kers
Total runtime 2 ms.
[2026-05-31 20:43:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-31 20:43:09] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2026-05-31 20:43:09] [INFO ] Invariant cache hit.
[2026-05-31 20:43:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-31 20:43:09] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2026-05-31 20:43:09] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2026-05-31 20:43:09] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2026-05-31 20:43:09] [INFO ] Invariant cache hit.
[2026-05-31 20:43:09] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 47 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 39/85 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 86 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3232ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/130 places, 45/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3432 ms. Remains : 25/130 places, 45/176 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(p1))))'
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-13 finished in 3576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X((p1||F(G(p2))))))'
Support contains 7 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 112 transition count 149
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 112 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 108 transition count 145
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 108 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 104 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 104 transition count 141
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 103 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 103 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 102 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 102 transition count 137
Applied a total of 56 rules in 5 ms. Remains 102 /130 variables (removed 28) and now considering 137/176 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16146637472778951004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17101423494368235258.kers'
[2026-05-31 20:43:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16146637472778951004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17101423494368235258.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 102 cols 388 entries
Finished phase 1 with 93 SingleSign rule and 1 generalized
[2026-05-31 20:43:12] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17101423494368235258.kers
Total runtime 1 ms.
[2026-05-31 20:43:13] [INFO ] Implicit Places using invariants in 61 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/130 places, 137/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 101/130 places, 137/176 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X((p1||F(G(p2))))))'
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 145 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-14 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0)) U (G(p1) U p2))))))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 176/176 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 114 transition count 151
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 114 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 110 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 110 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 106 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 106 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 104 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 104 transition count 133
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 102 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 102 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 100 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 100 transition count 129
Applied a total of 60 rules in 5 ms. Remains 100 /130 variables (removed 30) and now considering 129/176 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13090152906675845652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4705680765410635056.kers'
[2026-05-31 20:43:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13090152906675845652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4705680765410635056.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 100 cols 340 entries
Finished phase 1 with 91 SingleSign rule and 1 generalized
[2026-05-31 20:43:13] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4705680765410635056.kers
Total runtime 1 ms.
[2026-05-31 20:43:13] [INFO ] Implicit Places using invariants in 74 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/130 places, 129/176 transitions.
Applied a total of 0 rules in 0 ms. Remains 99 /99 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 99/130 places, 129/176 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0)) U (G(p1) U p2))))))'
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV1-PT-bP01C01-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA ErlangenMainframeV1-PT-bP01C01-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV1-PT-bP01C01-LTLFireability-15 finished in 529 ms.
All properties solved by simple procedures.
Total runtime 123615 ms.

BK_STOP 1780260194010

--------------------
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="ErlangenMainframeV1-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 ErlangenMainframeV1-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-178021499000052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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