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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K Mar 6 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 6 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 16:15 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.9K Mar 15 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 16:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 16:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 16:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:13 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 75K 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-10b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779598937855

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-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 05:02:19] [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 05:02:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:02:19] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-24 05:02:19] [INFO ] Transformed 296 places.
[2026-05-24 05:02:19] [INFO ] Transformed 314 transitions.
[2026-05-24 05:02:19] [INFO ] Found NUPN structural information;
[2026-05-24 05:02:19] [INFO ] Parsed PT model containing 296 places and 314 transitions and 819 arcs in 176 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-10b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 276 transition count 314
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 62 place count 234 transition count 272
Iterating global reduction 1 with 42 rules applied. Total rules applied 104 place count 234 transition count 272
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 115 place count 223 transition count 261
Iterating global reduction 1 with 11 rules applied. Total rules applied 126 place count 223 transition count 261
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 215 transition count 253
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 215 transition count 253
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 209 transition count 247
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 209 transition count 247
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 160 place count 203 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 166 place count 203 transition count 235
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 172 place count 197 transition count 229
Iterating global reduction 1 with 6 rules applied. Total rules applied 178 place count 197 transition count 229
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 184 place count 191 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 190 place count 191 transition count 223
Applied a total of 190 rules in 93 ms. Remains 191 /296 variables (removed 105) and now considering 223/314 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5413929505224587548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16992708374641142405.kers'
[2026-05-24 05:02:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5413929505224587548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16992708374641142405.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 191 cols 594 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-24 05:02:19] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16992708374641142405.kers
Total runtime 2 ms.
[2026-05-24 05:02:19] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-24 05:02:19] [INFO ] Invariant cache hit.
[2026-05-24 05:02:19] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-24 05:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/414 variables, 191/193 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/414 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 203 constraints, problems are : Problem set: 0 solved, 222 unsolved in 13507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/414 variables, 191/203 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 222/425 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/414 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 425 constraints, problems are : Problem set: 0 solved, 222 unsolved in 18294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31902ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 31922ms
Starting structural reductions in LTL mode, iteration 1 : 191/296 places, 223/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32534 ms. Remains : 191/296 places, 223/314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 191 /191 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-24 05:02:51] [INFO ] Invariant cache hit.
[2026-05-24 05:02:52] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-24 05:02:52] [INFO ] Invariant cache hit.
[2026-05-24 05:02:52] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 191/191 places, 223/223 transitions.
Support contains 33 out of 191 places after structural reductions.
[2026-05-24 05:02:52] [INFO ] Flatten gal took : 35 ms
[2026-05-24 05:02:52] [INFO ] Flatten gal took : 23 ms
[2026-05-24 05:02:52] [INFO ] Input system was already deterministic with 223 transitions.
RANDOM walk for 11971 steps (34 resets) in 501 ms. (23 steps per ms) remains 0/31 properties
Computed a total of 34 stabilizing places and 34 stable transitions
Graph (complete) has 373 edges and 191 vertex of which 188 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 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)&&F(p1)) U (p2||X(p1))))'
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 175 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 175 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 172 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 169 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 195
Applied a total of 50 rules in 14 ms. Remains 166 /191 variables (removed 25) and now considering 195/223 (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-9612950842080225952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-775656694996798186.kers'
[2026-05-24 05:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9612950842080225952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-775656694996798186.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 166 cols 526 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 05:02:53] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-775656694996798186.kers
Total runtime 2 ms.
[2026-05-24 05:02:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-24 05:02:53] [INFO ] Invariant cache hit.
[2026-05-24 05:02:53] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 05:02:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 195/361 variables, 166/168 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 178 constraints, problems are : Problem set: 0 solved, 194 unsolved in 10560 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/361 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 194/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 372 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23348ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 23349ms
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23567 ms. Remains : 166/191 places, 195/223 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)&&F(p1)) U (p2||X(p1))))'
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 335 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 26 ms. Proved property starting from automaton with 5 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 54 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-00 finished in 24366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Graph (complete) has 373 edges and 191 vertex of which 188 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 187 transition count 187
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 155 transition count 187
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 65 place count 155 transition count 161
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 117 place count 129 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 125 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 125 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 125 place count 125 transition count 156
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 127 place count 124 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 122 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 122 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 120 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 120 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 119 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 119 transition count 149
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 235 place count 70 transition count 100
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 244 place count 61 transition count 83
Iterating global reduction 2 with 9 rules applied. Total rules applied 253 place count 61 transition count 83
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 261 place count 53 transition count 74
Iterating global reduction 2 with 8 rules applied. Total rules applied 269 place count 53 transition count 74
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 277 place count 45 transition count 58
Iterating global reduction 2 with 8 rules applied. Total rules applied 285 place count 45 transition count 58
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 293 place count 37 transition count 50
Iterating global reduction 2 with 8 rules applied. Total rules applied 301 place count 37 transition count 50
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 309 place count 29 transition count 34
Iterating global reduction 2 with 8 rules applied. Total rules applied 317 place count 29 transition count 34
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 325 place count 21 transition count 26
Iterating global reduction 2 with 8 rules applied. Total rules applied 333 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 334 place count 20 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 336 place count 19 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 337 place count 19 transition count 23
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 338 place count 19 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 346 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 349 place count 9 transition count 14
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 353 place count 7 transition count 12
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 354 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 356 place count 5 transition count 9
Applied a total of 356 rules in 60 ms. Remains 5 /191 variables (removed 186) and now considering 9/223 (removed 214) transitions.
[2026-05-24 05:03:17] [INFO ] Flow matrix only has 7 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-2471542636997642941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12196448757549008670.kers'
[2026-05-24 05:03:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2471542636997642941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12196448757549008670.kers]
Normalized transition count is 6 out of 7 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 5 cols 10 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 05:03:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12196448757549008670.kers
Total runtime 1 ms.
[2026-05-24 05:03:17] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 05:03:17] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2026-05-24 05:03:17] [INFO ] Invariant cache hit.
[2026-05-24 05:03:17] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-24 05:03:17] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 05:03:17] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2026-05-24 05:03:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/11 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/191 places, 9/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 5/191 places, 9/223 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 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-02
Stuttering criterion allowed to conclude after 132 steps with 4 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-02 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||G((p2&&X(p3)))))'
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 180 transition count 212
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 180 transition count 212
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 178 transition count 209
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 178 transition count 209
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 176 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 176 transition count 206
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 174 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 174 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 173 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 173 transition count 203
Applied a total of 36 rules in 15 ms. Remains 173 /191 variables (removed 18) and now considering 203/223 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12595129108852003979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7601870302105599477.kers'
[2026-05-24 05:03:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12595129108852003979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7601870302105599477.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 173 cols 548 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-24 05:03:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7601870302105599477.kers
Total runtime 1 ms.
[2026-05-24 05:03:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-24 05:03:17] [INFO ] Invariant cache hit.
[2026-05-24 05:03:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-05-24 05:03:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 203/376 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 10/185 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 185 constraints, problems are : Problem set: 0 solved, 202 unsolved in 11129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/376 variables, 173/185 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 202/387 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/376 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 387 constraints, problems are : Problem set: 0 solved, 202 unsolved in 13641 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24812ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 24813ms
Starting structural reductions in LTL mode, iteration 1 : 173/191 places, 203/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25008 ms. Remains : 173/191 places, 203/223 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||G((p2&&X(p3)))))'
Stuttering acceptance computed with spot in 223 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-03
Stuttering criterion allowed to conclude after 568 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-03 finished in 25273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 175 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 175 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 172 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 170 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 170 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 169 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 169 transition count 199
Applied a total of 44 rules in 12 ms. Remains 169 /191 variables (removed 22) and now considering 199/223 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13219828189083852289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13790220724517549344.kers'
[2026-05-24 05:03:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13219828189083852289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13790220724517549344.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 169 cols 536 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-24 05:03:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13790220724517549344.kers
Total runtime 1 ms.
[2026-05-24 05:03:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 05:03:43] [INFO ] Invariant cache hit.
[2026-05-24 05:03:43] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-24 05:03:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/368 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 10/181 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 181 constraints, problems are : Problem set: 0 solved, 198 unsolved in 10531 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/368 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 198/379 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 379 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12094 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22673ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 22674ms
Starting structural reductions in LTL mode, iteration 1 : 169/191 places, 199/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22842 ms. Remains : 169/191 places, 199/223 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-04
Stuttering criterion allowed to conclude after 333 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-04 finished in 23018 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(F(p1)) U p1)))) U p1))'
Support contains 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 175 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 175 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 172 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 169 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 195
Applied a total of 50 rules in 11 ms. Remains 166 /191 variables (removed 25) and now considering 195/223 (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-17994680692261465362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14721028113520432135.kers'
[2026-05-24 05:04:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17994680692261465362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14721028113520432135.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 166 cols 526 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 05:04:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14721028113520432135.kers
Total runtime 1 ms.
[2026-05-24 05:04:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 05:04:06] [INFO ] Invariant cache hit.
[2026-05-24 05:04:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 05:04:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 195/361 variables, 166/168 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 178 constraints, problems are : Problem set: 0 solved, 194 unsolved in 10238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/361 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 194/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 372 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22908ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 22908ms
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23061 ms. Remains : 166/191 places, 195/223 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(F(p1)) U p1)))) U p1))'
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-06
Product exploration explored 100000 steps with 1776 reset in 174 ms.
Stack based approach found an accepted trace after 111 steps with 1 reset with depth 57 and stack size 57 in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-06 finished in 23473 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 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Graph (complete) has 373 edges and 191 vertex of which 188 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 187 transition count 189
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 157 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 155 transition count 187
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 65 place count 155 transition count 161
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 117 place count 129 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 121 place count 125 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 125 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 125 place count 125 transition count 156
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 127 place count 124 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 122 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 122 transition count 153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 120 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 120 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 119 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 119 transition count 149
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 235 place count 70 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 244 place count 61 transition count 83
Iterating global reduction 3 with 9 rules applied. Total rules applied 253 place count 61 transition count 83
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 262 place count 52 transition count 73
Iterating global reduction 3 with 9 rules applied. Total rules applied 271 place count 52 transition count 73
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 279 place count 44 transition count 57
Iterating global reduction 3 with 8 rules applied. Total rules applied 287 place count 44 transition count 57
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 295 place count 36 transition count 49
Iterating global reduction 3 with 8 rules applied. Total rules applied 303 place count 36 transition count 49
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 311 place count 28 transition count 33
Iterating global reduction 3 with 8 rules applied. Total rules applied 319 place count 28 transition count 33
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 327 place count 20 transition count 25
Iterating global reduction 3 with 8 rules applied. Total rules applied 335 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 3 with 1 rules applied. Total rules applied 336 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 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 3 with 7 rules applied. Total rules applied 345 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 349 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 5 with 4 rules applied. Total rules applied 353 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 5 with 1 rules applied. Total rules applied 354 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 356 place count 5 transition count 10
Applied a total of 356 rules in 38 ms. Remains 5 /191 variables (removed 186) and now considering 10/223 (removed 213) transitions.
[2026-05-24 05:04:29] [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-12562398140200797002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13226660605888162780.kers'
[2026-05-24 05:04:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12562398140200797002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13226660605888162780.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 05:04:29] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13226660605888162780.kers
Total runtime 1 ms.
[2026-05-24 05:04:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 05:04:29] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 05:04:29] [INFO ] Invariant cache hit.
[2026-05-24 05:04:29] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2026-05-24 05:04:29] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 05:04:29] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 05:04:29] [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 42 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 40 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 84ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/191 places, 10/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 5/191 places, 10/223 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 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-07
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-07 finished in 220 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 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Graph (complete) has 373 edges and 191 vertex of which 188 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 187 transition count 187
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 155 transition count 187
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 65 place count 155 transition count 162
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 115 place count 130 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 127 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 127 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 121 place count 127 transition count 158
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 126 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 124 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 124 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 122 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 122 transition count 153
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 231 place count 72 transition count 103
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 239 place count 64 transition count 87
Iterating global reduction 2 with 8 rules applied. Total rules applied 247 place count 64 transition count 87
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 254 place count 57 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 261 place count 57 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 268 place count 50 transition count 66
Iterating global reduction 2 with 7 rules applied. Total rules applied 275 place count 50 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 282 place count 43 transition count 58
Iterating global reduction 2 with 7 rules applied. Total rules applied 289 place count 43 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 296 place count 36 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 303 place count 36 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 310 place count 29 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 317 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 28 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 28 transition count 36
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 320 place count 28 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 29 edges and 24 vertex of which 21 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 2 with 8 rules applied. Total rules applied 330 place count 21 transition count 25
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 335 place count 16 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 343 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 345 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 348 place count 9 transition count 16
Applied a total of 348 rules in 40 ms. Remains 9 /191 variables (removed 182) and now considering 16/223 (removed 207) transitions.
[2026-05-24 05:04:29] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4463921736128254567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5601272898532001281.kers'
[2026-05-24 05:04:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4463921736128254567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5601272898532001281.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 18 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 05:04:29] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5601272898532001281.kers
Total runtime 2 ms.
[2026-05-24 05:04:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 05:04:29] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2026-05-24 05:04:29] [INFO ] Invariant cache hit.
[2026-05-24 05:04:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2026-05-24 05:04:29] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 05:04:29] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2026-05-24 05:04:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 63 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/20 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 61 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/191 places, 16/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 9/191 places, 16/223 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 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-08 finished in 329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&G((X(p1)||F((!p0 U (p2||G(!p0))))))))'
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 175 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 175 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 172 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 169 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 195
Applied a total of 50 rules in 22 ms. Remains 166 /191 variables (removed 25) and now considering 195/223 (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-14673253875126671260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7780250075319059645.kers'
[2026-05-24 05:04:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14673253875126671260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7780250075319059645.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 166 cols 526 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 05:04:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7780250075319059645.kers
Total runtime 1 ms.
[2026-05-24 05:04:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 05:04:30] [INFO ] Invariant cache hit.
[2026-05-24 05:04:30] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 05:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 195/361 variables, 166/168 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 178 constraints, problems are : Problem set: 0 solved, 194 unsolved in 10348 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/361 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 194/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 372 constraints, problems are : Problem set: 0 solved, 194 unsolved in 12239 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22602ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 22602ms
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22769 ms. Remains : 166/191 places, 195/223 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&G((X(p1)||F((!p0 U (p2||G(!p0))))))))'
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (NOT p0), (AND (NOT p2) p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-09
Stuttering criterion allowed to conclude after 356 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-09 finished in 23019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(p0)))||(p1&&(p2||G(p3)))))))'
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 175 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 175 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 172 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 169 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 195
Applied a total of 50 rules in 13 ms. Remains 166 /191 variables (removed 25) and now considering 195/223 (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-1589729645186875947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2874838913715161443.kers'
[2026-05-24 05:04:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1589729645186875947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2874838913715161443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 166 cols 526 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 05:04:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2874838913715161443.kers
Total runtime 1 ms.
[2026-05-24 05:04:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 05:04:53] [INFO ] Invariant cache hit.
[2026-05-24 05:04:53] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 166/191 places, 195/223 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(p0)))||(p1&&(p2||G(p3)))))))'
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (NOT p3), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-10 finished in 567 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 U p1)) U p0))'
Support contains 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 175 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 175 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 172 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 169 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 195
Applied a total of 50 rules in 13 ms. Remains 166 /191 variables (removed 25) and now considering 195/223 (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-1708542501647713325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2369918516775887610.kers'
[2026-05-24 05:04:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1708542501647713325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2369918516775887610.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 166 cols 526 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 05:04:53] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2369918516775887610.kers
Total runtime 2 ms.
[2026-05-24 05:04:53] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 05:04:53] [INFO ] Invariant cache hit.
[2026-05-24 05:04:53] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 166/191 places, 195/223 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 U p1)) U p0))'
Stuttering acceptance computed with spot in 126 ms :[true, p0, (AND p0 p1), p1]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Computed a total of 33 stabilizing places and 33 stable transitions
Graph (complete) has 335 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 33 stabilizing places and 33 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 16 ms. Proved property starting from automaton with 4 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-11 finished in 516 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||F(G(p1)))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 175 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 175 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 172 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 169 transition count 198
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 167 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 195
Applied a total of 50 rules in 12 ms. Remains 166 /191 variables (removed 25) and now considering 195/223 (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-1661770511833883167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14685771388361196070.kers'
[2026-05-24 05:04:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1661770511833883167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14685771388361196070.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 166 cols 525 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-24 05:04:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14685771388361196070.kers
Total runtime 1 ms.
[2026-05-24 05:04:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 05:04:54] [INFO ] Invariant cache hit.
[2026-05-24 05:04:54] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-24 05:04:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 195/361 variables, 166/168 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 10/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 178 constraints, problems are : Problem set: 0 solved, 194 unsolved in 10223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/361 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 194/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 372 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23404ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 23405ms
Starting structural reductions in LTL mode, iteration 1 : 166/191 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23580 ms. Remains : 166/191 places, 195/223 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||F(G(p1)))))'
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 334 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 15 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-12 finished in 23901 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||F(G(!p0))) U (G(p1)||X(X(p2)))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 179 transition count 211
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 179 transition count 211
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 176 transition count 207
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 176 transition count 207
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 173 transition count 203
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 173 transition count 203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 170 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 170 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 168 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 168 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 167 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 167 transition count 196
Applied a total of 48 rules in 12 ms. Remains 167 /191 variables (removed 24) and now considering 196/223 (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-15935788393789961665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10597138860127667466.kers'
[2026-05-24 05:05:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15935788393789961665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10597138860127667466.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 167 cols 527 entries
Finished phase 1 with 165 SingleSign rule and 0 generalized
[2026-05-24 05:05:18] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10597138860127667466.kers
Total runtime 2 ms.
[2026-05-24 05:05:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 05:05:18] [INFO ] Invariant cache hit.
[2026-05-24 05:05:18] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2026-05-24 05:05:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 196/363 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 10/179 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 179 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/363 variables, 167/179 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 195/374 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 374 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12717 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22960ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 22960ms
Starting structural reductions in LTL mode, iteration 1 : 167/191 places, 196/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23128 ms. Remains : 167/191 places, 196/223 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||F(G(!p0))) U (G(p1)||X(X(p2)))))'
Stuttering acceptance computed with spot in 433 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p2) p0), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 81 ms.
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Computed a total of 33 stabilizing places and 33 stable transitions
Graph (complete) has 335 edges and 167 vertex of which 165 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 33 stabilizing places and 33 stable transitions
Detected a total of 33/167 stabilizing places and 33/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 9 ms. Proved property starting from automaton with 11 states, 23 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 14 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-13 finished in 23800 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 (F(p1)&&(p2||(!p2&&X(G((!p2||G(!p3)))))))))'
Support contains 6 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Graph (complete) has 373 edges and 191 vertex of which 188 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 187 transition count 189
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 157 transition count 189
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 61 place count 157 transition count 164
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 111 place count 132 transition count 164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 129 transition count 161
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 129 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 128 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 128 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 127 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 127 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 126 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 126 transition count 157
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 221 place count 77 transition count 108
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 228 place count 70 transition count 95
Iterating global reduction 2 with 7 rules applied. Total rules applied 235 place count 70 transition count 95
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 241 place count 64 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 247 place count 64 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 253 place count 58 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 259 place count 58 transition count 76
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 53 transition count 71
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 53 transition count 71
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 274 place count 48 transition count 61
Iterating global reduction 2 with 5 rules applied. Total rules applied 279 place count 48 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 284 place count 43 transition count 56
Iterating global reduction 2 with 5 rules applied. Total rules applied 289 place count 43 transition count 56
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 290 place count 42 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 291 place count 42 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 292 place count 41 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 293 place count 41 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 294 place count 41 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 39 transition count 51
Applied a total of 296 rules in 23 ms. Remains 39 /191 variables (removed 152) and now considering 51/223 (removed 172) transitions.
[2026-05-24 05:05:41] [INFO ] Flow matrix only has 45 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5325395388621995731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6173981387593013282.kers'
[2026-05-24 05:05:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5325395388621995731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6173981387593013282.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 45 rows 37 cols 120 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-24 05:05:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6173981387593013282.kers
Total runtime 0 ms.
[2026-05-24 05:05:42] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 05:05:42] [INFO ] Flow matrix only has 45 transitions (discarded 6 similar events)
[2026-05-24 05:05:42] [INFO ] Invariant cache hit.
[2026-05-24 05:05:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 05:05:42] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2026-05-24 05:05:42] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2026-05-24 05:05:42] [INFO ] Flow matrix only has 45 transitions (discarded 6 similar events)
[2026-05-24 05:05:42] [INFO ] Invariant cache hit.
[2026-05-24 05:05:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 45/84 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 42 constraints, problems are : Problem set: 0 solved, 49 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 45/84 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 49/91 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 91 constraints, problems are : Problem set: 0 solved, 49 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 39/39 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1695ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1695ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/191 places, 51/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1817 ms. Remains : 39/191 places, 51/223 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 (F(p1)&&(p2||(!p2&&X(G((!p2||G(!p3)))))))))'
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2 p3), (AND p0 p3 p2), (AND (NOT p1) p3), p0, (AND p0 p3)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-14
Stuttering criterion allowed to conclude after 990 steps with 12 reset in 6 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-14 finished in 2097 ms.
All properties solved by simple procedures.
Total runtime 205035 ms.

BK_STOP 1779599144108

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-10b"
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-10b, 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-177955695500308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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