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.r083-tall-174860079600050.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 DNAwalker-PT-04track28LL, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079600050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 12 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 108K May 29 14:32 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 DNAwalker-PT-04track28LL-UpperBounds-00
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-01
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-02
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-03
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-04
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-05
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-06
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-07
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-08
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-09
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-10
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-11
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-12
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-13
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-14
FORMULA_NAME DNAwalker-PT-04track28LL-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748730613185

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-04track28LL
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:30:14] [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-05-31 22:30:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:30:14] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-05-31 22:30:14] [INFO ] Transformed 34 places.
[2025-05-31 22:30:14] [INFO ] Transformed 250 transitions.
[2025-05-31 22:30:14] [INFO ] Parsed PT model containing 34 places and 250 transitions and 728 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 1, 1, 0, 0, 1, 1, 0, 2, 1, 1, 1, 1, 1, 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:[1, 0, 1, 1, 0, 0, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 22:30:14] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2025-05-31 22:30:14] [INFO ] Computed 0 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 1, 0, 0, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (653 resets) in 62 ms. (158 steps per ms)
BEST_FIRST walk for 160014 steps (1002 resets) in 193 ms. (824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 22:30:14] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2025-05-31 22:30:14] [INFO ] Invariant cache hit.
[2025-05-31 22:30:15] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-05-31 22:30:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:16] [INFO ] [Nat]Absence check using state equation in 1043 ms returned unknown
[2025-05-31 22:30:16] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-31 22:30:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:17] [INFO ] [Nat]Absence check using state equation in 1035 ms returned unknown
[2025-05-31 22:30:17] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-31 22:30:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:18] [INFO ] [Nat]Absence check using state equation in 1034 ms returned unknown
[2025-05-31 22:30:18] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-05-31 22:30:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:19] [INFO ] [Nat]Absence check using state equation in 1035 ms returned unknown
[2025-05-31 22:30:19] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-05-31 22:30:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:20] [INFO ] [Nat]Absence check using state equation in 1032 ms returned unknown
[2025-05-31 22:30:20] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-31 22:30:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:21] [INFO ] [Nat]Absence check using state equation in 1037 ms returned unknown
[2025-05-31 22:30:21] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-31 22:30:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:22] [INFO ] [Nat]Absence check using state equation in 1029 ms returned unknown
[2025-05-31 22:30:23] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-31 22:30:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:24] [INFO ] [Nat]Absence check using state equation in 1030 ms returned unknown
[2025-05-31 22:30:24] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-05-31 22:30:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:25] [INFO ] [Nat]Absence check using state equation in 1032 ms returned unknown
[2025-05-31 22:30:25] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-05-31 22:30:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:26] [INFO ] [Nat]Absence check using state equation in 1028 ms returned unknown
[2025-05-31 22:30:26] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-31 22:30:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:27] [INFO ] [Nat]Absence check using state equation in 1036 ms returned unknown
[2025-05-31 22:30:27] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:30:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:28] [INFO ] [Nat]Absence check using state equation in 1030 ms returned unknown
[2025-05-31 22:30:28] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-31 22:30:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:29] [INFO ] [Nat]Absence check using state equation in 1031 ms returned unknown
[2025-05-31 22:30:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-31 22:30:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:30] [INFO ] [Nat]Absence check using state equation in 1031 ms returned unknown
[2025-05-31 22:30:30] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:30:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:31] [INFO ] [Nat]Absence check using state equation in 1037 ms returned unknown
[2025-05-31 22:30:31] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:30:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:30:33] [INFO ] [Nat]Absence check using state equation in 1031 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 250/250 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 34 transition count 240
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 32 transition count 238
Applied a total of 12 rules in 35 ms. Remains 32 /34 variables (removed 2) and now considering 238/250 (removed 12) transitions.
Running 230 sub problems to find dead transitions.
// Phase 1: matrix 238 rows 32 cols
[2025-05-31 22:30:33] [INFO ] Computed 0 invariants in 7 ms
[2025-05-31 22:30:33] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 238/266 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 4/270 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 70 constraints, problems are : Problem set: 0 solved, 230 unsolved in 5721 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 238/266 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 230/296 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 4/270 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 230 unsolved in 20013 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
After SMT, in 25958ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 25972ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26027 ms. Remains : 32/34 places, 238/250 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2025-05-31 22:30:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (71142 resets) in 2890 ms. (345 steps per ms)
BEST_FIRST walk for 16000013 steps (143963 resets) in 11206 ms. (1427 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 22:31:13] [INFO ] Invariant cache hit.
[2025-05-31 22:31:13] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:31:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:22] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2025-05-31 22:31:22] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-05-31 22:31:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:31] [INFO ] [Nat]Absence check using state equation in 9029 ms returned unknown
[2025-05-31 22:31:31] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:31:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:40] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2025-05-31 22:31:40] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:31:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:49] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2025-05-31 22:31:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:31:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:58] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2025-05-31 22:31:58] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 22:31:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:07] [INFO ] [Nat]Absence check using state equation in 9029 ms returned unknown
[2025-05-31 22:32:07] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 22:32:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:16] [INFO ] [Nat]Absence check using state equation in 9031 ms returned unknown
[2025-05-31 22:32:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:32:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:26] [INFO ] [Nat]Absence check using state equation in 9031 ms returned unknown
[2025-05-31 22:32:26] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:32:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:35] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2025-05-31 22:32:35] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:32:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:44] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2025-05-31 22:32:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:32:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:53] [INFO ] [Nat]Absence check using state equation in 9029 ms returned unknown
[2025-05-31 22:32:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:32:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:02] [INFO ] [Nat]Absence check using state equation in 9029 ms returned unknown
[2025-05-31 22:33:02] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-05-31 22:33:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:11] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2025-05-31 22:33:11] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:33:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:20] [INFO ] [Nat]Absence check using state equation in 9031 ms returned unknown
[2025-05-31 22:33:20] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:33:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:29] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2025-05-31 22:33:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:33:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:38] [INFO ] [Nat]Absence check using state equation in 9031 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 238/238 transitions.
Applied a total of 0 rules in 11 ms. Remains 32 /32 variables (removed 0) and now considering 238/238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 32/32 places, 238/238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 238/238 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2025-05-31 22:33:38] [INFO ] Invariant cache hit.
[2025-05-31 22:33:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-31 22:33:39] [INFO ] Invariant cache hit.
[2025-05-31 22:33:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-31 22:33:39] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2025-05-31 22:33:39] [INFO ] Redundant transitions in 11 ms returned []
Running 230 sub problems to find dead transitions.
[2025-05-31 22:33:39] [INFO ] Invariant cache hit.
[2025-05-31 22:33:39] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 238/266 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 4/270 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 70 constraints, problems are : Problem set: 0 solved, 230 unsolved in 5588 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 238/266 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 230/296 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 4/270 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30010 ms.
Refiners :[State Equation: 32/32 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
After SMT, in 35737ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 35740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35943 ms. Remains : 32/32 places, 238/238 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2025-05-31 22:34:15] [INFO ] Flatten gal took : 91 ms
[2025-05-31 22:34:15] [INFO ] Flatten gal took : 31 ms
[2025-05-31 22:34:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3271633007363298335.gal : 12 ms
RANDOM walk for 40000 steps (2827 resets) in 1577 ms. (25 steps per ms) remains 16/16 properties
[2025-05-31 22:34:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16248514657391032276.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3271633007363298335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16248514657391032276.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (35 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 16/16 properties

BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
its-reach command run as :
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 16/16 properties

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality16248514657391032276.prop.
BEST_FIRST walk for 4002 steps (32 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 9
BEST_FIRST walk for 4002 steps (34 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :9 after 76
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :76 after 573
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :573 after 1089
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :1089 after 7082
BEST_FIRST walk for 4004 steps (27 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :7082 after 28202
BEST_FIRST walk for 4004 steps (32 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :28202 after 61104
BEST_FIRST walk for 4004 steps (29 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :61104 after 247631
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :247631 after 1.54852e+06
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :1.54852e+06 after 9.23156e+06
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :9.23156e+06 after 4.94806e+07
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,1.89293e+08,0.697496,21584,2,2081,16,71649,22,0,425,90142,0
Total reachable state count : 189292701

Verifying 16 reachability properties.
Invariant property MIN0 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
MIN0,0,0.698042,21584,1,0,16,71649,22,0,426,90142,0
Invariant property MIN1 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
MIN1,0,0.69895,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN2 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
MIN2,0,0.699117,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN3 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
MIN3,0,0.69953,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN4 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
MIN4,0,0.699787,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN5 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
MIN5,0,0.699928,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN6 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
MIN6,0,0.70003,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN7 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
MIN7,0,0.700278,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN8 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
MIN8,0,0.700795,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN9 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
MIN9,0,0.701616,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN10 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
MIN10,0,0.701937,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN11 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
MIN11,0,0.702141,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN12 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
MIN12,0,0.703,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN13 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
MIN13,0,0.703179,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN14 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
MIN14,0,0.703687,21844,1,0,16,71649,22,0,426,90142,0
Invariant property MIN15 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
MIN15,0,0.703997,21844,1,0,16,71649,22,0,426,90142,0
Interrupted probabilistic random walk after 627102 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 16
Probabilistic random walk after 627102 steps, saw 133802 distinct states, run finished after 3004 ms. (steps per millisecond=208 ) properties seen :0
FORMULA DNAwalker-PT-04track28LL-UpperBounds-15 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-14 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-11 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-10 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-09 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-08 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-07 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-06 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-04track28LL-UpperBounds-00 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 16 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 244289 ms.

BK_STOP 1748730858678

--------------------
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="DNAwalker-PT-04track28LL"
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 DNAwalker-PT-04track28LL, 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 r083-tall-174860079600050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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