fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695400236
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DiscoveryGPU-PT-06a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
404.147 20057.00 34916.00 97.20 FFFFFFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.0K Mar 6 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 6 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 6 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 6 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 16:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 6 16:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 22K 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-06a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779594407758

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 03:46:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 03:46:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:46:49] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2026-05-24 03:46:49] [INFO ] Transformed 63 places.
[2026-05-24 03:46:49] [INFO ] Transformed 85 transitions.
[2026-05-24 03:46:49] [INFO ] Found NUPN structural information;
[2026-05-24 03:46:49] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 134 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 5 formulas.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 55 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 55 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 54 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 54 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 54 transition count 70
Applied a total of 23 rules in 21 ms. Remains 54 /63 variables (removed 9) and now considering 70/85 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11837465499348065507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7833249569278591058.kers'
[2026-05-24 03:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11837465499348065507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7833249569278591058.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 70 rows 52 cols 138 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-24 03:46:49] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7833249569278591058.kers
Total runtime 1 ms.
[2026-05-24 03:46:49] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-24 03:46:49] [INFO ] Invariant cache hit.
[2026-05-24 03:46:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 03:46:49] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2026-05-24 03:46:49] [INFO ] Invariant cache hit.
[2026-05-24 03:46:49] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 70/124 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 101 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 70/124 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 69/170 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 170 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1462 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3084ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3094ms
Starting structural reductions in LTL mode, iteration 1 : 54/63 places, 70/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3426 ms. Remains : 54/63 places, 70/85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2026-05-24 03:46:52] [INFO ] Invariant cache hit.
[2026-05-24 03:46:52] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 03:46:52] [INFO ] Invariant cache hit.
[2026-05-24 03:46:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 03:46:52] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 54/54 places, 70/70 transitions.
Support contains 25 out of 54 places after structural reductions.
[2026-05-24 03:46:52] [INFO ] Flatten gal took : 19 ms
[2026-05-24 03:46:52] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:46:52] [INFO ] Input system was already deterministic with 70 transitions.
Support contains 24 out of 54 places (down from 25) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (605 resets) in 825 ms. (48 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40004 steps (87 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
[2026-05-24 03:46:53] [INFO ] Invariant cache hit.
[2026-05-24 03:46:53] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/17 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/29 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/44 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/56 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 84/124 variables, and 56 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 35/54 constraints, ReadFeed: 21/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 159 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(p1||F(G(p2)))))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 49 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 49 transition count 65
Applied a total of 10 rules in 5 ms. Remains 49 /54 variables (removed 5) and now considering 65/70 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16958630222225124283.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7378435432211380164.kers'
[2026-05-24 03:46:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16958630222225124283.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7378435432211380164.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 47 cols 128 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-24 03:46:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7378435432211380164.kers
Total runtime 1 ms.
[2026-05-24 03:46:53] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 03:46:53] [INFO ] Invariant cache hit.
[2026-05-24 03:46:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:53] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2026-05-24 03:46:53] [INFO ] Invariant cache hit.
[2026-05-24 03:46:53] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 94 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 158 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2541ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2543ms
Starting structural reductions in LTL mode, iteration 1 : 49/54 places, 65/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2636 ms. Remains : 49/54 places, 65/70 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(F(G(p1))||p2)))))'
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-02
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-02 finished in 2989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Graph (complete) has 159 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 59 edges and 50 vertex of which 42 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Graph (trivial) has 46 edges and 42 vertex of which 22 / 42 are part of one of the 11 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 31 transition count 54
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 28 place count 25 transition count 43
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 21 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 21 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 17 transition count 27
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 17 transition count 27
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 13 transition count 19
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 13 transition count 19
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 9 transition count 15
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 5 transition count 10
Applied a total of 67 rules in 25 ms. Remains 5 /54 variables (removed 49) and now considering 10/70 (removed 60) transitions.
[2026-05-24 03:46:56] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3158590371922754789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-261150157025791986.kers'
[2026-05-24 03:46:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3158590371922754789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-261150157025791986.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 11 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 03:46:56] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-261150157025791986.kers
Total runtime 0 ms.
[2026-05-24 03:46:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 03:46:56] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 03:46:56] [INFO ] Invariant cache hit.
[2026-05-24 03:46:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-24 03:46:56] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 03:46:56] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 03:46:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/54 places, 10/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 5/54 places, 10/70 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-04
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-04 finished in 271 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||X(F(!p1)))) U p1) U X(p2))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 52 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 52 transition count 68
Applied a total of 4 rules in 4 ms. Remains 52 /54 variables (removed 2) and now considering 68/70 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12060568404842219041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16801820947186078696.kers'
[2026-05-24 03:46:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12060568404842219041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16801820947186078696.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 68 rows 50 cols 134 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-24 03:46:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16801820947186078696.kers
Total runtime 0 ms.
[2026-05-24 03:46:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 03:46:57] [INFO ] Invariant cache hit.
[2026-05-24 03:46:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 03:46:57] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 68/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 51/54 places, 68/70 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||X(F(!p1)))) U p1) U X(p2))))'
Stuttering acceptance computed with spot in 325 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p0) (NOT p2)), p1, (AND p1 p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-05
Product exploration explored 100000 steps with 1535 reset in 266 ms.
Stack based approach found an accepted trace after 5884 steps with 92 reset with depth 5 and stack size 5 in 23 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-05 finished in 783 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(((X(X(X(p0)))&&(!p1 U (p2||G(!p1))))||((!p1 U (p2||G(!p1)))&&F(p3))))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 48 transition count 64
Applied a total of 12 rules in 3 ms. Remains 48 /54 variables (removed 6) and now considering 64/70 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7922616930011570099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2538847318788912523.kers'
[2026-05-24 03:46:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7922616930011570099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2538847318788912523.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 64 rows 46 cols 126 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-24 03:46:57] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2538847318788912523.kers
Total runtime 2 ms.
[2026-05-24 03:46:57] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 03:46:57] [INFO ] Invariant cache hit.
[2026-05-24 03:46:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:46:57] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2026-05-24 03:46:57] [INFO ] Invariant cache hit.
[2026-05-24 03:46:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 93 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 63/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 156 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1200 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2404ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2405ms
Starting structural reductions in LTL mode, iteration 1 : 48/54 places, 64/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2547 ms. Remains : 48/54 places, 64/70 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(((X(X(X(p0)))&&(!p1 U (p2||G(!p1))))||((!p1 U (p2||G(!p1)))&&F(p3))))))'
Stuttering acceptance computed with spot in 565 ms :[(OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3) p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3) p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3) p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-06
Product exploration explored 100000 steps with 4363 reset in 242 ms.
Stack based approach found an accepted trace after 912 steps with 40 reset with depth 28 and stack size 28 in 2 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-06 finished in 3420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U X((G(p2) U p3)))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 49 transition count 65
Applied a total of 10 rules in 2 ms. Remains 49 /54 variables (removed 5) and now considering 65/70 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9393960388681484933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16032611897107026662.kers'
[2026-05-24 03:47:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9393960388681484933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16032611897107026662.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 47 cols 128 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-24 03:47:01] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16032611897107026662.kers
Total runtime 0 ms.
[2026-05-24 03:47:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 03:47:01] [INFO ] Invariant cache hit.
[2026-05-24 03:47:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:47:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2026-05-24 03:47:01] [INFO ] Invariant cache hit.
[2026-05-24 03:47:01] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 94 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 158 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2360ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2360ms
Starting structural reductions in LTL mode, iteration 1 : 49/54 places, 65/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2454 ms. Remains : 49/54 places, 65/70 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1) U X((G(p2) U p3)))))'
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-08
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-08 finished in 2758 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||G(p1)))))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 49 transition count 65
Applied a total of 10 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 65/70 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14136101681913637995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2497567559852520507.kers'
[2026-05-24 03:47:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14136101681913637995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2497567559852520507.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 47 cols 128 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-24 03:47:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2497567559852520507.kers
Total runtime 0 ms.
[2026-05-24 03:47:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 03:47:03] [INFO ] Invariant cache hit.
[2026-05-24 03:47:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:47:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 49/54 places, 65/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 49/54 places, 65/70 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0)||p1))))))'
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-10 finished in 330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U p1)||(F(p3)&&p2))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Graph (complete) has 159 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 53 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 51 transition count 67
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 9 place count 47 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 47 transition count 63
Applied a total of 13 rules in 13 ms. Remains 47 /54 variables (removed 7) and now considering 63/70 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12995454164551334016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11029172625007658268.kers'
[2026-05-24 03:47:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12995454164551334016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11029172625007658268.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 63 rows 45 cols 124 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-24 03:47:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11029172625007658268.kers
Total runtime 0 ms.
[2026-05-24 03:47:04] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-24 03:47:04] [INFO ] Invariant cache hit.
[2026-05-24 03:47:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:47:04] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2026-05-24 03:47:04] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2026-05-24 03:47:04] [INFO ] Invariant cache hit.
[2026-05-24 03:47:04] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 63/110 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 43/92 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/110 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 92 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 63/110 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 43/92 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 62/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 154 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2420ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/54 places, 63/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2512 ms. Remains : 47/54 places, 63/70 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0 U p1)||(F(p3)&&p2))))'
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-11
Product exploration explored 100000 steps with 6578 reset in 170 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-11 finished in 2784 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(p0)) U p0)) U (p1 U p2)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 48 transition count 64
Applied a total of 12 rules in 3 ms. Remains 48 /54 variables (removed 6) and now considering 64/70 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10427318144761824826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1584309306914919315.kers'
[2026-05-24 03:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10427318144761824826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1584309306914919315.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 64 rows 46 cols 126 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-24 03:47:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1584309306914919315.kers
Total runtime 2 ms.
[2026-05-24 03:47:07] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 03:47:07] [INFO ] Invariant cache hit.
[2026-05-24 03:47:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:47:07] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/54 places, 64/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 47/54 places, 64/70 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(p0)) U p0)) U (p1 U p2)))'
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 17 steps with 5 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-12 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Graph (complete) has 159 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 53 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 8 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 48 transition count 64
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 13 place count 47 transition count 63
Applied a total of 13 rules in 7 ms. Remains 47 /54 variables (removed 7) and now considering 63/70 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18391615403301984432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15143520622630245425.kers'
[2026-05-24 03:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18391615403301984432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15143520622630245425.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 63 rows 45 cols 124 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-24 03:47:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15143520622630245425.kers
Total runtime 0 ms.
[2026-05-24 03:47:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 03:47:07] [INFO ] Invariant cache hit.
[2026-05-24 03:47:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:47:07] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2026-05-24 03:47:07] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/54 places, 63/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 47/54 places, 63/70 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-14
Stuttering criterion allowed to conclude after 100 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-14 finished in 143 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 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 70/70 transitions.
Graph (complete) has 159 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 53 transition count 66
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 50 transition count 66
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 46 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 46 transition count 62
Applied a total of 15 rules in 8 ms. Remains 46 /54 variables (removed 8) and now considering 62/70 (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-10455245047603800438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7230062184681642976.kers'
[2026-05-24 03:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10455245047603800438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7230062184681642976.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 62 rows 44 cols 122 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-24 03:47:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7230062184681642976.kers
Total runtime 1 ms.
[2026-05-24 03:47:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-24 03:47:07] [INFO ] Invariant cache hit.
[2026-05-24 03:47:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 03:47:07] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 79 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/54 places, 62/70 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 34 transition count 51
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 30 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 30 transition count 43
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 26 transition count 35
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 26 transition count 35
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 22 transition count 31
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 22 transition count 31
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 18 transition count 23
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 18 transition count 23
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 14 transition count 19
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 14 transition count 19
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 63 place count 14 transition count 19
Applied a total of 63 rules in 6 ms. Remains 14 /45 variables (removed 31) and now considering 19/62 (removed 43) transitions.
[2026-05-24 03:47:07] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4381188447591175985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3204290300790185695.kers'
[2026-05-24 03:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4381188447591175985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3204290300790185695.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 13 cols 30 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 03:47:07] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3204290300790185695.kers
Total runtime 0 ms.
[2026-05-24 03:47:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 03:47:07] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2026-05-24 03:47:07] [INFO ] Invariant cache hit.
[2026-05-24 03:47:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-24 03:47:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/54 places, 19/70 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 140 ms. Remains : 14/54 places, 19/70 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 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-15 finished in 193 ms.
All properties solved by simple procedures.
Total runtime 18844 ms.

BK_STOP 1779594427815

--------------------
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-06a"
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-06a, 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-177955695400236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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