Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r103-tall-167814479001005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DNAwalker-PT-17redondantChoiceL, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814479001005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 13:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 13:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 211K Mar 5 18:22 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

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

=== Now, execution of the tool begins

BK_START 1678307622847

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-17redondantChoiceL
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 20:33:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 20:33:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:33:44] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-08 20:33:44] [INFO ] Transformed 43 places.
[2023-03-08 20:33:44] [INFO ] Transformed 490 transitions.
[2023-03-08 20:33:44] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Normalized transition count is 489 out of 490 initially.
// Phase 1: matrix 489 rows 43 cols
[2023-03-08 20:33:44] [INFO ] Computed 0 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 375 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :30
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
[2023-03-08 20:33:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-08 20:33:44] [INFO ] Computed 0 place invariants in 18 ms
[2023-03-08 20:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:33:45] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-08 20:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:33:50] [INFO ] [Nat]Absence check using state equation in 4973 ms returned unknown
[2023-03-08 20:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:33:50] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-08 20:33:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:33:55] [INFO ] [Nat]Absence check using state equation in 4993 ms returned unknown
[2023-03-08 20:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:33:55] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-08 20:33:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:00] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2023-03-08 20:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:00] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-08 20:34:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:05] [INFO ] [Nat]Absence check using state equation in 4983 ms returned unknown
[2023-03-08 20:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:05] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-08 20:34:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:10] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2023-03-08 20:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:10] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-08 20:34:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:15] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
[2023-03-08 20:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:15] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-08 20:34:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:20] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
[2023-03-08 20:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:20] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-08 20:34:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:26] [INFO ] [Nat]Absence check using state equation in 4981 ms returned unknown
[2023-03-08 20:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:26] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-08 20:34:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:31] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-08 20:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:31] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-08 20:34:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:36] [INFO ] [Nat]Absence check using state equation in 4983 ms returned unknown
[2023-03-08 20:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:36] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-08 20:34:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:41] [INFO ] [Nat]Absence check using state equation in 5002 ms returned unknown
[2023-03-08 20:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:41] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-08 20:34:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:45] [INFO ] [Nat]Absence check using state equation in 4458 ms returned unsat
[2023-03-08 20:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:46] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 20:34:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:51] [INFO ] [Nat]Absence check using state equation in 4999 ms returned unknown
[2023-03-08 20:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:51] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-08 20:34:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:56] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-08 20:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:56] [INFO ] [Real]Absence check using state equation in 46 ms returned unsat
[2023-03-08 20:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:56] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-08 20:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:34:57] [INFO ] [Nat]Absence check using state equation in 1502 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 2, -1, -1, 1, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 13 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 43 transition count 478
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 38 transition count 473
Applied a total of 17 rules in 58 ms. Remains 38 /43 variables (removed 5) and now considering 473/490 (removed 17) transitions.
// Phase 1: matrix 473 rows 38 cols
[2023-03-08 20:34:57] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-08 20:34:58] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 38/43 places, 473/490 transitions.
[2023-03-08 20:34:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 42432 resets, run finished after 4657 ms. (steps per millisecond=214 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3709 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3205 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3740 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3471 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3566 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 4100 resets, run finished after 817 ms. (steps per millisecond=1223 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3309 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3788 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3907 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3568 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 5954 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3676 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 1000000 steps, including 5632 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 13) seen :26
[2023-03-08 20:35:13] [INFO ] Invariant cache hit.
[2023-03-08 20:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:13] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-08 20:35:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:19] [INFO ] [Nat]Absence check using state equation in 6077 ms returned unknown
[2023-03-08 20:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:19] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-08 20:35:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:25] [INFO ] [Nat]Absence check using state equation in 6075 ms returned unknown
[2023-03-08 20:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:25] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 20:35:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:27] [INFO ] [Nat]Absence check using state equation in 1496 ms returned unsat
[2023-03-08 20:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:27] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 20:35:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:31] [INFO ] [Nat]Absence check using state equation in 4507 ms returned unsat
[2023-03-08 20:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:31] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-08 20:35:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:37] [INFO ] [Nat]Absence check using state equation in 6078 ms returned unknown
[2023-03-08 20:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:38] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-08 20:35:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:44] [INFO ] [Nat]Absence check using state equation in 6077 ms returned unknown
[2023-03-08 20:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:44] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 20:35:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:48] [INFO ] [Nat]Absence check using state equation in 4275 ms returned unsat
[2023-03-08 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:48] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-08 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:49] [INFO ] [Nat]Absence check using state equation in 1272 ms returned unsat
[2023-03-08 20:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-08 20:35:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:56] [INFO ] [Nat]Absence check using state equation in 6072 ms returned unknown
[2023-03-08 20:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:56] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-08 20:35:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:59] [INFO ] [Nat]Absence check using state equation in 2808 ms returned unsat
[2023-03-08 20:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:35:59] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-08 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:05] [INFO ] [Nat]Absence check using state equation in 6068 ms returned unknown
[2023-03-08 20:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:05] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-08 20:36:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:07] [INFO ] [Nat]Absence check using state equation in 2060 ms returned unsat
[2023-03-08 20:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:07] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-08 20:36:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:10] [INFO ] [Nat]Absence check using state equation in 2629 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 2, 2, -1, -1, 2, 2, -1, 2, -1, 2, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 473/473 transitions.
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 469
Applied a total of 4 rules in 25 ms. Remains 34 /38 variables (removed 4) and now considering 469/473 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 34/38 places, 469/473 transitions.
// Phase 1: matrix 469 rows 34 cols
[2023-03-08 20:36:10] [INFO ] Computed 0 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 50323 resets, run finished after 4446 ms. (steps per millisecond=224 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4918 resets, run finished after 780 ms. (steps per millisecond=1282 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4543 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4623 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4854 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4738 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 7999 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 6) seen :12
[2023-03-08 20:36:19] [INFO ] Invariant cache hit.
[2023-03-08 20:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:19] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-08 20:36:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:20] [INFO ] [Nat]Absence check using state equation in 1308 ms returned unsat
[2023-03-08 20:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:20] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-08 20:36:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:23] [INFO ] [Nat]Absence check using state equation in 2433 ms returned unsat
[2023-03-08 20:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:23] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 20:36:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:26] [INFO ] [Nat]Absence check using state equation in 3516 ms returned unsat
[2023-03-08 20:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:26] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-08 20:36:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:36:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:32] [INFO ] [Nat]Absence check using state equation in 5251 ms returned unsat
[2023-03-08 20:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:32] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 20:36:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:35] [INFO ] [Nat]Absence check using state equation in 2657 ms returned unsat
[2023-03-08 20:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:35] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-08 20:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 20:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 20:36:36] [INFO ] [Nat]Absence check using state equation in 1794 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, 2, 2] Max seen :[2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 172705 ms.
ITS solved all properties within timeout

BK_STOP 1678307797940

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-17redondantChoiceL"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DNAwalker-PT-17redondantChoiceL, 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 r103-tall-167814479001005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-17redondantChoiceL.tgz
mv DNAwalker-PT-17redondantChoiceL 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;