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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.0K Mar 30 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:17 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.1K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:16 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 73K 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-05b-ReachabilityFireability-00
FORMULA_NAME DES-PT-05b-ReachabilityFireability-01
FORMULA_NAME DES-PT-05b-ReachabilityFireability-02
FORMULA_NAME DES-PT-05b-ReachabilityFireability-03
FORMULA_NAME DES-PT-05b-ReachabilityFireability-04
FORMULA_NAME DES-PT-05b-ReachabilityFireability-05
FORMULA_NAME DES-PT-05b-ReachabilityFireability-06
FORMULA_NAME DES-PT-05b-ReachabilityFireability-07
FORMULA_NAME DES-PT-05b-ReachabilityFireability-08
FORMULA_NAME DES-PT-05b-ReachabilityFireability-09
FORMULA_NAME DES-PT-05b-ReachabilityFireability-10
FORMULA_NAME DES-PT-05b-ReachabilityFireability-11
FORMULA_NAME DES-PT-05b-ReachabilityFireability-12
FORMULA_NAME DES-PT-05b-ReachabilityFireability-13
FORMULA_NAME DES-PT-05b-ReachabilityFireability-14
FORMULA_NAME DES-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591177372865

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 09:42: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 09:42:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 09:42:56] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2020-06-03 09:42:56] [INFO ] Transformed 300 places.
[2020-06-03 09:42:56] [INFO ] Transformed 251 transitions.
[2020-06-03 09:42:56] [INFO ] Found NUPN structural information;
[2020-06-03 09:42:56] [INFO ] Parsed PT model containing 300 places and 251 transitions in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 83 resets, run finished after 168 ms. (steps per millisecond=59 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1]
FORMULA DES-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[1, 0, 0, 0, 0]
FORMULA DES-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 251 rows 300 cols
[2020-06-03 09:42:57] [INFO ] Computed 65 place invariants in 33 ms
[2020-06-03 09:42:57] [INFO ] [Real]Absence check using 40 positive place invariants in 64 ms returned sat
[2020-06-03 09:42:57] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 37 ms returned sat
[2020-06-03 09:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:42:58] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2020-06-03 09:42:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:42:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 91 ms returned sat
[2020-06-03 09:42:58] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 30 ms returned sat
[2020-06-03 09:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:42:59] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2020-06-03 09:42:59] [INFO ] Deduced a trap composed of 21 places in 255 ms
[2020-06-03 09:42:59] [INFO ] Deduced a trap composed of 14 places in 128 ms
[2020-06-03 09:42:59] [INFO ] Deduced a trap composed of 14 places in 114 ms
[2020-06-03 09:42:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 640 ms
[2020-06-03 09:42:59] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 31 ms.
[2020-06-03 09:43:02] [INFO ] Added : 239 causal constraints over 49 iterations in 2392 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 09:43:02] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-06-03 09:43:02] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 33 ms returned sat
[2020-06-03 09:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:43:03] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2020-06-03 09:43:03] [INFO ] Deduced a trap composed of 10 places in 98 ms
[2020-06-03 09:43:03] [INFO ] Deduced a trap composed of 31 places in 80 ms
[2020-06-03 09:43:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2020-06-03 09:43:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:43:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 53 ms returned sat
[2020-06-03 09:43:03] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 31 ms returned sat
[2020-06-03 09:43:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:43:03] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2020-06-03 09:43:04] [INFO ] Deduced a trap composed of 8 places in 50 ms
[2020-06-03 09:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2020-06-03 09:43:04] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 23 ms.
[2020-06-03 09:43:06] [INFO ] Added : 235 causal constraints over 47 iterations in 2444 ms. Result :sat
[2020-06-03 09:43:06] [INFO ] Deduced a trap composed of 31 places in 103 ms
[2020-06-03 09:43:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-03 09:43:06] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned unsat
[2020-06-03 09:43:06] [INFO ] [Real]Absence check using 40 positive place invariants in 44 ms returned sat
[2020-06-03 09:43:06] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 38 ms returned sat
[2020-06-03 09:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:43:07] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-06-03 09:43:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:43:07] [INFO ] [Nat]Absence check using 40 positive place invariants in 68 ms returned sat
[2020-06-03 09:43:07] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 35 ms returned sat
[2020-06-03 09:43:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:43:08] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2020-06-03 09:43:08] [INFO ] Deduced a trap composed of 8 places in 191 ms
[2020-06-03 09:43:08] [INFO ] Deduced a trap composed of 43 places in 148 ms
[2020-06-03 09:43:09] [INFO ] Deduced a trap composed of 23 places in 100 ms
[2020-06-03 09:43:09] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2020-06-03 09:43:09] [INFO ] Deduced a trap composed of 34 places in 134 ms
[2020-06-03 09:43:09] [INFO ] Deduced a trap composed of 32 places in 43 ms
[2020-06-03 09:43:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 876 ms
[2020-06-03 09:43:09] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 29 ms.
[2020-06-03 09:43:12] [INFO ] Added : 241 causal constraints over 49 iterations in 3144 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
FORMULA DES-PT-05b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 59100 steps, including 676 resets, run finished after 484 ms. (steps per millisecond=122 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 59200 steps, including 656 resets, run finished after 249 ms. (steps per millisecond=237 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 25300 steps, including 251 resets, run finished after 104 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 28 out of 300 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 300/300 places, 251/251 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 561 edges and 300 vertex of which 289 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.13 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 289 transition count 229
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 273 transition count 229
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 34 place count 273 transition count 224
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 268 transition count 224
Symmetric choice reduction at 2 with 17 rule applications. Total rules 61 place count 268 transition count 224
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 251 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 95 place count 251 transition count 206
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 250 transition count 206
Symmetric choice reduction at 2 with 11 rule applications. Total rules 108 place count 250 transition count 206
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 130 place count 239 transition count 195
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 142 place count 239 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 237 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 237 transition count 182
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 236 transition count 182
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 268 place count 175 transition count 121
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 274 place count 172 transition count 122
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 172 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 171 transition count 121
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 277 place count 171 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 170 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 279 place count 169 transition count 120
Applied a total of 279 rules in 219 ms. Remains 169 /300 variables (removed 131) and now considering 120/251 (removed 131) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/300 places, 120/251 transitions.
Incomplete random walk after 1000000 steps, including 23717 resets, run finished after 3450 ms. (steps per millisecond=289 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3909 resets, run finished after 2146 ms. (steps per millisecond=465 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3320 resets, run finished after 2019 ms. (steps per millisecond=495 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4301 resets, run finished after 2509 ms. (steps per millisecond=398 ) properties seen :[0, 0, 1]
FORMULA DES-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 120 rows 169 cols
[2020-06-03 09:43:23] [INFO ] Computed 59 place invariants in 9 ms
[2020-06-03 09:43:24] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2020-06-03 09:43:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2020-06-03 09:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:43:24] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-06-03 09:43:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:43:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2020-06-03 09:43:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 78 ms returned sat
[2020-06-03 09:43:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:43:24] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2020-06-03 09:43:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 09:43:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2020-06-03 09:43:24] [INFO ] Computed and/alt/rep : 114/346/114 causal constraints in 15 ms.
[2020-06-03 09:43:25] [INFO ] Added : 94 causal constraints over 19 iterations in 688 ms. Result :sat
[2020-06-03 09:43:25] [INFO ] Deduced a trap composed of 11 places in 56 ms
[2020-06-03 09:43:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 09:43:25] [INFO ] [Real]Absence check using 34 positive place invariants in 177 ms returned sat
[2020-06-03 09:43:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2020-06-03 09:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:43:26] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2020-06-03 09:43:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:43:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-06-03 09:43:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 63 ms returned sat
[2020-06-03 09:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:43:26] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2020-06-03 09:43:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2020-06-03 09:43:26] [INFO ] Computed and/alt/rep : 114/346/114 causal constraints in 19 ms.
[2020-06-03 09:43:27] [INFO ] Added : 104 causal constraints over 21 iterations in 688 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 29300 steps, including 877 resets, run finished after 152 ms. (steps per millisecond=192 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 13800 steps, including 311 resets, run finished after 66 ms. (steps per millisecond=209 ) properties seen :[0, 0] could not realise parikh vector
Support contains 15 out of 169 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 169/169 places, 120/120 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 169 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 166 transition count 116
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 166 transition count 116
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 165 transition count 115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 161 transition count 111
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 2 with 2 rules applied. Total rules applied 20 place count 160 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 159 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 158 transition count 108
Applied a total of 22 rules in 64 ms. Remains 158 /169 variables (removed 11) and now considering 108/120 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/169 places, 108/120 transitions.
Incomplete random walk after 1000000 steps, including 26972 resets, run finished after 3533 ms. (steps per millisecond=283 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4517 resets, run finished after 2241 ms. (steps per millisecond=446 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3607 resets, run finished after 2066 ms. (steps per millisecond=484 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 8959696 steps, run timeout after 30001 ms. (steps per millisecond=298 ) properties seen :[0, 0]
Probabilistic random walk after 8959696 steps, saw 1174095 distinct states, run finished after 30002 ms. (steps per millisecond=298 ) properties seen :[0, 0]
// Phase 1: matrix 108 rows 158 cols
[2020-06-03 09:44:05] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 09:44:05] [INFO ] [Real]Absence check using 36 positive place invariants in 27 ms returned sat
[2020-06-03 09:44:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2020-06-03 09:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:05] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2020-06-03 09:44:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:44:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-06-03 09:44:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2020-06-03 09:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:06] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-06-03 09:44:06] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 17 ms.
[2020-06-03 09:44:06] [INFO ] Added : 103 causal constraints over 21 iterations in 574 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 09:44:06] [INFO ] [Real]Absence check using 36 positive place invariants in 23 ms returned sat
[2020-06-03 09:44:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2020-06-03 09:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:06] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2020-06-03 09:44:06] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 35 ms.
[2020-06-03 09:44:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:44:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-06-03 09:44:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2020-06-03 09:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:07] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2020-06-03 09:44:07] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 32 ms.
[2020-06-03 09:44:07] [INFO ] Added : 97 causal constraints over 20 iterations in 463 ms. Result :sat
[2020-06-03 09:44:07] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-03 09:44:08] [INFO ] Deduced a trap composed of 14 places in 40 ms
[2020-06-03 09:44:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
Incomplete Parikh walk after 17900 steps, including 715 resets, run finished after 74 ms. (steps per millisecond=241 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 35500 steps, including 1320 resets, run finished after 139 ms. (steps per millisecond=255 ) properties seen :[0, 0] could not realise parikh vector
Support contains 15 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 108/108 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 108/108 transitions.
Starting structural reductions, iteration 0 : 158/158 places, 108/108 transitions.
Applied a total of 0 rules in 12 ms. Remains 158 /158 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 158 cols
[2020-06-03 09:44:08] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 09:44:08] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 108 rows 158 cols
[2020-06-03 09:44:08] [INFO ] Computed 60 place invariants in 4 ms
[2020-06-03 09:44:09] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2020-06-03 09:44:09] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 108 rows 158 cols
[2020-06-03 09:44:09] [INFO ] Computed 60 place invariants in 5 ms
[2020-06-03 09:44:09] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 108/108 transitions.
Incomplete random walk after 100000 steps, including 2661 resets, run finished after 378 ms. (steps per millisecond=264 ) properties seen :[0, 0]
// Phase 1: matrix 108 rows 158 cols
[2020-06-03 09:44:10] [INFO ] Computed 60 place invariants in 3 ms
[2020-06-03 09:44:10] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2020-06-03 09:44:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2020-06-03 09:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:10] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-03 09:44:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:44:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-06-03 09:44:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2020-06-03 09:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:10] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-06-03 09:44:10] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 12 ms.
[2020-06-03 09:44:11] [INFO ] Added : 103 causal constraints over 21 iterations in 521 ms. Result :sat
[2020-06-03 09:44:11] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2020-06-03 09:44:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2020-06-03 09:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:11] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-06-03 09:44:11] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 17 ms.
[2020-06-03 09:44:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:44:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-06-03 09:44:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2020-06-03 09:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:11] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-06-03 09:44:11] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 17 ms.
[2020-06-03 09:44:12] [INFO ] Added : 97 causal constraints over 20 iterations in 487 ms. Result :sat
[2020-06-03 09:44:12] [INFO ] Deduced a trap composed of 17 places in 65 ms
[2020-06-03 09:44:12] [INFO ] Deduced a trap composed of 14 places in 59 ms
[2020-06-03 09:44:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
Applied a total of 0 rules in 13 ms. Remains 158 /158 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 158 cols
[2020-06-03 09:44:12] [INFO ] Computed 60 place invariants in 4 ms
[2020-06-03 09:44:12] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2020-06-03 09:44:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2020-06-03 09:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:12] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 09:44:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:44:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-06-03 09:44:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2020-06-03 09:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:12] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2020-06-03 09:44:12] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 17 ms.
[2020-06-03 09:44:13] [INFO ] Added : 103 causal constraints over 21 iterations in 703 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-03 09:44:13] [INFO ] [Real]Absence check using 36 positive place invariants in 56 ms returned sat
[2020-06-03 09:44:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2020-06-03 09:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:14] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2020-06-03 09:44:14] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 43 ms.
[2020-06-03 09:44:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:44:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 68 ms returned sat
[2020-06-03 09:44:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 25 ms returned sat
[2020-06-03 09:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:44:15] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2020-06-03 09:44:15] [INFO ] Computed and/alt/rep : 104/277/104 causal constraints in 31 ms.
[2020-06-03 09:44:15] [INFO ] Added : 97 causal constraints over 20 iterations in 590 ms. Result :sat
[2020-06-03 09:44:15] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2020-06-03 09:44:15] [INFO ] Deduced a trap composed of 14 places in 69 ms
[2020-06-03 09:44:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-03 09:44:15] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2020-06-03 09:44:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
[2020-06-03 09:44:16] [INFO ] Flatten gal took : 126 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-05b @ 3570 seconds

