Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r265-tall-174931349600024.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r265-tall-174931349600024
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 11K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 11:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jun 6 11:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 6 08:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Jun 6 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Jun 6 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 126K Jun 5 20:08 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 1749318811086

Invoking MCC driver with
BK_TOOL=gold2024
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 202405141337
[2025-06-07 17:53:32] [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]
[2025-06-07 17:53:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:53:32] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2025-06-07 17:53:32] [INFO ] Transformed 125 places.
[2025-06-07 17:53:32] [INFO ] Transformed 165 transitions.
[2025-06-07 17:53:32] [INFO ] Parsed PT model containing 125 places and 165 transitions and 768 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0] 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, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0] 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
[2025-06-07 17:53:32] [INFO ] Computed 27 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0] Max Struct:[4, 4, 1, 1, 1, 4, 1, 1, 1, 1, 4, 4, 1, 4, 1, 1]
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 29 ms. (333 steps per ms)
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (13 resets) in 68 ms. (579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0] Max Struct:[4, 4, 4, 4]
[2025-06-07 17:53:32] [INFO ] Invariant cache hit.
[2025-06-07 17:53:32] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2025-06-07 17:53:32] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-07 17:53:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-07 17:53:33] [INFO ] [Real]Added 46 Read/Feed constraints in 9 ms returned sat
[2025-06-07 17:53:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Nat]Added 46 Read/Feed constraints in 7 ms returned sat
[2025-06-07 17:53:33] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 15 ms.
[2025-06-07 17:53:33] [INFO ] Added : 31 causal constraints over 7 iterations in 273 ms. Result :sat
Minimization took 177 ms.
[2025-06-07 17:53:33] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Real]Added 46 Read/Feed constraints in 6 ms returned sat
[2025-06-07 17:53:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Nat]Added 46 Read/Feed constraints in 6 ms returned sat
[2025-06-07 17:53:33] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 10 ms.
[2025-06-07 17:53:34] [INFO ] Added : 30 causal constraints over 7 iterations in 156 ms. Result :sat
Minimization took 98 ms.
[2025-06-07 17:53:34] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Real]Added 46 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:53:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:34] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Nat]Added 46 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:53:34] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 13 ms.
[2025-06-07 17:53:34] [INFO ] Added : 6 causal constraints over 2 iterations in 56 ms. Result :sat
Minimization took 90 ms.
[2025-06-07 17:53:34] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Real]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Real]Added 46 Read/Feed constraints in 5 ms returned sat
[2025-06-07 17:53:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:34] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-06-07 17:53:34] [INFO ] [Nat]Added 46 Read/Feed constraints in 4 ms returned sat
[2025-06-07 17:53:34] [INFO ] Computed and/alt/rep : 115/368/115 causal constraints (skipped 4 transitions) in 10 ms.
[2025-06-07 17:53:34] [INFO ] Added : 30 causal constraints over 7 iterations in 180 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0] Max Struct:[4, 4, 4, 4]
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 2] Max Struct:[4, 4]
Support contains 2 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 104 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 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 104 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 103 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 102 transition count 163
Applied a total of 5 rules in 43 ms. Remains 102 /125 variables (removed 23) and now considering 163/165 (removed 2) transitions.
Running 117 sub problems to find dead transitions.
// Phase 1: matrix 163 rows 102 cols
[2025-06-07 17:53:35] [INFO ] Computed 26 invariants in 8 ms
[2025-06-07 17:53:35] [INFO ] State equation strengthened by 46 read => feed constraints.
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
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 2/265 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 174 constraints, problems are : Problem set: 0 solved, 117 unsolved in 7326 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
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
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 109/281 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/265 variables, and 281 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/102 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 109/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 27492ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 27504ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27559 ms. Remains : 102/125 places, 163/165 transitions.
[2025-06-07 17:54:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 2] Max Struct:[4, 4]
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000002 steps (2 resets) in 903 ms. (1106 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 871 ms. (1146 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-06-07 17:54:04] [INFO ] Invariant cache hit.
[2025-06-07 17:54:04] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2025-06-07 17:54:04] [INFO ] [Real]Absence check using 25 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-07 17:54:04] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-07 17:54:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:54:04] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2025-06-07 17:54:04] [INFO ] [Nat]Absence check using 25 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:54:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-07 17:54:04] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-07 17:54:04] [INFO ] [Nat]Added 46 Read/Feed constraints in 13 ms returned sat
[2025-06-07 17:54:04] [INFO ] Computed and/alt/rep : 69/207/69 causal constraints (skipped 48 transitions) in 14 ms.
[2025-06-07 17:54:04] [INFO ] Added : 24 causal constraints over 6 iterations in 135 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 163/163 transitions.
Graph (complete) has 497 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 101 /102 variables (removed 1) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 101/102 places, 163/163 transitions.
// Phase 1: matrix 163 rows 101 cols
[2025-06-07 17:54:04] [INFO ] Computed 26 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (3 resets) in 786 ms. (1270 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 775 ms. (1288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-06-07 17:54:06] [INFO ] Invariant cache hit.
[2025-06-07 17:54:06] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2025-06-07 17:54:06] [INFO ] [Real]Absence check using 25 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:54:06] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-06-07 17:54:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-07 17:54:06] [INFO ] [Real]Added 46 Read/Feed constraints in 5 ms returned sat
[2025-06-07 17:54:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:54:06] [INFO ] [Nat]Absence check using 25 positive place invariants in 3 ms returned sat
[2025-06-07 17:54:06] [INFO ] [Nat]Absence check using 25 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 17:54:06] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-07 17:54:06] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2025-06-07 17:54:06] [INFO ] Computed and/alt/rep : 69/207/69 causal constraints (skipped 48 transitions) in 11 ms.
[2025-06-07 17:54:06] [INFO ] Added : 24 causal constraints over 6 iterations in 120 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] 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 14 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 14 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 7 ms. Remains 101 /101 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2025-06-07 17:54:06] [INFO ] Invariant cache hit.
[2025-06-07 17:54:06] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-07 17:54:06] [INFO ] Invariant cache hit.
[2025-06-07 17:54:06] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-07 17:54:07] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
[2025-06-07 17:54:07] [INFO ] Redundant transitions in 5 ms returned []
Running 117 sub problems to find dead transitions.
[2025-06-07 17:54:07] [INFO ] Invariant cache hit.
[2025-06-07 17:54:07] [INFO ] State equation strengthened by 46 read => feed constraints.
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
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 1/264 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/264 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 173 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6538 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
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
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 113/285 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 285 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30021 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: 0/0 constraints]
After SMT, in 36618ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 36620ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37276 ms. Remains : 101/101 places, 163/163 transitions.
RANDOM walk for 40000 steps (9 resets) in 434 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
[2025-06-07 17:54:44] [INFO ] Flatten gal took : 93 ms
[2025-06-07 17:54:44] [INFO ] Flatten gal took : 28 ms
[2025-06-07 17:54:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8130245910498293549.gal : 9 ms
[2025-06-07 17:54:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5817094348375861560.prop : 0 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8130245910498293549.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5817094348375861560.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5817094348375861560.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 329
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :329 after 336
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :336 after 3395
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,130333,0.069833,5744,2,1200,11,12353,6,0,565,5568,0
Total reachable state count : 130333

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,1,0.070834,5744,2,102,11,12353,7,0,568,5568,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,1,0.071789,6004,2,102,11,12353,8,0,569,5568,0
Interrupted probabilistic random walk after 724329 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 2
Probabilistic random walk after 724329 steps, saw 248977 distinct states, run finished after 3004 ms. (steps per millisecond=241 ) properties seen :0
FORMULA CopsAndRobbers-PT-CRL023X004-UpperBounds-11 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 74943 ms.

BK_STOP 1749318887422

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r265-tall-174931349600024"
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 ;