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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
501.691 15061.00 29284.00 106.70 FFFFFTFTFFTFFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695500299.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-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.7K Mar 6 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 6 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 16:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 16:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 6 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 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 36K 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-10a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779598579345

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 04:56:20] [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:56:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:56:20] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2026-05-24 04:56:20] [INFO ] Transformed 103 places.
[2026-05-24 04:56:20] [INFO ] Transformed 141 transitions.
[2026-05-24 04:56:20] [INFO ] Found NUPN structural information;
[2026-05-24 04:56:20] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 142 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 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 90 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 90 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 86 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 86 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 86 transition count 114
Applied a total of 40 rules in 38 ms. Remains 86 /103 variables (removed 17) and now considering 114/141 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17707946548758305807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12718069394520881717.kers'
[2026-05-24 04:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17707946548758305807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12718069394520881717.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 114 rows 84 cols 224 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-24 04:56:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12718069394520881717.kers
Total runtime 1 ms.
[2026-05-24 04:56:21] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-24 04:56:21] [INFO ] Invariant cache hit.
[2026-05-24 04:56:21] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-24 04:56:21] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-24 04:56:21] [INFO ] Invariant cache hit.
[2026-05-24 04:56:21] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/200 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 74/162 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 162 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/200 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 74/162 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 113/275 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 275 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3376 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6809ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 6825ms
Starting structural reductions in LTL mode, iteration 1 : 86/103 places, 114/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7254 ms. Remains : 86/103 places, 114/141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2026-05-24 04:56:28] [INFO ] Invariant cache hit.
[2026-05-24 04:56:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 04:56:28] [INFO ] Invariant cache hit.
[2026-05-24 04:56:28] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-24 04:56:28] [INFO ] Implicit Places using invariants and state equation in 80 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 120 ms. Remains : 86/86 places, 114/114 transitions.
Support contains 33 out of 86 places after structural reductions.
[2026-05-24 04:56:28] [INFO ] Flatten gal took : 30 ms
[2026-05-24 04:56:28] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:56:28] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 40001 steps (367 resets) in 955 ms. (41 steps per ms) remains 2/23 properties
BEST_FIRST walk for 40004 steps (33 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 317 ms. (125 steps per ms) remains 2/2 properties
[2026-05-24 04:56:28] [INFO ] Invariant cache hit.
[2026-05-24 04:56:28] [INFO ] State equation strengthened by 74 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/20 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 8/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 51/200 variables, and 34 constraints, problems are : Problem set: 2 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 24/86 constraints, ReadFeed: 8/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 257 edges and 86 vertex of which 83 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (F(p1)&&X((X(!p0) U ((!p2&&X(!p0))||X(G(!p0))))))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 81 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 81 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 78 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 78 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 76 transition count 104
Applied a total of 20 rules in 8 ms. Remains 76 /86 variables (removed 10) and now considering 104/114 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17712037977481351973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14239287121146636784.kers'
[2026-05-24 04:56:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17712037977481351973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14239287121146636784.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 104 rows 74 cols 206 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:56:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14239287121146636784.kers
Total runtime 1 ms.
[2026-05-24 04:56:29] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 04:56:29] [INFO ] Invariant cache hit.
[2026-05-24 04:56:29] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:56:29] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/86 places, 104/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 75/86 places, 104/114 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (F(p1)&&X((X(!p0) U ((!p2&&X(!p0))||X(G(!p0))))))))'
Stuttering acceptance computed with spot in 633 ms :[(OR (NOT p1) p0), (NOT p1), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-00
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 8 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-00 finished in 903 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||F(p1))))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Graph (complete) has 257 edges and 86 vertex of which 84 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 97 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Graph (trivial) has 83 edges and 75 vertex of which 40 / 75 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 55 transition count 94
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 47 place count 44 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 37 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 37 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 30 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 30 transition count 46
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 82 place count 23 transition count 32
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 23 transition count 32
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 16 transition count 25
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 16 transition count 25
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 109 place count 13 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 13 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 10 transition count 18
Applied a total of 113 rules in 28 ms. Remains 10 /86 variables (removed 76) and now considering 18/114 (removed 96) transitions.
[2026-05-24 04:56:30] [INFO ] Flow matrix only has 13 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-14433444978709585586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4914430039746397898.kers'
[2026-05-24 04:56:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14433444978709585586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4914430039746397898.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 10 cols 19 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 04:56:30] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4914430039746397898.kers
Total runtime 0 ms.
[2026-05-24 04:56:30] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 04:56:30] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
[2026-05-24 04:56:30] [INFO ] Invariant cache hit.
[2026-05-24 04:56:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 04:56:30] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 04:56:30] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
[2026-05-24 04:56:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/22 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 85 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/22 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 95 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/86 places, 18/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 10/86 places, 18/114 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)||p1)))'
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-01 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 82 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 110
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 80 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 80 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 78 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 78 transition count 106
Applied a total of 16 rules in 16 ms. Remains 78 /86 variables (removed 8) and now considering 106/114 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1931991020489115870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4048050299634326224.kers'
[2026-05-24 04:56:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1931991020489115870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4048050299634326224.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 106 rows 76 cols 210 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-24 04:56:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4048050299634326224.kers
Total runtime 0 ms.
[2026-05-24 04:56:30] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 04:56:30] [INFO ] Invariant cache hit.
[2026-05-24 04:56:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:56:30] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/86 places, 106/114 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 77/86 places, 106/114 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-02
Product exploration explored 100000 steps with 934 reset in 233 ms.
Stack based approach found an accepted trace after 3560 steps with 32 reset with depth 86 and stack size 82 in 7 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-02 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(X(p1))&&F(p2))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 81 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 81 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 78 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 78 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 76 transition count 104
Applied a total of 20 rules in 9 ms. Remains 76 /86 variables (removed 10) and now considering 104/114 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17665692622228857786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10063995248981985494.kers'
[2026-05-24 04:56:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17665692622228857786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10063995248981985494.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 104 rows 74 cols 206 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:56:31] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10063995248981985494.kers
Total runtime 0 ms.
[2026-05-24 04:56:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-24 04:56:31] [INFO ] Invariant cache hit.
[2026-05-24 04:56:31] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:56:31] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/86 places, 104/114 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 75/86 places, 104/114 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(X(p1))&&F(p2))))'
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-06
Product exploration explored 100000 steps with 15225 reset in 279 ms.
Stack based approach found an accepted trace after 217 steps with 41 reset with depth 9 and stack size 9 in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-06 finished in 762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 81 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 81 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 79 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 79 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 78 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 78 transition count 106
Applied a total of 16 rules in 4 ms. Remains 78 /86 variables (removed 8) and now considering 106/114 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-161359576391595765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17277576007490212248.kers'
[2026-05-24 04:56:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-161359576391595765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17277576007490212248.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 106 rows 76 cols 210 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-24 04:56:31] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17277576007490212248.kers
Total runtime 4 ms.
[2026-05-24 04:56:31] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 04:56:31] [INFO ] Invariant cache hit.
[2026-05-24 04:56:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:56:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 156 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/86 places, 106/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 77/86 places, 106/114 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Computed a total of 12 stabilizing places and 11 stable transitions
Graph (complete) has 209 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 11 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 20 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-07 finished in 691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Graph (complete) has 257 edges and 86 vertex of which 83 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 96 edges and 80 vertex of which 70 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 78 edges and 70 vertex of which 38 / 70 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 51 transition count 90
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 44 place count 41 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 52 place count 33 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 33 transition count 55
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 25 transition count 39
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 25 transition count 39
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 17 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 17 transition count 23
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 9 transition count 15
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 5 transition count 10
Applied a total of 115 rules in 11 ms. Remains 5 /86 variables (removed 81) and now considering 10/114 (removed 104) transitions.
[2026-05-24 04:56:32] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18009243421488649541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10182950048421110986.kers'
[2026-05-24 04:56:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18009243421488649541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10182950048421110986.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 11 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 04:56:32] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10182950048421110986.kers
Total runtime 0 ms.
[2026-05-24 04:56:32] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 04:56:32] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 04:56:32] [INFO ] Invariant cache hit.
[2026-05-24 04:56:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 04:56:32] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 04:56:32] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 04:56:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/86 places, 10/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 5/86 places, 10/114 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-08 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 82 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 82 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 79 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 79 transition count 107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 77 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 77 transition count 105
Applied a total of 18 rules in 8 ms. Remains 77 /86 variables (removed 9) and now considering 105/114 (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-3845208266520643413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9623467277837659827.kers'
[2026-05-24 04:56:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3845208266520643413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9623467277837659827.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 105 rows 75 cols 208 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-24 04:56:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9623467277837659827.kers
Total runtime 0 ms.
[2026-05-24 04:56:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 04:56:32] [INFO ] Invariant cache hit.
[2026-05-24 04:56:32] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:56:32] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 157 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 105/114 transitions.
Applied a total of 0 rules in 10 ms. Remains 76 /76 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 76/86 places, 105/114 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(p1)))'
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Computed a total of 12 stabilizing places and 11 stable transitions
Graph (complete) has 207 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 12 stabilizing places and 11 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 18 ms. Proved property starting from automaton with 5 states, 9 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-10 finished in 755 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((X(X(X(p0)))||G(!p1)||(!p1&&G(F(!p2))))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 114/114 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 83 transition count 111
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 83 transition count 111
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 81 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 81 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 80 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 80 transition count 108
Applied a total of 12 rules in 8 ms. Remains 80 /86 variables (removed 6) and now considering 108/114 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17437024305600187926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10541629569213203781.kers'
[2026-05-24 04:56:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17437024305600187926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10541629569213203781.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 108 rows 78 cols 213 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-24 04:56:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10541629569213203781.kers
Total runtime 1 ms.
[2026-05-24 04:56:33] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 04:56:33] [INFO ] Invariant cache hit.
[2026-05-24 04:56:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:56:33] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/86 places, 108/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 79/86 places, 108/114 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((X(X(X(p0)))||G(p1)||(G(F(p3))&&p2))))'
Stuttering acceptance computed with spot in 632 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLCardinality-13 finished in 856 ms.
All properties solved by simple procedures.
Total runtime 13782 ms.

BK_STOP 1779598594406

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

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