FORMULA DES-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-05b-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ DES-PT-05b

{
"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",
"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 09:44:16 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p21) AND (1 <= p41) AND (1 <= p30) AND (((1 <= p4) AND (1 <= p67)) OR ((1 <= p27) AND (1 <= p62))))))",
"processed_size": 115,
"rewrites": 1
},
"result":
{
"edges": 238462,
"markings": 128241,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 8,
"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": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p47) AND ((p58 <= 0)) AND (1 <= p35) AND (1 <= p59) AND (1 <= p77) AND ((p111 <= 0) OR (p12 <= 0) OR (p64 <= 0)))))",
"processed_size": 130,
"rewrites": 1
},
"result":
{
"edges": 476,
"markings": 460,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22628,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 456,
"conflict_clusters": 65,
"places": 158,
"places_significant": 98,
"singleton_clusters": 0,
"transitions": 108
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes yes "
},
"task":
{
"type": "compound"
}
}
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: 266/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 158
lola: finding significant places
lola: 158 places, 108 transitions, 98 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: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: E (F (((1 <= p47) AND ((p58 <= 0)) AND (1 <= p35) AND (1 <= p59) AND (1 <= p77) AND ((p111 <= 0) OR (p12 <= 0) OR (p64 <= 0))))) : E (F (((1 <= p21) AND (1 <= p41) AND (1 <= p30) AND (((1 <= p4) AND (1 <= p67)) OR ((1 <= p27) AND (1 <= p62))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p21) AND (1 <= p41) AND (1 <= p30) AND (((1 <= p4) AND (1 <= p67)) OR ((1 <= p27) AND (1 <= p62))))))
lola: ========================================
lola: SUBTASK
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 <= p21) AND (1 <= p41) AND (1 <= p30) AND (((1 <= p4) AND (1 <= p67)) OR ((1 <= p27) AND (1 <= p62))))))
lola: processed formula length: 115
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: 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 <= p21) AND (1 <= p41) AND (1 <= p30) AND (((1 <= p4) AND (1 <= p67)) OR ((1 <= p27) AND (1 <= p62))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 128241 markings, 238462 edges
lola: ========================================
lola: subprocess 1 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p47) AND ((p58 <= 0)) AND (1 <= p35) AND (1 <= p59) AND (1 <= p77) AND ((p111 <= 0) OR (p12 <= 0) OR (p64 <= 0)))))
lola: ========================================
lola: SUBTASK
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 <= p47) AND ((p58 <= 0)) AND (1 <= p35) AND (1 <= p59) AND (1 <= p77) AND ((p111 <= 0) OR (p12 <= 0) OR (p64 <= 0)))))
lola: processed formula length: 130
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: 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 <= p47) AND ((p58 <= 0)) AND (1 <= p35) AND (1 <= p59) AND (1 <= p77) AND ((p111 <= 0) OR (p12 <= 0) OR (p64 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 460 markings, 476 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
sara: try reading problem file ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: memory consumption: 22628 KB
lola: time consumption: 6 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-05b"
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-05b, 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-158987899900239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b 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 ;