fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499100211
Last Updated
Jun 17, 2026

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
468.191 102463.00 142112.00 1177.60 FFFTFTFFFFTFFTFF 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-178021499100211.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-bP01C01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K May 27 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 27 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 09:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 09:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 27 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 09:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K May 27 09:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:40 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 54K 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-bP01C01-LTLCardinality-00
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-01
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-02
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-03
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-04
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-05
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-06
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-07
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-08
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-09
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-10
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-11
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-12
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-13
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-14
FORMULA_NAME ErlangenMainframeV2-PT-bP01C01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1780370357347

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-bP01C01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-02 03:19:19] [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 03:19:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:19:20] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2026-06-02 03:19:20] [INFO ] Transformed 179 places.
[2026-06-02 03:19:20] [INFO ] Transformed 223 transitions.
[2026-06-02 03:19:20] [INFO ] Found NUPN structural information;
[2026-06-02 03:19:20] [INFO ] Parsed PT model containing 179 places and 223 transitions and 639 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 223/223 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 142 transition count 186
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 142 transition count 186
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 87 place count 129 transition count 173
Iterating global reduction 0 with 13 rules applied. Total rules applied 100 place count 129 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 127 transition count 171
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 105 place count 126 transition count 171
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 107 place count 124 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 109 place count 124 transition count 167
Applied a total of 109 rules in 92 ms. Remains 124 /179 variables (removed 55) and now considering 167/223 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15530216753075631815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2089683802893435402.kers'
[2026-06-02 03:19:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15530216753075631815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2089683802893435402.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 124 cols 492 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-06-02 03:19:20] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2089683802893435402.kers
Total runtime 3 ms.
[2026-06-02 03:19:21] [INFO ] Implicit Places using invariants in 392 ms returned []
[2026-06-02 03:19:21] [INFO ] Invariant cache hit.
[2026-06-02 03:19:21] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-06-02 03:19:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 167/291 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 140 constraints, problems are : Problem set: 0 solved, 166 unsolved in 15817 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/291 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 166/306 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/291 variables, and 316 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 46019ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 46047ms
Starting structural reductions in LTL mode, iteration 1 : 124/179 places, 167/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47014 ms. Remains : 124/179 places, 167/223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 167/167 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2026-06-02 03:20:07] [INFO ] Invariant cache hit.
[2026-06-02 03:20:07] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-06-02 03:20:07] [INFO ] Invariant cache hit.
[2026-06-02 03:20:08] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 124/124 places, 167/167 transitions.
Support contains 24 out of 124 places after structural reductions.
[2026-06-02 03:20:08] [INFO ] Flatten gal took : 85 ms
[2026-06-02 03:20:08] [INFO ] Flatten gal took : 36 ms
[2026-06-02 03:20:08] [INFO ] Input system was already deterministic with 167 transitions.
RANDOM walk for 33714 steps (8 resets) in 1632 ms. (20 steps per ms) remains 0/14 properties
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 16 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' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 167/167 transitions.
Graph (trivial) has 117 edges and 124 vertex of which 9 / 124 are part of one of the 4 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 118 transition count 128
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 81 place count 86 transition count 112
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 89 place count 78 transition count 112
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 89 place count 78 transition count 103
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 108 place count 68 transition count 103
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 62 transition count 97
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 62 transition count 97
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 120 place count 62 transition count 95
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 60 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 58 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 58 transition count 80
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 166 place count 39 transition count 61
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 36 transition count 51
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 36 transition count 51
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 180 place count 32 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 184 place count 32 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 188 place count 32 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 190 place count 31 transition count 60
Applied a total of 190 rules in 55 ms. Remains 31 /124 variables (removed 93) and now considering 60/167 (removed 107) transitions.
[2026-06-02 03:20:09] [INFO ] Flow matrix only has 56 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10784364259805251264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12339717145773162651.kers'
[2026-06-02 03:20:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10784364259805251264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12339717145773162651.kers]
Normalized transition count is 55 out of 56 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 55 rows 30 cols 232 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-06-02 03:20:09] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12339717145773162651.kers
Total runtime 0 ms.
[2026-06-02 03:20:09] [INFO ] Implicit Places using invariants in 99 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/124 places, 60/167 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 28 transition count 60
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 28 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 27 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 27 transition count 57
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 27 transition count 56
Applied a total of 8 rules in 8 ms. Remains 27 /30 variables (removed 3) and now considering 56/60 (removed 4) transitions.
[2026-06-02 03:20:09] [INFO ] Flow matrix only has 52 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8740088428083438569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4175870731534799275.kers'
[2026-06-02 03:20:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8740088428083438569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4175870731534799275.kers]
Normalized transition count is 51 out of 52 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 51 rows 27 cols 222 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-06-02 03:20:09] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4175870731534799275.kers
Total runtime 0 ms.
[2026-06-02 03:20:09] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-06-02 03:20:09] [INFO ] Flow matrix only has 52 transitions (discarded 4 similar events)
[2026-06-02 03:20:09] [INFO ] Invariant cache hit.
[2026-06-02 03:20:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-06-02 03:20:09] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/124 places, 56/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 272 ms. Remains : 27/124 places, 56/167 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)&&F(p1))))'
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLCardinality-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLCardinality-01 finished in 742 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((G(p0) U X(X(X(X(p1)))))))'
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 115 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 115 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 112 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 112 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 110 transition count 140
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 110 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 108 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 108 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 107 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 107 transition count 137
Applied a total of 34 rules in 15 ms. Remains 107 /124 variables (removed 17) and now considering 137/167 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12826755079196453528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16918243335522227741.kers'
[2026-06-02 03:20:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12826755079196453528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16918243335522227741.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 107 cols 372 entries
Finished phase 1 with 97 SingleSign rule and 1 generalized
[2026-06-02 03:20:10] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16918243335522227741.kers
Total runtime 1 ms.
[2026-06-02 03:20:10] [INFO ] Implicit Places using invariants in 71 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/124 places, 137/167 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 106/124 places, 137/167 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((G(p0) U X(X(X(X(p1)))))))'
Stuttering acceptance computed with spot in 472 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 533 ms.
Product exploration explored 100000 steps with 0 reset in 278 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 11 states, 19 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
RANDOM walk for 27212 steps (6 resets) in 373 ms. (72 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 11 states, 19 edges and 2 AP (stutter sensitive) to 11 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 520 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2383622513909466643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1267295938411180267.kers'
[2026-06-02 03:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2383622513909466643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1267295938411180267.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 106 cols 369 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-06-02 03:20:12] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1267295938411180267.kers
Total runtime 1 ms.
[2026-06-02 03:20:12] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
Proved EG (NOT p1) asserting that LTL formula F !(NOT p1) is false.
Negative knowledge disproves property using: (F p1)
Knowledge-based reduction took 1094 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-02 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLCardinality-02 finished in 2567 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(X(p0)))))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 167/167 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 112 transition count 155
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 107 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 107 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 103 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 103 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 100 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 100 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 99 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 99 transition count 125
Applied a total of 50 rules in 18 ms. Remains 99 /124 variables (removed 25) and now considering 125/167 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11904189206610824943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3027667803613235667.kers'
[2026-06-02 03:20:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11904189206610824943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3027667803613235667.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 99 cols 332 entries
Finished phase 1 with 89 SingleSign rule and 1 generalized
[2026-06-02 03:20:12] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3027667803613235667.kers
Total runtime 1 ms.
[2026-06-02 03:20:12] [INFO ] Implicit Places using invariants in 92 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/124 places, 125/167 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 98/124 places, 125/167 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLCardinality-03
Product exploration explored 100000 steps with 20000 reset in 186 ms.
Product exploration explored 100000 steps with 20000 reset in 257 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Knowledge-based reduction took 443 ms.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 125/125 (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-5408884037600879522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15181202368848933682.kers'
[2026-06-02 03:20:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5408884037600879522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15181202368848933682.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 98 cols 329 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-06-02 03:20:14] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15181202368848933682.kers
Total runtime 1 ms.
[2026-06-02 03:20:14] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-06-02 03:20:14] [INFO ] Invariant cache hit.
[2026-06-02 03:20:14] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-06-02 03:20:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 125/223 variables, 98/108 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 108 constraints, problems are : Problem set: 0 solved, 124 unsolved in 8747 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/223 variables, 98/108 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 124/232 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 233 constraints, problems are : Problem set: 0 solved, 124 unsolved in 10382 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19157ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 19160ms
Finished structural reductions in LTL mode , in 1 iterations and 19423 ms. Remains : 98/98 places, 125/125 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Knowledge-based reduction took 348 ms.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 55 ms.
Product exploration explored 100000 steps with 20000 reset in 66 ms.
Spot run failed in 155 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/ltsmin9805981306185653683
[2026-06-02 03:20:34] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9805981306185653683
Running compilation step : cd /tmp/ltsmin9805981306185653683;'/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 742 ms.
Running link step : cd /tmp/ltsmin9805981306185653683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin9805981306185653683;'/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/stateBased14806030767028652479.hoa' '--buchi-type=spotba'
LTSmin run took 82 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLCardinality-03 finished in 23135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 167/167 transitions.
Graph (trivial) has 120 edges and 124 vertex of which 11 / 124 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 117 transition count 127
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 49 rules applied. Total rules applied 82 place count 85 transition count 110
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 91 place count 77 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 76 transition count 109
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 92 place count 76 transition count 100
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 111 place count 66 transition count 100
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 116 place count 61 transition count 95
Iterating global reduction 4 with 5 rules applied. Total rules applied 121 place count 61 transition count 95
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 121 place count 61 transition count 93
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 59 transition count 93
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 128 place count 56 transition count 74
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 56 transition count 74
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 167 place count 38 transition count 56
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 36 transition count 50
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 36 transition count 50
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 181 place count 31 transition count 57
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 188 place count 31 transition count 50
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 190 place count 29 transition count 46
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 29 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 196 place count 29 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 198 place count 28 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 201 place count 28 transition count 48
Applied a total of 201 rules in 41 ms. Remains 28 /124 variables (removed 96) and now considering 48/167 (removed 119) transitions.
[2026-06-02 03:20:35] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4682322247914947282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15968870707758175894.kers'
[2026-06-02 03:20:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4682322247914947282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15968870707758175894.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 43 rows 26 cols 153 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-06-02 03:20:35] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15968870707758175894.kers
Total runtime 1 ms.
[2026-06-02 03:20:35] [INFO ] Implicit Places using invariants in 67 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/124 places, 48/167 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 48
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 25 transition count 47
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 24 transition count 45
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 24 transition count 45
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 24 transition count 44
Applied a total of 8 rules in 12 ms. Remains 24 /27 variables (removed 3) and now considering 44/48 (removed 4) transitions.
[2026-06-02 03:20:35] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17541072098056170424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6975680468991029048.kers'
[2026-06-02 03:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17541072098056170424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6975680468991029048.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 39 rows 23 cols 143 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-06-02 03:20:36] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6975680468991029048.kers
Total runtime 1 ms.
[2026-06-02 03:20:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-06-02 03:20:36] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2026-06-02 03:20:36] [INFO ] Invariant cache hit.
[2026-06-02 03:20:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-06-02 03:20:36] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/124 places, 44/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 24/124 places, 44/167 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 52 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLCardinality-06 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 167/167 transitions.
Graph (trivial) has 118 edges and 124 vertex of which 11 / 124 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 117 transition count 128
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 49 rules applied. Total rules applied 81 place count 86 transition count 110
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 90 place count 77 transition count 110
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 90 place count 77 transition count 101
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 109 place count 67 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 113 place count 63 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 63 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 117 place count 63 transition count 96
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 119 place count 62 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 59 transition count 77
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 59 transition count 77
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 165 place count 39 transition count 57
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 36 transition count 50
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 36 transition count 50
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 183 place count 30 transition count 68
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 195 place count 30 transition count 56
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 197 place count 28 transition count 52
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 28 transition count 52
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 209 place count 28 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 211 place count 27 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 218 place count 27 transition count 42
Applied a total of 218 rules in 41 ms. Remains 27 /124 variables (removed 97) and now considering 42/167 (removed 125) transitions.
[2026-06-02 03:20:36] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12334099501944595766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5501399815754612733.kers'
[2026-06-02 03:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12334099501944595766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5501399815754612733.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 37 rows 25 cols 120 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-06-02 03:20:36] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5501399815754612733.kers
Total runtime 1 ms.
[2026-06-02 03:20:36] [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 : 26/124 places, 42/167 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
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 24 transition count 50
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 9 place count 24 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 23 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 23 transition count 43
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 23 transition count 38
Applied a total of 16 rules in 9 ms. Remains 23 /26 variables (removed 3) and now considering 38/42 (removed 4) transitions.
[2026-06-02 03:20:36] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6176398312513163979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16642711017535193118.kers'
[2026-06-02 03:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6176398312513163979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16642711017535193118.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 32 rows 22 cols 102 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-06-02 03:20:36] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16642711017535193118.kers
Total runtime 1 ms.
[2026-06-02 03:20:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-06-02 03:20:36] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
[2026-06-02 03:20:36] [INFO ] Invariant cache hit.
[2026-06-02 03:20:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-02 03:20:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/124 places, 38/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 246 ms. Remains : 23/124 places, 38/167 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 52 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLCardinality-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLCardinality-07 finished in 334 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 G(!p0)))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 167/167 transitions.
Graph (trivial) has 120 edges and 124 vertex of which 11 / 124 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 117 transition count 127
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 49 rules applied. Total rules applied 82 place count 85 transition count 110
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 91 place count 76 transition count 110
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 91 place count 76 transition count 101
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 110 place count 66 transition count 101
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 116 place count 60 transition count 95
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 60 transition count 95
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 122 place count 60 transition count 93
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 126 place count 58 transition count 93
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 55 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 55 transition count 74
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 170 place count 36 transition count 55
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 33 transition count 48
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 33 transition count 48
Performed 5 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 186 place count 28 transition count 61
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 192 place count 28 transition count 55
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 193 place count 27 transition count 53
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 27 transition count 53
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 200 place count 27 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 207 place count 27 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 209 place count 26 transition count 46
Applied a total of 209 rules in 32 ms. Remains 26 /124 variables (removed 98) and now considering 46/167 (removed 121) transitions.
[2026-06-02 03:20:36] [INFO ] Flow matrix only has 42 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17225232763666622133.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13872444001738438977.kers'
[2026-06-02 03:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17225232763666622133.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13872444001738438977.kers]
Normalized transition count is 41 out of 42 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 41 rows 24 cols 158 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-06-02 03:20:36] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13872444001738438977.kers
Total runtime 1 ms.
[2026-06-02 03:20:36] [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 : 25/124 places, 46/167 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
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 23 transition count 60
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 23 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 22 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 22 transition count 50
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 22 transition count 42
Applied a total of 22 rules in 8 ms. Remains 22 /25 variables (removed 3) and now considering 42/46 (removed 4) transitions.
[2026-06-02 03:20:36] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16499298753280176877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3892813130490712832.kers'
[2026-06-02 03:20:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16499298753280176877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3892813130490712832.kers]
Normalized transition count is 37 out of 38 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 37 rows 21 cols 140 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-06-02 03:20:36] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3892813130490712832.kers
Total runtime 1 ms.
[2026-06-02 03:20:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-06-02 03:20:36] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
[2026-06-02 03:20:36] [INFO ] Invariant cache hit.
[2026-06-02 03:20:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2026-06-02 03:20:36] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/124 places, 42/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 22/124 places, 42/167 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 G(!p0)))'
Stuttering acceptance computed with spot in 119 ms :[p0, true, p0]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 154 ms.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Negative knowledge disproves property using: (X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 52 ms. Proved property starting from automaton with 3 states, 5 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 58 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLCardinality-08 finished in 799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0)) U (p1&&F(p2)))))))'
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 114 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 114 transition count 157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 110 transition count 140
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 110 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 107 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 107 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 105 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 105 transition count 134
Applied a total of 38 rules in 9 ms. Remains 105 /124 variables (removed 19) and now considering 134/167 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13792935720714842783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17676139548333338082.kers'
[2026-06-02 03:20:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13792935720714842783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17676139548333338082.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 105 cols 366 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-06-02 03:20:37] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17676139548333338082.kers
Total runtime 2 ms.
[2026-06-02 03:20:37] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-06-02 03:20:37] [INFO ] Invariant cache hit.
[2026-06-02 03:20:37] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-06-02 03:20:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/239 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 115 constraints, problems are : Problem set: 0 solved, 133 unsolved in 9394 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/239 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 133/250 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 12013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21435ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 21437ms
Starting structural reductions in LTL mode, iteration 1 : 105/124 places, 134/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21712 ms. Remains : 105/124 places, 134/167 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0)) U (p1&&F(p2)))))))'
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : ErlangenMainframeV2-PT-bP01C01-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 211 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 50 in 0 ms.
FORMULA ErlangenMainframeV2-PT-bP01C01-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV2-PT-bP01C01-LTLCardinality-12 finished in 22283 ms.
All properties solved by simple procedures.
Total runtime 99706 ms.

BK_STOP 1780370459810

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

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