About the Execution of ITS-Tools for DiscoveryGPU-PT-09b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 511.071 | 160635.00 | 197227.00 | 841.70 | FFFFFTFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695500292.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-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500292
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.1K Mar 6 16:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 16:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 16:12 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 4.0K Mar 15 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 6 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 68K 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-09b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779598188327
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 04:49:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 04:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:49:49] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2026-05-24 04:49:49] [INFO ] Transformed 268 places.
[2026-05-24 04:49:49] [INFO ] Transformed 284 transitions.
[2026-05-24 04:49:49] [INFO ] Found NUPN structural information;
[2026-05-24 04:49:49] [INFO ] Parsed PT model containing 268 places and 284 transitions and 740 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 250 transition count 284
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 61 place count 207 transition count 241
Iterating global reduction 1 with 43 rules applied. Total rules applied 104 place count 207 transition count 241
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 199 transition count 233
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 199 transition count 233
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 126 place count 193 transition count 227
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 138 place count 187 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 144 place count 187 transition count 221
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 149 place count 182 transition count 211
Iterating global reduction 1 with 5 rules applied. Total rules applied 154 place count 182 transition count 211
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 158 place count 178 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 162 place count 178 transition count 207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 165 place count 175 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 168 place count 175 transition count 204
Applied a total of 168 rules in 84 ms. Remains 175 /268 variables (removed 93) and now considering 204/284 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16462395538070769950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16903248472976691735.kers'
[2026-05-24 04:49:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16462395538070769950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16903248472976691735.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 175 cols 544 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-24 04:49:49] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16903248472976691735.kers
Total runtime 1 ms.
[2026-05-24 04:49:50] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-24 04:49:50] [INFO ] Invariant cache hit.
[2026-05-24 04:49:50] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2026-05-24 04:49:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 204/379 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 18/195 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 0/379 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 195 constraints, problems are : Problem set: 0 solved, 203 unsolved in 12371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/379 variables, 175/195 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 203/398 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 398 constraints, problems are : Problem set: 0 solved, 203 unsolved in 16184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28649ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 28660ms
Starting structural reductions in LTL mode, iteration 1 : 175/268 places, 204/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29176 ms. Remains : 175/268 places, 204/284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2026-05-24 04:50:18] [INFO ] Invariant cache hit.
[2026-05-24 04:50:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 04:50:18] [INFO ] Invariant cache hit.
[2026-05-24 04:50:19] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 175/175 places, 204/204 transitions.
Support contains 27 out of 175 places after structural reductions.
[2026-05-24 04:50:19] [INFO ] Flatten gal took : 36 ms
[2026-05-24 04:50:19] [INFO ] Flatten gal took : 20 ms
[2026-05-24 04:50:19] [INFO ] Input system was already deterministic with 204 transitions.
RANDOM walk for 3946 steps (10 resets) in 179 ms. (21 steps per ms) remains 0/24 properties
Computed a total of 30 stabilizing places and 30 stable transitions
Graph (complete) has 343 edges and 175 vertex of which 171 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Graph (complete) has 343 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 171 transition count 176
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 147 transition count 176
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 49 place count 147 transition count 148
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 105 place count 119 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 116 transition count 144
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 116 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 114 transition count 142
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 114 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 113 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 113 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 112 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 112 transition count 139
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 201 place count 71 transition count 98
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 207 place count 65 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 213 place count 65 transition count 86
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 219 place count 59 transition count 80
Iterating global reduction 2 with 6 rules applied. Total rules applied 225 place count 59 transition count 80
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 231 place count 53 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 237 place count 53 transition count 68
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 243 place count 47 transition count 62
Iterating global reduction 2 with 6 rules applied. Total rules applied 249 place count 47 transition count 62
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 254 place count 42 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 259 place count 42 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 264 place count 37 transition count 47
Iterating global reduction 2 with 5 rules applied. Total rules applied 269 place count 37 transition count 47
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 271 place count 36 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 273 place count 34 transition count 45
Applied a total of 273 rules in 70 ms. Remains 34 /175 variables (removed 141) and now considering 45/204 (removed 159) transitions.
[2026-05-24 04:50:19] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1696299131354566628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12457836723249630612.kers'
[2026-05-24 04:50:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1696299131354566628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12457836723249630612.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 40 rows 32 cols 106 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-24 04:50:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12457836723249630612.kers
Total runtime 0 ms.
[2026-05-24 04:50:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 04:50:19] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2026-05-24 04:50:19] [INFO ] Invariant cache hit.
[2026-05-24 04:50:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 04:50:20] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2026-05-24 04:50:20] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2026-05-24 04:50:20] [INFO ] Flow matrix only has 40 transitions (discarded 5 similar events)
[2026-05-24 04:50:20] [INFO ] Invariant cache hit.
[2026-05-24 04:50:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 40/74 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 37 constraints, problems are : Problem set: 0 solved, 43 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 40/74 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 80 constraints, problems are : Problem set: 0 solved, 43 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1545ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1546ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/175 places, 45/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1746 ms. Remains : 34/175 places, 45/204 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 146 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-00
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-00 finished in 1957 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||X(X(X(X(X(p1)))))) U p2))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 167 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 167 transition count 195
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 162 transition count 190
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 162 transition count 190
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 159 transition count 187
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 159 transition count 187
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 157 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 157 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 155 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 155 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 153 transition count 179
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 153 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 151 transition count 177
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 151 transition count 177
Applied a total of 48 rules in 18 ms. Remains 151 /175 variables (removed 24) and now considering 177/204 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11982736086324412286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1352155638042238230.kers'
[2026-05-24 04:50:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11982736086324412286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1352155638042238230.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 151 cols 476 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-24 04:50:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1352155638042238230.kers
Total runtime 1 ms.
[2026-05-24 04:50:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 04:50:21] [INFO ] Invariant cache hit.
[2026-05-24 04:50:21] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-24 04:50:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/328 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 162 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/328 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 176/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 338 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19095ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 19096ms
Starting structural reductions in LTL mode, iteration 1 : 151/175 places, 177/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19291 ms. Remains : 151/175 places, 177/204 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(X(X(p0)))))||p1) U p2))'
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-01 finished in 19581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(p1)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Graph (complete) has 343 edges and 175 vertex of which 171 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 170 transition count 174
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 145 transition count 174
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 51 place count 145 transition count 145
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 109 place count 116 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 111 transition count 139
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 111 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 119 place count 111 transition count 138
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 110 transition count 138
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 107 transition count 135
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 107 transition count 135
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 105 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 105 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 103 transition count 129
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 103 transition count 129
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 213 place count 64 transition count 90
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 220 place count 57 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 227 place count 57 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 233 place count 51 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 239 place count 51 transition count 70
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 245 place count 45 transition count 58
Iterating global reduction 2 with 6 rules applied. Total rules applied 251 place count 45 transition count 58
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 257 place count 39 transition count 52
Iterating global reduction 2 with 6 rules applied. Total rules applied 263 place count 39 transition count 52
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 269 place count 33 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 275 place count 33 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 281 place count 27 transition count 34
Iterating global reduction 2 with 6 rules applied. Total rules applied 287 place count 27 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 288 place count 27 transition count 33
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 289 place count 27 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 291 place count 25 transition count 31
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 27 edges and 23 vertex of which 20 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 299 place count 20 transition count 23
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 304 place count 15 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 310 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 12 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 314 place count 9 transition count 16
Applied a total of 314 rules in 49 ms. Remains 9 /175 variables (removed 166) and now considering 16/204 (removed 188) transitions.
[2026-05-24 04:50:41] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14821051109541882284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2902814478867202338.kers'
[2026-05-24 04:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14821051109541882284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2902814478867202338.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 9 cols 18 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 04:50:41] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2902814478867202338.kers
Total runtime 3 ms.
[2026-05-24 04:50:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 04:50:41] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2026-05-24 04:50:41] [INFO ] Invariant cache hit.
[2026-05-24 04:50:41] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 04:50:41] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 04:50:41] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2026-05-24 04:50:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 8 unsolved in 63 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 5/20 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 60 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/175 places, 16/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 9/175 places, 16/204 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-02 finished in 327 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((X(X(X(G(p0))))||(p1&&G(p2)))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 168 transition count 197
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 168 transition count 197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 165 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 165 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 164 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 164 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 163 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 163 transition count 192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 162 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 162 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 161 transition count 189
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 161 transition count 189
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 188
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 188
Applied a total of 30 rules in 16 ms. Remains 160 /175 variables (removed 15) and now considering 188/204 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-411879338802011697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14368991546802448368.kers'
[2026-05-24 04:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-411879338802011697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14368991546802448368.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 188 rows 160 cols 506 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-24 04:50:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14368991546802448368.kers
Total runtime 1 ms.
[2026-05-24 04:50:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 04:50:41] [INFO ] Invariant cache hit.
[2026-05-24 04:50:41] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2026-05-24 04:50:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 188/348 variables, 160/162 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 171 constraints, problems are : Problem set: 0 solved, 187 unsolved in 9515 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/348 variables, 160/171 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 187/358 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 358 constraints, problems are : Problem set: 0 solved, 187 unsolved in 12073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21614ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 21618ms
Starting structural reductions in LTL mode, iteration 1 : 160/175 places, 188/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21798 ms. Remains : 160/175 places, 188/204 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((X(X(X(G(p0))))||(p1&&G(p2)))))))'
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-03 finished in 22249 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))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 194
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 161 transition count 189
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 161 transition count 189
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 158 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 158 transition count 186
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 156 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 156 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 154 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 152 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 150 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 150 transition count 176
Applied a total of 50 rules in 23 ms. Remains 150 /175 variables (removed 25) and now considering 176/204 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13011952463334443936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13286740933851767297.kers'
[2026-05-24 04:51:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13011952463334443936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13286740933851767297.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 150 cols 475 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-24 04:51:03] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13286740933851767297.kers
Total runtime 1 ms.
[2026-05-24 04:51:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 04:51:04] [INFO ] Invariant cache hit.
[2026-05-24 04:51:04] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 04:51:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/326 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 161 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/326 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 175/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 336 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10884 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19267ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 19268ms
Starting structural reductions in LTL mode, iteration 1 : 150/175 places, 176/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19452 ms. Remains : 150/175 places, 176/204 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))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-04 finished in 19613 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(p1)||p0))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Graph (complete) has 343 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 171 transition count 175
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 146 transition count 175
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 51 place count 146 transition count 146
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 109 place count 117 transition count 146
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 113 transition count 141
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 113 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 117 place count 113 transition count 140
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 119 place count 112 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 110 transition count 138
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 110 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 109 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 109 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 108 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 108 transition count 135
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 209 place count 67 transition count 94
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 215 place count 61 transition count 82
Iterating global reduction 2 with 6 rules applied. Total rules applied 221 place count 61 transition count 82
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 227 place count 55 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 233 place count 55 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 239 place count 49 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 245 place count 49 transition count 64
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 251 place count 43 transition count 58
Iterating global reduction 2 with 6 rules applied. Total rules applied 257 place count 43 transition count 58
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 263 place count 37 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 269 place count 37 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 275 place count 31 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 281 place count 31 transition count 40
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 283 place count 31 transition count 38
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 284 place count 31 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 29 transition count 36
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 31 edges and 27 vertex of which 24 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 297 place count 24 transition count 25
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 305 place count 16 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 311 place count 13 transition count 22
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 4 with 2 rules applied. Total rules applied 313 place count 12 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 315 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 318 place count 9 transition count 17
Applied a total of 318 rules in 44 ms. Remains 9 /175 variables (removed 166) and now considering 17/204 (removed 187) transitions.
[2026-05-24 04:51:23] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9970846693739686887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13937897994111496226.kers'
[2026-05-24 04:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9970846693739686887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13937897994111496226.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 9 cols 19 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 04:51:23] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13937897994111496226.kers
Total runtime 0 ms.
[2026-05-24 04:51:23] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 04:51:23] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2026-05-24 04:51:23] [INFO ] Invariant cache hit.
[2026-05-24 04:51:23] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2026-05-24 04:51:23] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 04:51:23] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2026-05-24 04:51:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/21 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/21 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 62 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/175 places, 17/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 9/175 places, 17/204 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(p1)||p0))))'
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-06 finished in 320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G(F(p1)) U G(p2)))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 194
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 161 transition count 189
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 161 transition count 189
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 158 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 158 transition count 186
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 156 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 156 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 154 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 152 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 150 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 150 transition count 176
Applied a total of 50 rules in 18 ms. Remains 150 /175 variables (removed 25) and now considering 176/204 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13727182794837999197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1960027210126594033.kers'
[2026-05-24 04:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13727182794837999197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1960027210126594033.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 150 cols 475 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-24 04:51:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1960027210126594033.kers
Total runtime 2 ms.
[2026-05-24 04:51:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 04:51:23] [INFO ] Invariant cache hit.
[2026-05-24 04:51:24] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 04:51:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/326 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 161 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/326 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 175/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 336 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10864 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19133ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 19133ms
Starting structural reductions in LTL mode, iteration 1 : 150/175 places, 176/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19283 ms. Remains : 150/175 places, 176/204 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G(F(p1)) U G(p2)))))'
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-07
Product exploration explored 100000 steps with 7838 reset in 229 ms.
Stack based approach found an accepted trace after 816 steps with 58 reset with depth 25 and stack size 25 in 4 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-07 finished in 19786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X(G(p2)))))'
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 194
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 161 transition count 189
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 161 transition count 189
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 158 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 158 transition count 186
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 156 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 156 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 154 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 152 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 150 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 150 transition count 176
Applied a total of 50 rules in 28 ms. Remains 150 /175 variables (removed 25) and now considering 176/204 (removed 28) transitions.
[2026-05-24 04:51:43] [INFO ] Invariant cache hit.
[2026-05-24 04:51:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 04:51:43] [INFO ] Invariant cache hit.
[2026-05-24 04:51:43] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 150/175 places, 176/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 150/175 places, 176/204 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X(G(p2)))))'
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-11 finished in 365 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(G(p0)))))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 167 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 167 transition count 195
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 162 transition count 190
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 162 transition count 190
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 159 transition count 187
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 159 transition count 187
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 157 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 157 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 155 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 155 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 153 transition count 179
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 153 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 151 transition count 177
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 151 transition count 177
Applied a total of 48 rules in 16 ms. Remains 151 /175 variables (removed 24) and now considering 177/204 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14634833939352301723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7236722835431840106.kers'
[2026-05-24 04:51:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14634833939352301723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7236722835431840106.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 151 cols 477 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-24 04:51:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7236722835431840106.kers
Total runtime 1 ms.
[2026-05-24 04:51:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 04:51:44] [INFO ] Invariant cache hit.
[2026-05-24 04:51:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2026-05-24 04:51:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/328 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 162 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/328 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 176/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 338 constraints, problems are : Problem set: 0 solved, 176 unsolved in 11574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19801ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 19803ms
Starting structural reductions in LTL mode, iteration 1 : 151/175 places, 177/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19977 ms. Remains : 151/175 places, 177/204 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(G(p0)))))'
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 686 steps with 2 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-12 finished in 20161 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 X(p1)) U X((F(p2)||G(p3)))))'
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 167 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 167 transition count 195
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 163 transition count 191
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 163 transition count 191
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 160 transition count 188
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 160 transition count 188
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 158 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 158 transition count 186
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 156 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 156 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 154 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 154 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 152 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 152 transition count 178
Applied a total of 46 rules in 19 ms. Remains 152 /175 variables (removed 23) and now considering 178/204 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11655936854158286094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-134979315932989528.kers'
[2026-05-24 04:52:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11655936854158286094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-134979315932989528.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 152 cols 479 entries
Finished phase 1 with 150 SingleSign rule and 0 generalized
[2026-05-24 04:52:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-134979315932989528.kers
Total runtime 1 ms.
[2026-05-24 04:52:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 04:52:04] [INFO ] Invariant cache hit.
[2026-05-24 04:52:04] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-24 04:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 178/330 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 18/172 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 0/330 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 172 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/330 variables, 152/172 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 177/349 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 349 constraints, problems are : Problem set: 0 solved, 177 unsolved in 14177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24053ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 24053ms
Starting structural reductions in LTL mode, iteration 1 : 152/175 places, 178/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24215 ms. Remains : 152/175 places, 178/204 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 X(p1)) U X((F(p2)||G(p3)))))'
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-13
Stuttering criterion allowed to conclude after 2882 steps with 12 reset in 5 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-13 finished in 24549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 204/204 transitions.
Graph (complete) has 343 edges and 175 vertex of which 171 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 170 transition count 174
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 145 transition count 174
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 51 place count 145 transition count 145
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 109 place count 116 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 111 transition count 139
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 111 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 119 place count 111 transition count 138
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 121 place count 110 transition count 138
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 107 transition count 135
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 107 transition count 135
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 105 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 105 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 103 transition count 129
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 103 transition count 129
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 215 place count 63 transition count 89
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 223 place count 55 transition count 73
Iterating global reduction 2 with 8 rules applied. Total rules applied 231 place count 55 transition count 73
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 239 place count 47 transition count 65
Iterating global reduction 2 with 8 rules applied. Total rules applied 247 place count 47 transition count 65
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 255 place count 39 transition count 49
Iterating global reduction 2 with 8 rules applied. Total rules applied 263 place count 39 transition count 49
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 271 place count 31 transition count 41
Iterating global reduction 2 with 8 rules applied. Total rules applied 279 place count 31 transition count 41
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 286 place count 24 transition count 27
Iterating global reduction 2 with 7 rules applied. Total rules applied 293 place count 24 transition count 27
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 300 place count 17 transition count 20
Iterating global reduction 2 with 7 rules applied. Total rules applied 307 place count 17 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 308 place count 17 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 311 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 315 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 9 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 316 place count 9 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 318 place count 8 transition count 12
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 4 with 2 rules applied. Total rules applied 320 place count 7 transition count 12
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 322 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 324 place count 5 transition count 8
Applied a total of 324 rules in 19 ms. Remains 5 /175 variables (removed 170) and now considering 8/204 (removed 196) transitions.
[2026-05-24 04:52:28] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12155403713780667396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14139359260176018714.kers'
[2026-05-24 04:52:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12155403713780667396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14139359260176018714.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 9 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 04:52:28] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14139359260176018714.kers
Total runtime 0 ms.
[2026-05-24 04:52:28] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 04:52:28] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 04:52:28] [INFO ] Invariant cache hit.
[2026-05-24 04:52:28] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2026-05-24 04:52:28] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 04:52:28] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 04:52:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 34 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/175 places, 8/204 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 5/175 places, 8/204 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-14 finished in 206 ms.
All properties solved by simple procedures.
Total runtime 159542 ms.
BK_STOP 1779598348962
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-09b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-09b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695500292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09b.tgz
mv DiscoveryGPU-PT-09b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;