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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 8.5K Mar 6 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 6 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 16:13 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.8K Mar 15 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 16:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 6 16:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Mar 6 16:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:11 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 28K 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-08a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779595621248

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 04:07:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 04:07:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:07:02] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2026-05-24 04:07:02] [INFO ] Transformed 83 places.
[2026-05-24 04:07:02] [INFO ] Transformed 113 transitions.
[2026-05-24 04:07:02] [INFO ] Found NUPN structural information;
[2026-05-24 04:07:02] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 81 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 111
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 79 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 79 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 78 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 78 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 17 place count 78 transition count 100
Applied a total of 17 rules in 29 ms. Remains 78 /83 variables (removed 5) and now considering 100/113 (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-1692552327934571894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10515462233355807119.kers'
[2026-05-24 04:07:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1692552327934571894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10515462233355807119.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 100 rows 76 cols 193 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-24 04:07:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10515462233355807119.kers
Total runtime 2 ms.
[2026-05-24 04:07:02] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-24 04:07:02] [INFO ] Invariant cache hit.
[2026-05-24 04:07:03] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 04:07:03] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 336 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 100/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 383 ms. Remains : 77/83 places, 100/113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 100/100 (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-4292220372528633423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3559412320912365760.kers'
[2026-05-24 04:07:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4292220372528633423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3559412320912365760.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 100 rows 76 cols 193 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-24 04:07:03] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3559412320912365760.kers
Total runtime 0 ms.
[2026-05-24 04:07:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 04:07:03] [INFO ] Invariant cache hit.
[2026-05-24 04:07:03] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-24 04:07:03] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2026-05-24 04:07:03] [INFO ] Invariant cache hit.
[2026-05-24 04:07:03] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/177 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 46/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 124 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/177 variables, 77/78 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 46/124 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 99/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 223 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2589 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5132ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 5146ms
Finished structural reductions in LTL mode , in 1 iterations and 5306 ms. Remains : 77/77 places, 100/100 transitions.
Support contains 26 out of 77 places after structural reductions.
[2026-05-24 04:07:08] [INFO ] Flatten gal took : 23 ms
[2026-05-24 04:07:08] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:07:08] [INFO ] Input system was already deterministic with 100 transitions.
RANDOM walk for 40000 steps (464 resets) in 666 ms. (59 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40004 steps (58 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
[2026-05-24 04:07:08] [INFO ] Invariant cache hit.
[2026-05-24 04:07:08] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/27 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/74 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/74 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/89 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/89 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 21/110 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/110 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/110 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 21/131 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/131 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/131 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 14/145 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/145 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 12/157 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/157 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 10/167 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/167 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 10/177 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/177 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/177 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/27 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Int declared 27/177 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/77 constraints, ReadFeed: 10/46 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 187 edges and 77 vertex of which 71 are kept as prefixes of interest. Removing 6 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' '!(G(F(p0)))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Graph (complete) has 187 edges and 77 vertex of which 72 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 80 edges and 70 vertex of which 60 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 66 edges and 60 vertex of which 32 / 60 are part of one of the 16 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 44 transition count 75
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 38 place count 35 transition count 59
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 30 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 30 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 25 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 25 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 20 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 20 transition count 29
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 15 transition count 24
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 12 transition count 21
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 85 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 9 transition count 17
Applied a total of 88 rules in 20 ms. Remains 9 /77 variables (removed 68) and now considering 17/100 (removed 83) transitions.
[2026-05-24 04:07:09] [INFO ] Flow matrix only has 12 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-12609671759019254594.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10918880492716357839.kers'
[2026-05-24 04:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12609671759019254594.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10918880492716357839.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 17 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 04:07:09] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10918880492716357839.kers
Total runtime 0 ms.
[2026-05-24 04:07:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 04:07:09] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
[2026-05-24 04:07:09] [INFO ] Invariant cache hit.
[2026-05-24 04:07:09] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-24 04:07:09] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 04:07:09] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
[2026-05-24 04:07:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/20 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 72 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/77 places, 17/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 9/77 places, 17/100 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 190 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-00 finished in 484 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)))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 68 transition count 91
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 68 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 64 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 64 transition count 87
Applied a total of 26 rules in 9 ms. Remains 64 /77 variables (removed 13) and now considering 87/100 (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-9345657644318607016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-476419431404351862.kers'
[2026-05-24 04:07:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9345657644318607016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-476419431404351862.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 87 rows 63 cols 171 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-24 04:07:09] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-476419431404351862.kers
Total runtime 0 ms.
[2026-05-24 04:07:09] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 04:07:09] [INFO ] Invariant cache hit.
[2026-05-24 04:07:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 04:07:09] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2026-05-24 04:07:09] [INFO ] Invariant cache hit.
[2026-05-24 04:07:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/151 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/151 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 107 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/151 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 86/193 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 193 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3681ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3681ms
Starting structural reductions in LTL mode, iteration 1 : 64/77 places, 87/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3804 ms. Remains : 64/77 places, 87/100 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)))'
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-02 finished in 3962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 67 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 67 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 63 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 63 transition count 86
Applied a total of 28 rules in 15 ms. Remains 63 /77 variables (removed 14) and now considering 86/100 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11502854453983899941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12520426216178930958.kers'
[2026-05-24 04:07:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11502854453983899941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12520426216178930958.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 86 rows 62 cols 170 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-24 04:07:13] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12520426216178930958.kers
Total runtime 1 ms.
[2026-05-24 04:07:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 04:07:13] [INFO ] Invariant cache hit.
[2026-05-24 04:07:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 04:07:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-24 04:07:13] [INFO ] Invariant cache hit.
[2026-05-24 04:07:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/149 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 42/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/149 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 106 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1766 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/149 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 42/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 191 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1893 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3666ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3667ms
Starting structural reductions in LTL mode, iteration 1 : 63/77 places, 86/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3799 ms. Remains : 63/77 places, 86/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-03
Stuttering criterion allowed to conclude after 347 steps with 4 reset in 9 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-03 finished in 3964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Graph (complete) has 187 edges and 77 vertex of which 73 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 81 edges and 71 vertex of which 62 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 59 edges and 62 vertex of which 26 / 62 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 49 transition count 77
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 36 place count 40 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 39 transition count 63
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 42 place count 34 transition count 53
Iterating global reduction 3 with 5 rules applied. Total rules applied 47 place count 34 transition count 53
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 29 transition count 43
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 29 transition count 43
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 26 transition count 37
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 26 transition count 37
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 23 transition count 34
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 23 transition count 34
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 3 with 2 rules applied. Total rules applied 71 place count 22 transition count 33
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 3 with 2 rules applied. Total rules applied 73 place count 21 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 21 transition count 31
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 21 transition count 31
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 19 transition count 29
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 19 transition count 29
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 15 transition count 25
Applied a total of 87 rules in 14 ms. Remains 15 /77 variables (removed 62) and now considering 25/100 (removed 75) transitions.
[2026-05-24 04:07:17] [INFO ] Flow matrix only has 21 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-13996552092764767367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10818683741529495373.kers'
[2026-05-24 04:07:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13996552092764767367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10818683741529495373.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 15 cols 35 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-24 04:07:17] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10818683741529495373.kers
Total runtime 0 ms.
[2026-05-24 04:07:17] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 04:07:17] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2026-05-24 04:07:17] [INFO ] Invariant cache hit.
[2026-05-24 04:07:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2026-05-24 04:07:17] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-24 04:07:17] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2026-05-24 04:07:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 7/35 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/36 variables, and 15 constraints, problems are : Problem set: 0 solved, 15 unsolved in 129 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 7/35 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/36 variables, and 30 constraints, problems are : Problem set: 0 solved, 15 unsolved in 133 ms.
Refiners :[State Equation: 15/15 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 265ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/77 places, 25/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 15/77 places, 25/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-04 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X(X(F(p1))))))))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 95
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 67 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 67 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 62 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 62 transition count 85
Applied a total of 30 rules in 13 ms. Remains 62 /77 variables (removed 15) and now considering 85/100 (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-13204164575432294304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17455189349511970058.kers'
[2026-05-24 04:07:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13204164575432294304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17455189349511970058.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 61 cols 168 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-24 04:07:18] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17455189349511970058.kers
Total runtime 2 ms.
[2026-05-24 04:07:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 04:07:18] [INFO ] Invariant cache hit.
[2026-05-24 04:07:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-24 04:07:18] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2026-05-24 04:07:18] [INFO ] Invariant cache hit.
[2026-05-24 04:07:18] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/147 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 104 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/147 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 84/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3483ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3484ms
Starting structural reductions in LTL mode, iteration 1 : 62/77 places, 85/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3593 ms. Remains : 62/77 places, 85/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X(X(F(p1))))))))'
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-08
Product exploration explored 100000 steps with 16666 reset in 175 ms.
Product exploration explored 100000 steps with 16666 reset in 143 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 167 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 428 steps (3 resets) in 6 ms. (61 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 376 ms.
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2026-05-24 04:07:23] [INFO ] Invariant cache hit.
[2026-05-24 04:07:23] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 04:07:23] [INFO ] Invariant cache hit.
[2026-05-24 04:07:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-24 04:07:23] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 62/62 places, 85/85 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 167 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge based reduction with 1 factoid took 54 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 731 steps (6 resets) in 8 ms. (81 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 384 ms.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16666 reset in 104 ms.
Product exploration explored 100000 steps with 16666 reset in 107 ms.
Spot run failed in 90 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/ltsmin11802055650522226044
[2026-05-24 04:07:24] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11802055650522226044
Running compilation step : cd /tmp/ltsmin11802055650522226044;'/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 267 ms.
Running link step : cd /tmp/ltsmin11802055650522226044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11802055650522226044;'/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/stateBased13703083785404918587.hoa' '--buchi-type=spotba'
LTSmin run took 46 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-08 finished in 6616 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(X(X(G(p0))))||(G(p1)&&F(p2))))))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 66 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 66 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 61 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 61 transition count 84
Applied a total of 32 rules in 6 ms. Remains 61 /77 variables (removed 16) and now considering 84/100 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10118220237257312481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12708950423734118673.kers'
[2026-05-24 04:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10118220237257312481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12708950423734118673.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 84 rows 60 cols 166 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-24 04:07:24] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12708950423734118673.kers
Total runtime 0 ms.
[2026-05-24 04:07:24] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 04:07:24] [INFO ] Invariant cache hit.
[2026-05-24 04:07:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-24 04:07:24] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2026-05-24 04:07:24] [INFO ] Invariant cache hit.
[2026-05-24 04:07:24] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/145 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/145 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 103 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/145 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 83/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 186 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3376ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3377ms
Starting structural reductions in LTL mode, iteration 1 : 61/77 places, 84/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3471 ms. Remains : 61/77 places, 84/100 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(X(X(G(p0))))||(G(p1)&&F(p2))))))'
Stuttering acceptance computed with spot in 593 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 90 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-09 finished in 4108 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 G(p1)))) U !(!p2 U (p2 U p3)))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 73 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 73 transition count 96
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 70 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 70 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 68 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 68 transition count 91
Applied a total of 18 rules in 8 ms. Remains 68 /77 variables (removed 9) and now considering 91/100 (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-6029365002697172749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17722662043399418462.kers'
[2026-05-24 04:07:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6029365002697172749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17722662043399418462.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 91 rows 67 cols 178 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-24 04:07:28] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17722662043399418462.kers
Total runtime 1 ms.
[2026-05-24 04:07:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 04:07:28] [INFO ] Invariant cache hit.
[2026-05-24 04:07:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 04:07:28] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-24 04:07:28] [INFO ] Invariant cache hit.
[2026-05-24 04:07:28] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 91/159 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 43/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/159 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 112 constraints, problems are : Problem set: 0 solved, 90 unsolved in 1803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 91/159 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 43/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 90/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 202 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4007ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 4008ms
Starting structural reductions in LTL mode, iteration 1 : 68/77 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4112 ms. Remains : 68/77 places, 91/100 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 G(p1)))) U !(!p2 U (p2 U p3)))))'
Stuttering acceptance computed with spot in 631 ms :[p3, p3, (NOT p1), (AND (NOT p1) p3), p3, (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (OR (AND p1 p3) (AND p0 p3)), (OR (AND p1 p3) (AND p0 p3)), (AND p0 (NOT p1) p3), (AND p0 (NOT p1) p3)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-11 finished in 4812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U X((p1||G(p2))))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 68 transition count 91
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 68 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 64 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 64 transition count 87
Applied a total of 26 rules in 9 ms. Remains 64 /77 variables (removed 13) and now considering 87/100 (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-16014845532283538586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11042353769259190440.kers'
[2026-05-24 04:07:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16014845532283538586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11042353769259190440.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 87 rows 63 cols 171 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-24 04:07:33] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11042353769259190440.kers
Total runtime 0 ms.
[2026-05-24 04:07:33] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 04:07:33] [INFO ] Invariant cache hit.
[2026-05-24 04:07:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 04:07:33] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2026-05-24 04:07:33] [INFO ] Invariant cache hit.
[2026-05-24 04:07:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/151 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/151 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 107 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/151 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 86/193 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 193 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3641ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3641ms
Starting structural reductions in LTL mode, iteration 1 : 64/77 places, 87/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3751 ms. Remains : 64/77 places, 87/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U X((p1||G(p2))))))'
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 108 ms.
Product exploration explored 100000 steps with 33333 reset in 137 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 170 edges and 64 vertex of which 62 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Detected a total of 10/64 stabilizing places and 9/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 19 ms. Proved property starting from automaton with 6 states, 11 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-13 finished in 4292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1&&F(p2))))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 100/100 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 95
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 69 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 69 transition count 92
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 66 transition count 89
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 66 transition count 89
Applied a total of 22 rules in 5 ms. Remains 66 /77 variables (removed 11) and now considering 89/100 (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-3645621047842160355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3084568423655292628.kers'
[2026-05-24 04:07:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3645621047842160355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3084568423655292628.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 89 rows 65 cols 175 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-24 04:07:37] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3084568423655292628.kers
Total runtime 0 ms.
[2026-05-24 04:07:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 04:07:38] [INFO ] Invariant cache hit.
[2026-05-24 04:07:38] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-24 04:07:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-24 04:07:38] [INFO ] Invariant cache hit.
[2026-05-24 04:07:38] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 89/155 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/155 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 110 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1805 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 89/155 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 88/198 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 198 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1899 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3713ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3713ms
Starting structural reductions in LTL mode, iteration 1 : 66/77 places, 89/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3814 ms. Remains : 66/77 places, 89/100 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((F(p1)&&p2)))))'
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Product exploration explored 100000 steps with 33333 reset in 137 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 173 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 20 ms. Proved property starting from automaton with 8 states, 15 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-14 finished in 4476 ms.
All properties solved by simple procedures.
Total runtime 40026 ms.

BK_STOP 1779595662499

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-08a"
export BK_EXAMINATION="LTLCardinality"
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-08a, examination is LTLCardinality"
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-177955695400267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08a.tgz
mv DiscoveryGPU-PT-08a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;