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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.6K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 6 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 6 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:14 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 43K 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-12a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779601375986

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-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 05:42:57] [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:42:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:42:57] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2026-05-24 05:42:57] [INFO ] Transformed 123 places.
[2026-05-24 05:42:57] [INFO ] Transformed 169 transitions.
[2026-05-24 05:42:57] [INFO ] Found NUPN structural information;
[2026-05-24 05:42:57] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 142 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 1 formulas.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 113 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 113 transition count 159
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 105 transition count 151
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 105 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 101 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 101 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 101 transition count 135
Applied a total of 52 rules in 43 ms. Remains 101 /123 variables (removed 22) and now considering 135/169 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11895720481796846533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17201578776478320362.kers'
[2026-05-24 05:42:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11895720481796846533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17201578776478320362.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 135 rows 99 cols 267 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-24 05:42:57] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17201578776478320362.kers
Total runtime 1 ms.
[2026-05-24 05:42:57] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-24 05:42:57] [INFO ] Invariant cache hit.
[2026-05-24 05:42:57] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 05:42:57] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-24 05:42:57] [INFO ] Invariant cache hit.
[2026-05-24 05:42:57] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/236 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 88/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 191 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4181 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/236 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 88/191 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 134/325 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 325 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8637ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 8651ms
Starting structural reductions in LTL mode, iteration 1 : 101/123 places, 135/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9081 ms. Remains : 101/123 places, 135/169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-24 05:43:06] [INFO ] Invariant cache hit.
[2026-05-24 05:43:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 05:43:06] [INFO ] Invariant cache hit.
[2026-05-24 05:43:06] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 05:43:06] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 101/101 places, 135/135 transitions.
Support contains 35 out of 101 places after structural reductions.
[2026-05-24 05:43:06] [INFO ] Flatten gal took : 25 ms
[2026-05-24 05:43:06] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:43:06] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 2187 steps (14 resets) in 126 ms. (17 steps per ms) remains 0/35 properties
FORMULA DiscoveryGPU-PT-12a-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 306 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!p0) U ((!p1&&X(!p0)&&(p2 U (p3||G(p2))))||X(G(!p0))))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 94 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 91 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 91 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 90 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 90 transition count 124
Applied a total of 22 rules in 9 ms. Remains 90 /101 variables (removed 11) and now considering 124/135 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16515056815892790213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6934085305798217727.kers'
[2026-05-24 05:43:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16515056815892790213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6934085305798217727.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 124 rows 88 cols 246 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 05:43:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6934085305798217727.kers
Total runtime 0 ms.
[2026-05-24 05:43:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 05:43:07] [INFO ] Invariant cache hit.
[2026-05-24 05:43:07] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:07] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 179 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/101 places, 124/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 193 ms. Remains : 89/101 places, 124/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!p0) U (X(G(!p0))||(!p1&&X(!p0)&&(p2 U (p3||G(p2))))))))'
Stuttering acceptance computed with spot in 385 ms :[p0, p0, p0, (AND p0 (NOT p2) (NOT p3)), true, (AND p0 (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 361 ms.
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 23 factoid took 21 ms. Proved property starting from automaton with 7 states, 18 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-00 finished in 1269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 92 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 91 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 91 transition count 125
Applied a total of 20 rules in 16 ms. Remains 91 /101 variables (removed 10) and now considering 125/135 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18197153629885722828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17536734620251540799.kers'
[2026-05-24 05:43:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18197153629885722828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17536734620251540799.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 125 rows 89 cols 248 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 05:43:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17536734620251540799.kers
Total runtime 0 ms.
[2026-05-24 05:43:08] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 05:43:08] [INFO ] Invariant cache hit.
[2026-05-24 05:43:08] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:08] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-24 05:43:08] [INFO ] Invariant cache hit.
[2026-05-24 05:43:08] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 178 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3526 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 124/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 302 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7006ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7008ms
Starting structural reductions in LTL mode, iteration 1 : 91/101 places, 125/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7171 ms. Remains : 91/101 places, 125/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p1)&&p2))))'
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-01
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-01 finished in 7425 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(p0)||(F((p1||X(p0))) U X(p2)))))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 94 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 91 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 91 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 90 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 90 transition count 124
Applied a total of 22 rules in 14 ms. Remains 90 /101 variables (removed 11) and now considering 124/135 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-466038729716839151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12361269681384046475.kers'
[2026-05-24 05:43:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-466038729716839151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12361269681384046475.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 124 rows 88 cols 246 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 05:43:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12361269681384046475.kers
Total runtime 0 ms.
[2026-05-24 05:43:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 05:43:15] [INFO ] Invariant cache hit.
[2026-05-24 05:43:16] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:16] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/101 places, 124/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 89/101 places, 124/135 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(p0)||(F((p1||X(p0))) U X(p2)))))))'
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 130 ms.
Product exploration explored 100000 steps with 20000 reset in 218 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Detected a total of 14/89 stabilizing places and 13/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 632 steps (3 resets) in 14 ms. (42 steps per ms) remains 0/7 properties
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 603 ms.
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 124/124 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13205859064681603289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13242473790423329149.kers'
[2026-05-24 05:43:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13205859064681603289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13242473790423329149.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 124 rows 88 cols 246 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 05:43:17] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13242473790423329149.kers
Total runtime 3 ms.
[2026-05-24 05:43:17] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 05:43:17] [INFO ] Invariant cache hit.
[2026-05-24 05:43:17] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 05:43:17] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2026-05-24 05:43:17] [INFO ] Invariant cache hit.
[2026-05-24 05:43:17] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/213 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 61/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 151 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/213 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 61/151 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 123/274 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 274 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3521 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6279ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6280ms
Finished structural reductions in LTL mode , in 1 iterations and 6399 ms. Remains : 89/89 places, 124/124 transitions.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Detected a total of 14/89 stabilizing places and 13/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 867 steps (3 resets) in 17 ms. (48 steps per ms) remains 0/7 properties
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 658 ms.
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 20000 reset in 121 ms.
Product exploration explored 100000 steps with 20000 reset in 138 ms.
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4774122244569108027
[2026-05-24 05:43:25] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4774122244569108027
Running compilation step : cd /tmp/ltsmin4774122244569108027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 314 ms.
Running link step : cd /tmp/ltsmin4774122244569108027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4774122244569108027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4616707019703927939.hoa' '--buchi-type=spotba'
LTSmin run took 41 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-04 finished in 10365 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 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 94 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 91 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 91 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 90 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 90 transition count 124
Applied a total of 22 rules in 4 ms. Remains 90 /101 variables (removed 11) and now considering 124/135 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14259568691651452069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18177846886931066498.kers'
[2026-05-24 05:43:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14259568691651452069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18177846886931066498.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 124 rows 88 cols 246 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 05:43:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18177846886931066498.kers
Total runtime 0 ms.
[2026-05-24 05:43:26] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 05:43:26] [INFO ] Invariant cache hit.
[2026-05-24 05:43:26] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/101 places, 124/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 89/101 places, 124/135 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 105 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-05
Stuttering criterion allowed to conclude after 14628 steps with 947 reset in 30 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-05 finished in 316 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 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Graph (complete) has 306 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 99 transition count 129
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 16 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 88 transition count 122
Applied a total of 23 rules in 30 ms. Remains 88 /101 variables (removed 13) and now considering 122/135 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4518709465476180716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11617733410143476619.kers'
[2026-05-24 05:43:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4518709465476180716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11617733410143476619.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 122 rows 86 cols 242 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-24 05:43:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11617733410143476619.kers
Total runtime 0 ms.
[2026-05-24 05:43:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 05:43:26] [INFO ] Invariant cache hit.
[2026-05-24 05:43:26] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:26] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2026-05-24 05:43:26] [INFO ] Redundant transitions in 5 ms returned []
Running 121 sub problems to find dead transitions.
[2026-05-24 05:43:26] [INFO ] Invariant cache hit.
[2026-05-24 05:43:26] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/210 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 85/175 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 175 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3442 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/210 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 85/175 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 121/296 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 296 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3296 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6752ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 6753ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/101 places, 122/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6965 ms. Remains : 88/101 places, 122/135 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 45 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-06
Product exploration explored 100000 steps with 862 reset in 140 ms.
Stack based approach found an accepted trace after 692 steps with 5 reset with depth 137 and stack size 130 in 3 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-06 finished in 7174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 92 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 91 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 91 transition count 125
Applied a total of 20 rules in 3 ms. Remains 91 /101 variables (removed 10) and now considering 125/135 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17283638683740856160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9455411581247095220.kers'
[2026-05-24 05:43:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17283638683740856160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9455411581247095220.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 125 rows 89 cols 248 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 05:43:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9455411581247095220.kers
Total runtime 0 ms.
[2026-05-24 05:43:33] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 05:43:33] [INFO ] Invariant cache hit.
[2026-05-24 05:43:33] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:33] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-24 05:43:33] [INFO ] Invariant cache hit.
[2026-05-24 05:43:33] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 178 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/216 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 124/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 302 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3694 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7065ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7065ms
Starting structural reductions in LTL mode, iteration 1 : 91/101 places, 125/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7206 ms. Remains : 91/101 places, 125/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 5133 steps with 40 reset in 15 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-07 finished in 7389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Graph (complete) has 306 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 99 transition count 130
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 13 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 19 place count 90 transition count 124
Applied a total of 19 rules in 8 ms. Remains 90 /101 variables (removed 11) and now considering 124/135 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5940642824212323628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5821332340244732670.kers'
[2026-05-24 05:43:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5940642824212323628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5821332340244732670.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 124 rows 88 cols 245 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 05:43:41] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5821332340244732670.kers
Total runtime 2 ms.
[2026-05-24 05:43:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 05:43:41] [INFO ] Invariant cache hit.
[2026-05-24 05:43:41] [INFO ] State equation strengthened by 86 read => feed constraints.
[2026-05-24 05:43:41] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/101 places, 124/135 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 65 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 55 transition count 80
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 55 transition count 80
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 45 transition count 60
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 45 transition count 60
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 35 transition count 50
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 35 transition count 50
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 118 place count 25 transition count 30
Iterating global reduction 0 with 10 rules applied. Total rules applied 128 place count 25 transition count 30
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 138 place count 15 transition count 20
Iterating global reduction 0 with 10 rules applied. Total rules applied 148 place count 15 transition count 20
Applied a total of 148 rules in 13 ms. Remains 15 /89 variables (removed 74) and now considering 20/124 (removed 104) transitions.
[2026-05-24 05:43:41] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6042673118941531333.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12474476320525861452.kers'
[2026-05-24 05:43:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6042673118941531333.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12474476320525861452.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 14 cols 29 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 05:43:41] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12474476320525861452.kers
Total runtime 0 ms.
[2026-05-24 05:43:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 05:43:41] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2026-05-24 05:43:41] [INFO ] Invariant cache hit.
[2026-05-24 05:43:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-24 05:43:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/101 places, 20/135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 213 ms. Remains : 15/101 places, 20/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-08
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-08 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((F(p0)||G(p1)) U G(p2))||(G(!p0) U p3))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Graph (complete) has 306 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 99 transition count 130
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 13 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 19 place count 90 transition count 124
Applied a total of 19 rules in 19 ms. Remains 90 /101 variables (removed 11) and now considering 124/135 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17803080181445704287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1661164212217584372.kers'
[2026-05-24 05:43:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17803080181445704287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1661164212217584372.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 124 rows 88 cols 245 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-24 05:43:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1661164212217584372.kers
Total runtime 0 ms.
[2026-05-24 05:43:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 05:43:41] [INFO ] Invariant cache hit.
[2026-05-24 05:43:41] [INFO ] State equation strengthened by 86 read => feed constraints.
[2026-05-24 05:43:41] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 142 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/101 places, 124/135 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 102
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 57 transition count 82
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 57 transition count 82
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 48 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 48 transition count 64
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 40 transition count 56
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 40 transition count 56
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 33 transition count 42
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 33 transition count 42
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 119 place count 26 transition count 35
Iterating global reduction 0 with 7 rules applied. Total rules applied 126 place count 26 transition count 35
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 26 transition count 35
Applied a total of 128 rules in 13 ms. Remains 26 /89 variables (removed 63) and now considering 35/124 (removed 89) transitions.
[2026-05-24 05:43:41] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16379783542949987107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5114616090762344682.kers'
[2026-05-24 05:43:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16379783542949987107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5114616090762344682.kers]
Normalized transition count is 29 out of 30 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 25 cols 57 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-24 05:43:41] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5114616090762344682.kers
Total runtime 0 ms.
[2026-05-24 05:43:41] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 05:43:41] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2026-05-24 05:43:41] [INFO ] Invariant cache hit.
[2026-05-24 05:43:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-24 05:43:41] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/101 places, 35/135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 227 ms. Remains : 26/101 places, 35/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((F(p0)||G(p1)) U G(p2))||(G(!p0) U p3))))'
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-09 finished in 677 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 (p1||X(X(X(G(p2)))))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 92 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 91 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 91 transition count 125
Applied a total of 20 rules in 7 ms. Remains 91 /101 variables (removed 10) and now considering 125/135 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17866361193102450780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7717178300765280131.kers'
[2026-05-24 05:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17866361193102450780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7717178300765280131.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 125 rows 89 cols 248 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 05:43:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7717178300765280131.kers
Total runtime 1 ms.
[2026-05-24 05:43:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 05:43:42] [INFO ] Invariant cache hit.
[2026-05-24 05:43:42] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:42] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/101 places, 125/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 90/101 places, 125/135 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 (p1||X(X(X(G(p2)))))))'
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-10 finished in 332 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 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Graph (complete) has 306 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 99 transition count 130
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 13 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 19 place count 90 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 89 transition count 123
Applied a total of 21 rules in 17 ms. Remains 89 /101 variables (removed 12) and now considering 123/135 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2064511230512171472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7590511146959870127.kers'
[2026-05-24 05:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2064511230512171472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7590511146959870127.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 123 rows 87 cols 244 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-24 05:43:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7590511146959870127.kers
Total runtime 0 ms.
[2026-05-24 05:43:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 05:43:42] [INFO ] Invariant cache hit.
[2026-05-24 05:43:42] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:42] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/101 places, 123/135 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 65 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 55 transition count 80
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 55 transition count 80
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 46 transition count 62
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 46 transition count 62
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 37 transition count 53
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 37 transition count 53
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 28 transition count 35
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 28 transition count 35
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 129 place count 19 transition count 26
Iterating global reduction 0 with 9 rules applied. Total rules applied 138 place count 19 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 139 place count 19 transition count 26
Applied a total of 139 rules in 9 ms. Remains 19 /88 variables (removed 69) and now considering 26/123 (removed 97) transitions.
[2026-05-24 05:43:42] [INFO ] Flow matrix only has 22 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-18051116751299541228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7870103310636351677.kers'
[2026-05-24 05:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18051116751299541228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7870103310636351677.kers]
Normalized transition count is 21 out of 22 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 21 rows 18 cols 40 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-24 05:43:42] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7870103310636351677.kers
Total runtime 0 ms.
[2026-05-24 05:43:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 05:43:42] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2026-05-24 05:43:42] [INFO ] Invariant cache hit.
[2026-05-24 05:43:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-05-24 05:43:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/101 places, 26/135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 19/101 places, 26/135 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 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-11
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-11 finished in 360 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&&X(p0))||(p0&&F((p1||G(F(p1)))))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 93 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 93 transition count 127
Applied a total of 16 rules in 9 ms. Remains 93 /101 variables (removed 8) and now considering 127/135 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12815566405823480903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3295020506064232899.kers'
[2026-05-24 05:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12815566405823480903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3295020506064232899.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 127 rows 91 cols 251 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-24 05:43:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3295020506064232899.kers
Total runtime 1 ms.
[2026-05-24 05:43:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 05:43:42] [INFO ] Invariant cache hit.
[2026-05-24 05:43:42] [INFO ] State equation strengthened by 86 read => feed constraints.
[2026-05-24 05:43:43] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 178 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/101 places, 127/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 92/101 places, 127/135 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&&X(p0))||(p0&&F((p1||G(F(p1)))))))))'
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-12
Product exploration explored 100000 steps with 2655 reset in 217 ms.
Stack based approach found an accepted trace after 6817 steps with 168 reset with depth 50 and stack size 47 in 14 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-12 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(p0 U (p1 U (p2||G(p1))))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 95 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 92 transition count 126
Applied a total of 18 rules in 3 ms. Remains 92 /101 variables (removed 9) and now considering 126/135 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17034210898573624663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6985282633959385627.kers'
[2026-05-24 05:43:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17034210898573624663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6985282633959385627.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 126 rows 90 cols 250 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 05:43:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6985282633959385627.kers
Total runtime 0 ms.
[2026-05-24 05:43:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 05:43:43] [INFO ] Invariant cache hit.
[2026-05-24 05:43:43] [INFO ] State equation strengthened by 85 read => feed constraints.
[2026-05-24 05:43:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-05-24 05:43:43] [INFO ] Invariant cache hit.
[2026-05-24 05:43:43] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/218 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 85/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/218 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 179 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3370 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/218 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 85/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 125/304 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 304 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3632 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7015ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 7015ms
Starting structural reductions in LTL mode, iteration 1 : 92/101 places, 126/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7134 ms. Remains : 92/101 places, 126/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(p0 U (p1 U (p2||G(p1))))))'
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-13 finished in 7378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (F(p1)||X(X(p2)))))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 135/135 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 94 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 92 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 92 transition count 126
Applied a total of 18 rules in 5 ms. Remains 92 /101 variables (removed 9) and now considering 126/135 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13183112090739488319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11351898260597794552.kers'
[2026-05-24 05:43:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13183112090739488319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11351898260597794552.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 126 rows 90 cols 250 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 05:43:50] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11351898260597794552.kers
Total runtime 2 ms.
[2026-05-24 05:43:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 05:43:50] [INFO ] Invariant cache hit.
[2026-05-24 05:43:50] [INFO ] State equation strengthened by 86 read => feed constraints.
[2026-05-24 05:43:50] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2026-05-24 05:43:50] [INFO ] Invariant cache hit.
[2026-05-24 05:43:50] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/218 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 86/180 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/218 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 180 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3457 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/218 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 86/180 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 125/305 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 305 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7302ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 7304ms
Starting structural reductions in LTL mode, iteration 1 : 92/101 places, 126/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7437 ms. Remains : 92/101 places, 126/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (F(p1)||X(X(p2)))))))'
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-15
Stuttering criterion allowed to conclude after 270 steps with 3 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-15 finished in 7851 ms.
All properties solved by simple procedures.
Total runtime 61604 ms.

BK_STOP 1779601438673

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-12a"
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-12a, 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-177955695500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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