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-177955695500307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DiscoveryGPU-PT-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K Mar 6 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 6 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 16:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 16:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 16:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 75K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779598784173

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-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 04:59:45] [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:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:59:45] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2026-05-24 04:59:45] [INFO ] Transformed 296 places.
[2026-05-24 04:59:45] [INFO ] Transformed 314 transitions.
[2026-05-24 04:59:45] [INFO ] Found NUPN structural information;
[2026-05-24 04:59:45] [INFO ] Parsed PT model containing 296 places and 314 transitions and 819 arcs in 165 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 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 277 transition count 314
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 62 place count 234 transition count 271
Iterating global reduction 1 with 43 rules applied. Total rules applied 105 place count 234 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 114 place count 225 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 123 place count 225 transition count 262
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 130 place count 218 transition count 255
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 218 transition count 255
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 144 place count 211 transition count 248
Iterating global reduction 1 with 7 rules applied. Total rules applied 151 place count 211 transition count 248
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 158 place count 204 transition count 234
Iterating global reduction 1 with 7 rules applied. Total rules applied 165 place count 204 transition count 234
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 172 place count 197 transition count 227
Iterating global reduction 1 with 7 rules applied. Total rules applied 179 place count 197 transition count 227
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 184 place count 192 transition count 222
Iterating global reduction 1 with 5 rules applied. Total rules applied 189 place count 192 transition count 222
Applied a total of 189 rules in 100 ms. Remains 192 /296 variables (removed 104) and now considering 222/314 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1225813870405256483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14860074205262254597.kers'
[2026-05-24 04:59:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1225813870405256483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14860074205262254597.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 192 cols 589 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-24 04:59:45] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14860074205262254597.kers
Total runtime 2 ms.
[2026-05-24 04:59:46] [INFO ] Implicit Places using invariants in 402 ms returned []
[2026-05-24 04:59:46] [INFO ] Invariant cache hit.
[2026-05-24 04:59:46] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-24 04:59:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/413 variables, 191/193 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 11/204 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 1/414 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 205 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16943 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/413 variables, 191/204 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 220/424 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/414 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/414 variables, and 427 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47066ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 47077ms
Starting structural reductions in LTL mode, iteration 1 : 192/296 places, 222/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47971 ms. Remains : 192/296 places, 222/314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2026-05-24 05:00:33] [INFO ] Invariant cache hit.
[2026-05-24 05:00:33] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-24 05:00:33] [INFO ] Invariant cache hit.
[2026-05-24 05:00:33] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 192/192 places, 222/222 transitions.
Support contains 21 out of 192 places after structural reductions.
[2026-05-24 05:00:34] [INFO ] Flatten gal took : 38 ms
[2026-05-24 05:00:34] [INFO ] Flatten gal took : 16 ms
[2026-05-24 05:00:34] [INFO ] Input system was already deterministic with 222 transitions.
RANDOM walk for 7463 steps (21 resets) in 316 ms. (23 steps per ms) remains 0/14 properties
Computed a total of 34 stabilizing places and 34 stable transitions
Graph (complete) has 372 edges and 192 vertex of which 186 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 222/222 transitions.
Graph (complete) has 372 edges and 192 vertex of which 186 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 185 transition count 186
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 155 transition count 186
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 61 place count 155 transition count 157
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 119 place count 126 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 122 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 122 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 127 place count 122 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 121 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 119 transition count 150
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 119 transition count 150
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 117 transition count 146
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 117 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 115 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 115 transition count 144
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 233 place count 69 transition count 98
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 242 place count 60 transition count 80
Iterating global reduction 2 with 9 rules applied. Total rules applied 251 place count 60 transition count 80
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 260 place count 51 transition count 71
Iterating global reduction 2 with 9 rules applied. Total rules applied 269 place count 51 transition count 71
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 278 place count 42 transition count 53
Iterating global reduction 2 with 9 rules applied. Total rules applied 287 place count 42 transition count 53
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 296 place count 33 transition count 44
Iterating global reduction 2 with 9 rules applied. Total rules applied 305 place count 33 transition count 44
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 313 place count 25 transition count 28
Iterating global reduction 2 with 8 rules applied. Total rules applied 321 place count 25 transition count 28
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 329 place count 17 transition count 20
Iterating global reduction 2 with 8 rules applied. Total rules applied 337 place count 17 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 17 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 339 place count 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 341 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 345 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 346 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 346 place count 9 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 348 place count 8 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 352 place count 6 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 355 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 5 transition count 9
Applied a total of 356 rules in 52 ms. Remains 5 /192 variables (removed 187) and now considering 9/222 (removed 213) transitions.
[2026-05-24 05:00:34] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6736368518480598156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10963402767261423451.kers'
[2026-05-24 05:00:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6736368518480598156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10963402767261423451.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 13 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 05:00:34] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10963402767261423451.kers
Total runtime 0 ms.
[2026-05-24 05:00:34] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 05:00:34] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2026-05-24 05:00:34] [INFO ] Invariant cache hit.
[2026-05-24 05:00:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 05:00:34] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 05:00:34] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2026-05-24 05:00:34] [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) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/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 51 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) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/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 45 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 99ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/192 places, 9/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 5/192 places, 9/222 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 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-02 finished in 492 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||X(X(X(!p1)))))) U (G(X(F((!p0||X(X(X(!p1)))))))||(X(F((!p0||X(X(X(!p1))))))&&p2))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 222/222 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 184 transition count 214
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 184 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 181 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 181 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 180 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 180 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 179 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 179 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 178 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 178 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 177 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 177 transition count 206
Applied a total of 30 rules in 29 ms. Remains 177 /192 variables (removed 15) and now considering 206/222 (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-11098066048115658393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8063559126533837138.kers'
[2026-05-24 05:00:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11098066048115658393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8063559126533837138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 177 cols 552 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-24 05:00:34] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8063559126533837138.kers
Total runtime 1 ms.
[2026-05-24 05:00:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 05:00:34] [INFO ] Invariant cache hit.
[2026-05-24 05:00:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-24 05:00:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 206/382 variables, 176/178 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 10/188 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 1/383 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 189 constraints, problems are : Problem set: 0 solved, 205 unsolved in 13803 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/382 variables, 176/188 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 204/392 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 1/383 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/383 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 394 constraints, problems are : Problem set: 0 solved, 205 unsolved in 24968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38806ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 38807ms
Starting structural reductions in LTL mode, iteration 1 : 177/192 places, 206/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39024 ms. Remains : 177/192 places, 206/222 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||X(X(X(!p1)))))) U (G(X(F((!p0||X(X(X(!p1)))))))||(X(F((!p0||X(X(X(!p1))))))&&p2))))'
Stuttering acceptance computed with spot in 241 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-04
Product exploration explored 100000 steps with 425 reset in 356 ms.
Stack based approach found an accepted trace after 171 steps with 0 reset with depth 172 and stack size 172 in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-04 finished in 39673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 222/222 transitions.
Graph (complete) has 372 edges and 192 vertex of which 186 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 185 transition count 188
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 157 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 155 transition count 186
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 61 place count 155 transition count 157
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 119 place count 126 transition count 157
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 123 place count 122 transition count 153
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 122 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 127 place count 122 transition count 152
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 129 place count 121 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 119 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 119 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 117 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 117 transition count 146
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 115 transition count 144
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 115 transition count 144
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 231 place count 70 transition count 99
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 239 place count 62 transition count 83
Iterating global reduction 3 with 8 rules applied. Total rules applied 247 place count 62 transition count 83
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 255 place count 54 transition count 75
Iterating global reduction 3 with 8 rules applied. Total rules applied 263 place count 54 transition count 75
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 271 place count 46 transition count 59
Iterating global reduction 3 with 8 rules applied. Total rules applied 279 place count 46 transition count 59
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 287 place count 38 transition count 51
Iterating global reduction 3 with 8 rules applied. Total rules applied 295 place count 38 transition count 51
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 302 place count 31 transition count 37
Iterating global reduction 3 with 7 rules applied. Total rules applied 309 place count 31 transition count 37
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 316 place count 24 transition count 30
Iterating global reduction 3 with 7 rules applied. Total rules applied 323 place count 24 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 24 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 325 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 22 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 24 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 333 place count 17 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 336 place count 14 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 336 place count 14 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 338 place count 13 transition count 20
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 5 with 2 rules applied. Total rules applied 340 place count 12 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 344 place count 10 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 347 place count 10 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 349 place count 8 transition count 15
Applied a total of 349 rules in 35 ms. Remains 8 /192 variables (removed 184) and now considering 15/222 (removed 207) transitions.
[2026-05-24 05:01:14] [INFO ] Flow matrix only has 13 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-6979425738939563435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9336864653915080562.kers'
[2026-05-24 05:01:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6979425738939563435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9336864653915080562.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 8 cols 21 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 05:01:14] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9336864653915080562.kers
Total runtime 4 ms.
[2026-05-24 05:01:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 05:01:14] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2026-05-24 05:01:14] [INFO ] Invariant cache hit.
[2026-05-24 05:01:14] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-24 05:01:14] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 05:01:14] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2026-05-24 05:01:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 63 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/20 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 68 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 134ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/192 places, 15/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 8/192 places, 15/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-05 finished in 295 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(p1)||G(p2))&&p0)))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 222/222 transitions.
Graph (complete) has 372 edges and 192 vertex of which 186 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 185 transition count 188
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 157 transition count 188
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 57 place count 157 transition count 160
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 113 place count 129 transition count 160
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 126 transition count 157
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 126 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 124 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 124 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 122 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 122 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 120 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 120 transition count 149
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 223 place count 74 transition count 103
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 231 place count 66 transition count 87
Iterating global reduction 2 with 8 rules applied. Total rules applied 239 place count 66 transition count 87
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 247 place count 58 transition count 79
Iterating global reduction 2 with 8 rules applied. Total rules applied 255 place count 58 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 262 place count 51 transition count 65
Iterating global reduction 2 with 7 rules applied. Total rules applied 269 place count 51 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 276 place count 44 transition count 58
Iterating global reduction 2 with 7 rules applied. Total rules applied 283 place count 44 transition count 58
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 289 place count 38 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 295 place count 38 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 301 place count 32 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 307 place count 32 transition count 40
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 308 place count 32 transition count 39
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 32 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 30 transition count 37
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 314 place count 29 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 28 transition count 36
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 315 place count 28 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 323 place count 24 transition count 32
Applied a total of 323 rules in 59 ms. Remains 24 /192 variables (removed 168) and now considering 32/222 (removed 190) transitions.
[2026-05-24 05:01:14] [INFO ] Flow matrix only has 28 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-14139429771292935285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18236841327931103452.kers'
[2026-05-24 05:01:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14139429771292935285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18236841327931103452.kers]
Normalized transition count is 27 out of 28 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 27 rows 24 cols 64 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-24 05:01:14] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18236841327931103452.kers
Total runtime 0 ms.
[2026-05-24 05:01:14] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 05:01:14] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2026-05-24 05:01:14] [INFO ] Invariant cache hit.
[2026-05-24 05:01:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 05:01:14] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-24 05:01:14] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2026-05-24 05:01:14] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2026-05-24 05:01:14] [INFO ] Invariant cache hit.
[2026-05-24 05:01:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 27/47 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 4/51 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/52 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 26 constraints, problems are : Problem set: 0 solved, 28 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 27/47 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 4/51 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/52 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 54 constraints, problems are : Problem set: 0 solved, 28 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/192 places, 32/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1037 ms. Remains : 24/192 places, 32/222 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(p1)||G(p2))&&p0)))'
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-06 finished in 1203 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 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 222/222 transitions.
Graph (complete) has 372 edges and 192 vertex of which 186 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 185 transition count 186
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 155 transition count 186
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 61 place count 155 transition count 157
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 119 place count 126 transition count 157
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 123 transition count 154
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 123 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 121 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 121 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 119 transition count 148
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 119 transition count 148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 117 transition count 146
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 117 transition count 146
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 231 place count 70 transition count 99
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 239 place count 62 transition count 83
Iterating global reduction 2 with 8 rules applied. Total rules applied 247 place count 62 transition count 83
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 255 place count 54 transition count 75
Iterating global reduction 2 with 8 rules applied. Total rules applied 263 place count 54 transition count 75
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 271 place count 46 transition count 59
Iterating global reduction 2 with 8 rules applied. Total rules applied 279 place count 46 transition count 59
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 287 place count 38 transition count 51
Iterating global reduction 2 with 8 rules applied. Total rules applied 295 place count 38 transition count 51
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 303 place count 30 transition count 35
Iterating global reduction 2 with 8 rules applied. Total rules applied 311 place count 30 transition count 35
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 319 place count 22 transition count 27
Iterating global reduction 2 with 8 rules applied. Total rules applied 327 place count 22 transition count 27
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 328 place count 22 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 329 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 331 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 333 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 334 place count 18 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 334 place count 18 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 340 place count 15 transition count 20
Applied a total of 340 rules in 29 ms. Remains 15 /192 variables (removed 177) and now considering 20/222 (removed 202) transitions.
[2026-05-24 05:01:16] [INFO ] Flow matrix only has 18 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-15590768535643425850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4548939209440412569.kers'
[2026-05-24 05:01:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15590768535643425850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4548939209440412569.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 14 cols 36 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 05:01:16] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4548939209440412569.kers
Total runtime 0 ms.
[2026-05-24 05:01:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 05:01:16] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 05:01:16] [INFO ] Invariant cache hit.
[2026-05-24 05:01:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 05:01:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-24 05:01:16] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2026-05-24 05:01:16] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 05:01:16] [INFO ] Invariant cache hit.
[2026-05-24 05:01:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 18/31 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 17 constraints, problems are : Problem set: 0 solved, 18 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 18/31 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/33 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 35 constraints, problems are : Problem set: 0 solved, 18 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 412ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/192 places, 20/222 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 15/192 places, 20/222 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 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-11
Product exploration explored 100000 steps with 12724 reset in 157 ms.
Product exploration explored 100000 steps with 12776 reset in 134 ms.
Computed a total of 9 stabilizing places and 12 stable transitions
Computed a total of 9 stabilizing places and 12 stable transitions
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 36 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 250 ms.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-24 05:01:17] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 05:01:17] [INFO ] Invariant cache hit.
[2026-05-24 05:01:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 05:01:17] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 05:01:17] [INFO ] Invariant cache hit.
[2026-05-24 05:01:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 05:01:17] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-24 05:01:17] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 15/15 places, 20/20 transitions.
Computed a total of 9 stabilizing places and 12 stable transitions
Computed a total of 9 stabilizing places and 12 stable transitions
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 47 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 229 ms.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12771 reset in 84 ms.
Product exploration explored 100000 steps with 12782 reset in 82 ms.
Built C files in :
/tmp/ltsmin1642301640630155704
[2026-05-24 05:01:17] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2026-05-24 05:01:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:01:17] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2026-05-24 05:01:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:01:17] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2026-05-24 05:01:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 05:01:17] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1642301640630155704
Running compilation step : cd /tmp/ltsmin1642301640630155704;'/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 196 ms.
Running link step : cd /tmp/ltsmin1642301640630155704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin1642301640630155704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2171668246323193483.hoa' '--buchi-type=spotba'
LTSmin run took 606 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-11 finished in 2785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(X(p0)))&&F((X(p1) U p1))))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 222/222 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 191 transition count 222
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 178 transition count 209
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 178 transition count 209
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 175 transition count 206
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 175 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 173 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 173 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 171 transition count 202
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 171 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 169 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 169 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 167 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 167 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 165 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 165 transition count 194
Applied a total of 53 rules in 20 ms. Remains 165 /192 variables (removed 27) and now considering 194/222 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10312681829794160494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3130701088849725552.kers'
[2026-05-24 05:01:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10312681829794160494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3130701088849725552.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 165 cols 524 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-24 05:01:18] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3130701088849725552.kers
Total runtime 3 ms.
[2026-05-24 05:01:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 05:01:18] [INFO ] Invariant cache hit.
[2026-05-24 05:01:19] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-24 05:01:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 177 constraints, problems are : Problem set: 0 solved, 193 unsolved in 10079 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 370 constraints, problems are : Problem set: 0 solved, 193 unsolved in 11730 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21839ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 21840ms
Starting structural reductions in LTL mode, iteration 1 : 165/192 places, 194/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22038 ms. Remains : 165/192 places, 194/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(X(p0)))&&F((X(p1) U p1))))))'
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-12
Stuttering criterion allowed to conclude after 281 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-12 finished in 22358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(X(X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 222/222 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 191 transition count 222
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 182 transition count 213
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 182 transition count 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 180 transition count 211
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 180 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 179 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 179 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 178 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 178 transition count 209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 177 transition count 207
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 177 transition count 207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 176 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 176 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 175 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 175 transition count 205
Applied a total of 33 rules in 18 ms. Remains 175 /192 variables (removed 17) and now considering 205/222 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9703430732814020495.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12919607165893946391.kers'
[2026-05-24 05:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9703430732814020495.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12919607165893946391.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 175 cols 550 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-24 05:01:41] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12919607165893946391.kers
Total runtime 4 ms.
[2026-05-24 05:01:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 05:01:41] [INFO ] Invariant cache hit.
[2026-05-24 05:01:41] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2026-05-24 05:01:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 205/380 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 10/187 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 187 constraints, problems are : Problem set: 0 solved, 204 unsolved in 11010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/380 variables, 175/187 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 204/391 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 391 constraints, problems are : Problem set: 0 solved, 204 unsolved in 15148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26180ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 26181ms
Starting structural reductions in LTL mode, iteration 1 : 175/192 places, 205/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26393 ms. Remains : 175/192 places, 205/222 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X((X(!p0) U ((!p1&&X(!p0))||X(G(!p0)))))))&&p2))))'
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), true, p0, p0, p0, p0]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLCardinality-14 finished in 26699 ms.
All properties solved by simple procedures.
Total runtime 142595 ms.

BK_STOP 1779598927954

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-10b"
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-10b, 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-177955695500307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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