About the Execution of ITS-LoLa for ResAllocation-PT-R003C050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.800 | 3600000.00 | 100890.00 | 102.20 | FFFTFTTTFTTTTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033390400687.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ResAllocation-PT-R003C050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390400687
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 3.8K May 14 00:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 00:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 17:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 17:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 07:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 360K May 12 20:53 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 ResAllocation-PT-R003C050-ReachabilityFireability-00
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-01
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-02
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-03
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-04
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-05
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-06
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-07
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-08
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-09
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-10
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-11
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-12
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-13
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-14
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591238092402
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:34:54] [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-04 02:34:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:34:54] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-06-04 02:34:54] [INFO ] Transformed 300 places.
[2020-06-04 02:34:54] [INFO ] Transformed 200 transitions.
[2020-06-04 02:34:54] [INFO ] Parsed PT model containing 300 places and 200 transitions in 167 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 95 resets, run finished after 114 ms. (steps per millisecond=87 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1]
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 200 rows 300 cols
[2020-06-04 02:34:55] [INFO ] Computed 150 place invariants in 18 ms
[2020-06-04 02:34:55] [INFO ] [Real]Absence check using 150 positive place invariants in 96 ms returned sat
[2020-06-04 02:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:34:55] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-06-04 02:34:56] [INFO ] Deduced a trap composed of 4 places in 89 ms
[2020-06-04 02:34:56] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-06-04 02:34:56] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-06-04 02:34:56] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-06-04 02:34:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 324 ms
[2020-06-04 02:34:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:34:56] [INFO ] [Nat]Absence check using 150 positive place invariants in 128 ms returned sat
[2020-06-04 02:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:34:56] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2020-06-04 02:34:57] [INFO ] Deduced a trap composed of 4 places in 177 ms
[2020-06-04 02:34:57] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-06-04 02:34:57] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-06-04 02:34:57] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-06-04 02:34:57] [INFO ] Deduced a trap composed of 4 places in 62 ms
[2020-06-04 02:34:57] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-06-04 02:34:57] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-04 02:34:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 704 ms
[2020-06-04 02:34:57] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints in 19 ms.
[2020-06-04 02:34:57] [INFO ] Added : 17 causal constraints over 4 iterations in 145 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-04 02:34:57] [INFO ] [Real]Absence check using 150 positive place invariants in 71 ms returned sat
[2020-06-04 02:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:34:58] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2020-06-04 02:34:58] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-04 02:34:58] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-04 02:34:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 91 ms
[2020-06-04 02:34:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:34:58] [INFO ] [Nat]Absence check using 150 positive place invariants in 55 ms returned sat
[2020-06-04 02:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:34:58] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2020-06-04 02:34:59] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-04 02:34:59] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-04 02:34:59] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-04 02:34:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2020-06-04 02:34:59] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints in 15 ms.
[2020-06-04 02:34:59] [INFO ] Added : 25 causal constraints over 5 iterations in 114 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-06-04 02:34:59] [INFO ] [Real]Absence check using 150 positive place invariants in 98 ms returned sat
[2020-06-04 02:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:34:59] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2020-06-04 02:34:59] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-06-04 02:34:59] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-04 02:34:59] [INFO ] Deduced a trap composed of 5 places in 14 ms
[2020-06-04 02:34:59] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-04 02:35:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 274 ms
[2020-06-04 02:35:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:35:00] [INFO ] [Nat]Absence check using 150 positive place invariants in 130 ms returned sat
[2020-06-04 02:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:35:00] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2020-06-04 02:35:00] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-06-04 02:35:00] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-06-04 02:35:00] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-06-04 02:35:00] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-04 02:35:00] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-04 02:35:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 342 ms
[2020-06-04 02:35:00] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints in 13 ms.
[2020-06-04 02:35:01] [INFO ] Added : 20 causal constraints over 4 iterations in 93 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-04 02:35:01] [INFO ] [Real]Absence check using 150 positive place invariants in 68 ms returned sat
[2020-06-04 02:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:35:01] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2020-06-04 02:35:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:35:01] [INFO ] [Nat]Absence check using 150 positive place invariants in 59 ms returned sat
[2020-06-04 02:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:35:01] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2020-06-04 02:35:01] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-06-04 02:35:02] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-04 02:35:02] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-06-04 02:35:02] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-04 02:35:02] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-04 02:35:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 294 ms
[2020-06-04 02:35:02] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints in 35 ms.
[2020-06-04 02:35:02] [INFO ] Added : 27 causal constraints over 6 iterations in 220 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-06-04 02:35:02] [INFO ] [Real]Absence check using 150 positive place invariants in 53 ms returned sat
[2020-06-04 02:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:35:02] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-06-04 02:35:02] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-04 02:35:03] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2020-06-04 02:35:03] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-06-04 02:35:03] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-04 02:35:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 259 ms
[2020-06-04 02:35:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:35:03] [INFO ] [Nat]Absence check using 150 positive place invariants in 78 ms returned sat
[2020-06-04 02:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:35:03] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2020-06-04 02:35:03] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-04 02:35:03] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-04 02:35:03] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-04 02:35:03] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-06-04 02:35:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 345 ms
[2020-06-04 02:35:03] [INFO ] Computed and/alt/rep : 150/150/150 causal constraints in 21 ms.
[2020-06-04 02:35:04] [INFO ] Added : 24 causal constraints over 5 iterations in 175 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 7300 steps, including 98 resets, run finished after 65 ms. (steps per millisecond=112 ) properties seen :[0, 1, 0, 0, 1] could not realise parikh vector
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7100 steps, including 102 resets, run finished after 37 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 6200 steps, including 97 resets, run finished after 33 ms. (steps per millisecond=187 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7200 steps, including 98 resets, run finished after 34 ms. (steps per millisecond=211 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 5900 steps, including 97 resets, run finished after 28 ms. (steps per millisecond=210 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 21 out of 300 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 300/300 places, 200/200 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 0 with 87 rules applied. Total rules applied 87 place count 256 transition count 157
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 256 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 254 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 254 transition count 155
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 93 place count 253 transition count 154
Free-agglomeration rule (complex) applied 42 times.
Iterating global reduction 2 with 42 rules applied. Total rules applied 135 place count 253 transition count 112
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t_1_1.t_1_0 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 27 rules applied. Total rules applied 162 place count 133 transition count 85
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 71 rules applied. Total rules applied 233 place count 87 transition count 60
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 250 place count 76 transition count 54
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 255 place count 76 transition count 49
Ensure Unique test removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 257 place count 74 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 257 place count 74 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 260 place count 72 transition count 48
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 262 place count 72 transition count 46
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 268 place count 67 transition count 45
Applied a total of 268 rules in 162 ms. Remains 67 /300 variables (removed 233) and now considering 45/200 (removed 155) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/300 places, 45/200 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties seen :[0]
Interrupted probabilistic random walk after 24993561 steps, run timeout after 30001 ms. (steps per millisecond=833 ) properties seen :[0]
Probabilistic random walk after 24993561 steps, saw 2012140 distinct states, run finished after 30001 ms. (steps per millisecond=833 ) properties seen :[0]
// Phase 1: matrix 45 rows 67 cols
[2020-06-04 02:35:36] [INFO ] Computed 39 place invariants in 1 ms
[2020-06-04 02:35:36] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2020-06-04 02:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:35:36] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-06-04 02:35:36] [INFO ] Deduced a trap composed of 3 places in 25 ms
[2020-06-04 02:35:36] [INFO ] Deduced a trap composed of 3 places in 16 ms
[2020-06-04 02:35:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2020-06-04 02:35:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:35:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 18 ms returned sat
[2020-06-04 02:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:35:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-04 02:35:36] [INFO ] Deduced a trap composed of 3 places in 10 ms
[2020-06-04 02:35:36] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-06-04 02:35:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 40 ms
[2020-06-04 02:35:36] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints in 3 ms.
[2020-06-04 02:35:36] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 1300 steps, including 105 resets, run finished after 10 ms. (steps per millisecond=130 ) properties seen :[0] could not realise parikh vector
Support contains 21 out of 67 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 67/67 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 45/45 transitions.
Starting structural reductions, iteration 0 : 67/67 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2020-06-04 02:35:37] [INFO ] Computed 39 place invariants in 0 ms
[2020-06-04 02:35:37] [INFO ] Implicit Places using invariants in 137 ms returned [0, 24, 25, 34, 37, 38, 45, 47, 48, 66]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 140 ms to find 10 implicit places.
[2020-06-04 02:35:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 57 cols
[2020-06-04 02:35:37] [INFO ] Computed 29 place invariants in 0 ms
[2020-06-04 02:35:37] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 57/67 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2020-06-04 02:35:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 57 cols
[2020-06-04 02:35:37] [INFO ] Computed 29 place invariants in 1 ms
[2020-06-04 02:35:37] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/67 places, 45/45 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties seen :[0]
Interrupted probabilistic random walk after 26504005 steps, run timeout after 30001 ms. (steps per millisecond=883 ) properties seen :[0]
Probabilistic random walk after 26504005 steps, saw 2111902 distinct states, run finished after 30003 ms. (steps per millisecond=883 ) properties seen :[0]
// Phase 1: matrix 45 rows 57 cols
[2020-06-04 02:36:08] [INFO ] Computed 29 place invariants in 1 ms
[2020-06-04 02:36:08] [INFO ] [Real]Absence check using 29 positive place invariants in 17 ms returned sat
[2020-06-04 02:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:36:08] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-04 02:36:08] [INFO ] Deduced a trap composed of 3 places in 10 ms
[2020-06-04 02:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2020-06-04 02:36:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:36:08] [INFO ] [Nat]Absence check using 29 positive place invariants in 18 ms returned sat
[2020-06-04 02:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:36:08] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-04 02:36:08] [INFO ] Deduced a trap composed of 3 places in 20 ms
[2020-06-04 02:36:08] [INFO ] Deduced a trap composed of 3 places in 9 ms
[2020-06-04 02:36:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 52 ms
[2020-06-04 02:36:08] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints in 2 ms.
[2020-06-04 02:36:08] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 1200 steps, including 106 resets, run finished after 3 ms. (steps per millisecond=400 ) properties seen :[0] could not realise parikh vector
Support contains 21 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 45/45 transitions.
Starting structural reductions, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2020-06-04 02:36:09] [INFO ] Computed 29 place invariants in 1 ms
[2020-06-04 02:36:09] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 45 rows 57 cols
[2020-06-04 02:36:09] [INFO ] Computed 29 place invariants in 1 ms
[2020-06-04 02:36:09] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2020-06-04 02:36:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 57 cols
[2020-06-04 02:36:09] [INFO ] Computed 29 place invariants in 10 ms
[2020-06-04 02:36:09] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 45/45 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=1562 ) properties seen :[0]
// Phase 1: matrix 45 rows 57 cols
[2020-06-04 02:36:09] [INFO ] Computed 29 place invariants in 0 ms
[2020-06-04 02:36:09] [INFO ] [Real]Absence check using 29 positive place invariants in 14 ms returned sat
[2020-06-04 02:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:36:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-04 02:36:09] [INFO ] Deduced a trap composed of 3 places in 9 ms
[2020-06-04 02:36:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2020-06-04 02:36:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:36:09] [INFO ] [Nat]Absence check using 29 positive place invariants in 20 ms returned sat
[2020-06-04 02:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:36:09] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-04 02:36:09] [INFO ] Deduced a trap composed of 3 places in 19 ms
[2020-06-04 02:36:09] [INFO ] Deduced a trap composed of 3 places in 15 ms
[2020-06-04 02:36:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2020-06-04 02:36:09] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints in 2 ms.
[2020-06-04 02:36:09] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 53 transition count 44
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 53 transition count 42
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 50 transition count 42
Applied a total of 10 rules in 10 ms. Remains 50 /57 variables (removed 7) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 50 cols
[2020-06-04 02:36:09] [INFO ] Computed 25 place invariants in 0 ms
[2020-06-04 02:36:09] [INFO ] [Real]Absence check using 25 positive place invariants in 28 ms returned sat
[2020-06-04 02:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:36:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-06-04 02:36:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:36:09] [INFO ] [Nat]Absence check using 25 positive place invariants in 18 ms returned sat
[2020-06-04 02:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:36:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-04 02:36:09] [INFO ] Computed and/alt/rep : 25/25/25 causal constraints in 2 ms.
[2020-06-04 02:36:09] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-06-04 02:36:09] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2020-06-04 02:36:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2020-06-04 02:36:10] [INFO ] Flatten gal took : 91 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ResAllocation-PT-R003C050 @ 3570 seconds
FORMULA ResAllocation-PT-R003C050-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ ResAllocation-PT-R003C050
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: 102/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 57
lola: finding significant places
lola: 57 places, 45 transitions, 28 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: E (F (((1 <= p54) AND (1 <= p38) AND (1 <= p36) AND ((1 <= p31) OR ((1 <= p13) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p42) AND (1 <= p43) AND (1 <= p46)) OR (((p1 <= 0) OR (p4 <= 0)) AND ((p24 <= 0) OR (p27 <= 0) OR (p28 <= 0)))) AND ((p15 <= 0) OR (p19 <= 0) OR (p20 <= 0) OR ((1 <= p51) AND (1 <= p52) AND (1 <= p55))))))
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 (((1 <= p54) AND (1 <= p38) AND (1 <= p36) AND ((1 <= p31) OR ((1 <= p13) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p42) AND (1 <= p43) AND (1 <= p46)) OR (((p1 <= 0) OR (p4 <= 0)) AND ((p24 <= 0) OR (p27 <= 0) OR (p28 <= 0)))) AND ((p15 <= 0) OR (p19 <= 0) OR (p20 <= 0) OR ((1 <= p51) AND (1 <= p52) AND (1 <= p55))))))
lola: processed formula length: 334
lola: 1 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p54) AND (1 <= p38) AND (1 <= p36) AND ((1 <= p31) OR ((1 <= p13) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p42) AND (1 <= p43) AND (1 <= p46)) OR (((p1 <= 0) OR (p4 <= 0)) AND ((p24 <= 0) OR (p27 <= 0) OR (p28 <= 0)))) AND ((p15 <= 0) OR (p19 <= 0) OR (p20 <= 0) OR ((1 <= p51) AND (1 <= p52) AND (1 <= p55))))
lola: local time limit reached - aborting
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 238 literals and 36 conjunctive subformulas
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 5 markings, 6 edges
lola: memory consumption: 19444 KB
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
lola: state equation: calling and running sara
lola: memory consumption: 19844 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--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="ResAllocation-PT-R003C050"
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 ResAllocation-PT-R003C050, 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 r194-csrt-159033390400687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C050.tgz
mv ResAllocation-PT-R003C050 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 '
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 ;