About the Execution of ITS-LoLa for DNAwalker-PT-15ringRRLarge
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15739.530 | 3600000.00 | 153414.00 | 114.60 | FFTFFTTFTTTFFFFF | normal |
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-158987882000198.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-15ringRRLarge, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882000198
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 3.3K Mar 31 05:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 05:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 20:56 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:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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.9K Mar 28 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 06:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 14 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 135K 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-15ringRRLarge-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591207998350
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:13:20] [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]
[2020-06-03 18:13:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:13:20] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2020-06-03 18:13:20] [INFO ] Transformed 33 places.
[2020-06-03 18:13:20] [INFO ] Transformed 312 transitions.
[2020-06-03 18:13:20] [INFO ] Parsed PT model containing 33 places and 312 transitions in 121 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 758 resets, run finished after 100 ms. (steps per millisecond=100 ) properties seen :[0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 45 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 61 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 10000 steps, including 59 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 21 ms. (steps per millisecond=476 ) 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 14 ms. (steps per millisecond=714 ) 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 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 56 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 49 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 59 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 17 ms. (steps per millisecond=588 ) 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 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 44 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 49 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 18:13:21] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2020-06-03 18:13:21] [INFO ] Computed 0 place invariants in 13 ms
[2020-06-03 18:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:21] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 18:13:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:21] [INFO ] [Nat]Absence check using state equation in 249 ms returned unsat
[2020-06-03 18:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:21] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 18:13:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:22] [INFO ] [Nat]Absence check using state equation in 323 ms returned unsat
[2020-06-03 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:22] [INFO ] [Real]Absence check using state equation in 86 ms returned unsat
[2020-06-03 18:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:22] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2020-06-03 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:23] [INFO ] [Nat]Absence check using state equation in 436 ms returned unsat
[2020-06-03 18:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:23] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-06-03 18:13:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:23] [INFO ] [Nat]Absence check using state equation in 218 ms returned unsat
[2020-06-03 18:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:23] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-03 18:13:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:23] [INFO ] [Nat]Absence check using state equation in 196 ms returned unsat
[2020-06-03 18:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:24] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2020-06-03 18:13:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:24] [INFO ] [Nat]Absence check using state equation in 246 ms returned unsat
[2020-06-03 18:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:24] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2020-06-03 18:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:24] [INFO ] [Real]Absence check using state equation in 89 ms returned unsat
[2020-06-03 18:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:24] [INFO ] [Real]Absence check using state equation in 72 ms returned unsat
[2020-06-03 18:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:24] [INFO ] [Real]Absence check using state equation in 47 ms returned unsat
[2020-06-03 18:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:24] [INFO ] [Real]Absence check using state equation in 67 ms returned unsat
[2020-06-03 18:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:24] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-06-03 18:13:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:25] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2020-06-03 18:13:25] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-06-03 18:13:25] [INFO ] [Nat]Added 71 Read/Feed constraints in 32 ms returned sat
[2020-06-03 18:13:25] [INFO ] Computed and/alt/rep : 282/3965/281 causal constraints in 47 ms.
[2020-06-03 18:13:25] [INFO ] Added : 27 causal constraints over 6 iterations in 467 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 18:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:25] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-06-03 18:13:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:13:26] [INFO ] [Nat]Absence check using state equation in 226 ms returned unsat
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 2700 steps, including 203 resets, run finished after 32 ms. (steps per millisecond=84 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 33 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 32 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 31 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 30 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 29 transition count 302
Applied a total of 10 rules in 118 ms. Remains 29 /33 variables (removed 4) and now considering 302/312 (removed 10) transitions.
// Phase 1: matrix 302 rows 29 cols
[2020-06-03 18:13:26] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 18:13:26] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/33 places, 302/312 transitions.
Incomplete random walk after 1000000 steps, including 101027 resets, run finished after 2980 ms. (steps per millisecond=335 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 7382 resets, run finished after 1000 ms. (steps per millisecond=1000 ) properties seen :[0]
Interrupted probabilistic random walk after 21370958 steps, run timeout after 30001 ms. (steps per millisecond=712 ) properties seen :[0]
Probabilistic random walk after 21370958 steps, saw 3959235 distinct states, run finished after 30001 ms. (steps per millisecond=712 ) properties seen :[0]
// Phase 1: matrix 302 rows 29 cols
[2020-06-03 18:14:00] [INFO ] Computed 0 place invariants in 9 ms
[2020-06-03 18:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:14:00] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2020-06-03 18:14:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:14:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:14:00] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-06-03 18:14:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-03 18:14:00] [INFO ] [Nat]Added 18 Read/Feed constraints in 29 ms returned sat
[2020-06-03 18:14:00] [INFO ] Computed and/alt/rep : 276/3180/276 causal constraints in 28 ms.
[2020-06-03 18:14:01] [INFO ] Added : 42 causal constraints over 10 iterations in 406 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
Incomplete Parikh walk after 2500 steps, including 117 resets, run finished after 11 ms. (steps per millisecond=227 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 29 /29 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 29/29 places, 302/302 transitions.
Applied a total of 0 rules in 14 ms. Remains 29 /29 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 29 cols
[2020-06-03 18:14:01] [INFO ] Computed 0 place invariants in 3 ms
[2020-06-03 18:14:01] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 302 rows 29 cols
[2020-06-03 18:14:01] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 18:14:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-03 18:14:01] [INFO ] Implicit Places using invariants and state equation in 259 ms returned [8, 22]
Discarding 2 places :
Drop transitions removed 22 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 23 transitions.
Implicit Place search using SMT with State Equation took 353 ms to find 2 implicit places.
[2020-06-03 18:14:01] [INFO ] Redundant transitions in 95 ms returned []
// Phase 1: matrix 279 rows 27 cols
[2020-06-03 18:14:01] [INFO ] Computed 0 place invariants in 9 ms
[2020-06-03 18:14:02] [INFO ] Dead Transitions using invariants and state equation in 362 ms returned []
Starting structural reductions, iteration 1 : 27/29 places, 279/302 transitions.
Applied a total of 0 rules in 14 ms. Remains 27 /27 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2020-06-03 18:14:02] [INFO ] Redundant transitions in 163 ms returned []
// Phase 1: matrix 279 rows 27 cols
[2020-06-03 18:14:02] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 18:14:02] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Finished structural reductions, in 2 iterations. Remains : 27/29 places, 279/302 transitions.
Incomplete random walk after 1000000 steps, including 54904 resets, run finished after 2504 ms. (steps per millisecond=399 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 5839 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties seen :[0]
Interrupted probabilistic random walk after 23295664 steps, run timeout after 30001 ms. (steps per millisecond=776 ) properties seen :[0]
Probabilistic random walk after 23295664 steps, saw 4482017 distinct states, run finished after 30001 ms. (steps per millisecond=776 ) properties seen :[0]
// Phase 1: matrix 279 rows 27 cols
[2020-06-03 18:14:35] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 18:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:14:35] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-03 18:14:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:14:36] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2020-06-03 18:14:36] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-03 18:14:36] [INFO ] [Nat]Added 18 Read/Feed constraints in 30 ms returned sat
[2020-06-03 18:14:36] [INFO ] Computed and/alt/rep : 254/2935/254 causal constraints in 29 ms.
[2020-06-03 18:14:36] [INFO ] Added : 25 causal constraints over 5 iterations in 179 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 2000 steps, including 117 resets, run finished after 13 ms. (steps per millisecond=153 ) properties seen :[0] could not realise parikh vector
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 279/279 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 279/279 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 279/279 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 279/279 (removed 0) transitions.
// Phase 1: matrix 279 rows 27 cols
[2020-06-03 18:14:36] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 18:14:36] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 279 rows 27 cols
[2020-06-03 18:14:36] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 18:14:36] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-03 18:14:36] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2020-06-03 18:14:36] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 279 rows 27 cols
[2020-06-03 18:14:36] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 18:14:36] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 279/279 transitions.
Incomplete random walk after 100000 steps, including 5470 resets, run finished after 361 ms. (steps per millisecond=277 ) properties seen :[0]
// Phase 1: matrix 279 rows 27 cols
[2020-06-03 18:14:37] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 18:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:14:37] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-06-03 18:14:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:14:37] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-06-03 18:14:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-03 18:14:37] [INFO ] [Nat]Added 18 Read/Feed constraints in 23 ms returned sat
[2020-06-03 18:14:37] [INFO ] Computed and/alt/rep : 254/2935/254 causal constraints in 17 ms.
[2020-06-03 18:14:37] [INFO ] Added : 25 causal constraints over 5 iterations in 154 ms. Result :sat
Applied a total of 0 rules in 8 ms. Remains 27 /27 variables (removed 0) and now considering 279/279 (removed 0) transitions.
// Phase 1: matrix 279 rows 27 cols
[2020-06-03 18:14:37] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 18:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:14:37] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-03 18:14:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:14:38] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2020-06-03 18:14:38] [INFO ] Computed and/alt/rep : 252/2773/252 causal constraints in 29 ms.
[2020-06-03 18:14:38] [INFO ] Added : 29 causal constraints over 6 iterations in 241 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 18:14:38] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2020-06-03 18:14:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
[2020-06-03 18:14:38] [INFO ] Flatten gal took : 95 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DNAwalker-PT-15ringRRLarge @ 3570 seconds
FORMULA DNAwalker-PT-15ringRRLarge-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3517
rslt: Output for ReachabilityCardinality @ DNAwalker-PT-15ringRRLarge
{
"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": "Wed Jun 3 18:14:39 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19272,
"runtime": 53.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"JSON": "ReachabilityCardinality.json",
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((((p0 <= p16) AND (1 <= p24) AND (3 <= p12)) OR ((p25 + 1 <= p0) AND (p4 + 1 <= p17)))))",
"processed_size": 95,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 821,
"conflict_clusters": 3,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 279
},
"result":
{
"edges": 335,
"markings": 204,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability",
"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: 306/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 279 transitions, 27 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: E (F ((((p0 <= p16) AND (1 <= p24) AND (3 <= p12)) OR ((p25 + 1 <= p0) AND (p4 + 1 <= p17)))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p0 <= p16) AND (1 <= p24) AND (3 <= p12)) OR ((p25 + 1 <= p0) AND (p4 + 1 <= p17)))))
lola: processed formula length: 95
lola: 1 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p0 <= p16) AND (1 <= p24) AND (3 <= p12)) OR ((p25 + 1 <= p0) AND (p4 + 1 <= p17)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 204 markings, 335 edges
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: error: :64: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: memory consumption: 19272 KB
lola: time consumption: 53 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: memory consumption: 19272 KB
lola: time consumption: 53 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-15ringRRLarge"
export BK_EXAMINATION="ReachabilityCardinality"
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-15ringRRLarge, 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 r178-tajo-158987882000198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-15ringRRLarge.tgz
mv DNAwalker-PT-15ringRRLarge 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 '
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 ;