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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.5K Mar 6 16:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 6 16:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 6 16:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 17 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 17 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 17 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 17 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 6 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 6 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 17 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 17 09:01 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 54K 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-07b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779595037805

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-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 03:57:18] [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 03:57:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:57:19] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2026-05-24 03:57:19] [INFO ] Transformed 212 places.
[2026-05-24 03:57:19] [INFO ] Transformed 224 transitions.
[2026-05-24 03:57:19] [INFO ] Found NUPN structural information;
[2026-05-24 03:57:19] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 199 transition count 224
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 42 place count 170 transition count 195
Iterating global reduction 1 with 29 rules applied. Total rules applied 71 place count 170 transition count 195
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 165 transition count 190
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 165 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 163 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 163 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 162 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 162 transition count 187
Applied a total of 87 rules in 62 ms. Remains 162 /212 variables (removed 50) and now considering 187/224 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17236333935968485302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6574848425615465110.kers'
[2026-05-24 03:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17236333935968485302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6574848425615465110.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 162 cols 495 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-24 03:57:19] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6574848425615465110.kers
Total runtime 3 ms.
[2026-05-24 03:57:19] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-24 03:57:19] [INFO ] Invariant cache hit.
[2026-05-24 03:57:19] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-24 03:57:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/348 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 1/349 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 172 constraints, problems are : Problem set: 0 solved, 186 unsolved in 12371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/348 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 185/356 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 358 constraints, problems are : Problem set: 0 solved, 186 unsolved in 18271 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30732ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 30751ms
Starting structural reductions in LTL mode, iteration 1 : 162/212 places, 187/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31239 ms. Remains : 162/212 places, 187/224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Applied a total of 0 rules in 14 ms. Remains 162 /162 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2026-05-24 03:57:50] [INFO ] Invariant cache hit.
[2026-05-24 03:57:50] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-24 03:57:50] [INFO ] Invariant cache hit.
[2026-05-24 03:57:50] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 162/162 places, 187/187 transitions.
Support contains 37 out of 162 places after structural reductions.
[2026-05-24 03:57:50] [INFO ] Flatten gal took : 37 ms
[2026-05-24 03:57:50] [INFO ] Flatten gal took : 14 ms
[2026-05-24 03:57:50] [INFO ] Input system was already deterministic with 187 transitions.
RANDOM walk for 10476 steps (42 resets) in 307 ms. (34 steps per ms) remains 0/24 properties
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 311 edges and 162 vertex of which 155 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 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)||F(p1)) U p2)&&X(X(p3)))))'
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 187
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 150 transition count 176
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 150 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 146 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 146 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 142 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 142 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 138 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 138 transition count 162
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 136 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 136 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 134 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 134 transition count 156
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 132 transition count 154
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 132 transition count 154
Applied a total of 59 rules in 18 ms. Remains 132 /162 variables (removed 30) and now considering 154/187 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1069918106086535135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7137945392044224596.kers'
[2026-05-24 03:57:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1069918106086535135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7137945392044224596.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 132 cols 414 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-24 03:57:51] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7137945392044224596.kers
Total runtime 1 ms.
[2026-05-24 03:57:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 03:57:51] [INFO ] Invariant cache hit.
[2026-05-24 03:57:51] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2026-05-24 03:57:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/286 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 141 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6289 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/286 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 153/294 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 294 constraints, problems are : Problem set: 0 solved, 153 unsolved in 8105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14423ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 14424ms
Starting structural reductions in LTL mode, iteration 1 : 132/162 places, 154/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14594 ms. Remains : 132/162 places, 154/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((X(p0)||F(p1)) U p2)&&X(X(p3)))))'
Stuttering acceptance computed with spot in 413 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (NOT p3), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-01 finished in 15105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||G(p1)) U (p2&&F((p2&&X(p3))))))'
Support contains 7 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 153 transition count 178
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 153 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 149 transition count 172
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 149 transition count 172
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 146 transition count 169
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 146 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 143 transition count 165
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 143 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 142 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 142 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 141 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 141 transition count 163
Applied a total of 42 rules in 19 ms. Remains 141 /162 variables (removed 21) and now considering 163/187 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5408729369937291547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15837808037453101256.kers'
[2026-05-24 03:58:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5408729369937291547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15837808037453101256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 141 cols 435 entries
Finished phase 1 with 139 SingleSign rule and 0 generalized
[2026-05-24 03:58:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15837808037453101256.kers
Total runtime 1 ms.
[2026-05-24 03:58:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 03:58:06] [INFO ] Invariant cache hit.
[2026-05-24 03:58:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2026-05-24 03:58:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 163/303 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 7/149 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 1/304 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 150 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/303 variables, 140/149 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 161/310 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 1/304 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 312 constraints, problems are : Problem set: 0 solved, 162 unsolved in 14377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23416ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 23417ms
Starting structural reductions in LTL mode, iteration 1 : 141/162 places, 163/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23577 ms. Remains : 141/162 places, 163/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||G(p1)) U (F((p2&&X(p3)))&&p2)))'
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 276 edges and 141 vertex of which 136 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 21 factoid took 13 ms. Proved property starting from automaton with 5 states, 11 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-07 finished in 24218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&(G(p1)||X(F(p2)))))'
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 187
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 150 transition count 176
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 150 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 146 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 146 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 142 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 142 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 138 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 138 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 135 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 135 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 133 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 133 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 132 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 132 transition count 154
Applied a total of 59 rules in 27 ms. Remains 132 /162 variables (removed 30) and now considering 154/187 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15082860817563585821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9129768855141612823.kers'
[2026-05-24 03:58:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15082860817563585821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9129768855141612823.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 132 cols 414 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-24 03:58:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9129768855141612823.kers
Total runtime 0 ms.
[2026-05-24 03:58:31] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-24 03:58:31] [INFO ] Invariant cache hit.
[2026-05-24 03:58:31] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2026-05-24 03:58:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/286 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 141 constraints, problems are : Problem set: 0 solved, 153 unsolved in 6371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 154/286 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 153/294 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/286 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 294 constraints, problems are : Problem set: 0 solved, 153 unsolved in 7773 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14161ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 14162ms
Starting structural reductions in LTL mode, iteration 1 : 132/162 places, 154/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14492 ms. Remains : 132/162 places, 154/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&(G(p1)||X(F(p2)))))'
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 263 edges and 132 vertex of which 130 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 24 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 18 ms. Proved property starting from automaton with 5 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-08 finished in 14857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F((F(p2)&&F(G(p3))&&p1)))))))'
Support contains 7 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 187
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 149 transition count 175
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 149 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 145 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 145 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 141 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 141 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 137 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 137 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 134 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 134 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 131 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 131 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 130 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 130 transition count 152
Applied a total of 63 rules in 18 ms. Remains 130 /162 variables (removed 32) and now considering 152/187 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18274002916667897564.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7940692096458940035.kers'
[2026-05-24 03:58:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18274002916667897564.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7940692096458940035.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 130 cols 407 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-24 03:58:45] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7940692096458940035.kers
Total runtime 1 ms.
[2026-05-24 03:58:45] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 03:58:45] [INFO ] Invariant cache hit.
[2026-05-24 03:58:45] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2026-05-24 03:58:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/282 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 8/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 140 constraints, problems are : Problem set: 0 solved, 151 unsolved in 6394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 152/282 variables, 130/140 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 151/291 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 291 constraints, problems are : Problem set: 0 solved, 151 unsolved in 7754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14165ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 14166ms
Starting structural reductions in LTL mode, iteration 1 : 130/162 places, 152/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14310 ms. Remains : 130/162 places, 152/187 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((F(p1)&&F(G(p2))&&p0))))&&p3)))'
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-09
Stuttering criterion allowed to conclude after 229 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-09 finished in 14650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X((X(p1)||F(p2)))))))'
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 187
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 148 transition count 174
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 148 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 143 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 143 transition count 167
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 138 transition count 162
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 138 transition count 162
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 133 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 133 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 130 transition count 151
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 130 transition count 151
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 127 transition count 148
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 125 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 125 transition count 146
Applied a total of 73 rules in 10 ms. Remains 125 /162 variables (removed 37) and now considering 146/187 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11616292492462852311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3574458722420429941.kers'
[2026-05-24 03:59:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11616292492462852311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3574458722420429941.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 125 cols 392 entries
Finished phase 1 with 123 SingleSign rule and 0 generalized
[2026-05-24 03:59:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3574458722420429941.kers
Total runtime 1 ms.
[2026-05-24 03:59:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 03:59:00] [INFO ] Invariant cache hit.
[2026-05-24 03:59:00] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-24 03:59:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 146/271 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 134 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/271 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 145/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 279 constraints, problems are : Problem set: 0 solved, 145 unsolved in 7042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12644ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 12644ms
Starting structural reductions in LTL mode, iteration 1 : 125/162 places, 146/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12799 ms. Remains : 125/162 places, 146/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U X((X(p1)||F(p2)))))))'
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-10
Product exploration explored 100000 steps with 20092 reset in 82 ms.
Product exploration explored 100000 steps with 19914 reset in 127 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 249 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 6 factoid took 67 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (174 resets) in 236 ms. (168 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (33 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2026-05-24 03:59:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/100 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 140/240 variables, 78/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/266 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/271 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/271 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/96 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/100 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 140/240 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/266 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 271/271 variables, and 128 constraints, problems are : Problem set: 1 solved, 0 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Knowledge-based reduction took 827 ms.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2026-05-24 03:59:14] [INFO ] Invariant cache hit.
[2026-05-24 03:59:14] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 03:59:14] [INFO ] Invariant cache hit.
[2026-05-24 03:59:14] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 125/125 places, 146/146 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 249 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge based reduction with 6 factoid took 58 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 1919 steps (7 resets) in 20 ms. (91 steps per ms) remains 0/6 properties
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Knowledge-based reduction took 501 ms.
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 20034 reset in 77 ms.
Product exploration explored 100000 steps with 20120 reset in 96 ms.
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10513707486416281103
[2026-05-24 03:59:16] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10513707486416281103
Running compilation step : cd /tmp/ltsmin10513707486416281103;'/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 360 ms.
Running link step : cd /tmp/ltsmin10513707486416281103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10513707486416281103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4125007363358515832.hoa' '--buchi-type=spotba'
LTSmin run took 5354 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-10 finished in 21884 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(G(!p0)) U p1)))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Graph (complete) has 311 edges and 162 vertex of which 155 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 154 transition count 157
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 131 transition count 157
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 47 place count 131 transition count 133
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 95 place count 107 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 101 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 101 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 98 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 98 transition count 124
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 95 transition count 119
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 95 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 93 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 93 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 92 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 92 transition count 115
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 191 place count 59 transition count 82
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 55 transition count 75
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 55 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 201 place count 53 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 203 place count 53 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 205 place count 51 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 51 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 209 place count 49 transition count 66
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 49 transition count 66
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 47 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 47 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 217 place count 45 transition count 60
Iterating global reduction 2 with 2 rules applied. Total rules applied 219 place count 45 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 220 place count 44 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 221 place count 44 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 223 place count 43 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 224 place count 42 transition count 57
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 42 transition count 57
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 226 place count 41 transition count 55
Iterating global reduction 2 with 1 rules applied. Total rules applied 227 place count 41 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 228 place count 40 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 229 place count 40 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 39 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 39 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 38 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 38 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 37 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 37 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 36 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 36 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 36 transition count 46
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 240 place count 36 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 34 transition count 44
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 39 edges and 32 vertex of which 29 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 10 rules applied. Total rules applied 252 place count 29 transition count 34
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 259 place count 22 transition count 34
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 269 place count 17 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 17 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 275 place count 13 transition count 23
Applied a total of 275 rules in 57 ms. Remains 13 /162 variables (removed 149) and now considering 23/187 (removed 164) transitions.
[2026-05-24 03:59:22] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2607123216189810148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4892518656495722845.kers'
[2026-05-24 03:59:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2607123216189810148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4892518656495722845.kers]
Normalized transition count is 16 out of 17 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 13 cols 26 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 03:59:22] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4892518656495722845.kers
Total runtime 6 ms.
[2026-05-24 03:59:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 03:59:22] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2026-05-24 03:59:22] [INFO ] Invariant cache hit.
[2026-05-24 03:59:22] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2026-05-24 03:59:22] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2026-05-24 03:59:22] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2026-05-24 03:59:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 14/23 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 6/29 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 13 constraints, problems are : Problem set: 0 solved, 13 unsolved in 110 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 14/23 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 6/29 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 26 constraints, problems are : Problem set: 0 solved, 13 unsolved in 153 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/162 places, 23/187 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 13/162 places, 23/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0)) U p1)))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-11 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U ((!p1&&X(X(p0)))||X(X(G(p0)))))))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 187
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 148 transition count 174
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 148 transition count 174
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 142 transition count 166
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 142 transition count 166
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 136 transition count 159
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 136 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 130 transition count 152
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 130 transition count 152
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 127 transition count 148
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 127 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 125 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 125 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 124 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 124 transition count 145
Applied a total of 75 rules in 19 ms. Remains 124 /162 variables (removed 38) and now considering 145/187 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18207702266398663725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2779296349321377761.kers'
[2026-05-24 03:59:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18207702266398663725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2779296349321377761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 124 cols 389 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-24 03:59:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2779296349321377761.kers
Total runtime 0 ms.
[2026-05-24 03:59:22] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-24 03:59:22] [INFO ] Invariant cache hit.
[2026-05-24 03:59:22] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-05-24 03:59:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 145/269 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 133 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/269 variables, 124/133 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 144/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 277 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6994 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13133ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 13133ms
Starting structural reductions in LTL mode, iteration 1 : 124/162 places, 145/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13426 ms. Remains : 124/162 places, 145/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U (X(X(G(p0)))||(!p1&&X(X(p0)))))))'
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-14 finished in 13618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 187/187 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 187
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 147 transition count 173
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 147 transition count 173
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 141 transition count 165
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 141 transition count 165
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 135 transition count 158
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 130 transition count 152
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 130 transition count 152
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 127 transition count 147
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 127 transition count 147
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 124 transition count 144
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 122 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 122 transition count 142
Applied a total of 79 rules in 20 ms. Remains 122 /162 variables (removed 40) and now considering 142/187 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11465841057797213918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14136077042438630515.kers'
[2026-05-24 03:59:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11465841057797213918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14136077042438630515.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 122 cols 383 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-24 03:59:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14136077042438630515.kers
Total runtime 0 ms.
[2026-05-24 03:59:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 03:59:36] [INFO ] Invariant cache hit.
[2026-05-24 03:59:36] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2026-05-24 03:59:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/264 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 7/131 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 131 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5624 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/264 variables, 122/131 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 141/272 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 272 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12141ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 12141ms
Starting structural reductions in LTL mode, iteration 1 : 122/162 places, 142/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12311 ms. Remains : 122/162 places, 142/187 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1205 steps with 5 reset in 11 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-15 finished in 12448 ms.
All properties solved by simple procedures.
Total runtime 149822 ms.

BK_STOP 1779595188810

--------------------
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-07b"
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-07b, 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-177955695400259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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