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.r050-smll-177946901000004.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 Champagne-PT-H04T0R, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 8.3K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 61K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779479947250

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H04T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 19:59:09] [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-22 19:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:59:09] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2026-05-22 19:59:09] [INFO ] Transformed 219 places.
[2026-05-22 19:59:09] [INFO ] Transformed 274 transitions.
[2026-05-22 19:59:09] [INFO ] Found NUPN structural information;
[2026-05-22 19:59:09] [INFO ] Parsed PT model containing 219 places and 274 transitions and 666 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H04T0R-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T0R-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T0R-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 274/274 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 172 transition count 227
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 172 transition count 227
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 119 place count 147 transition count 202
Iterating global reduction 0 with 25 rules applied. Total rules applied 144 place count 147 transition count 202
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 155 place count 136 transition count 188
Iterating global reduction 0 with 11 rules applied. Total rules applied 166 place count 136 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 168 place count 136 transition count 186
Applied a total of 168 rules in 107 ms. Remains 136 /219 variables (removed 83) and now considering 186/274 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1723181002194468292.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15060564453334974447.kers'
[2026-05-22 19:59:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1723181002194468292.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15060564453334974447.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 136 cols 482 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-22 19:59:10] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15060564453334974447.kers
Total runtime 3 ms.
[2026-05-22 19:59:10] [INFO ] Implicit Places using invariants in 427 ms returned []
[2026-05-22 19:59:10] [INFO ] Invariant cache hit.
[2026-05-22 19:59:11] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-22 19:59:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/322 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 156 constraints, problems are : Problem set: 0 solved, 185 unsolved in 17050 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/322 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 185/341 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 349 constraints, problems are : Problem set: 0 solved, 185 unsolved in 28197 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45410ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 45440ms
Starting structural reductions in LTL mode, iteration 1 : 136/219 places, 186/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46468 ms. Remains : 136/219 places, 186/274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Applied a total of 0 rules in 6 ms. Remains 136 /136 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-22 19:59:56] [INFO ] Invariant cache hit.
[2026-05-22 19:59:56] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-22 19:59:56] [INFO ] Invariant cache hit.
[2026-05-22 19:59:56] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 136/136 places, 186/186 transitions.
Support contains 37 out of 136 places after structural reductions.
[2026-05-22 19:59:57] [INFO ] Flatten gal took : 81 ms
[2026-05-22 19:59:57] [INFO ] Flatten gal took : 32 ms
[2026-05-22 19:59:57] [INFO ] Input system was already deterministic with 186 transitions.
RANDOM walk for 28464 steps (213 resets) in 1198 ms. (23 steps per ms) remains 0/33 properties
FORMULA Champagne-PT-H04T0R-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 20 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Graph (trivial) has 130 edges and 136 vertex of which 27 / 136 are part of one of the 5 SCC in 5 ms
Free SCC test removed 22 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 113 transition count 138
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 37 rules applied. Total rules applied 59 place count 92 transition count 122
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 67 place count 85 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 84 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 83 transition count 119
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 71 place count 83 transition count 114
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 81 place count 78 transition count 114
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 91 place count 68 transition count 96
Iterating global reduction 5 with 10 rules applied. Total rules applied 101 place count 68 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 104 place count 68 transition count 93
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 104 place count 68 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 108 place count 66 transition count 91
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 110 place count 64 transition count 86
Iterating global reduction 6 with 2 rules applied. Total rules applied 112 place count 64 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 114 place count 64 transition count 84
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 172 place count 35 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 174 place count 33 transition count 53
Applied a total of 174 rules in 80 ms. Remains 33 /136 variables (removed 103) and now considering 53/186 (removed 133) transitions.
[2026-05-22 19:59:58] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5933079170852845102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2299233712090568594.kers'
[2026-05-22 19:59:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5933079170852845102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2299233712090568594.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 32 rows 29 cols 76 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 19:59:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2299233712090568594.kers
Total runtime 3 ms.
[2026-05-22 19:59:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 19:59:58] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2026-05-22 19:59:58] [INFO ] Invariant cache hit.
[2026-05-22 19:59:58] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2026-05-22 19:59:58] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
[2026-05-22 19:59:58] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2026-05-22 19:59:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 28 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 28/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 72 constraints, problems are : Problem set: 0 solved, 28 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1765ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1766ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/136 places, 53/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2011 ms. Remains : 33/136 places, 53/186 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 450 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-00 finished in 2603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p1)&&(X(F(p2)) U G(p3)))||p0)))'
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 119 transition count 164
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 119 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 119 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 111 transition count 149
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 111 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 111 transition count 146
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 107 transition count 141
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 107 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 107 transition count 140
Applied a total of 66 rules in 24 ms. Remains 107 /136 variables (removed 29) and now considering 140/186 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11730729280631366538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-870300922171948829.kers'
[2026-05-22 20:00:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11730729280631366538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-870300922171948829.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 107 cols 362 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-22 20:00:01] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-870300922171948829.kers
Total runtime 2 ms.
[2026-05-22 20:00:01] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-22 20:00:01] [INFO ] Invariant cache hit.
[2026-05-22 20:00:01] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2026-05-22 20:00:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/247 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 0/247 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 118 constraints, problems are : Problem set: 0 solved, 139 unsolved in 8407 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/247 variables, 107/118 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 139/257 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (OVERLAPS) 0/247 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 264 constraints, problems are : Problem set: 0 solved, 139 unsolved in 23093 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31541ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 31546ms
Starting structural reductions in LTL mode, iteration 1 : 107/136 places, 140/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31852 ms. Remains : 107/136 places, 140/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p1)&&(X(F(p2)) U G(p3)))||p0)))'
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p2), (NOT p3), true]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-01
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-01 finished in 32166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||X(F(p2)))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 159
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 117 transition count 154
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 110 transition count 146
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 110 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 110 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 106 transition count 139
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 106 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 106 transition count 138
Applied a total of 68 rules in 33 ms. Remains 106 /136 variables (removed 30) and now considering 138/186 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16705149700632011718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13021625692587636012.kers'
[2026-05-22 20:00:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16705149700632011718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13021625692587636012.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 106 cols 356 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-22 20:00:33] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13021625692587636012.kers
Total runtime 2 ms.
[2026-05-22 20:00:33] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-22 20:00:33] [INFO ] Invariant cache hit.
[2026-05-22 20:00:33] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2026-05-22 20:00:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/244 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 0/244 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 117 constraints, problems are : Problem set: 0 solved, 137 unsolved in 8304 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/244 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 137/254 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/244 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 257 constraints, problems are : Problem set: 0 solved, 137 unsolved in 17779 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26108ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 26110ms
Starting structural reductions in LTL mode, iteration 1 : 106/136 places, 138/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26473 ms. Remains : 106/136 places, 138/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||X(F(p2)))))'
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-02
Stuttering criterion allowed to conclude after 368 steps with 1 reset in 8 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-02 finished in 26732 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(X(G(p0))))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 118 transition count 159
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 110 transition count 148
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 110 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 110 transition count 145
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 106 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 106 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 106 transition count 139
Applied a total of 68 rules in 6 ms. Remains 106 /136 variables (removed 30) and now considering 139/186 (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-10674438197505064840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13123809520370806238.kers'
[2026-05-22 20:00:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10674438197505064840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13123809520370806238.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 106 cols 360 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-22 20:00:59] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13123809520370806238.kers
Total runtime 3 ms.
[2026-05-22 20:01:00] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 20:01:00] [INFO ] Invariant cache hit.
[2026-05-22 20:01:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-22 20:01:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 139/245 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 0/245 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 117 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8049 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 139/245 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 138/255 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 260 constraints, problems are : Problem set: 0 solved, 138 unsolved in 17623 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25695ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 25697ms
Starting structural reductions in LTL mode, iteration 1 : 106/136 places, 139/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25927 ms. Remains : 106/136 places, 139/186 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(X(G(p0))))))'
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-04
Entered a terminal (fully accepting) state of product in 634 steps with 5 reset in 27 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-04 finished in 26287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0) U G((p1||X(F((p1&&F(p2)))))))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 119 transition count 161
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 119 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 119 transition count 156
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 113 transition count 147
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 113 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 113 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 110 transition count 140
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 110 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 110 transition count 139
Applied a total of 61 rules in 8 ms. Remains 110 /136 variables (removed 26) and now considering 139/186 (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-11976409410972765526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10589292724927282690.kers'
[2026-05-22 20:01:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11976409410972765526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10589292724927282690.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 110 cols 352 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-22 20:01:26] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10589292724927282690.kers
Total runtime 2 ms.
[2026-05-22 20:01:26] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-22 20:01:26] [INFO ] Invariant cache hit.
[2026-05-22 20:01:26] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-22 20:01:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 139/249 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 121 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8372 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 139/249 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 138/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 263 constraints, problems are : Problem set: 0 solved, 138 unsolved in 15567 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23961ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 23962ms
Starting structural reductions in LTL mode, iteration 1 : 110/136 places, 139/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24254 ms. Remains : 110/136 places, 139/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0) U G((p1||X(F((p1&&F(p2)))))))))))'
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-05
Stuttering criterion allowed to conclude after 977 steps with 124 reset in 7 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-05 finished in 24782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((p1&&(!p2 U (p3||G(!p2)))) U (G((p1&&(!p2 U (p3||G(!p2)))))||(p1&&(!p2 U (p3||G(!p2)))&&(X(p4) U ((p4&&X(p4))||X(G(p4))))))))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 120 transition count 162
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 120 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 120 transition count 158
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 113 transition count 148
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 113 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 113 transition count 146
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 109 transition count 141
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 109 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 109 transition count 140
Applied a total of 61 rules in 5 ms. Remains 109 /136 variables (removed 27) and now considering 140/186 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12020355123795720130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4131205086761356591.kers'
[2026-05-22 20:01:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12020355123795720130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4131205086761356591.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 109 cols 354 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-22 20:01:51] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4131205086761356591.kers
Total runtime 1 ms.
[2026-05-22 20:01:51] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-22 20:01:51] [INFO ] Invariant cache hit.
[2026-05-22 20:01:51] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2026-05-22 20:01:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/249 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 120 constraints, problems are : Problem set: 0 solved, 139 unsolved in 8465 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/249 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 139/259 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 263 constraints, problems are : Problem set: 0 solved, 139 unsolved in 17554 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26038ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 26039ms
Starting structural reductions in LTL mode, iteration 1 : 109/136 places, 140/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26247 ms. Remains : 109/136 places, 140/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((p1&&(!p2 U (p3||G(!p2)))) U (G((p1&&(!p2 U (p3||G(!p2)))))||(p1&&(!p2 U (p3||G(!p2)))&&(X(p4) U ((p4&&X(p4))||X(G(p4))))))))))'
Stuttering acceptance computed with spot in 825 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (AND (NOT p3) p2), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND p2 (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (AND (NOT p0) (NOT p3) p2), (NOT p4), (NOT p4), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4))]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 518 ms.
Product exploration explored 100000 steps with 33333 reset in 482 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 40 factoid took 21 ms. Proved property starting from automaton with 14 states, 48 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T0R-LTLFireability-06 finished in 28234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Graph (trivial) has 126 edges and 136 vertex of which 27 / 136 are part of one of the 5 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 113 transition count 138
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 38 rules applied. Total rules applied 60 place count 92 transition count 121
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 71 place count 84 transition count 118
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 75 place count 81 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 75 place count 81 transition count 114
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 81 place count 78 transition count 114
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 90 place count 69 transition count 97
Iterating global reduction 4 with 9 rules applied. Total rules applied 99 place count 69 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 102 place count 69 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 102 place count 69 transition count 93
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 104 place count 68 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 67 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 67 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 67 transition count 90
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 167 place count 37 transition count 60
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 36 transition count 58
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 36 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 36 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 172 place count 34 transition count 55
Applied a total of 172 rules in 25 ms. Remains 34 /136 variables (removed 102) and now considering 55/186 (removed 131) transitions.
[2026-05-22 20:02:19] [INFO ] Flow matrix only has 37 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11462996724163887370.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-60665605941411932.kers'
[2026-05-22 20:02:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11462996724163887370.kers, --Pflows, --basisKERS=/tmp/petrispot-output-60665605941411932.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 36 rows 30 cols 90 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-22 20:02:19] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-60665605941411932.kers
Total runtime 1 ms.
[2026-05-22 20:02:19] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-22 20:02:19] [INFO ] Flow matrix only has 37 transitions (discarded 18 similar events)
[2026-05-22 20:02:19] [INFO ] Invariant cache hit.
[2026-05-22 20:02:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2026-05-22 20:02:19] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-22 20:02:19] [INFO ] Flow matrix only has 37 transitions (discarded 18 similar events)
[2026-05-22 20:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 36/70 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/70 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/71 variables, and 45 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 36/70 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/70 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/71 variables, and 77 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2208ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2209ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 55/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2467 ms. Remains : 34/136 places, 55/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-07 finished in 2639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U p1)||X(((p2 U p3) U p4))))))'
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 121 transition count 166
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 121 transition count 166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 121 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 115 transition count 154
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 115 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 115 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 112 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 112 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 112 transition count 147
Applied a total of 55 rules in 6 ms. Remains 112 /136 variables (removed 24) and now considering 147/186 (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-311912684051394285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4714409437361498549.kers'
[2026-05-22 20:02:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-311912684051394285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4714409437361498549.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 112 cols 380 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-22 20:02:21] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4714409437361498549.kers
Total runtime 1 ms.
[2026-05-22 20:02:22] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-22 20:02:22] [INFO ] Invariant cache hit.
[2026-05-22 20:02:22] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-22 20:02:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/259 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 129 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9546 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/259 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 146/275 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 278 constraints, problems are : Problem set: 0 solved, 146 unsolved in 17075 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26644ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 26645ms
Starting structural reductions in LTL mode, iteration 1 : 112/136 places, 147/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26952 ms. Remains : 112/136 places, 147/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0) U p1)||X(((p2 U p3) U p4))))))'
Stuttering acceptance computed with spot in 533 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p4)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-08
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-08 finished in 27547 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 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Graph (trivial) has 131 edges and 136 vertex of which 27 / 136 are part of one of the 5 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 113 transition count 137
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 39 rules applied. Total rules applied 62 place count 91 transition count 120
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 71 place count 83 transition count 119
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 82 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 81 transition count 117
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 75 place count 81 transition count 113
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 83 place count 77 transition count 113
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 93 place count 67 transition count 95
Iterating global reduction 5 with 10 rules applied. Total rules applied 103 place count 67 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 106 place count 67 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 106 place count 67 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 110 place count 65 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 111 place count 64 transition count 87
Iterating global reduction 6 with 1 rules applied. Total rules applied 112 place count 64 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 113 place count 64 transition count 86
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 169 place count 36 transition count 58
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 171 place count 34 transition count 54
Iterating global reduction 7 with 2 rules applied. Total rules applied 173 place count 34 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 175 place count 34 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 177 place count 33 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 181 place count 33 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 183 place count 31 transition count 53
Applied a total of 183 rules in 66 ms. Remains 31 /136 variables (removed 105) and now considering 53/186 (removed 133) transitions.
[2026-05-22 20:02:49] [INFO ] Flow matrix only has 34 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16215792449468146451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15564493786015117252.kers'
[2026-05-22 20:02:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16215792449468146451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15564493786015117252.kers]
Normalized transition count is 33 out of 34 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 33 rows 28 cols 86 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-22 20:02:49] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15564493786015117252.kers
Total runtime 1 ms.
[2026-05-22 20:02:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 20:02:49] [INFO ] Flow matrix only has 34 transitions (discarded 19 similar events)
[2026-05-22 20:02:49] [INFO ] Invariant cache hit.
[2026-05-22 20:02:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-05-22 20:02:49] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2026-05-22 20:02:49] [INFO ] Flow matrix only has 34 transitions (discarded 19 similar events)
[2026-05-22 20:02:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 33/64 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/64 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/65 variables, and 42 constraints, problems are : Problem set: 0 solved, 26 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 33/64 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/65 variables, and 68 constraints, problems are : Problem set: 0 solved, 26 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1632ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 1632ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/136 places, 53/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1859 ms. Remains : 31/136 places, 53/186 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 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-11
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-11 finished in 2014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(p1)) U X((p2||(!p0 U p3)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 160
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 160
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 118 transition count 155
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 110 transition count 144
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 110 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 110 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 109 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 109 transition count 140
Applied a total of 62 rules in 9 ms. Remains 109 /136 variables (removed 27) and now considering 140/186 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2729199259564553823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5426476389345556272.kers'
[2026-05-22 20:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2729199259564553823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5426476389345556272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 109 cols 358 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-22 20:02:51] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5426476389345556272.kers
Total runtime 1 ms.
[2026-05-22 20:02:51] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-22 20:02:51] [INFO ] Invariant cache hit.
[2026-05-22 20:02:51] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2026-05-22 20:02:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/249 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 120 constraints, problems are : Problem set: 0 solved, 139 unsolved in 8694 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/249 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 139/259 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 139 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 38725ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 38727ms
Starting structural reductions in LTL mode, iteration 1 : 109/136 places, 140/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39023 ms. Remains : 109/136 places, 140/186 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)) U X((p2||(!p0 U p3)))))'
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-12
Product exploration explored 100000 steps with 5488 reset in 382 ms.
Stack based approach found an accepted trace after 899 steps with 53 reset with depth 32 and stack size 32 in 5 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-12 finished in 39885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Graph (trivial) has 123 edges and 136 vertex of which 27 / 136 are part of one of the 5 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 113 transition count 137
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 39 rules applied. Total rules applied 62 place count 91 transition count 120
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 71 place count 83 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 82 transition count 119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 72 place count 82 transition count 116
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 78 place count 79 transition count 116
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 88 place count 69 transition count 100
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 69 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 69 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 100 place count 69 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 104 place count 67 transition count 96
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 106 place count 65 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 108 place count 65 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 65 transition count 89
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 166 place count 37 transition count 61
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 36 transition count 59
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 36 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 169 place count 36 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 171 place count 34 transition count 56
Applied a total of 171 rules in 44 ms. Remains 34 /136 variables (removed 102) and now considering 56/186 (removed 130) transitions.
[2026-05-22 20:03:31] [INFO ] Flow matrix only has 40 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-739947705462702898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17525711314901307056.kers'
[2026-05-22 20:03:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-739947705462702898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17525711314901307056.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 2 ms.
// Phase 1: matrix 39 rows 30 cols 100 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-22 20:03:31] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17525711314901307056.kers
Total runtime 5 ms.
[2026-05-22 20:03:31] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-22 20:03:31] [INFO ] Flow matrix only has 40 transitions (discarded 16 similar events)
[2026-05-22 20:03:31] [INFO ] Invariant cache hit.
[2026-05-22 20:03:31] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2026-05-22 20:03:31] [INFO ] Redundant transitions in 2 ms returned []
Running 34 sub problems to find dead transitions.
[2026-05-22 20:03:31] [INFO ] Flow matrix only has 40 transitions (discarded 16 similar events)
[2026-05-22 20:03:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 3/34 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 39/73 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/74 variables, and 45 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 3/34 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 39/73 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/74 variables, and 79 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2229ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 2230ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/136 places, 56/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2453 ms. Remains : 34/136 places, 56/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-14 finished in 2653 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 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 186/186 transitions.
Graph (trivial) has 129 edges and 136 vertex of which 33 / 136 are part of one of the 6 SCC in 0 ms
Free SCC test removed 27 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 108 transition count 133
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 37 rules applied. Total rules applied 59 place count 87 transition count 117
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 80 transition count 117
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 80 transition count 114
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 77 transition count 114
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 82 place count 67 transition count 98
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 67 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 67 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 94 place count 67 transition count 94
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 98 place count 65 transition count 94
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 64 transition count 91
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 64 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 64 transition count 90
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 157 place count 36 transition count 62
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 159 place count 34 transition count 58
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 34 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 163 place count 34 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 165 place count 32 transition count 54
Applied a total of 165 rules in 30 ms. Remains 32 /136 variables (removed 104) and now considering 54/186 (removed 132) transitions.
[2026-05-22 20:03:34] [INFO ] Flow matrix only has 35 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15721589775072954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11041197278365028638.kers'
[2026-05-22 20:03:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15721589775072954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11041197278365028638.kers]
Normalized transition count is 34 out of 35 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 34 rows 29 cols 88 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-22 20:03:34] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11041197278365028638.kers
Total runtime 0 ms.
[2026-05-22 20:03:34] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-22 20:03:34] [INFO ] Flow matrix only has 35 transitions (discarded 19 similar events)
[2026-05-22 20:03:34] [INFO ] Invariant cache hit.
[2026-05-22 20:03:34] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2026-05-22 20:03:34] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2026-05-22 20:03:34] [INFO ] Flow matrix only has 35 transitions (discarded 19 similar events)
[2026-05-22 20:03:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 3/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 34/66 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/67 variables, and 43 constraints, problems are : Problem set: 0 solved, 29 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 3/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 34/66 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/66 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/67 variables, and 72 constraints, problems are : Problem set: 0 solved, 29 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1942ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 1942ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/136 places, 54/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2138 ms. Remains : 32/136 places, 54/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H04T0R-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T0R-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T0R-LTLFireability-15 finished in 2226 ms.
All properties solved by simple procedures.
Total runtime 266698 ms.

BK_STOP 1779480216265

--------------------
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="Champagne-PT-H04T0R"
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 Champagne-PT-H04T0R, 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 r050-smll-177946901000004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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