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

About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1006

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6210.308 42496.00 128068.00 284.70 TTFFFTTFFFTTTFFT 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.r114-smll-177955740600470.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 ErlangenMainframeV0-PT-1006, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740600470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 6.9K Mar 7 05:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 05:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 05:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 05:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 09:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 7 05:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 05:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 7 05:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 41M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779886475325

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1006
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-27 12:54:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 12:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 12:54:40] [INFO ] Load time of PNML (sax parser for PT used): 2738 ms
[2026-05-27 12:54:40] [INFO ] Transformed 279 places.
[2026-05-27 12:54:40] [INFO ] Transformed 35278 transitions.
[2026-05-27 12:54:40] [INFO ] Found NUPN structural information;
[2026-05-27 12:54:40] [INFO ] Parsed PT model containing 279 places and 35278 transitions and 817267 arcs in 3539 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 26820 ms. (1 steps per ms) remains 3/14 properties
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-27 12:54:52] [INFO ] Flatten gal took : 8653 ms
BEST_FIRST walk for 40002 steps (8 resets) in 14124 ms. (2 steps per ms) remains 2/3 properties
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 2623 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 776 ms. (51 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16179994220991230262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3556566857924199795.kers'
[2026-05-27 12:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16179994220991230262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3556566857924199795.kers]
Culled 0 columns in 137 ms.
// Phase 1: matrix 35278 rows 279 cols 817267 entries
Finished phase 1 with 250 SingleSign rule and 3 generalized
[2026-05-27 12:54:54] [INFO ] Computed 26 invariants in 605 ms
Computed 26 P flows in 606 ms.
Exported basis to /tmp/petrispot-output-3556566857924199795.kers
Total runtime 717 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 227/255 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 227/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/279 variables, 10/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 24/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2026-05-27 12:54:57] [INFO ] Flatten gal took : 4870 ms
[2026-05-27 12:54:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11089712452820222115.gal : 1155 ms
[2026-05-27 12:54:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13736316994623131443.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11089712452820222115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13736316994623131443.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
SMT process timed out in 6712ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 35278/35278 transitions.
Graph (trivial) has 176 edges and 279 vertex of which 2 / 279 are part of one of the 1 SCC in 24 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 278 transition count 35210
Reduce places removed 66 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 71 rules applied. Total rules applied 138 place count 212 transition count 35205
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 143 place count 207 transition count 35205
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 143 place count 207 transition count 35194
Deduced a syphon composed of 11 places in 53 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 165 place count 196 transition count 35194
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 207 place count 154 transition count 35152
Iterating global reduction 3 with 42 rules applied. Total rules applied 249 place count 154 transition count 35152
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 249 place count 154 transition count 35149
Deduced a syphon composed of 3 places in 49 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 255 place count 151 transition count 35149
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 269 place count 137 transition count 23489
Ensure Unique test removed 8 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 291 place count 129 transition count 23489
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 300 place count 120 transition count 353
Iterating global reduction 3 with 9 rules applied. Total rules applied 309 place count 120 transition count 353
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 312 place count 117 transition count 347
Iterating global reduction 3 with 3 rules applied. Total rules applied 315 place count 117 transition count 347
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 381 place count 84 transition count 314
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 382 place count 83 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 383 place count 83 transition count 209
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 389 place count 80 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 397 place count 80 transition count 201
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 407 place count 80 transition count 191
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 424 place count 70 transition count 184
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 425 place count 69 transition count 178
Iterating global reduction 4 with 1 rules applied. Total rules applied 426 place count 69 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 427 place count 69 transition count 177
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 428 place count 69 transition count 176
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 430 place count 69 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 432 place count 69 transition count 174
Applied a total of 432 rules in 11266 ms. Remains 69 /279 variables (removed 210) and now considering 174/35278 (removed 35104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11283 ms. Remains : 69/279 places, 174/35278 transitions.
RANDOM walk for 40000 steps (8 resets) in 858 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 691605 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 2
Probabilistic random walk after 691605 steps, saw 187914 distinct states, run finished after 3010 ms. (steps per millisecond=229 ) properties seen :0
[2026-05-27 12:55:14] [INFO ] Flow matrix only has 170 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-850387799922349162.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12996963139891695764.kers'
[2026-05-27 12:55:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-850387799922349162.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12996963139891695764.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 170 rows 68 cols 1498 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-05-27 12:55:14] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12996963139891695764.kers
Total runtime 2 ms.
[2026-05-27 12:55:14] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/68 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 170/239 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 117/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 204 constraints, problems are : Problem set: 0 solved, 2 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/68 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/69 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 170/239 variables, 69/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 117/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/239 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 228 ms.
Support contains 28 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 174/174 transitions.
Applied a total of 0 rules in 7 ms. Remains 69 /69 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 69/69 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 69 /69 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2026-05-27 12:55:16] [INFO ] Flow matrix only has 170 transitions (discarded 4 similar events)
[2026-05-27 12:55:16] [INFO ] Invariant cache hit.
[2026-05-27 12:55:16] [INFO ] Implicit Places using invariants in 292 ms returned [36, 42, 53]
[2026-05-27 12:55:16] [INFO ] Actually due to overlaps returned [36, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 306 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 174/174 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 170
Applied a total of 4 rules in 15 ms. Remains 67 /67 variables (removed 0) and now considering 170/174 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2858372093122449788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15382431138360785805.kers'
[2026-05-27 12:55:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2858372093122449788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15382431138360785805.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 67 cols 1398 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-05-27 12:55:16] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15382431138360785805.kers
Total runtime 4 ms.
[2026-05-27 12:55:16] [INFO ] Implicit Places using invariants in 161 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/69 places, 170/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 497 ms. Remains : 66/69 places, 170/174 transitions.
RANDOM walk for 40000 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/2 properties
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15643620807308239075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8413079902638095191.kers'
[2026-05-27 12:55:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15643620807308239075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8413079902638095191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 66 cols 1297 entries
Finished phase 1 with 49 SingleSign rule and 2 generalized
[2026-05-27 12:55:16] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8413079902638095191.kers
Total runtime 4 ms.
[2026-05-27 12:55:16] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/66 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 170/236 variables, 66/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 117/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/66 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 170/236 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 117/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
FORMULA ErlangenMainframeV0-PT-1006-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 40515 ms.

BK_STOP 1779886517821

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ErlangenMainframeV0-PT-1006"
export BK_EXAMINATION="ReachabilityCardinality"
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 ErlangenMainframeV0-PT-1006, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-177955740600470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1006.tgz
mv ErlangenMainframeV0-PT-1006 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;