Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987881900127.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DNAwalker-PT-06track28RL, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 3.6K Mar 31 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 20:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 20:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 06:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 27 06:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 12 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 108K Mar 24 05:37 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-06track28RL-ReachabilityFireability-00
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-01
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-02
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-03
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-04
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-05
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-06
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-07
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-08
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-09
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-10
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-11
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-12
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-13
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-14
FORMULA_NAME DNAwalker-PT-06track28RL-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591203880926

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:04:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 17:04:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:04:42] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-06-03 17:04:42] [INFO ] Transformed 34 places.
[2020-06-03 17:04:42] [INFO ] Transformed 250 transitions.
[2020-06-03 17:04:42] [INFO ] Parsed PT model containing 34 places and 250 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 640 resets, run finished after 87 ms. (steps per millisecond=114 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0]
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 17:04:42] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2020-06-03 17:04:42] [INFO ] Computed 0 place invariants in 11 ms
[2020-06-03 17:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:43] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-06-03 17:04:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:43] [INFO ] [Nat]Absence check using state equation in 133 ms returned unsat
[2020-06-03 17:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:43] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-06-03 17:04:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:43] [INFO ] [Nat]Absence check using state equation in 320 ms returned unsat
[2020-06-03 17:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:43] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2020-06-03 17:04:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:44] [INFO ] [Nat]Absence check using state equation in 145 ms returned unsat
[2020-06-03 17:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:44] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-06-03 17:04:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:44] [INFO ] [Nat]Absence check using state equation in 339 ms returned unsat
[2020-06-03 17:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:44] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-06-03 17:04:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:44] [INFO ] [Nat]Absence check using state equation in 179 ms returned unsat
[2020-06-03 17:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:44] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-03 17:04:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:45] [INFO ] [Nat]Absence check using state equation in 158 ms returned unsat
[2020-06-03 17:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:45] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-06-03 17:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:45] [INFO ] [Nat]Absence check using state equation in 125 ms returned unsat
[2020-06-03 17:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:45] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-06-03 17:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:45] [INFO ] [Nat]Absence check using state equation in 133 ms returned unsat
[2020-06-03 17:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:45] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-06-03 17:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:45] [INFO ] [Nat]Absence check using state equation in 212 ms returned unsat
[2020-06-03 17:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:45] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-03 17:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:46] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2020-06-03 17:04:46] [INFO ] State equation strengthened by 54 read => feed constraints.
[2020-06-03 17:04:46] [INFO ] [Nat]Added 54 Read/Feed constraints in 179 ms returned sat
[2020-06-03 17:04:46] [INFO ] Computed and/alt/rep : 234/2667/231 causal constraints in 22 ms.
[2020-06-03 17:04:46] [INFO ] Added : 27 causal constraints over 6 iterations in 201 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2020-06-03 17:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:46] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-06-03 17:04:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:04:46] [INFO ] [Nat]Absence check using state equation in 193 ms returned unsat
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 2800 steps, including 335 resets, run finished after 12 ms. (steps per millisecond=233 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 34 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 34/34 places, 250/250 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 240 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 33 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 32 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 31 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 30 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 29 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 28 transition count 230
Applied a total of 20 rules in 83 ms. Remains 28 /34 variables (removed 6) and now considering 230/250 (removed 20) transitions.
// Phase 1: matrix 230 rows 28 cols
[2020-06-03 17:04:46] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 17:04:46] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/34 places, 230/250 transitions.
Incomplete random walk after 1000000 steps, including 82762 resets, run finished after 2217 ms. (steps per millisecond=451 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 11812 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties seen :[0]
Interrupted probabilistic random walk after 23491236 steps, run timeout after 30001 ms. (steps per millisecond=783 ) properties seen :[0]
Probabilistic random walk after 23491236 steps, saw 5672586 distinct states, run finished after 30001 ms. (steps per millisecond=783 ) properties seen :[0]
// Phase 1: matrix 230 rows 28 cols
[2020-06-03 17:05:19] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:05:20] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-06-03 17:05:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:05:20] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2020-06-03 17:05:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 17:05:20] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2020-06-03 17:05:20] [INFO ] Computed and/alt/rep : 224/2092/224 causal constraints in 27 ms.
[2020-06-03 17:05:21] [INFO ] Added : 80 causal constraints over 21 iterations in 1360 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 2300 steps, including 614 resets, run finished after 17 ms. (steps per millisecond=135 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 28 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 28/28 places, 230/230 transitions.
Applied a total of 0 rules in 17 ms. Remains 28 /28 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/28 places, 230/230 transitions.
Starting structural reductions, iteration 0 : 28/28 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 28 cols
[2020-06-03 17:05:21] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:05:21] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 230 rows 28 cols
[2020-06-03 17:05:21] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:05:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 17:05:21] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [18, 23, 27]
Discarding 3 places :
Drop transitions removed 15 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 17 transitions.
Implicit Place search using SMT with State Equation took 173 ms to find 3 implicit places.
[2020-06-03 17:05:21] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 213 rows 25 cols
[2020-06-03 17:05:21] [INFO ] Computed 0 place invariants in 0 ms
[2020-06-03 17:05:22] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Starting structural reductions, iteration 1 : 25/28 places, 213/230 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2020-06-03 17:05:22] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 213 rows 25 cols
[2020-06-03 17:05:22] [INFO ] Computed 0 place invariants in 5 ms
[2020-06-03 17:05:22] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/28 places, 213/230 transitions.
Incomplete random walk after 1000000 steps, including 54999 resets, run finished after 2085 ms. (steps per millisecond=479 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 9174 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties seen :[0]
Interrupted probabilistic random walk after 23416320 steps, run timeout after 30001 ms. (steps per millisecond=780 ) properties seen :[0]
Probabilistic random walk after 23416320 steps, saw 5493229 distinct states, run finished after 30001 ms. (steps per millisecond=780 ) properties seen :[0]
// Phase 1: matrix 213 rows 25 cols
[2020-06-03 17:05:55] [INFO ] Computed 0 place invariants in 5 ms
[2020-06-03 17:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:05:55] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-06-03 17:05:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:05:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:05:55] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2020-06-03 17:05:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 17:05:55] [INFO ] [Nat]Added 6 Read/Feed constraints in 11 ms returned sat
[2020-06-03 17:05:55] [INFO ] Computed and/alt/rep : 207/1952/207 causal constraints in 27 ms.
[2020-06-03 17:05:56] [INFO ] Added : 74 causal constraints over 18 iterations in 1254 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 2200 steps, including 570 resets, run finished after 17 ms. (steps per millisecond=129 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 213/213 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 25 cols
[2020-06-03 17:05:56] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 17:05:56] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 213 rows 25 cols
[2020-06-03 17:05:56] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:05:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 17:05:57] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2020-06-03 17:05:57] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 213 rows 25 cols
[2020-06-03 17:05:57] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 17:05:57] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 213/213 transitions.
Incomplete random walk after 100000 steps, including 5502 resets, run finished after 169 ms. (steps per millisecond=591 ) properties seen :[0]
// Phase 1: matrix 213 rows 25 cols
[2020-06-03 17:05:57] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:05:57] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2020-06-03 17:05:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:05:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:05:57] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2020-06-03 17:05:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-06-03 17:05:57] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2020-06-03 17:05:57] [INFO ] Computed and/alt/rep : 207/1952/207 causal constraints in 19 ms.
[2020-06-03 17:05:58] [INFO ] Added : 74 causal constraints over 18 iterations in 1299 ms. Result :sat
Applied a total of 0 rules in 11 ms. Remains 25 /25 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 25 cols
[2020-06-03 17:05:58] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:05:59] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-03 17:05:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:05:59] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 17:05:59] [INFO ] Computed and/alt/rep : 207/1916/207 causal constraints in 26 ms.
[2020-06-03 17:05:59] [INFO ] Added : 39 causal constraints over 10 iterations in 441 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 17:05:59] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2020-06-03 17:05:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
[2020-06-03 17:06:00] [INFO ] Flatten gal took : 65 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DNAwalker-PT-06track28RL @ 3570 seconds

