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.r098-tall-177955695400244.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 DiscoveryGPU-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695400244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.0K Mar 6 16:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 16:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 46K 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 DiscoveryGPU-PT-06b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779594693757

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 03:51:34] [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-24 03:51:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:51:35] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2026-05-24 03:51:35] [INFO ] Transformed 184 places.
[2026-05-24 03:51:35] [INFO ] Transformed 194 transitions.
[2026-05-24 03:51:35] [INFO ] Found NUPN structural information;
[2026-05-24 03:51:35] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 38 place count 146 transition count 168
Iterating global reduction 1 with 26 rules applied. Total rules applied 64 place count 146 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 142 transition count 164
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 142 transition count 164
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 139 transition count 161
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 139 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 136 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 136 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 135 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 135 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 134 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 134 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 133 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 133 transition count 154
Applied a total of 90 rules in 69 ms. Remains 133 /184 variables (removed 51) and now considering 154/194 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6290258645668780115.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5785364586086739920.kers'
[2026-05-24 03:51:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6290258645668780115.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5785364586086739920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 133 cols 407 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-24 03:51:35] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5785364586086739920.kers
Total runtime 2 ms.
[2026-05-24 03:51:35] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-24 03:51:35] [INFO ] Invariant cache hit.
[2026-05-24 03:51:35] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2026-05-24 03:51:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/287 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 142 constraints, problems are : Problem set: 0 solved, 153 unsolved in 7300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/287 variables, 133/142 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 153/295 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 295 constraints, problems are : Problem set: 0 solved, 153 unsolved in 10358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17731ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 17746ms
Starting structural reductions in LTL mode, iteration 1 : 133/184 places, 154/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18196 ms. Remains : 133/184 places, 154/194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2026-05-24 03:51:53] [INFO ] Invariant cache hit.
[2026-05-24 03:51:53] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 03:51:53] [INFO ] Invariant cache hit.
[2026-05-24 03:51:53] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 133/133 places, 154/154 transitions.
Support contains 34 out of 133 places after structural reductions.
[2026-05-24 03:51:53] [INFO ] Flatten gal took : 31 ms
[2026-05-24 03:51:53] [INFO ] Flatten gal took : 14 ms
[2026-05-24 03:51:53] [INFO ] Input system was already deterministic with 154 transitions.
Support contains 33 out of 133 places (down from 34) after GAL structural reductions.
RANDOM walk for 2393 steps (9 resets) in 167 ms. (14 steps per ms) remains 0/30 properties
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 256 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1) U X((p1||X(p1)))))'
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 141
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 141
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 116 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 116 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 112 transition count 131
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 112 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 111 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 110 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 109 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 109 transition count 127
Applied a total of 48 rules in 16 ms. Remains 109 /133 variables (removed 24) and now considering 127/154 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9448770209469554702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13487065779681600994.kers'
[2026-05-24 03:51:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9448770209469554702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13487065779681600994.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 109 cols 340 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-24 03:51:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13487065779681600994.kers
Total runtime 0 ms.
[2026-05-24 03:51:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 03:51:54] [INFO ] Invariant cache hit.
[2026-05-24 03:51:54] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 03:51:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/236 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 117 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/236 variables, 109/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 126/243 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 243 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4784 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9499ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 9501ms
Starting structural reductions in LTL mode, iteration 1 : 109/133 places, 127/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9667 ms. Remains : 109/133 places, 127/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1) U X((p1||X(p1)))))'
Stuttering acceptance computed with spot in 351 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-01
Stuttering criterion allowed to conclude after 3000 steps with 45 reset in 21 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-01 finished in 10142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(X(F(p1)))))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 141
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 141
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 116 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 116 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 112 transition count 131
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 110 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 110 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 106 transition count 123
Applied a total of 54 rules in 23 ms. Remains 106 /133 variables (removed 27) and now considering 123/154 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2448681541468072014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14549656107498956145.kers'
[2026-05-24 03:52:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2448681541468072014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14549656107498956145.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 106 cols 330 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-24 03:52:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14549656107498956145.kers
Total runtime 0 ms.
[2026-05-24 03:52:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 03:52:04] [INFO ] Invariant cache hit.
[2026-05-24 03:52:04] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 03:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/229 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 114 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4487 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/229 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 122/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 236 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5064 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9577ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9578ms
Starting structural reductions in LTL mode, iteration 1 : 106/133 places, 123/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9736 ms. Remains : 106/133 places, 123/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 28569 reset in 156 ms.
Product exploration explored 100000 steps with 28527 reset in 127 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 211 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/106 stabilizing places and 20/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 1879 steps (6 resets) in 27 ms. (67 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 351 ms.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2026-05-24 03:52:15] [INFO ] Invariant cache hit.
[2026-05-24 03:52:15] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 03:52:15] [INFO ] Invariant cache hit.
[2026-05-24 03:52:15] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 106/106 places, 123/123 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 211 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/106 stabilizing places and 20/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
RANDOM walk for 648 steps (0 resets) in 11 ms. (54 steps per ms) remains 0/3 properties
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 345 ms.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28565 reset in 96 ms.
Product exploration explored 100000 steps with 28584 reset in 136 ms.
Spot run failed in 78 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8344848073544386435
[2026-05-24 03:52:16] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8344848073544386435
Running compilation step : cd /tmp/ltsmin8344848073544386435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 351 ms.
Running link step : cd /tmp/ltsmin8344848073544386435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8344848073544386435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15119757849596885839.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-02 finished in 12441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||F(p1)) U X(X(p2))))))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 121 transition count 140
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 121 transition count 140
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 115 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 115 transition count 134
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 111 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 111 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 109 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 107 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 105 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 105 transition count 122
Applied a total of 56 rules in 14 ms. Remains 105 /133 variables (removed 28) and now considering 122/154 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13229164218491305690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11448678986331928213.kers'
[2026-05-24 03:52:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13229164218491305690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11448678986331928213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 105 cols 328 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-24 03:52:16] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11448678986331928213.kers
Total runtime 1 ms.
[2026-05-24 03:52:16] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 03:52:16] [INFO ] Invariant cache hit.
[2026-05-24 03:52:17] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-24 03:52:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4376 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9523ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 9523ms
Starting structural reductions in LTL mode, iteration 1 : 105/133 places, 122/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9658 ms. Remains : 105/133 places, 122/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0||F(p1)) U X(X(p2))))))'
Stuttering acceptance computed with spot in 435 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-03
Stuttering criterion allowed to conclude after 264 steps with 7 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-03 finished in 10161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Graph (complete) has 256 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 130 transition count 129
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 108 transition count 129
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 45 place count 108 transition count 109
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 85 place count 88 transition count 109
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 82 transition count 101
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 82 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 79 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 79 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 78 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 78 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 77 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 77 transition count 95
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 169 place count 46 transition count 64
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 41 transition count 55
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 41 transition count 55
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 184 place count 36 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 189 place count 36 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 193 place count 32 transition count 41
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 32 transition count 41
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 28 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 28 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 24 transition count 29
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 24 transition count 29
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 217 place count 20 transition count 25
Iterating global reduction 2 with 4 rules applied. Total rules applied 221 place count 20 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 222 place count 19 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 223 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 224 place count 18 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 18 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 226 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 228 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 230 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 14 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 231 place count 14 transition count 16
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 235 place count 12 transition count 16
Applied a total of 235 rules in 46 ms. Remains 12 /133 variables (removed 121) and now considering 16/154 (removed 138) transitions.
[2026-05-24 03:52:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14247413371791759819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7113533873854875145.kers'
[2026-05-24 03:52:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14247413371791759819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7113533873854875145.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 14 rows 11 cols 34 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-24 03:52:27] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7113533873854875145.kers
Total runtime 0 ms.
[2026-05-24 03:52:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 03:52:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2026-05-24 03:52:27] [INFO ] Invariant cache hit.
[2026-05-24 03:52:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 03:52:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-24 03:52:27] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-24 03:52:27] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2026-05-24 03:52:27] [INFO ] Invariant cache hit.
[2026-05-24 03:52:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 300ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/133 places, 16/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 12/133 places, 16/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-04
Stuttering criterion allowed to conclude after 4644 steps with 256 reset in 20 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-04 finished in 548 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||X((X((F(p1)&&X((p2&&G(F(p3)))))) U (p0&&X((F(p1)&&X((p2&&G(F(p3))))))))))))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 142
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 118 transition count 138
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 118 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 115 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 115 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 113 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 113 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 111 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 109 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 109 transition count 127
Applied a total of 48 rules in 18 ms. Remains 109 /133 variables (removed 24) and now considering 127/154 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8971453296449666259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1183054340210258856.kers'
[2026-05-24 03:52:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8971453296449666259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1183054340210258856.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 109 cols 340 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-24 03:52:27] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1183054340210258856.kers
Total runtime 1 ms.
[2026-05-24 03:52:27] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 03:52:27] [INFO ] Invariant cache hit.
[2026-05-24 03:52:27] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-24 03:52:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/236 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 118 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4529 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/236 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 126/244 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 244 constraints, problems are : Problem set: 0 solved, 126 unsolved in 6161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10706ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10706ms
Starting structural reductions in LTL mode, iteration 1 : 109/133 places, 127/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10850 ms. Remains : 109/133 places, 127/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X((F(p1)&&X((p2&&G(F(p3)))))) U (p0&&X((F(p1)&&X((p2&&G(F(p3))))))))))))'
Stuttering acceptance computed with spot in 361 ms :[(NOT p0), (OR (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p3)), true, (NOT p3), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-05 finished in 11259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 142
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 117 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 117 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 114 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 114 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 112 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 112 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 108 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 108 transition count 126
Applied a total of 50 rules in 14 ms. Remains 108 /133 variables (removed 25) and now considering 126/154 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10238220740184375475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17553510120680365029.kers'
[2026-05-24 03:52:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10238220740184375475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17553510120680365029.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 108 cols 338 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-24 03:52:38] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17553510120680365029.kers
Total runtime 1 ms.
[2026-05-24 03:52:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 03:52:38] [INFO ] Invariant cache hit.
[2026-05-24 03:52:38] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-05-24 03:52:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/234 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/234 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 116 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/234 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 125/241 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 241 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9470ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 9471ms
Starting structural reductions in LTL mode, iteration 1 : 108/133 places, 126/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9609 ms. Remains : 108/133 places, 126/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-07 finished in 9788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Graph (complete) has 256 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 130 transition count 130
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 109 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 108 transition count 129
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 45 place count 108 transition count 110
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 83 place count 89 transition count 110
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 88 place count 84 transition count 103
Iterating global reduction 3 with 5 rules applied. Total rules applied 93 place count 84 transition count 103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 81 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 81 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 80 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 80 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 79 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 79 transition count 97
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 165 place count 48 transition count 66
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 170 place count 43 transition count 57
Iterating global reduction 3 with 5 rules applied. Total rules applied 175 place count 43 transition count 57
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 38 transition count 51
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 38 transition count 51
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 189 place count 34 transition count 43
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 34 transition count 43
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 197 place count 30 transition count 39
Iterating global reduction 3 with 4 rules applied. Total rules applied 201 place count 30 transition count 39
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 205 place count 26 transition count 31
Iterating global reduction 3 with 4 rules applied. Total rules applied 209 place count 26 transition count 31
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 213 place count 22 transition count 27
Iterating global reduction 3 with 4 rules applied. Total rules applied 217 place count 22 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 220 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 222 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 18 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 223 place count 18 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 229 place count 15 transition count 20
Applied a total of 229 rules in 22 ms. Remains 15 /133 variables (removed 118) and now considering 20/154 (removed 134) transitions.
[2026-05-24 03:52:48] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17358823330206904708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16396917527458544919.kers'
[2026-05-24 03:52:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17358823330206904708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16396917527458544919.kers]
Normalized transition count is 17 out of 18 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 15 cols 31 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 03:52:48] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16396917527458544919.kers
Total runtime 0 ms.
[2026-05-24 03:52:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 03:52:48] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 03:52:48] [INFO ] Invariant cache hit.
[2026-05-24 03:52:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-24 03:52:48] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-24 03:52:48] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 03:52:48] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 03:52:48] [INFO ] Invariant cache hit.
[2026-05-24 03:52:48] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/33 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 30 constraints, problems are : Problem set: 0 solved, 19 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 17/32 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 49 constraints, problems are : Problem set: 0 solved, 19 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 567ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/133 places, 20/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 655 ms. Remains : 15/133 places, 20/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-08
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-08 finished in 766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Graph (complete) has 256 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 130 transition count 127
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 106 transition count 127
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 49 place count 106 transition count 109
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 85 place count 88 transition count 109
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 82 transition count 101
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 82 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 97 place count 82 transition count 100
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 81 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 78 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 78 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 77 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 77 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 76 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 76 transition count 94
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 2 with 60 rules applied. Total rules applied 169 place count 46 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 173 place count 42 transition count 57
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 42 transition count 57
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 181 place count 38 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 185 place count 38 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 189 place count 34 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 34 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 197 place count 30 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 201 place count 30 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 205 place count 26 transition count 32
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 26 transition count 32
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 213 place count 22 transition count 28
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 220 place count 20 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 221 place count 20 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 224 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 231 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 235 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 239 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 5 transition count 10
Applied a total of 242 rules in 26 ms. Remains 5 /133 variables (removed 128) and now considering 10/154 (removed 144) transitions.
[2026-05-24 03:52:49] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-136085686315761081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11428144645996927122.kers'
[2026-05-24 03:52:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-136085686315761081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11428144645996927122.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 11 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 03:52:49] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11428144645996927122.kers
Total runtime 0 ms.
[2026-05-24 03:52:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 03:52:49] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 03:52:49] [INFO ] Invariant cache hit.
[2026-05-24 03:52:49] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2026-05-24 03:52:49] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 03:52:49] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 03:52:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 37 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/133 places, 10/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 5/133 places, 10/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-09
Stuttering criterion allowed to conclude after 18 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-09 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((X((p1||X(X(!p2)))) U (p0&&X((p1||X(X(!p2)))))))) U G(p3)))'
Support contains 7 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 123 transition count 142
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 123 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 118 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 118 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 117 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 117 transition count 136
Applied a total of 32 rules in 5 ms. Remains 117 /133 variables (removed 16) and now considering 136/154 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-840807660371891850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13368999446413767694.kers'
[2026-05-24 03:52:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-840807660371891850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13368999446413767694.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 117 cols 366 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-24 03:52:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13368999446413767694.kers
Total runtime 1 ms.
[2026-05-24 03:52:49] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-24 03:52:49] [INFO ] Invariant cache hit.
[2026-05-24 03:52:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2026-05-24 03:52:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/253 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 125 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5181 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/253 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 135/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 260 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11147ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 11147ms
Starting structural reductions in LTL mode, iteration 1 : 117/133 places, 136/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11423 ms. Remains : 117/133 places, 136/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((X((p1||X(X(!p2)))) U (p0&&X((p1||X(X(!p2)))))))) U G(p3)))'
Stuttering acceptance computed with spot in 365 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2), p2, p2, true, (AND p2 (NOT p3) (NOT p1)), (AND p2 (NOT p3)), (AND (NOT p3) p2), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-10
Product exploration explored 100000 steps with 17603 reset in 161 ms.
Product exploration explored 100000 steps with 17491 reset in 138 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 233 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/117 stabilizing places and 20/136 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 11 factoid took 203 ms. Reduced automaton from 11 states, 20 edges and 4 AP (stutter sensitive) to 11 states, 20 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (205 resets) in 284 ms. (140 steps per ms) remains 1/10 properties
BEST_FIRST walk for 25836 steps (27 resets) in 80 ms. (318 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 316 ms. Reduced automaton from 11 states, 20 edges and 4 AP (stutter sensitive) to 11 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2), p2, p2, true, (AND p2 (NOT p3) (NOT p1)), (AND p2 (NOT p3)), (AND (NOT p3) p2), (NOT p3)]
[2026-05-24 03:53:02] [INFO ] Invariant cache hit.
[2026-05-24 03:53:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 03:53:02] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-24 03:53:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 03:53:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 03:53:03] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-24 03:53:03] [INFO ] Computed and/alt/rep : 132/205/132 causal constraints (skipped 3 transitions) in 10 ms.
[2026-05-24 03:53:03] [INFO ] Added : 91 causal constraints over 19 iterations in 298 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 1678 ms.
Stuttering acceptance computed with spot in 338 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2), p2, p2, true, (AND p2 (NOT p3) (NOT p1)), (AND p2 (NOT p3)), (AND (NOT p3) p2), (NOT p3)]
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 136/136 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2026-05-24 03:53:03] [INFO ] Invariant cache hit.
[2026-05-24 03:53:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 03:53:03] [INFO ] Invariant cache hit.
[2026-05-24 03:53:03] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 117/117 places, 136/136 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 233 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/117 stabilizing places and 20/136 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 11 factoid took 212 ms. Reduced automaton from 11 states, 20 edges and 4 AP (stutter sensitive) to 11 states, 20 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (202 resets) in 170 ms. (233 steps per ms) remains 1/10 properties
BEST_FIRST walk for 16115 steps (14 resets) in 18 ms. (848 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 400 ms. Reduced automaton from 11 states, 20 edges and 4 AP (stutter sensitive) to 11 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2), p2, p2, true, (AND p2 (NOT p3) (NOT p1)), (AND p2 (NOT p3)), (AND (NOT p3) p2), (NOT p3)]
[2026-05-24 03:53:04] [INFO ] Invariant cache hit.
[2026-05-24 03:53:05] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2026-05-24 03:53:05] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2026-05-24 03:53:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 03:53:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-24 03:53:05] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2026-05-24 03:53:05] [INFO ] Computed and/alt/rep : 132/205/132 causal constraints (skipped 3 transitions) in 9 ms.
[2026-05-24 03:53:05] [INFO ] Added : 91 causal constraints over 19 iterations in 374 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 1685 ms.
Stuttering acceptance computed with spot in 332 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2), p2, p2, true, (AND p2 (NOT p3) (NOT p1)), (AND p2 (NOT p3)), (AND (NOT p3) p2), (NOT p3)]
Stuttering acceptance computed with spot in 352 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2), p2, p2, true, (AND p2 (NOT p3) (NOT p1)), (AND p2 (NOT p3)), (AND (NOT p3) p2), (NOT p3)]
Product exploration explored 100000 steps with 17522 reset in 103 ms.
Product exploration explored 100000 steps with 17405 reset in 262 ms.
Spot run failed in 38 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9389636647240769212
[2026-05-24 03:53:06] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9389636647240769212
Running compilation step : cd /tmp/ltsmin9389636647240769212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin9389636647240769212;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9389636647240769212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7959287870247142275.hoa' '--buchi-type=spotba'
LTSmin run took 20 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-10 finished in 17465 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(G(!p0)) U p0))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 141
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 117 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 117 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 114 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 114 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 111 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 111 transition count 129
Applied a total of 44 rules in 5 ms. Remains 111 /133 variables (removed 22) and now considering 129/154 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9741235275244320831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3320133396633741338.kers'
[2026-05-24 03:53:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9741235275244320831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3320133396633741338.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 111 cols 348 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 03:53:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3320133396633741338.kers
Total runtime 1 ms.
[2026-05-24 03:53:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 03:53:07] [INFO ] Invariant cache hit.
[2026-05-24 03:53:07] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-24 03:53:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/240 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 119 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4988 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/240 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 128/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 247 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10360ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 10361ms
Starting structural reductions in LTL mode, iteration 1 : 111/133 places, 129/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10517 ms. Remains : 111/133 places, 129/154 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(G(!p0)) U p0))))'
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 504 reset in 206 ms.
Stack based approach found an accepted trace after 3183 steps with 14 reset with depth 275 and stack size 266 in 8 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-11 finished in 10896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G((p1||X((p2||X(G(p3))))))))))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 141
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 141
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 116 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 116 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 112 transition count 131
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 110 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 110 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 106 transition count 123
Applied a total of 54 rules in 5 ms. Remains 106 /133 variables (removed 27) and now considering 123/154 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-542589008758125114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11999214695255057655.kers'
[2026-05-24 03:53:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-542589008758125114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11999214695255057655.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 106 cols 330 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-24 03:53:18] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11999214695255057655.kers
Total runtime 4 ms.
[2026-05-24 03:53:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 03:53:18] [INFO ] Invariant cache hit.
[2026-05-24 03:53:18] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 03:53:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/229 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 114 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4632 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/229 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 122/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 236 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4877 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9539ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9539ms
Starting structural reductions in LTL mode, iteration 1 : 106/133 places, 123/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9681 ms. Remains : 106/133 places, 123/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G((p1||X((p2||X(G(p3))))))))))'
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-12 finished in 9921 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||X(p1))) U X(G(p1)))))'
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Graph (complete) has 256 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 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 130 transition count 129
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 108 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 106 transition count 127
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 49 place count 106 transition count 109
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 85 place count 88 transition count 109
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 82 transition count 101
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 82 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 97 place count 82 transition count 100
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 81 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 78 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 78 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 77 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 77 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 76 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 76 transition count 94
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 3 with 58 rules applied. Total rules applied 167 place count 47 transition count 65
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 171 place count 43 transition count 58
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 43 transition count 58
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 178 place count 40 transition count 54
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 40 transition count 54
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 184 place count 37 transition count 48
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 37 transition count 48
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 34 transition count 45
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 34 transition count 45
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 196 place count 31 transition count 39
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 31 transition count 39
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 28 transition count 36
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 27 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 26 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 26 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 26 transition count 32
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 24 transition count 30
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 26 edges and 22 vertex of which 19 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 8 rules applied. Total rules applied 220 place count 19 transition count 22
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 225 place count 14 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 231 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 11 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 235 place count 8 transition count 15
Applied a total of 235 rules in 19 ms. Remains 8 /133 variables (removed 125) and now considering 15/154 (removed 139) transitions.
[2026-05-24 03:53:27] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3454022417250286616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15901300794017390219.kers'
[2026-05-24 03:53:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3454022417250286616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15901300794017390219.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 8 cols 18 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 03:53:27] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15901300794017390219.kers
Total runtime 0 ms.
[2026-05-24 03:53:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 03:53:27] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2026-05-24 03:53:27] [INFO ] Invariant cache hit.
[2026-05-24 03:53:27] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-24 03:53:27] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 03:53:27] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2026-05-24 03:53:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 5/19 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 8 constraints, problems are : Problem set: 0 solved, 7 unsolved in 54 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 5/19 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 53 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/133 places, 15/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 8/133 places, 15/154 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||X(p1))) U X(G(p1)))))'
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-13 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(p1))||G(p2)))||p0)))'
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 122 transition count 141
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 122 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 118 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 118 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 115 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 115 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 113 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 113 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 111 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 111 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 109 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 109 transition count 126
Applied a total of 48 rules in 5 ms. Remains 109 /133 variables (removed 24) and now considering 126/154 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3669313961664438943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16272037010207388303.kers'
[2026-05-24 03:53:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3669313961664438943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16272037010207388303.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 109 cols 338 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-24 03:53:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16272037010207388303.kers
Total runtime 3 ms.
[2026-05-24 03:53:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 03:53:28] [INFO ] Invariant cache hit.
[2026-05-24 03:53:28] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-05-24 03:53:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/235 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/235 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 118 constraints, problems are : Problem set: 0 solved, 125 unsolved in 4728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/235 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 125/243 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 243 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10627ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 10627ms
Starting structural reductions in LTL mode, iteration 1 : 109/133 places, 126/154 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10744 ms. Remains : 109/133 places, 126/154 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(p1))||G(p2)))||p0)))'
Stuttering acceptance computed with spot in 262 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 216 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Proved property starting from automaton with 7 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 71 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-15 finished in 11233 ms.
All properties solved by simple procedures.
Total runtime 124600 ms.

BK_STOP 1779594819574

--------------------
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="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r098-tall-177955695400244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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