fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r079-tall-177946972200059
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for CopsAndRobbers-PT-CRL023X004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
538.027 109863.00 126239.00 564.50 4 4 4 1 1 1 4 1 4 1 4 1 1 4 4 1 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.r079-tall-177946972200059.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 gold2025
Input is CopsAndRobbers-PT-CRL023X004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-tall-177946972200059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.2K Mar 6 13:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 13:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 13:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 13:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 15 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 6 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Mar 6 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 6 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 122K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779556967055

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-CRL023X004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 17:22:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 17:22:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:22:48] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-23 17:22:48] [INFO ] Transformed 125 places.
[2026-05-23 17:22:48] [INFO ] Transformed 165 transitions.
[2026-05-23 17:22:48] [INFO ] Parsed PT model containing 125 places and 165 transitions and 768 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 165 rows 125 cols
[2026-05-23 17:22:48] [INFO ] Computed 27 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[4, 4, 4, 1, 1, 1, 4, 1, 4, 1, 4, 1, 1, 4, 4, 1]
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10003 steps (2 resets) in 27 ms. (357 steps per ms)
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2026-05-23 17:22:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:48] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2026-05-23 17:22:48] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 17:22:48] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-23 17:22:49] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 17:22:49] [INFO ] [Real]Added 46 Read/Feed constraints in 10 ms returned sat
[2026-05-23 17:22:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 17:22:49] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2026-05-23 17:22:49] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:22:49] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-23 17:22:49] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2026-05-23 17:22:49] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 12 ms.
[2026-05-23 17:22:49] [INFO ] Added : 31 causal constraints over 7 iterations in 334 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 165/165 transitions.
Graph (complete) has 562 edges and 125 vertex of which 103 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 103 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 102 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 101 transition count 163
Applied a total of 5 rules in 32 ms. Remains 101 /125 variables (removed 24) and now considering 163/165 (removed 2) transitions.
Running 117 sub problems to find dead transitions.
// Phase 1: matrix 163 rows 101 cols
[2026-05-23 17:22:49] [INFO ] Computed 26 invariants in 3 ms
[2026-05-23 17:22:49] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 163/263 variables, 100/126 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:22:55] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 1/264 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/264 variables, and 174 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 163/263 variables, 100/127 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 113/286 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/264 variables, and 286 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/101 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 113/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40132ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 40140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40181 ms. Remains : 101/125 places, 163/165 transitions.
[2026-05-23 17:23:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1101 ms. (907 steps per ms)
BEST_FIRST walk for 1000001 steps (3 resets) in 871 ms. (1146 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2026-05-23 17:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 17:23:31] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2026-05-23 17:23:31] [INFO ] [Real]Absence check using 25 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-23 17:23:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2026-05-23 17:23:31] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 17:23:31] [INFO ] [Real]Added 46 Read/Feed constraints in 5 ms returned sat
[2026-05-23 17:23:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 17:23:31] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2026-05-23 17:23:31] [INFO ] [Nat]Absence check using 25 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 17:23:31] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2026-05-23 17:23:31] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2026-05-23 17:23:31] [INFO ] Computed and/alt/rep : 69/207/69 causal constraints (skipped 48 transitions) in 9 ms.
[2026-05-23 17:23:32] [INFO ] Added : 24 causal constraints over 6 iterations in 113 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 163/163 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 163/163 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2026-05-23 17:23:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 17:23:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 17:23:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 17:23:32] [INFO ] State equation strengthened by 46 read => feed constraints.
[2026-05-23 17:23:33] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 17:23:33] [INFO ] Redundant transitions in 9 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-23 17:23:33] [INFO ] Invariant cache hit.
[2026-05-23 17:23:33] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 2/100 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 163/263 variables, 100/126 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:23:39] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 1/264 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 17:23:55] [INFO ] Deduced a trap along path composed of 5 places in 55 ms of which 7 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/264 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/264 variables, and 175 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 2/100 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 163/263 variables, 100/127 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 113/286 constraints. Problems are: Problem set: 0 solved, 117 unsolved
SMT process timed out in 60067ms, After SMT, problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61426 ms. Remains : 101/101 places, 163/163 transitions.
RANDOM walk for 40000 steps (8 resets) in 394 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
[2026-05-23 17:24:33] [INFO ] Flatten gal took : 57 ms
[2026-05-23 17:24:33] [INFO ] Flatten gal took : 26 ms
[2026-05-23 17:24:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10561831917591604054.gal : 10 ms
[2026-05-23 17:24:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17790134521087490943.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10561831917591604054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17790134521087490943.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17790134521087490943.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 328
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :328 after 336
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :336 after 3395
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3395 after 130330
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :130330 after 457170
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :457170 after 531165
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :531165 after 1.03322e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.03322e+06 after 2.30099e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.30099e+06 after 3.52228e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9.88777e+06,2.08403,67168,2,13327,16,275303,8,0,567,276232,0
Total reachable state count : 9887770

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,7,2.08494,67168,2,138,16,275303,8,0,569,276232,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,7,2.08559,67168,2,138,16,275303,8,0,569,276232,0
Interrupted probabilistic random walk after 840172 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 2
Probabilistic random walk after 840172 steps, saw 290979 distinct states, run finished after 3004 ms. (steps per millisecond=279 ) properties seen :0
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-10 4 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 108509 ms.

BK_STOP 1779557076918

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="CopsAndRobbers-PT-CRL023X004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is CopsAndRobbers-PT-CRL023X004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r079-tall-177946972200059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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