MCC'2026- Execution of r338-smll-178021499200235

About the Execution of ITS-Tools for ErlangenMainframeV2-PT-bP04C04

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
579.256	122503.00	174049.00	582.60	FFFFFFTTTFFFFFFF	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.r338-smll-178021499200235.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 ErlangenMainframeV2-PT-bP04C04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.5K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 222K May 26 18:17 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 ErlangenMainframeV2-PT-bP04C04-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780373083954

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-02 04:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 04:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 04:04:46] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2026-06-02 04:04:46] [INFO ] Transformed 239 places.
[2026-06-02 04:04:46] [INFO ] Transformed 511 transitions.
[2026-06-02 04:04:46] [INFO ] Found NUPN structural information;
[2026-06-02 04:04:46] [INFO ] Parsed PT model containing 239 places and 511 transitions and 3954 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 511/511 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 197 transition count 469
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 197 transition count 469
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 102 place count 179 transition count 451
Iterating global reduction 0 with 18 rules applied. Total rules applied 120 place count 179 transition count 451
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 125 place count 174 transition count 386
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 131 place count 173 transition count 386
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 135 place count 169 transition count 281
Iterating global reduction 0 with 4 rules applied. Total rules applied 139 place count 169 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 141 place count 167 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 143 place count 167 transition count 279
Applied a total of 143 rules in 149 ms. Remains 167 /239 variables (removed 72) and now considering 279/511 (removed 232) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10251291489330298793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2168726249748643752.kers'
[2026-06-02 04:04:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10251291489330298793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2168726249748643752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 167 cols 1630 entries
Finished phase 1 with 149 SingleSign rule and 3 generalized
[2026-06-02 04:04:47] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2168726249748643752.kers
Total runtime 5 ms.
[2026-06-02 04:04:48] [INFO ] Implicit Places using invariants in 623 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 692 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/239 places, 279/511 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 875 ms. Remains : 166/239 places, 279/511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10456765788923781045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1006891472100993983.kers'
[2026-06-02 04:04:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10456765788923781045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1006891472100993983.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 166 cols 1540 entries
Finished phase 1 with 149 SingleSign rule and 3 generalized
[2026-06-02 04:04:48] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1006891472100993983.kers
Total runtime 4 ms.
[2026-06-02 04:04:48] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-06-02 04:04:48] [INFO ] Invariant cache hit.
[2026-06-02 04:04:48] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-06-02 04:04:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 279/445 variables, 166/184 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 184 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 1/166 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 279/445 variables, 166/184 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 278/462 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 7/469 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 472 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60654ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60687ms
Finished structural reductions in LTL mode , in 1 iterations and 61440 ms. Remains : 166/166 places, 279/279 transitions.
Support contains 38 out of 166 places after structural reductions.
[2026-06-02 04:05:50] [INFO ] Flatten gal took : 139 ms
[2026-06-02 04:05:50] [INFO ] Flatten gal took : 70 ms
[2026-06-02 04:05:50] [INFO ] Input system was already deterministic with 279 transitions.
Support contains 33 out of 166 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2410 ms. (16 steps per ms) remains 7/18 properties
BEST_FIRST walk for 40001 steps (8 resets) in 352 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 326 ms. (122 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 296 ms. (134 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 397 ms. (100 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 332 ms. (120 steps per ms) remains 1/2 properties
[2026-06-02 04:05:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/166 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/445 variables, 166/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/166 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/445 variables, 166/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 279/279 transitions.
Graph (trivial) has 150 edges and 166 vertex of which 11 / 166 are part of one of the 5 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 160 transition count 225
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 56 rules applied. Total rules applied 99 place count 118 transition count 211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 105 place count 112 transition count 211
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 105 place count 112 transition count 201
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 125 place count 102 transition count 201
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 136 place count 91 transition count 146
Ensure Unique test removed 1 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 148 place count 90 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 148 place count 90 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 154 place count 87 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 83 transition count 116
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 83 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 81 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 81 transition count 106
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 228 place count 50 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 50 transition count 74
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 233 place count 46 transition count 65
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 238 place count 45 transition count 65
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 239 place count 44 transition count 61
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 44 transition count 61
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 254 place count 37 transition count 79
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 264 place count 37 transition count 69
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 266 place count 35 transition count 64
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 35 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 272 place count 35 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 274 place count 34 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 291 place count 34 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 293 place count 33 transition count 51
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 300 place count 33 transition count 44
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 316 place count 26 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 318 place count 26 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 319 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 322 place count 25 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 328 place count 25 transition count 31
Applied a total of 328 rules in 134 ms. Remains 25 /166 variables (removed 141) and now considering 31/279 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 25/166 places, 31/279 transitions.
RANDOM walk for 142 steps (0 resets) in 12 ms. (10 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 20 stable 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)))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Graph (trivial) has 149 edges and 166 vertex of which 11 / 166 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 159 transition count 234
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 51 rules applied. Total rules applied 89 place count 122 transition count 220
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 95 place count 116 transition count 220
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 95 place count 116 transition count 209
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 117 place count 105 transition count 209
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 128 place count 94 transition count 154
Ensure Unique test removed 1 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 93 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 140 place count 93 transition count 152
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 91 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 149 place count 86 transition count 123
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 155 place count 85 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 82 transition count 109
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 82 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 81 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 81 transition count 107
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 223 place count 51 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 224 place count 51 transition count 76
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 228 place count 47 transition count 68
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 233 place count 46 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 234 place count 45 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 45 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 44 transition count 65
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 253 place count 36 transition count 83
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 265 place count 36 transition count 71
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 267 place count 34 transition count 67
Iterating global reduction 5 with 2 rules applied. Total rules applied 269 place count 34 transition count 67
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 279 place count 34 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 281 place count 33 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 303 place count 33 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 304 place count 32 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 306 place count 30 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 310 place count 28 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 314 place count 28 transition count 49
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 315 place count 27 transition count 47
Iterating global reduction 8 with 1 rules applied. Total rules applied 316 place count 27 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 320 place count 27 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 325 place count 27 transition count 38
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 327 place count 27 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 329 place count 25 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 331 place count 24 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 332 place count 24 transition count 40
Applied a total of 332 rules in 108 ms. Remains 24 /166 variables (removed 142) and now considering 40/279 (removed 239) transitions.
[2026-06-02 04:05:52] [INFO ] Flow matrix only has 32 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5089955551673436601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6601286633338752956.kers'
[2026-06-02 04:05:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5089955551673436601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6601286633338752956.kers]
Normalized transition count is 31 out of 32 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 31 rows 18 cols 71 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-06-02 04:05:52] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6601286633338752956.kers
Total runtime 1 ms.
[2026-06-02 04:05:52] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-06-02 04:05:52] [INFO ] Flow matrix only has 32 transitions (discarded 8 similar events)
[2026-06-02 04:05:52] [INFO ] Invariant cache hit.
[2026-06-02 04:05:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-02 04:05:52] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-06-02 04:05:52] [INFO ] Redundant transitions in 17 ms returned []
Running 24 sub problems to find dead transitions.
[2026-06-02 04:05:52] [INFO ] Flow matrix only has 32 transitions (discarded 8 similar events)
[2026-06-02 04:05:52] [INFO ] Invariant cache hit.
[2026-06-02 04:05:52] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 5/24 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 31/55 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 24 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 24/24 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 5/24 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 31/55 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/56 variables, and 62 constraints, problems are : Problem set: 0 solved, 24 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 24/24 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1516ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1517ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/166 places, 40/279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1800 ms. Remains : 24/166 places, 40/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 319 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-01 finished in 2236 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 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Graph (trivial) has 144 edges and 166 vertex of which 11 / 166 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 159 transition count 235
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 49 rules applied. Total rules applied 86 place count 123 transition count 222
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 94 place count 117 transition count 220
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 97 place count 115 transition count 219
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 97 place count 115 transition count 208
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 119 place count 104 transition count 208
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 131 place count 92 transition count 152
Ensure Unique test removed 1 places
Iterating global reduction 4 with 13 rules applied. Total rules applied 144 place count 91 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 144 place count 91 transition count 150
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 89 transition count 150
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 84 transition count 121
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 83 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 80 transition count 107
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 80 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 79 transition count 105
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 79 transition count 105
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 221 place count 52 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 52 transition count 77
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 226 place count 48 transition count 69
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 231 place count 47 transition count 69
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 232 place count 46 transition count 67
Iterating global reduction 5 with 1 rules applied. Total rules applied 233 place count 46 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 45 transition count 66
Performed 8 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 251 place count 37 transition count 84
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 263 place count 37 transition count 72
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 265 place count 35 transition count 68
Iterating global reduction 6 with 2 rules applied. Total rules applied 267 place count 35 transition count 68
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 277 place count 35 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 279 place count 34 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 7 with 23 rules applied. Total rules applied 302 place count 34 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 303 place count 33 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 305 place count 31 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 307 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 312 place count 30 transition count 45
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 2 rules applied. Total rules applied 314 place count 30 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 316 place count 28 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 318 place count 27 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 319 place count 27 transition count 47
Applied a total of 319 rules in 100 ms. Remains 27 /166 variables (removed 139) and now considering 47/279 (removed 232) transitions.
[2026-06-02 04:05:54] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6458772129904121115.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8816692402161735148.kers'
[2026-06-02 04:05:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6458772129904121115.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8816692402161735148.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 39 rows 22 cols 100 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-06-02 04:05:54] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8816692402161735148.kers
Total runtime 1 ms.
[2026-06-02 04:05:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-06-02 04:05:55] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
[2026-06-02 04:05:55] [INFO ] Invariant cache hit.
[2026-06-02 04:05:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-02 04:05:55] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-06-02 04:05:55] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2026-06-02 04:05:55] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
[2026-06-02 04:05:55] [INFO ] Invariant cache hit.
[2026-06-02 04:05:55] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 5/27 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 39/66 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/66 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/67 variables, and 41 constraints, problems are : Problem set: 0 solved, 27 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 5/27 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 39/66 variables, 27/36 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 27/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/67 variables, and 69 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 27/27 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2038ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 2040ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/166 places, 47/279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2290 ms. Remains : 27/166 places, 47/279 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 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 373 ms.
Product exploration explored 100000 steps with 0 reset in 234 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 5043 steps (173 resets) in 21 ms. (229 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 227 ms.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2026-06-02 04:05:58] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
[2026-06-02 04:05:58] [INFO ] Invariant cache hit.
[2026-06-02 04:05:58] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-06-02 04:05:58] [INFO ] Flow matrix only has 40 transitions (discarded 7 similar events)
[2026-06-02 04:05:58] [INFO ] Invariant cache hit.
[2026-06-02 04:05:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-06-02 04:05:58] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2026-06-02 04:05:58] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 27/27 places, 47/47 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 2085 steps (69 resets) in 9 ms. (208 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 291 ms.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 160 ms.
Product exploration explored 100000 steps with 0 reset in 119 ms.
Built C files in :
/tmp/ltsmin15212149620427175571
[2026-06-02 04:05:59] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2026-06-02 04:05:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 04:05:59] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2026-06-02 04:05:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 04:05:59] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2026-06-02 04:05:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-02 04:05:59] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15212149620427175571
Running compilation step : cd /tmp/ltsmin15212149620427175571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 597 ms.
Running link step : cd /tmp/ltsmin15212149620427175571;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin15212149620427175571;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6423657202251586739.hoa' '--buchi-type=spotba'
LTSmin run took 262 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-04 finished in 5387 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(((X(F(!p0))&&G(!p1))||(!p2&&X(p3))||G(F(!p0))||G(p3))))'
Support contains 7 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 219
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 219
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 140 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 140 transition count 193
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 136 transition count 182
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 61 place count 135 transition count 182
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 65 place count 131 transition count 167
Iterating global reduction 0 with 4 rules applied. Total rules applied 69 place count 131 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 72 place count 128 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 128 transition count 162
Applied a total of 75 rules in 25 ms. Remains 128 /166 variables (removed 38) and now considering 162/279 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1594898546991677941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9959642817921422315.kers'
[2026-06-02 04:06:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1594898546991677941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9959642817921422315.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 128 cols 476 entries
Finished phase 1 with 113 SingleSign rule and 2 generalized
[2026-06-02 04:06:00] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9959642817921422315.kers
Total runtime 2 ms.
[2026-06-02 04:06:00] [INFO ] Implicit Places using invariants in 119 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/166 places, 162/279 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 127/166 places, 162/279 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(F(p0))||G(p1)||(X(F(p0))&&G(p2))||(X(p1)&&p3))))'
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 475 ms.
Product exploration explored 100000 steps with 0 reset in 420 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 45 factoid took 220 ms. Reduced automaton from 6 states, 30 edges and 4 AP (stutter sensitive) to 6 states, 30 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 640 ms. (62 steps per ms) remains 9/22 properties
BEST_FIRST walk for 40002 steps (8 resets) in 360 ms. (110 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 543 ms. (73 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 313 ms. (127 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-277753249772842318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17462026600554418874.kers'
[2026-06-02 04:06:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-277753249772842318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17462026600554418874.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 127 cols 470 entries
Finished phase 1 with 113 SingleSign rule and 2 generalized
[2026-06-02 04:06:02] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17462026600554418874.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/101 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/127 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 162/289 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 139 constraints, problems are : Problem set: 0 solved, 3 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/101 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 26/127 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 162/289 variables, 127/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 743ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 3758 steps, including 63 resets, run visited all 1 properties in 16 ms. (steps per millisecond=234 )
Parikh walk visited 3 properties in 89 ms.
Knowledge based reduction with 45 factoid took 645 ms. Reduced automaton from 6 states, 30 edges and 4 AP (stutter sensitive) to 6 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 2960 ms.
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2026-06-02 04:06:05] [INFO ] Invariant cache hit.
[2026-06-02 04:06:05] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-06-02 04:06:05] [INFO ] Invariant cache hit.
[2026-06-02 04:06:05] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2026-06-02 04:06:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/289 variables, 127/140 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 140 constraints, problems are : Problem set: 0 solved, 161 unsolved in 12955 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/289 variables, 127/140 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 161/301 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 306 constraints, problems are : Problem set: 0 solved, 161 unsolved in 20846 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 33835ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 33837ms
Finished structural reductions in LTL mode , in 1 iterations and 34184 ms. Remains : 127/127 places, 162/162 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge based reduction with 45 factoid took 132 ms. Reduced automaton from 6 states, 30 edges and 4 AP (stutter sensitive) to 6 states, 30 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 265 ms. (150 steps per ms) remains 9/22 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/3 properties
[2026-06-02 04:06:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/100 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/127 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 162/289 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 139 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/100 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/127 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 162/289 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 66 ms.
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 162/162 transitions.
Graph (trivial) has 117 edges and 127 vertex of which 11 / 127 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 121 transition count 124
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 35 rules applied. Total rules applied 62 place count 95 transition count 115
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 67 place count 90 transition count 115
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 67 place count 90 transition count 103
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 91 place count 78 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 77 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 77 transition count 101
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 143 place count 52 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 147 place count 52 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 150 place count 49 transition count 65
Iterating global reduction 4 with 3 rules applied. Total rules applied 153 place count 49 transition count 65
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 171 place count 40 transition count 85
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 181 place count 40 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 39 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 201 place count 39 transition count 72
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 208 place count 39 transition count 65
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 222 place count 32 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 230 place count 32 transition count 50
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 32 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 31 transition count 54
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 31 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 31 transition count 53
Applied a total of 234 rules in 51 ms. Remains 31 /127 variables (removed 96) and now considering 53/162 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 31/127 places, 53/162 transitions.
RANDOM walk for 19055 steps (4 resets) in 68 ms. (276 steps per ms) remains 0/1 properties
Knowledge based reduction with 45 factoid took 515 ms. Reduced automaton from 6 states, 30 edges and 4 AP (stutter sensitive) to 6 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 1847 ms.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 296 ms.
Product exploration explored 100000 steps with 0 reset in 340 ms.
Spot run failed in 219 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15626964820441574492
[2026-06-02 04:06:42] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15626964820441574492
Running compilation step : cd /tmp/ltsmin15626964820441574492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin15626964820441574492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin15626964820441574492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3465415706845836627.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-05 finished in 43088 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||G(p1)) U X(p2)))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 216
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 216
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 139 transition count 191
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 191
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 136 transition count 182
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 136 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 134 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 134 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 133 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 133 transition count 174
Applied a total of 66 rules in 10 ms. Remains 133 /166 variables (removed 33) and now considering 174/279 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13894393261471553010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17867883079550993412.kers'
[2026-06-02 04:06:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13894393261471553010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17867883079550993412.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 133 cols 618 entries
Finished phase 1 with 116 SingleSign rule and 3 generalized
[2026-06-02 04:06:43] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17867883079550993412.kers
Total runtime 2 ms.
[2026-06-02 04:06:43] [INFO ] Implicit Places using invariants in 138 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/166 places, 174/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 132/166 places, 174/279 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)||p1) U X(p2)))'
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 17 ms. Proved property starting from automaton with 6 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-06 finished in 962 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)||G(p1)))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 145 transition count 214
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 145 transition count 214
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 137 transition count 187
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 137 transition count 187
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 133 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 133 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 131 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 131 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 130 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 130 transition count 167
Applied a total of 72 rules in 7 ms. Remains 130 /166 variables (removed 36) and now considering 167/279 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-931551807197378764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13885057142538387489.kers'
[2026-06-02 04:06:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-931551807197378764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13885057142538387489.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 130 cols 548 entries
Finished phase 1 with 114 SingleSign rule and 2 generalized
[2026-06-02 04:06:44] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13885057142538387489.kers
Total runtime 1 ms.
[2026-06-02 04:06:44] [INFO ] Implicit Places using invariants in 125 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/166 places, 167/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 129/166 places, 167/279 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)||G(p1)))'
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 17 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-07 finished in 573 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(X(X(X(G(!p1)))))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 145 transition count 222
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 145 transition count 222
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 137 transition count 209
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 137 transition count 209
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 133 transition count 187
Ensure Unique test removed 1 places
Iterating global reduction 0 with 5 rules applied. Total rules applied 67 place count 132 transition count 187
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 69 place count 130 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 71 place count 130 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 72 place count 129 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 73 place count 129 transition count 169
Applied a total of 73 rules in 6 ms. Remains 129 /166 variables (removed 37) and now considering 169/279 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1521740427040416264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6227474347406968218.kers'
[2026-06-02 04:06:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1521740427040416264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6227474347406968218.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 129 cols 542 entries
Finished phase 1 with 114 SingleSign rule and 2 generalized
[2026-06-02 04:06:44] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6227474347406968218.kers
Total runtime 2 ms.
[2026-06-02 04:06:44] [INFO ] Implicit Places using invariants in 106 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/166 places, 169/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 128/166 places, 169/279 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(X(X(X(G(!p1)))))))'
Stuttering acceptance computed with spot in 240 ms :[p1, p1, p1, p1, true, p1]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 245 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-10 finished in 644 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 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 248
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 248
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 133 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 133 transition count 200
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 127 transition count 177
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 125 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 121 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 121 transition count 156
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 119 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 119 transition count 153
Applied a total of 92 rules in 6 ms. Remains 119 /166 variables (removed 47) and now considering 153/279 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15748589657266621139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-841093624184842955.kers'
[2026-06-02 04:06:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15748589657266621139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-841093624184842955.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 119 cols 446 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-06-02 04:06:45] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-841093624184842955.kers
Total runtime 2 ms.
[2026-06-02 04:06:45] [INFO ] Implicit Places using invariants in 91 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/166 places, 153/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 118/166 places, 153/279 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 191 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-11 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 144 transition count 213
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 144 transition count 213
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 133 transition count 183
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 133 transition count 183
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 127 transition count 166
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 125 transition count 166
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 121 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 121 transition count 155
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 119 transition count 152
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 119 transition count 152
Applied a total of 92 rules in 8 ms. Remains 119 /166 variables (removed 47) and now considering 152/279 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18410036921582806605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12941819683647897591.kers'
[2026-06-02 04:06:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18410036921582806605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12941819683647897591.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 119 cols 428 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-06-02 04:06:45] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12941819683647897591.kers
Total runtime 1 ms.
[2026-06-02 04:06:45] [INFO ] Implicit Places using invariants in 86 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/166 places, 152/279 transitions.
Applied a total of 0 rules in 1 ms. Remains 118 /118 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 118/166 places, 152/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-12 finished in 291 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 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 279/279 transitions.
Graph (trivial) has 149 edges and 166 vertex of which 11 / 166 are part of one of the 5 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 159 transition count 233
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 50 rules applied. Total rules applied 89 place count 121 transition count 221
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 94 place count 116 transition count 221
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 94 place count 116 transition count 211
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 114 place count 106 transition count 211
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 125 place count 95 transition count 156
Ensure Unique test removed 1 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 137 place count 94 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 137 place count 94 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 93 transition count 155
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 144 place count 88 transition count 126
Ensure Unique test removed 1 places
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 87 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 84 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 84 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 83 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 83 transition count 110
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 222 place count 51 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 51 transition count 77
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 226 place count 48 transition count 70
Ensure Unique test removed 1 places
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 47 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 231 place count 46 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 46 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 234 place count 45 transition count 67
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 248 place count 38 transition count 76
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 255 place count 38 transition count 69
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 257 place count 36 transition count 65
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 36 transition count 65
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 263 place count 36 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 265 place count 35 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 274 place count 35 transition count 63
Applied a total of 274 rules in 37 ms. Remains 35 /166 variables (removed 131) and now considering 63/279 (removed 216) transitions.
[2026-06-02 04:06:46] [INFO ] Flow matrix only has 53 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13867614285306122723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16897069192028782776.kers'
[2026-06-02 04:06:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13867614285306122723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16897069192028782776.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 33 cols 232 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-06-02 04:06:46] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16897069192028782776.kers
Total runtime 1 ms.
[2026-06-02 04:06:46] [INFO ] Implicit Places using invariants in 61 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/166 places, 63/279 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 32 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 32 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 31 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 31 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 31 transition count 59
Applied a total of 8 rules in 6 ms. Remains 31 /34 variables (removed 3) and now considering 59/63 (removed 4) transitions.
[2026-06-02 04:06:46] [INFO ] Flow matrix only has 49 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17497739021441857194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9289474196670343842.kers'
[2026-06-02 04:06:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17497739021441857194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9289474196670343842.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 48 rows 30 cols 222 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-06-02 04:06:46] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9289474196670343842.kers
Total runtime 1 ms.
[2026-06-02 04:06:46] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-06-02 04:06:46] [INFO ] Flow matrix only has 49 transitions (discarded 10 similar events)
[2026-06-02 04:06:46] [INFO ] Invariant cache hit.
[2026-06-02 04:06:46] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-02 04:06:46] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/166 places, 59/279 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 31/166 places, 59/279 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 44 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP04C04-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP04C04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP04C04-LTLCardinality-13 finished in 294 ms.
All properties solved by simple procedures.
Total runtime 119914 ms.

BK_STOP 1780373206457

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV2-PT-bP04C04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV2-PT-bP04C04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499200235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV2-PT-bP04C04.tgz
mv ErlangenMainframeV2-PT-bP04C04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;