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.r180-ebro-158987899800191.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 DES-PT-00b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899800191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 30 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 66K 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 DES-PT-00b-ReachabilityFireability-00
FORMULA_NAME DES-PT-00b-ReachabilityFireability-01
FORMULA_NAME DES-PT-00b-ReachabilityFireability-02
FORMULA_NAME DES-PT-00b-ReachabilityFireability-03
FORMULA_NAME DES-PT-00b-ReachabilityFireability-04
FORMULA_NAME DES-PT-00b-ReachabilityFireability-05
FORMULA_NAME DES-PT-00b-ReachabilityFireability-06
FORMULA_NAME DES-PT-00b-ReachabilityFireability-07
FORMULA_NAME DES-PT-00b-ReachabilityFireability-08
FORMULA_NAME DES-PT-00b-ReachabilityFireability-09
FORMULA_NAME DES-PT-00b-ReachabilityFireability-10
FORMULA_NAME DES-PT-00b-ReachabilityFireability-11
FORMULA_NAME DES-PT-00b-ReachabilityFireability-12
FORMULA_NAME DES-PT-00b-ReachabilityFireability-13
FORMULA_NAME DES-PT-00b-ReachabilityFireability-14
FORMULA_NAME DES-PT-00b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591166392825

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:39:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:39:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:39:56] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2020-06-03 06:39:56] [INFO ] Transformed 271 places.
[2020-06-03 06:39:56] [INFO ] Transformed 230 transitions.
[2020-06-03 06:39:56] [INFO ] Found NUPN structural information;
[2020-06-03 06:39:56] [INFO ] Parsed PT model containing 271 places and 230 transitions in 379 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 86 resets, run finished after 104 ms. (steps per millisecond=96 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1]
FORMULA DES-PT-00b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 1, 0, 0]
FORMULA DES-PT-00b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0]
// Phase 1: matrix 230 rows 271 cols
[2020-06-03 06:39:56] [INFO ] Computed 59 place invariants in 28 ms
[2020-06-03 06:39:57] [INFO ] [Real]Absence check using 37 positive place invariants in 40 ms returned unsat
[2020-06-03 06:39:57] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2020-06-03 06:39:57] [INFO ] [Real]Absence check using 37 positive and 22 generalized place invariants in 17 ms returned sat
[2020-06-03 06:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:39:57] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2020-06-03 06:39:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:39:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 64 ms returned sat
[2020-06-03 06:39:58] [INFO ] [Nat]Absence check using 37 positive and 22 generalized place invariants in 28 ms returned sat
[2020-06-03 06:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:39:58] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2020-06-03 06:39:59] [INFO ] Deduced a trap composed of 29 places in 381 ms
[2020-06-03 06:39:59] [INFO ] Deduced a trap composed of 24 places in 270 ms
[2020-06-03 06:39:59] [INFO ] Deduced a trap composed of 20 places in 192 ms
[2020-06-03 06:39:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1023 ms
[2020-06-03 06:39:59] [INFO ] Computed and/alt/rep : 229/403/229 causal constraints in 41 ms.
[2020-06-03 06:40:01] [INFO ] Added : 222 causal constraints over 45 iterations in 2003 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 06:40:01] [INFO ] [Real]Absence check using 37 positive place invariants in 49 ms returned sat
[2020-06-03 06:40:02] [INFO ] [Real]Absence check using 37 positive and 22 generalized place invariants in 74 ms returned sat
[2020-06-03 06:40:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:02] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2020-06-03 06:40:03] [INFO ] Deduced a trap composed of 8 places in 339 ms
[2020-06-03 06:40:03] [INFO ] Deduced a trap composed of 9 places in 51 ms
[2020-06-03 06:40:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2020-06-03 06:40:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:40:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 122 ms returned sat
[2020-06-03 06:40:03] [INFO ] [Nat]Absence check using 37 positive and 22 generalized place invariants in 39 ms returned sat
[2020-06-03 06:40:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:03] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2020-06-03 06:40:03] [INFO ] Deduced a trap composed of 9 places in 69 ms
[2020-06-03 06:40:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2020-06-03 06:40:04] [INFO ] Computed and/alt/rep : 229/403/229 causal constraints in 74 ms.
[2020-06-03 06:40:06] [INFO ] Added : 223 causal constraints over 45 iterations in 2127 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
FORMULA DES-PT-00b-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 60900 steps, including 710 resets, run finished after 307 ms. (steps per millisecond=198 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 57200 steps, including 643 resets, run finished after 223 ms. (steps per millisecond=256 ) properties seen :[0, 0] could not realise parikh vector
Support contains 9 out of 271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 271/271 places, 230/230 transitions.
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (complete) has 489 edges and 271 vertex of which 265 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.23 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 265 transition count 202
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 242 transition count 202
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 48 place count 242 transition count 192
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 68 place count 232 transition count 192
Symmetric choice reduction at 2 with 18 rule applications. Total rules 86 place count 232 transition count 192
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 122 place count 214 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 122 place count 214 transition count 173
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 213 transition count 173
Symmetric choice reduction at 2 with 14 rule applications. Total rules 138 place count 213 transition count 173
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 166 place count 199 transition count 159
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 180 place count 199 transition count 145
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 183 place count 197 transition count 144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 183 place count 197 transition count 142
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 195 transition count 142
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 323 place count 127 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 331 place count 123 transition count 83
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 332 place count 123 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 333 place count 122 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 334 place count 122 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 121 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 337 place count 119 transition count 81
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 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 339 place count 118 transition count 80
Applied a total of 339 rules in 229 ms. Remains 118 /271 variables (removed 153) and now considering 80/230 (removed 150) transitions.
Finished structural reductions, in 1 iterations. Remains : 118/271 places, 80/230 transitions.
Incomplete random walk after 1000000 steps, including 55789 resets, run finished after 3675 ms. (steps per millisecond=272 ) properties seen :[1, 0]
FORMULA DES-PT-00b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7968 resets, run finished after 1885 ms. (steps per millisecond=530 ) properties seen :[0]
// Phase 1: matrix 80 rows 118 cols
[2020-06-03 06:40:12] [INFO ] Computed 56 place invariants in 7 ms
[2020-06-03 06:40:12] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2020-06-03 06:40:12] [INFO ] [Real]Absence check using 34 positive and 22 generalized place invariants in 11 ms returned sat
[2020-06-03 06:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:12] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2020-06-03 06:40:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:40:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-06-03 06:40:12] [INFO ] [Nat]Absence check using 34 positive and 22 generalized place invariants in 25 ms returned sat
[2020-06-03 06:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:12] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2020-06-03 06:40:12] [INFO ] Computed and/alt/rep : 62/231/62 causal constraints in 11 ms.
[2020-06-03 06:40:13] [INFO ] Added : 61 causal constraints over 13 iterations in 278 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 46800 steps, including 3900 resets, run finished after 220 ms. (steps per millisecond=212 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 118 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 118/118 places, 80/80 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 79
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 117 transition count 79
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 116 transition count 76
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 13 place count 116 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 115 transition count 67
Applied a total of 14 rules in 27 ms. Remains 115 /118 variables (removed 3) and now considering 67/80 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 115/118 places, 67/80 transitions.
Incomplete random walk after 1000000 steps, including 61825 resets, run finished after 3322 ms. (steps per millisecond=301 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 12017 resets, run finished after 1797 ms. (steps per millisecond=556 ) properties seen :[0]
Interrupted probabilistic random walk after 10682358 steps, run timeout after 30001 ms. (steps per millisecond=356 ) properties seen :[0]
Probabilistic random walk after 10682358 steps, saw 1521324 distinct states, run finished after 30001 ms. (steps per millisecond=356 ) properties seen :[0]
// Phase 1: matrix 67 rows 115 cols
[2020-06-03 06:40:48] [INFO ] Computed 56 place invariants in 5 ms
[2020-06-03 06:40:48] [INFO ] [Real]Absence check using 33 positive place invariants in 44 ms returned sat
[2020-06-03 06:40:48] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 17 ms returned sat
[2020-06-03 06:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:49] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-06-03 06:40:49] [INFO ] Computed and/alt/rep : 58/155/58 causal constraints in 8 ms.
[2020-06-03 06:40:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:40:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2020-06-03 06:40:49] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 10 ms returned sat
[2020-06-03 06:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:49] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2020-06-03 06:40:49] [INFO ] Computed and/alt/rep : 58/155/58 causal constraints in 9 ms.
[2020-06-03 06:40:49] [INFO ] Added : 57 causal constraints over 12 iterations in 197 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 27600 steps, including 2501 resets, run finished after 147 ms. (steps per millisecond=187 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 115/115 places, 67/67 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 115/115 places, 67/67 transitions.
Starting structural reductions, iteration 0 : 115/115 places, 67/67 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 115 cols
[2020-06-03 06:40:49] [INFO ] Computed 56 place invariants in 7 ms
[2020-06-03 06:40:49] [INFO ] Implicit Places using invariants in 331 ms returned []
// Phase 1: matrix 67 rows 115 cols
[2020-06-03 06:40:49] [INFO ] Computed 56 place invariants in 3 ms
[2020-06-03 06:40:50] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
[2020-06-03 06:40:50] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 67 rows 115 cols
[2020-06-03 06:40:50] [INFO ] Computed 56 place invariants in 4 ms
[2020-06-03 06:40:50] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 115/115 places, 67/67 transitions.
Incomplete random walk after 100000 steps, including 6289 resets, run finished after 326 ms. (steps per millisecond=306 ) properties seen :[0]
// Phase 1: matrix 67 rows 115 cols
[2020-06-03 06:40:51] [INFO ] Computed 56 place invariants in 2 ms
[2020-06-03 06:40:51] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2020-06-03 06:40:51] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 10 ms returned sat
[2020-06-03 06:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:51] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2020-06-03 06:40:51] [INFO ] Computed and/alt/rep : 58/155/58 causal constraints in 8 ms.
[2020-06-03 06:40:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:40:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 19 ms returned sat
[2020-06-03 06:40:51] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 11 ms returned sat
[2020-06-03 06:40:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:51] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-06-03 06:40:51] [INFO ] Computed and/alt/rep : 58/155/58 causal constraints in 8 ms.
[2020-06-03 06:40:51] [INFO ] Added : 57 causal constraints over 12 iterations in 185 ms. Result :sat
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 115 cols
[2020-06-03 06:40:51] [INFO ] Computed 56 place invariants in 2 ms
[2020-06-03 06:40:51] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2020-06-03 06:40:51] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 12 ms returned sat
[2020-06-03 06:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:51] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2020-06-03 06:40:51] [INFO ] Computed and/alt/rep : 58/155/58 causal constraints in 22 ms.
[2020-06-03 06:40:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:40:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 18 ms returned sat
[2020-06-03 06:40:52] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 11 ms returned sat
[2020-06-03 06:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:40:52] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2020-06-03 06:40:52] [INFO ] Computed and/alt/rep : 58/155/58 causal constraints in 8 ms.
[2020-06-03 06:40:52] [INFO ] Added : 57 causal constraints over 12 iterations in 201 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 06:40:52] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2020-06-03 06:40:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2020-06-03 06:40:52] [INFO ] Flatten gal took : 121 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-00b @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ DES-PT-00b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 06:40:53 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 18428,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p69 <= 0) OR (p15 <= 0) OR (((p41 <= 0) OR (p58 <= 0)) AND ((p17 <= 0) OR (p19 <= 0))))))",
"processed_size": 101,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 341,
"conflict_clusters": 47,
"places": 115,
"places_significant": 59,
"singleton_clusters": 0,
"transitions": 67
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 182/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 115
lola: finding significant places
lola: 115 places, 67 transitions, 59 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: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: A (G (((p69 <= 0) OR (p15 <= 0) OR (((p41 <= 0) OR (p58 <= 0)) AND ((p17 <= 0) OR (p19 <= 0))))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p69 <= 0) OR (p15 <= 0) OR (((p41 <= 0) OR (p58 <= 0)) AND ((p17 <= 0) OR (p19 <= 0))))))
lola: processed formula length: 101
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p69) AND (1 <= p15) AND (((1 <= p41) AND (1 <= p58)) OR ((1 <= p17) AND (1 <= p19))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 18428 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="DES-PT-00b"
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 DES-PT-00b, 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 r180-ebro-158987899800191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-00b.tgz
mv DES-PT-00b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;