FORMULA DNAwalker-PT-06track28RL-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3507
rslt: Output for ReachabilityFireability @ DNAwalker-PT-06track28RL

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 17:06:00 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20156,
"runtime": 63.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p0 <= 1) OR (p2 <= 0) OR ((2 <= p0) AND (1 <= p8)) OR ((2 <= p11) AND (1 <= p20)) OR ((2 <= p1) AND (1 <= p2)) OR ((1 <= p10) AND (2 <= p11) AND (1 <= p20) AND (2 <= p23)))))",
"processed_size": 187,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 634,
"conflict_clusters": 2,
"places": 25,
"places_significant": 25,
"singleton_clusters": 0,
"transitions": 213
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 96,
"problems": 16
},
"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: 238/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 213 transitions, 25 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 ReachabilityFireability.xml
lola: A (G (((p0 <= 1) OR (p2 <= 0) OR ((2 <= p0) AND (1 <= p8)) OR ((2 <= p11) AND (1 <= p20)) OR ((2 <= p1) AND (1 <= p2)) OR ((1 <= p10) AND (2 <= p11) AND (1 <= p20) AND (2 <= p23)))))
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 (((p0 <= 1) OR (p2 <= 0) OR ((2 <= p0) AND (1 <= p8)) OR ((2 <= p11) AND (1 <= p20)) OR ((2 <= p1) AND (1 <= p2)) OR ((1 <= p10) AND (2 <= p11) AND (1 <= p20) AND (2 <= p23)))))
lola: processed formula length: 187
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p0) AND (1 <= p2) AND ((p0 <= 1) OR (p8 <= 0)) AND ((p11 <= 1) OR (p20 <= 0)) AND ((p1 <= 1) OR (p2 <= 0)) AND ((p10 <= 0) OR (p11 <= 1) OR (p20 <= 0) OR (p23 <= 1)))
lola: local time limit reached - aborting
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 96 literals and 16 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 24 markings, 24 edges
lola: memory consumption: 20156 KB
lola: time consumption: 63 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
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-06track28RL"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is DNAwalker-PT-06track28RL, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987881900127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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