Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.4K Apr 29 18:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 18:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 19 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 211K May 10 09:33 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-16redondantChoiceR-UpperBounds-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652591181134

Running Version 0
[2022-05-15 05:06:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 05:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:06:22] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2022-05-15 05:06:22] [INFO ] Transformed 43 places.
[2022-05-15 05:06:22] [INFO ] Transformed 490 transitions.
[2022-05-15 05:06:22] [INFO ] Parsed PT model containing 43 places and 490 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 139 ms.
Normalized transition count is 489 out of 490 initially.
// Phase 1: matrix 489 rows 43 cols
[2022-05-15 05:06:23] [INFO ] Computed 0 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 378 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 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :30
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 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 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 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 26 resets, run finished after 13 ms. (steps per millisecond=769 ) 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 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 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 27 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 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 26 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 32 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 26 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :31
[2022-05-15 05:06:23] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2022-05-15 05:06:23] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-15 05:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:23] [INFO ] [Real]Absence check using state equation in 90 ms returned unsat
[2022-05-15 05:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:23] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-15 05:06:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:27] [INFO ] [Nat]Absence check using state equation in 3705 ms returned unsat
[2022-05-15 05:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:27] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-15 05:06:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:32] [INFO ] [Nat]Absence check using state equation in 4992 ms returned unknown
[2022-05-15 05:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:32] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-15 05:06:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:37] [INFO ] [Nat]Absence check using state equation in 5002 ms returned unknown
[2022-05-15 05:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:37] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-15 05:06:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:42] [INFO ] [Nat]Absence check using state equation in 4994 ms returned unknown
[2022-05-15 05:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:42] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-15 05:06:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:47] [INFO ] [Nat]Absence check using state equation in 4348 ms returned unsat
[2022-05-15 05:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:47] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-15 05:06:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:49] [INFO ] [Nat]Absence check using state equation in 2451 ms returned unsat
[2022-05-15 05:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:49] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-05-15 05:06:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:54] [INFO ] [Nat]Absence check using state equation in 4993 ms returned unknown
[2022-05-15 05:06:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:54] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-15 05:06:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:06:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:06:59] [INFO ] [Nat]Absence check using state equation in 4992 ms returned unknown
[2022-05-15 05:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:00] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-15 05:07:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:05] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
[2022-05-15 05:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:05] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 05:07:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:08] [INFO ] [Nat]Absence check using state equation in 3067 ms returned unsat
[2022-05-15 05:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:08] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-15 05:07:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:11] [INFO ] [Nat]Absence check using state equation in 3062 ms returned unsat
[2022-05-15 05:07:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:11] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-15 05:07:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:15] [INFO ] [Nat]Absence check using state equation in 3766 ms returned unsat
[2022-05-15 05:07:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:15] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-15 05:07:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:16] [INFO ] [Nat]Absence check using state equation in 1125 ms returned unsat
[2022-05-15 05:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:16] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 05:07:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:19] [INFO ] [Nat]Absence check using state equation in 2419 ms returned unsat
[2022-05-15 05:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:19] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 05:07:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:24] [INFO ] [Nat]Absence check using state equation in 4989 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 2, -1, -1, -1, 2, 2, -1, -1, -1, 2, 2, 2, 2, 2, -1] Max seen :[1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 42 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 41 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 40 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 39 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 38 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 37 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 36 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 35 transition count 465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 34 transition count 464
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 33 transition count 463
Applied a total of 27 rules in 193 ms. Remains 33 /43 variables (removed 10) and now considering 463/490 (removed 27) transitions.
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 05:07:24] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 05:07:24] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/43 places, 463/490 transitions.
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 05:07:24] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 42608 resets, run finished after 4441 ms. (steps per millisecond=225 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4264 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4410 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4172 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4316 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4418 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4135 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4393 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 7) seen :14
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 05:07:34] [INFO ] Computed 0 place invariants in 14 ms
[2022-05-15 05:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:34] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-15 05:07:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:36] [INFO ] [Nat]Absence check using state equation in 1819 ms returned unsat
[2022-05-15 05:07:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:36] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-15 05:07:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:38] [INFO ] [Nat]Absence check using state equation in 2153 ms returned unsat
[2022-05-15 05:07:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:38] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-15 05:07:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:41] [INFO ] [Nat]Absence check using state equation in 3065 ms returned unknown
[2022-05-15 05:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:41] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-15 05:07:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:44] [INFO ] [Nat]Absence check using state equation in 3065 ms returned unknown
[2022-05-15 05:07:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:45] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 05:07:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:48] [INFO ] [Nat]Absence check using state equation in 3060 ms returned unknown
[2022-05-15 05:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:48] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-15 05:07:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:49] [INFO ] [Nat]Absence check using state equation in 1684 ms returned unsat
[2022-05-15 05:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:49] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-15 05:07:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:07:53] [INFO ] [Nat]Absence check using state equation in 3067 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, 2, -1, -1, -1, 2, -1] Max seen :[2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 463/463 transitions.
Applied a total of 0 rules in 13 ms. Remains 33 /33 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 463/463 transitions.
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 05:07:53] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 42633 resets, run finished after 4292 ms. (steps per millisecond=232 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 4187 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 4348 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 4411 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 4378 resets, run finished after 800 ms. (steps per millisecond=1250 ) properties (out of 4) seen :8
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 05:08:00] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 05:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:00] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-15 05:08:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:03] [INFO ] [Nat]Absence check using state equation in 3067 ms returned unknown
[2022-05-15 05:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:03] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 05:08:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:06] [INFO ] [Nat]Absence check using state equation in 3066 ms returned unknown
[2022-05-15 05:08:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:06] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-15 05:08:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:09] [INFO ] [Nat]Absence check using state equation in 3061 ms returned unknown
[2022-05-15 05:08:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:10] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-15 05:08:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:13] [INFO ] [Nat]Absence check using state equation in 3065 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[2, 2, 2, 2]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 463/463 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 463/463 transitions.
Starting structural reductions, iteration 0 : 33/33 places, 463/463 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 05:08:13] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 05:08:13] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 463 rows 33 cols
[2022-05-15 05:08:13] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 05:08:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-15 05:08:13] [INFO ] Implicit Places using invariants and state equation in 522 ms returned [32]
Discarding 1 places :
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 581 ms to find 1 implicit places.
[2022-05-15 05:08:13] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 458 rows 32 cols
[2022-05-15 05:08:13] [INFO ] Computed 0 place invariants in 9 ms
[2022-05-15 05:08:13] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 458/463 transitions.
Applied a total of 0 rules in 11 ms. Remains 32 /32 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2022-05-15 05:08:13] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 458 rows 32 cols
[2022-05-15 05:08:13] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 05:08:14] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 458/463 transitions.
// Phase 1: matrix 458 rows 32 cols
[2022-05-15 05:08:14] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 36237 resets, run finished after 4131 ms. (steps per millisecond=242 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 3860 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 3917 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 3969 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 4007 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 4) seen :8
// Phase 1: matrix 458 rows 32 cols
[2022-05-15 05:08:21] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 05:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:21] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 05:08:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:24] [INFO ] [Nat]Absence check using state equation in 3058 ms returned unknown
[2022-05-15 05:08:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:24] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-15 05:08:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:27] [INFO ] [Nat]Absence check using state equation in 3054 ms returned unknown
[2022-05-15 05:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:27] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-15 05:08:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:30] [INFO ] [Nat]Absence check using state equation in 2487 ms returned unsat
[2022-05-15 05:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:30] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-15 05:08:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:31] [INFO ] [Nat]Absence check using state equation in 1037 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 2, 2] Max seen :[2, 2, 2, 2]
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 458/458 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 456
Applied a total of 2 rules in 20 ms. Remains 31 /32 variables (removed 1) and now considering 456/458 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/32 places, 456/458 transitions.
// Phase 1: matrix 456 rows 31 cols
[2022-05-15 05:08:31] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 36232 resets, run finished after 3998 ms. (steps per millisecond=250 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 4007 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 4012 resets, run finished after 765 ms. (steps per millisecond=1307 ) properties (out of 2) seen :4
// Phase 1: matrix 456 rows 31 cols
[2022-05-15 05:08:36] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 05:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:36] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2022-05-15 05:08:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:41] [INFO ] [Nat]Absence check using state equation in 4779 ms returned unsat
[2022-05-15 05:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:41] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-15 05:08:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:44] [INFO ] [Nat]Absence check using state equation in 2418 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2] Max seen :[2, 2]
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652591325244

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-16redondantChoiceR"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DNAwalker-PT-16redondantChoiceR, 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 r071-tall-165254780500184"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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