Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097500319.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DNAwalker-PT-14ringLRLarge, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097500319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 17:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 17:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 14 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 135K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620563263975

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 12:27:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-09 12:27:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:27:45] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-09 12:27:45] [INFO ] Transformed 33 places.
[2021-05-09 12:27:45] [INFO ] Transformed 312 transitions.
[2021-05-09 12:27:45] [INFO ] Parsed PT model containing 33 places and 312 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 779 resets, run finished after 104 ms. (steps per millisecond=96 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-09 12:27:46] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2021-05-09 12:27:46] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-09 12:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:46] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-09 12:27:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:46] [INFO ] [Nat]Absence check using state equation in 397 ms returned unsat
[2021-05-09 12:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:46] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-09 12:27:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:47] [INFO ] [Nat]Absence check using state equation in 358 ms returned unsat
[2021-05-09 12:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:47] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-09 12:27:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:47] [INFO ] [Nat]Absence check using state equation in 192 ms returned unsat
[2021-05-09 12:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:47] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-09 12:27:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:47] [INFO ] [Nat]Absence check using state equation in 281 ms returned unsat
[2021-05-09 12:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:47] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-09 12:27:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:48] [INFO ] [Nat]Absence check using state equation in 921 ms returned unsat
[2021-05-09 12:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:48] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 12:27:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:49] [INFO ] [Nat]Absence check using state equation in 198 ms returned unsat
[2021-05-09 12:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:49] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 12:27:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:49] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2021-05-09 12:27:49] [INFO ] State equation strengthened by 71 read => feed constraints.
[2021-05-09 12:27:49] [INFO ] [Nat]Added 71 Read/Feed constraints in 20 ms returned sat
[2021-05-09 12:27:49] [INFO ] Computed and/alt/rep : 282/3965/281 causal constraints in 23 ms.
[2021-05-09 12:27:49] [INFO ] Added : 29 causal constraints over 6 iterations in 230 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-09 12:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:49] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-09 12:27:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:50] [INFO ] [Nat]Absence check using state equation in 247 ms returned unsat
[2021-05-09 12:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:50] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2021-05-09 12:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:50] [INFO ] [Real]Absence check using state equation in 40 ms returned unsat
[2021-05-09 12:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:50] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-09 12:27:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:50] [INFO ] [Nat]Absence check using state equation in 164 ms returned unsat
[2021-05-09 12:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:50] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-09 12:27:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:50] [INFO ] [Nat]Absence check using state equation in 246 ms returned unsat
[2021-05-09 12:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:50] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-09 12:27:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:51] [INFO ] [Nat]Absence check using state equation in 288 ms returned unsat
[2021-05-09 12:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:51] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 12:27:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:27:51] [INFO ] [Nat]Absence check using state equation in 333 ms returned unsat
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-14ringLRLarge-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 2800 steps, including 117 resets, run finished after 16 ms. (steps per millisecond=175 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 33 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 32 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 31 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 30 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 29 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 28 transition count 300
Applied a total of 12 rules in 58 ms. Remains 28 /33 variables (removed 5) and now considering 300/312 (removed 12) transitions.
// Phase 1: matrix 300 rows 28 cols
[2021-05-09 12:27:51] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-09 12:27:51] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/33 places, 300/312 transitions.
Incomplete random walk after 1000000 steps, including 111671 resets, run finished after 4410 ms. (steps per millisecond=226 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 9500 resets, run finished after 862 ms. (steps per millisecond=1160 ) properties seen :[0]
Interrupted probabilistic random walk after 17073410 steps, run timeout after 30001 ms. (steps per millisecond=569 ) properties seen :[0]
Probabilistic random walk after 17073410 steps, saw 3238593 distinct states, run finished after 30001 ms. (steps per millisecond=569 ) properties seen :[0]
// Phase 1: matrix 300 rows 28 cols
[2021-05-09 12:28:27] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-09 12:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:28:27] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 12:28:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:28:27] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2021-05-09 12:28:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 12:28:27] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2021-05-09 12:28:27] [INFO ] Computed and/alt/rep : 275/3181/275 causal constraints in 19 ms.
[2021-05-09 12:28:27] [INFO ] Added : 36 causal constraints over 10 iterations in 366 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 2400 steps, including 136 resets, run finished after 13 ms. (steps per millisecond=184 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 300/300 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 300/300 transitions.
Starting structural reductions, iteration 0 : 28/28 places, 300/300 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 300/300 (removed 0) transitions.
// Phase 1: matrix 300 rows 28 cols
[2021-05-09 12:28:27] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:28:27] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 300 rows 28 cols
[2021-05-09 12:28:27] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:28:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 12:28:28] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [9, 22]
Discarding 2 places :
Drop transitions removed 23 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 24 transitions.
Implicit Place search using SMT with State Equation took 277 ms to find 2 implicit places.
[2021-05-09 12:28:28] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 276 rows 26 cols
[2021-05-09 12:28:28] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:28:28] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Starting structural reductions, iteration 1 : 26/28 places, 276/300 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2021-05-09 12:28:28] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 276 rows 26 cols
[2021-05-09 12:28:28] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:28:28] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 2 iterations. Remains : 26/28 places, 276/300 transitions.
Incomplete random walk after 1000000 steps, including 54859 resets, run finished after 3547 ms. (steps per millisecond=281 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 6474 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties seen :[0]
Interrupted probabilistic random walk after 16996909 steps, run timeout after 30001 ms. (steps per millisecond=566 ) properties seen :[0]
Probabilistic random walk after 16996909 steps, saw 3450410 distinct states, run finished after 30001 ms. (steps per millisecond=566 ) properties seen :[0]
// Phase 1: matrix 276 rows 26 cols
[2021-05-09 12:29:02] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:29:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-09 12:29:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:29:03] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-09 12:29:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 12:29:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2021-05-09 12:29:03] [INFO ] Computed and/alt/rep : 252/2933/252 causal constraints in 18 ms.
[2021-05-09 12:29:03] [INFO ] Added : 57 causal constraints over 13 iterations in 539 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 2400 steps, including 119 resets, run finished after 11 ms. (steps per millisecond=218 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 26/26 places, 276/276 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 276/276 transitions.
Starting structural reductions, iteration 0 : 26/26 places, 276/276 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
// Phase 1: matrix 276 rows 26 cols
[2021-05-09 12:29:03] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:29:03] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 276 rows 26 cols
[2021-05-09 12:29:03] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 12:29:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 12:29:03] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2021-05-09 12:29:03] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 276 rows 26 cols
[2021-05-09 12:29:03] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 12:29:04] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/26 places, 276/276 transitions.
Incomplete random walk after 100000 steps, including 5407 resets, run finished after 345 ms. (steps per millisecond=289 ) properties seen :[0]
// Phase 1: matrix 276 rows 26 cols
[2021-05-09 12:29:04] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:29:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-09 12:29:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:29:04] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2021-05-09 12:29:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 12:29:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2021-05-09 12:29:04] [INFO ] Computed and/alt/rep : 252/2933/252 causal constraints in 18 ms.
[2021-05-09 12:29:05] [INFO ] Added : 57 causal constraints over 13 iterations in 545 ms. Result :sat
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 276/276 (removed 0) transitions.
// Phase 1: matrix 276 rows 26 cols
[2021-05-09 12:29:05] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 12:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:29:05] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-09 12:29:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:29:05] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2021-05-09 12:29:05] [INFO ] Computed and/alt/rep : 251/2764/251 causal constraints in 14 ms.
[2021-05-09 12:29:07] [INFO ] Added : 53 causal constraints over 12 iterations in 2157 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 12:29:07] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2021-05-09 12:29:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-09 12:29:07] [INFO ] Flatten gal took : 55 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DNAwalker-PT-14ringLRLarge @ 3570 seconds
vrfy: finished
info: timeLeft: 3537
rslt: Output for ReachabilityCardinality @ DNAwalker-PT-14ringLRLarge

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 9 12:29:08 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18196,
"runtime": 33.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p20 + 1 <= p14) OR (p0 <= p3) OR (p14 <= p16))))",
"processed_size": 58,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 817,
"conflict_clusters": 2,
"places": 26,
"places_significant": 26,
"singleton_clusters": 0,
"transitions": 276
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 302/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 276 transitions, 26 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: A (G (((p20 + 1 <= p14) OR (p0 <= p3) OR (p14 <= p16))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p20 + 1 <= p14) OR (p0 <= p3) OR (p14 <= p16))))
lola: processed formula length: 58
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p14 <= p20) AND (p3 + 1 <= p0) AND (p16 + 1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 18196 KB
lola: time consumption: 33 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

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-14ringLRLarge"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is DNAwalker-PT-14ringLRLarge, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tall-162039097500319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-14ringLRLarge.tgz
mv DNAwalker-PT-14ringLRLarge execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;