fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r192-oct2-177969025800168
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for MedleyA-PT-22

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 31275.00 0.00 0.00 F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r192-oct2-177969025800168.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2025
Input is MedleyA-PT-22, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r192-oct2-177969025800168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 238K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1780576876889

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2026-06-04 12:41:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-06-04 12:41:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-04 12:41:18] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2026-06-04 12:41:18] [INFO ] Transformed 307 places.
[2026-06-04 12:41:18] [INFO ] Transformed 740 transitions.
[2026-06-04 12:41:18] [INFO ] Found NUPN structural information;
[2026-06-04 12:41:18] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 236 ms.
Structural test allowed to assert that 48 places are NOT stable. Took 22 ms.
[2026-06-04 12:41:19] [INFO ] Flatten gal took : 142 ms
[2026-06-04 12:41:19] [INFO ] Flatten gal took : 117 ms
RANDOM walk for 40000 steps (1159 resets) in 2456 ms. (16 steps per ms) remains 164/259 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
[2026-06-04 12:41:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17779137040529196482.gal : 63 ms
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
[2026-06-04 12:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality981838235780599023.prop : 2 ms
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17779137040529196482.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality981838235780599023.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 164/164 properties
// Phase 1: matrix 740 rows 307 cols
[2026-06-04 12:41:20] [INFO ] Computed 24 invariants in 14 ms
Loading property file /tmp/ReachabilityCardinality981838235780599023.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,164 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,164 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,164 properties remain. new max is 16
SDD size :7 after 19
SDD proceeding with computation,164 properties remain. new max is 32
SDD size :19 after 47
SDD proceeding with computation,164 properties remain. new max is 64
SDD size :47 after 403
SDD proceeding with computation,164 properties remain. new max is 128
SDD size :403 after 1607
SDD proceeding with computation,164 properties remain. new max is 256
SDD size :1607 after 52703
Invariant property smplace_66 does not hold.
Invariant property smplace_23 does not hold.
SDD proceeding with computation,162 properties remain. new max is 256
SDD size :52703 after 54502
SDD proceeding with computation,162 properties remain. new max is 512
SDD size :54502 after 57198
Invariant property smplace_180 does not hold.
Invariant property smplace_179 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_177 does not hold.
Invariant property smplace_176 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_174 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_172 does not hold.
Invariant property smplace_171 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_105 does not hold.
Invariant property smplace_104 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_55 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_6 does not hold.
SDD proceeding with computation,144 properties remain. new max is 512
SDD size :57198 after 77178
Invariant property smplace_10 does not hold.
SDD proceeding with computation,143 properties remain. new max is 512
SDD size :77178 after 87260
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SDD proceeding with computation,143 properties remain. new max is 1024
SDD size :87260 after 105863
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 1/165 constraints. Problems are: Problem set: 21 solved, 143 unsolved
Invariant property smplace_151 does not hold.
SDD proceeding with computation,142 properties remain. new max is 1024
SDD size :105863 after 180612
Invariant property smplace_122 does not hold.
Invariant property smplace_108 does not hold.
SDD proceeding with computation,140 properties remain. new max is 1024
SDD size :180612 after 294720
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/165 constraints. Problems are: Problem set: 24 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 86/250 variables, 9/174 constraints. Problems are: Problem set: 24 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 86/260 constraints. Problems are: Problem set: 24 solved, 140 unsolved
SDD proceeding with computation,140 properties remain. new max is 2048
SDD size :294720 after 420375
Invariant property smplace_145 does not hold.
Invariant property smplace_115 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/260 constraints. Problems are: Problem set: 37 solved, 127 unsolved
Invariant property smplace_39 does not hold.
Invariant property smplace_32 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_18 does not hold.
Invariant property smplace_15 does not hold.
Invariant property smplace_14 does not hold.
At refinement iteration 6 (OVERLAPS) 10/260 variables, 1/261 constraints. Problems are: Problem set: 43 solved, 121 unsolved
SDD proceeding with computation,121 properties remain. new max is 2048
SDD size :420375 after 824133
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 10/271 constraints. Problems are: Problem set: 43 solved, 121 unsolved
SDD proceeding with computation,121 properties remain. new max is 4096
SDD size :824133 after 1.14801e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/271 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 47/307 variables, 13/284 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 47/331 constraints. Problems are: Problem set: 43 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/1047 variables, and 331 constraints, problems are : Problem set: 43 solved, 121 unsolved in 5049 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 121 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/122 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/122 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 116/237 variables, 9/131 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 116/247 constraints. Problems are: Problem set: 43 solved, 121 unsolved
SDD proceeding with computation,121 properties remain. new max is 8192
SDD size :1.14801e+06 after 1.61618e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/247 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 10/247 variables, 1/248 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 10/258 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/258 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 60/307 variables, 13/271 constraints. Problems are: Problem set: 43 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 60/331 constraints. Problems are: Problem set: 43 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:29] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:29] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property smplace_270 does not hold.
Invariant property smplace_265 does not hold.
Invariant property smplace_207 does not hold.
[2026-06-04 12:41:29] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 23 ms to minimize.
Invariant property smplace_195 does not hold.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/1047 variables, and 334 constraints, problems are : Problem set: 47 solved, 117 unsolved in 5019 ms.
Refiners :[Domain max(s): 307/307 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 0/164 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10201ms problems are : Problem set: 47 solved, 117 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 300 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 300 transition count 706
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 270 transition count 701
Invariant property smplace_129 does not hold.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 67 place count 270 transition count 698
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 267 transition count 698
Invariant property smplace_100 does not hold.
Invariant property smplace_96 does not hold.
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 107 place count 233 transition count 656
Iterating global reduction 2 with 34 rules applied. Total rules applied 141 place count 233 transition count 656
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 149 place count 225 transition count 634
Iterating global reduction 2 with 8 rules applied. Total rules applied 157 place count 225 transition count 634
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 221 transition count 624
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 221 transition count 624
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 167 place count 219 transition count 618
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 219 transition count 618
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 221 place count 193 transition count 592
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 224 place count 190 transition count 589
Iterating global reduction 2 with 3 rules applied. Total rules applied 227 place count 190 transition count 589
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 233 place count 187 transition count 617
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 247 place count 187 transition count 603
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 253 place count 187 transition count 597
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 259 place count 181 transition count 597
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 263 place count 181 transition count 599
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 267 place count 177 transition count 599
Applied a total of 267 rules in 172 ms. Remains 177 /307 variables (removed 130) and now considering 599/740 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 177/307 places, 599/740 transitions.
Invariant property smplace_58 does not hold.
Invariant property smplace_53 does not hold.
Invariant property smplace_51 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_48 does not hold.
Invariant property smplace_42 does not hold.
Invariant property smplace_41 does not hold.
Invariant property smplace_26 does not hold.
Invariant property smplace_13 does not hold.
Invariant property smplace_12 does not hold.
SDD proceeding with computation,104 properties remain. new max is 8192
SDD size :1.61618e+06 after 2.05997e+07
Invariant property smplace_49 does not hold.
SDD proceeding with computation,103 properties remain. new max is 8192
SDD size :2.05997e+07 after 2.52986e+07
RANDOM walk for 4000000 steps (589291 resets) in 36190 ms. (110 steps per ms) remains 2/114 properties
SDD proceeding with computation,103 properties remain. new max is 16384
SDD size :2.52986e+07 after 2.83833e+07
BEST_FIRST walk for 4000003 steps (92621 resets) in 5883 ms. (679 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (92673 resets) in 5835 ms. (685 steps per ms) remains 2/2 properties
[2026-06-04 12:41:43] [INFO ] Flow matrix only has 539 transitions (discarded 60 similar events)
// Phase 1: matrix 539 rows 177 cols
[2026-06-04 12:41:43] [INFO ] Computed 23 invariants in 3 ms
[2026-06-04 12:41:43] [INFO ] State equation strengthened by 143 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/96 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/126 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/176 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 539/715 variables, 176/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/715 variables, 143/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/715 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/716 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/716 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/716 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 716/716 variables, and 343 constraints, problems are : Problem set: 0 solved, 2 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 177/177 constraints, ReadFeed: 143/143 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 74/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/96 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/126 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/173 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:43] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:43] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:44] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:44] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:44] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:44] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:44] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/176 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 539/715 variables, 176/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/715 variables, 143/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/715 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:45] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 15 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/715 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:45] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-04 12:41:45] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/715 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/715 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/716 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/716 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/716 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 716/716 variables, and 355 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2262 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 177/177 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2544ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 599/599 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 177 transition count 577
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 48 place count 155 transition count 573
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 73 place count 130 transition count 541
Iterating global reduction 2 with 25 rules applied. Total rules applied 98 place count 130 transition count 541
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 109 place count 119 transition count 515
Iterating global reduction 2 with 11 rules applied. Total rules applied 120 place count 119 transition count 515
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 117 transition count 510
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 117 transition count 510
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 116 transition count 507
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 116 transition count 507
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 150 place count 104 transition count 495
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 101 transition count 490
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 101 transition count 490
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 98 transition count 512
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 96 transition count 494
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 96 transition count 494
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 172 place count 96 transition count 488
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 178 place count 90 transition count 488
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 184 place count 84 transition count 446
Iterating global reduction 3 with 6 rules applied. Total rules applied 190 place count 84 transition count 446
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 202 place count 84 transition count 504
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 223 place count 72 transition count 495
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 227 place count 72 transition count 491
Applied a total of 227 rules in 113 ms. Remains 72 /177 variables (removed 105) and now considering 491/599 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 72/177 places, 491/599 transitions.
RANDOM walk for 666271 steps (126744 resets) in 6339 ms. (105 steps per ms) remains 0/2 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 260 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL
Total runtime 29504 ms.

BK_STOP 1780576908164

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="MedleyA-PT-22"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool gold2025"
echo " Input is MedleyA-PT-22, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r192-oct2-177969025800168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;