About the Execution of ITS-LoLa for DES-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.340 | 3600000.00 | 1672164.00 | 471.30 | TTTTTFFTTTFTFTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899900255.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-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899900255
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 4.0K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 79K 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-10b-ReachabilityFireability-00
FORMULA_NAME DES-PT-10b-ReachabilityFireability-01
FORMULA_NAME DES-PT-10b-ReachabilityFireability-02
FORMULA_NAME DES-PT-10b-ReachabilityFireability-03
FORMULA_NAME DES-PT-10b-ReachabilityFireability-04
FORMULA_NAME DES-PT-10b-ReachabilityFireability-05
FORMULA_NAME DES-PT-10b-ReachabilityFireability-06
FORMULA_NAME DES-PT-10b-ReachabilityFireability-07
FORMULA_NAME DES-PT-10b-ReachabilityFireability-08
FORMULA_NAME DES-PT-10b-ReachabilityFireability-09
FORMULA_NAME DES-PT-10b-ReachabilityFireability-10
FORMULA_NAME DES-PT-10b-ReachabilityFireability-11
FORMULA_NAME DES-PT-10b-ReachabilityFireability-12
FORMULA_NAME DES-PT-10b-ReachabilityFireability-13
FORMULA_NAME DES-PT-10b-ReachabilityFireability-14
FORMULA_NAME DES-PT-10b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591180925090
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:42:08] [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 10:42:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:42:08] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2020-06-03 10:42:08] [INFO ] Transformed 320 places.
[2020-06-03 10:42:08] [INFO ] Transformed 271 transitions.
[2020-06-03 10:42:08] [INFO ] Found NUPN structural information;
[2020-06-03 10:42:08] [INFO ] Parsed PT model containing 320 places and 271 transitions in 218 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 89 resets, run finished after 139 ms. (steps per millisecond=71 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1]
FORMULA DES-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA DES-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 1, 0]
FORMULA DES-PT-10b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 271 rows 320 cols
[2020-06-03 10:42:08] [INFO ] Computed 65 place invariants in 36 ms
[2020-06-03 10:42:09] [INFO ] [Real]Absence check using 39 positive place invariants in 64 ms returned sat
[2020-06-03 10:42:09] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2020-06-03 10:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:09] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2020-06-03 10:42:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:42:10] [INFO ] [Nat]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 10:42:10] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-06-03 10:42:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:10] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2020-06-03 10:42:10] [INFO ] Deduced a trap composed of 16 places in 147 ms
[2020-06-03 10:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2020-06-03 10:42:11] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 42 ms.
[2020-06-03 10:42:13] [INFO ] Added : 262 causal constraints over 53 iterations in 2849 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 10:42:14] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2020-06-03 10:42:14] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-06-03 10:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:15] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2020-06-03 10:42:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:42:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-06-03 10:42:15] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 114 ms returned sat
[2020-06-03 10:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:18] [INFO ] [Nat]Absence check using state equation in 2608 ms returned sat
[2020-06-03 10:42:18] [INFO ] Deduced a trap composed of 39 places in 187 ms
[2020-06-03 10:42:18] [INFO ] Deduced a trap composed of 34 places in 151 ms
[2020-06-03 10:42:18] [INFO ] Deduced a trap composed of 31 places in 117 ms
[2020-06-03 10:42:18] [INFO ] Deduced a trap composed of 9 places in 111 ms
[2020-06-03 10:42:18] [INFO ] Deduced a trap composed of 32 places in 99 ms
[2020-06-03 10:42:19] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-06-03 10:42:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 983 ms
[2020-06-03 10:42:19] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 27 ms.
[2020-06-03 10:42:20] [INFO ] Added : 120 causal constraints over 24 iterations in 1114 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 10:42:20] [INFO ] [Real]Absence check using 39 positive place invariants in 39 ms returned sat
[2020-06-03 10:42:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2020-06-03 10:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:20] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2020-06-03 10:42:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:42:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-06-03 10:42:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-06-03 10:42:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:21] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2020-06-03 10:42:21] [INFO ] Deduced a trap composed of 14 places in 230 ms
[2020-06-03 10:42:22] [INFO ] Deduced a trap composed of 12 places in 199 ms
[2020-06-03 10:42:22] [INFO ] Deduced a trap composed of 21 places in 97 ms
[2020-06-03 10:42:22] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2020-06-03 10:42:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 767 ms
[2020-06-03 10:42:22] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 39 ms.
[2020-06-03 10:42:25] [INFO ] Added : 260 causal constraints over 53 iterations in 2801 ms. Result :sat
[2020-06-03 10:42:25] [INFO ] Deduced a trap composed of 46 places in 134 ms
[2020-06-03 10:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 10:42:25] [INFO ] [Real]Absence check using 39 positive place invariants in 37 ms returned sat
[2020-06-03 10:42:25] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2020-06-03 10:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:26] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2020-06-03 10:42:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:42:26] [INFO ] [Nat]Absence check using 39 positive place invariants in 60 ms returned sat
[2020-06-03 10:42:26] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 101 ms returned sat
[2020-06-03 10:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:27] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2020-06-03 10:42:27] [INFO ] Deduced a trap composed of 8 places in 263 ms
[2020-06-03 10:42:27] [INFO ] Deduced a trap composed of 20 places in 131 ms
[2020-06-03 10:42:27] [INFO ] Deduced a trap composed of 12 places in 107 ms
[2020-06-03 10:42:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 601 ms
[2020-06-03 10:42:27] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 26 ms.
[2020-06-03 10:42:29] [INFO ] Added : 224 causal constraints over 45 iterations in 2144 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 14700 steps, including 177 resets, run finished after 95 ms. (steps per millisecond=154 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA DES-PT-10b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 178700 steps, including 1910 resets, run finished after 753 ms. (steps per millisecond=237 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 168000 steps, including 1785 resets, run finished after 633 ms. (steps per millisecond=265 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 30 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 271/271 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 621 edges and 320 vertex of which 309 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.13 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 309 transition count 251
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 296 transition count 251
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 29 place count 296 transition count 244
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 43 place count 289 transition count 244
Symmetric choice reduction at 2 with 20 rule applications. Total rules 63 place count 289 transition count 244
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 103 place count 269 transition count 224
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 269 transition count 224
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 139 place count 257 transition count 212
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 151 place count 257 transition count 200
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 154 place count 255 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 154 place count 255 transition count 198
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 254 transition count 198
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 278 place count 193 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
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 282 place count 191 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 191 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 286 place count 189 transition count 137
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 189 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 290 place count 187 transition count 135
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 292 place count 187 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 186 transition count 134
Applied a total of 293 rules in 250 ms. Remains 186 /320 variables (removed 134) and now considering 134/271 (removed 137) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/320 places, 134/271 transitions.
Incomplete random walk after 1000000 steps, including 17235 resets, run finished after 3870 ms. (steps per millisecond=258 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2972 resets, run finished after 1974 ms. (steps per millisecond=506 ) properties seen :[1, 0, 0]
FORMULA DES-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 3284 resets, run finished after 2874 ms. (steps per millisecond=347 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3216 resets, run finished after 1841 ms. (steps per millisecond=543 ) properties seen :[0, 0]
// Phase 1: matrix 134 rows 186 cols
[2020-06-03 10:42:42] [INFO ] Computed 61 place invariants in 16 ms
[2020-06-03 10:42:42] [INFO ] [Real]Absence check using 36 positive place invariants in 27 ms returned sat
[2020-06-03 10:42:42] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-06-03 10:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:42] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2020-06-03 10:42:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:42:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-03 10:42:42] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 68 ms returned sat
[2020-06-03 10:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:43] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2020-06-03 10:42:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:42:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-03 10:42:43] [INFO ] Deduced a trap composed of 18 places in 107 ms
[2020-06-03 10:42:43] [INFO ] Deduced a trap composed of 26 places in 98 ms
[2020-06-03 10:42:43] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2020-06-03 10:42:43] [INFO ] Deduced a trap composed of 12 places in 66 ms
[2020-06-03 10:42:43] [INFO ] Deduced a trap composed of 26 places in 58 ms
[2020-06-03 10:42:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 514 ms
[2020-06-03 10:42:43] [INFO ] Computed and/alt/rep : 133/524/133 causal constraints in 14 ms.
[2020-06-03 10:42:44] [INFO ] Added : 125 causal constraints over 25 iterations in 830 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 10:42:44] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-06-03 10:42:44] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 18 ms returned sat
[2020-06-03 10:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:44] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-03 10:42:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:42:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 46 ms returned sat
[2020-06-03 10:42:45] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 32 ms returned sat
[2020-06-03 10:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:42:45] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2020-06-03 10:42:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-06-03 10:42:45] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2020-06-03 10:42:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2020-06-03 10:42:45] [INFO ] Computed and/alt/rep : 133/524/133 causal constraints in 16 ms.
[2020-06-03 10:42:46] [INFO ] Added : 122 causal constraints over 25 iterations in 808 ms. Result :sat
[2020-06-03 10:42:46] [INFO ] Deduced a trap composed of 32 places in 82 ms
[2020-06-03 10:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
Incomplete Parikh walk after 35400 steps, including 587 resets, run finished after 165 ms. (steps per millisecond=214 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 54500 steps, including 900 resets, run finished after 249 ms. (steps per millisecond=218 ) properties seen :[0, 0] could not realise parikh vector
Support contains 24 out of 186 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 186/186 places, 134/134 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 185 transition count 133
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 182 transition count 130
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 182 transition count 129
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 181 transition count 128
Applied a total of 11 rules in 39 ms. Remains 181 /186 variables (removed 5) and now considering 128/134 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/186 places, 128/134 transitions.
Incomplete random walk after 1000000 steps, including 18238 resets, run finished after 3539 ms. (steps per millisecond=282 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3516 resets, run finished after 2845 ms. (steps per millisecond=351 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3451 resets, run finished after 1775 ms. (steps per millisecond=563 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 9781079 steps, run timeout after 30001 ms. (steps per millisecond=326 ) properties seen :[0, 0]
Probabilistic random walk after 9781079 steps, saw 1063198 distinct states, run finished after 30005 ms. (steps per millisecond=325 ) properties seen :[0, 0]
// Phase 1: matrix 128 rows 181 cols
[2020-06-03 10:43:25] [INFO ] Computed 61 place invariants in 28 ms
[2020-06-03 10:43:25] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-06-03 10:43:25] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 35 ms returned sat
[2020-06-03 10:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:25] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2020-06-03 10:43:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:43:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 10:43:25] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 40 ms returned sat
[2020-06-03 10:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:26] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2020-06-03 10:43:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:43:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 10:43:26] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2020-06-03 10:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2020-06-03 10:43:26] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 16 ms.
[2020-06-03 10:43:27] [INFO ] Added : 121 causal constraints over 25 iterations in 1006 ms. Result :sat
[2020-06-03 10:43:27] [INFO ] Deduced a trap composed of 12 places in 29 ms
[2020-06-03 10:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 10:43:27] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2020-06-03 10:43:27] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-06-03 10:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:27] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-03 10:43:27] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 10:43:27] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 16 ms.
[2020-06-03 10:43:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:43:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 10:43:27] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 54 ms returned sat
[2020-06-03 10:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:28] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-06-03 10:43:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 10:43:28] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-06-03 10:43:28] [INFO ] Deduced a trap composed of 12 places in 63 ms
[2020-06-03 10:43:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2020-06-03 10:43:28] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 16 ms.
[2020-06-03 10:43:29] [INFO ] Added : 124 causal constraints over 25 iterations in 793 ms. Result :sat
[2020-06-03 10:43:29] [INFO ] Deduced a trap composed of 8 places in 21 ms
[2020-06-03 10:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 75100 steps, including 1327 resets, run finished after 305 ms. (steps per millisecond=246 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 63600 steps, including 1189 resets, run finished after 254 ms. (steps per millisecond=250 ) properties seen :[0, 0] could not realise parikh vector
Support contains 24 out of 181 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 181/181 places, 128/128 transitions.
Applied a total of 0 rules in 13 ms. Remains 181 /181 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 128/128 transitions.
Starting structural reductions, iteration 0 : 181/181 places, 128/128 transitions.
Applied a total of 0 rules in 11 ms. Remains 181 /181 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 181 cols
[2020-06-03 10:43:29] [INFO ] Computed 61 place invariants in 9 ms
[2020-06-03 10:43:30] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 128 rows 181 cols
[2020-06-03 10:43:30] [INFO ] Computed 61 place invariants in 5 ms
[2020-06-03 10:43:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:43:31] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2020-06-03 10:43:31] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 128 rows 181 cols
[2020-06-03 10:43:31] [INFO ] Computed 61 place invariants in 7 ms
[2020-06-03 10:43:31] [INFO ] Dead Transitions using invariants and state equation in 459 ms returned []
Finished structural reductions, in 1 iterations. Remains : 181/181 places, 128/128 transitions.
Incomplete random walk after 100000 steps, including 1866 resets, run finished after 352 ms. (steps per millisecond=284 ) properties seen :[0, 0]
// Phase 1: matrix 128 rows 181 cols
[2020-06-03 10:43:32] [INFO ] Computed 61 place invariants in 4 ms
[2020-06-03 10:43:32] [INFO ] [Real]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-03 10:43:32] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 32 ms returned sat
[2020-06-03 10:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:32] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2020-06-03 10:43:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:43:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 31 ms returned sat
[2020-06-03 10:43:32] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 30 ms returned sat
[2020-06-03 10:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:33] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2020-06-03 10:43:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 10:43:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-03 10:43:33] [INFO ] Deduced a trap composed of 9 places in 111 ms
[2020-06-03 10:43:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2020-06-03 10:43:33] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 20 ms.
[2020-06-03 10:43:34] [INFO ] Added : 121 causal constraints over 25 iterations in 848 ms. Result :sat
[2020-06-03 10:43:34] [INFO ] Deduced a trap composed of 12 places in 22 ms
[2020-06-03 10:43:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2020-06-03 10:43:34] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 10:43:34] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 24 ms returned sat
[2020-06-03 10:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:34] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2020-06-03 10:43:34] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-06-03 10:43:34] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 16 ms.
[2020-06-03 10:43:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:43:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 48 ms returned sat
[2020-06-03 10:43:34] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 10:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:35] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2020-06-03 10:43:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-03 10:43:35] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2020-06-03 10:43:35] [INFO ] Deduced a trap composed of 12 places in 27 ms
[2020-06-03 10:43:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2020-06-03 10:43:35] [INFO ] Computed and/alt/rep : 127/515/127 causal constraints in 16 ms.
[2020-06-03 10:43:36] [INFO ] Added : 124 causal constraints over 25 iterations in 709 ms. Result :sat
[2020-06-03 10:43:36] [INFO ] Deduced a trap composed of 8 places in 42 ms
[2020-06-03 10:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 128
Applied a total of 1 rules in 20 ms. Remains 181 /181 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 181 cols
[2020-06-03 10:43:36] [INFO ] Computed 61 place invariants in 4 ms
[2020-06-03 10:43:36] [INFO ] [Real]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 10:43:36] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-06-03 10:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:36] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-06-03 10:43:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:43:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 10:43:36] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 37 ms returned sat
[2020-06-03 10:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:37] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2020-06-03 10:43:37] [INFO ] Deduced a trap composed of 9 places in 76 ms
[2020-06-03 10:43:37] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2020-06-03 10:43:37] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2020-06-03 10:43:37] [INFO ] Deduced a trap composed of 9 places in 37 ms
[2020-06-03 10:43:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 332 ms
[2020-06-03 10:43:37] [INFO ] Computed and/alt/rep : 127/517/127 causal constraints in 19 ms.
[2020-06-03 10:43:38] [INFO ] Added : 120 causal constraints over 24 iterations in 945 ms. Result :sat
[2020-06-03 10:43:38] [INFO ] Deduced a trap composed of 30 places in 70 ms
[2020-06-03 10:43:38] [INFO ] Deduced a trap composed of 24 places in 69 ms
[2020-06-03 10:43:38] [INFO ] Deduced a trap composed of 23 places in 48 ms
[2020-06-03 10:43:38] [INFO ] Deduced a trap composed of 17 places in 40 ms
[2020-06-03 10:43:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 378 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-06-03 10:43:39] [INFO ] [Real]Absence check using 36 positive place invariants in 38 ms returned sat
[2020-06-03 10:43:39] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 21 ms returned sat
[2020-06-03 10:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:39] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-03 10:43:39] [INFO ] Computed and/alt/rep : 127/517/127 causal constraints in 26 ms.
[2020-06-03 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:43:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 10:43:39] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 62 ms returned sat
[2020-06-03 10:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:43:39] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2020-06-03 10:43:39] [INFO ] Computed and/alt/rep : 127/517/127 causal constraints in 20 ms.
[2020-06-03 10:43:40] [INFO ] Added : 118 causal constraints over 24 iterations in 762 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-06-03 10:43:40] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2020-06-03 10:43:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
[2020-06-03 10:43:41] [INFO ] Flatten gal took : 103 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DES-PT-10b @ 3570 seconds
FORMULA DES-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DES-PT-10b-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2797
rslt: Output for ReachabilityFireability @ DES-PT-10b
{
"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 10:43:41 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p33 <= 0) OR (p54 <= 0))))",
"processed_size": 35,
"rewrites": 2
},
"result":
{
"edges": 5192,
"markings": 3137,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p158) AND (1 <= p4) AND (1 <= p91)) OR ((1 <= p96) AND (1 <= p157) AND (1 <= p160)) OR ((1 <= p53) AND (1 <= p51) AND (1 <= p82)) OR ((1 <= p62) AND (1 <= p41) AND ((p175 <= 0)) AND (1 <= p166) AND (1 <= p168) AND (((1 <= p14) AND (1 <= p176)) OR ((1 <= p46) AND (1 <= p49) AND (1 <= p58) AND (1 <= p59) AND (1 <= p64) AND (1 <= p68)))))))",
"processed_size": 357,
"rewrites": 1
},
"result":
{
"edges": 264073863,
"markings": 78539197,
"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": 27,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 25636,
"runtime": 773.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 610,
"conflict_clusters": 68,
"places": 181,
"places_significant": 120,
"singleton_clusters": 0,
"transitions": 128
},
"result":
{
"preliminary_value": "yes no ",
"value": "yes no "
},
"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: 309/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 181
lola: finding significant places
lola: 181 places, 128 transitions, 120 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: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: E (F ((((1 <= p158) AND (1 <= p4) AND (1 <= p91)) OR ((1 <= p96) AND (1 <= p157) AND (1 <= p160)) OR ((1 <= p53) AND (1 <= p51) AND (1 <= p82)) OR ((1 <= p62) AND (1 <= p41) AND ((p175 <= 0)) AND (1 <= p166) AND (1 <= p168) AND (((1 <= p14) AND (1 <= p176)) OR ((1 <= p46) AND (1 <= p49) AND (1 <= p58) AND (1 <= p59) AND (1 <= p64) AND (1 <= p68))))))) : A (G (((p33 <= 0) OR (p54 <= 0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p33 <= 0) OR (p54 <= 0))))
lola: ========================================
lola: SUBTASK
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 (((p33 <= 0) OR (p54 <= 0))))
lola: processed formula length: 35
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: 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 <= p33) AND (1 <= p54))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 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.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3137 markings, 5192 edges
lola: ========================================
lola: subprocess 1 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p158) AND (1 <= p4) AND (1 <= p91)) OR ((1 <= p96) AND (1 <= p157) AND (1 <= p160)) OR ((1 <= p53) AND (1 <= p51) AND (1 <= p82)) OR ((1 <= p62) AND (1 <= p41) AND ((p175 <= 0)) AND (1 <= p166) AND (1 <= p168) AND (((1 <= p14) AND (1 <= p176)) OR ((1 <= p46) AND (1 <= p49) AND (1 <= p58) AND (1 <= p59) AND (1 <= p64) AND (1 <= p68)))))))
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 <= p158) AND (1 <= p4) AND (1 <= p91)) OR ((1 <= p96) AND (1 <= p157) AND (1 <= p160)) OR ((1 <= p53) AND (1 <= p51) AND (1 <= p82)) OR ((1 <= p62) AND (1 <= p41) AND ((p175 <= 0)) AND (1 <= p166) AND (1 <= p168) AND (((1 <= p14) AND (1 <= p176)) OR ((1 <= p46) AND (1 <= p49) AND (1 <= p58) AND (1 <= p59) AND (1 <= p64) AND (1 <= p68)))))))
lola: processed formula length: 357
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 <= p158) AND (1 <= p4) AND (1 <= p91)) OR ((1 <= p96) AND (1 <= p157) AND (1 <= p160)) OR ((1 <= p53) AND (1 <= p51) AND (1 <= p82)) OR ((1 <= p62) AND (1 <= p41) AND ((p175 <= 0)) AND (1 <= p166) AND (1 <= p168) AND (((1 <= p14) AND (1 <= p176)) OR ((1 <= p46) AND (1 <= p49) AND (1 <= p58) AND (1 <= p59) AND (1 <= p64) AND (1 <= p68)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 27 literals and 5 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: sara is running 0 secs || 590677 markings, 1951909 edges, 118135 markings/sec, 0 secs
lola: sara is running 5 secs || 1173105 markings, 3819546 edges, 116486 markings/sec, 5 secs
lola: sara is running 10 secs || 1752492 markings, 5682465 edges, 115877 markings/sec, 10 secs
lola: sara is running 15 secs || 2310495 markings, 7501860 edges, 111601 markings/sec, 15 secs
lola: sara is running 20 secs || 2877515 markings, 9363616 edges, 113404 markings/sec, 20 secs
lola: sara is running 25 secs || 3435482 markings, 11166653 edges, 111593 markings/sec, 25 secs
lola: sara is running 30 secs || 3956455 markings, 12992766 edges, 104195 markings/sec, 30 secs
lola: sara is running 35 secs || 4524848 markings, 14863187 edges, 113679 markings/sec, 35 secs
lola: sara is running 40 secs || 5071787 markings, 16604416 edges, 109388 markings/sec, 40 secs
lola: sara is running 45 secs || 5602246 markings, 18350463 edges, 106092 markings/sec, 45 secs
lola: sara is running 50 secs || 6094105 markings, 20077152 edges, 98372 markings/sec, 50 secs
lola: sara is running 55 secs || 6645726 markings, 21884189 edges, 110324 markings/sec, 55 secs
lola: sara is running 60 secs || 7165392 markings, 23729788 edges, 103933 markings/sec, 60 secs
lola: sara is running 65 secs || 7740423 markings, 25607791 edges, 115006 markings/sec, 65 secs
lola: sara is running 70 secs || 8307393 markings, 27452771 edges, 113394 markings/sec, 70 secs
lola: sara is running 75 secs || 8856945 markings, 29285857 edges, 109910 markings/sec, 75 secs
lola: sara is running 80 secs || 9380941 markings, 31124152 edges, 104799 markings/sec, 80 secs
lola: sara is running 85 secs || 9925772 markings, 32867017 edges, 108966 markings/sec, 85 secs
lola: sara is running 90 secs || 10457593 markings, 34695838 edges, 106364 markings/sec, 90 secs
lola: sara is running 95 secs || 11017604 markings, 36473807 edges, 112002 markings/sec, 95 secs
lola: sara is running 100 secs || 11543280 markings, 38221656 edges, 105135 markings/sec, 100 secs
lola: sara is running 105 secs || 12070374 markings, 39914219 edges, 105419 markings/sec, 105 secs
lola: sara is running 110 secs || 12589323 markings, 41571371 edges, 103790 markings/sec, 110 secs
lola: sara is running 115 secs || 13110829 markings, 43312588 edges, 104301 markings/sec, 115 secs
lola: sara is running 120 secs || 13597624 markings, 45045343 edges, 97359 markings/sec, 120 secs
lola: sara is running 125 secs || 14130147 markings, 46831183 edges, 106505 markings/sec, 125 secs
lola: sara is running 130 secs || 14629063 markings, 48655982 edges, 99783 markings/sec, 130 secs
lola: sara is running 135 secs || 15163465 markings, 50404388 edges, 106880 markings/sec, 135 secs
lola: sara is running 140 secs || 15684278 markings, 52097325 edges, 104163 markings/sec, 140 secs
lola: sara is running 145 secs || 16176938 markings, 53764855 edges, 98532 markings/sec, 145 secs
lola: sara is running 150 secs || 16674456 markings, 55439907 edges, 99504 markings/sec, 150 secs
lola: sara is running 155 secs || 17169668 markings, 57169577 edges, 99042 markings/sec, 155 secs
lola: sara is running 160 secs || 17661594 markings, 58864659 edges, 98385 markings/sec, 160 secs
lola: sara is running 165 secs || 18141763 markings, 60667281 edges, 96034 markings/sec, 165 secs
lola: sara is running 170 secs || 18717900 markings, 62494080 edges, 115227 markings/sec, 170 secs
lola: sara is running 175 secs || 19268306 markings, 64259279 edges, 110081 markings/sec, 175 secs
lola: sara is running 180 secs || 19800125 markings, 66011078 edges, 106364 markings/sec, 180 secs
lola: sara is running 185 secs || 20349137 markings, 67706870 edges, 109802 markings/sec, 185 secs
lola: sara is running 190 secs || 20845277 markings, 69408700 edges, 99228 markings/sec, 190 secs
lola: sara is running 195 secs || 21370374 markings, 71214563 edges, 105019 markings/sec, 195 secs
lola: sara is running 200 secs || 21913696 markings, 73018900 edges, 108664 markings/sec, 200 secs
lola: sara is running 205 secs || 22468863 markings, 74816225 edges, 111033 markings/sec, 205 secs
lola: sara is running 210 secs || 23005544 markings, 76471391 edges, 107336 markings/sec, 210 secs
lola: sara is running 215 secs || 23494655 markings, 78119488 edges, 97822 markings/sec, 215 secs
lola: sara is running 220 secs || 24004844 markings, 79854230 edges, 102038 markings/sec, 220 secs
lola: sara is running 225 secs || 24515065 markings, 81573223 edges, 102044 markings/sec, 225 secs
lola: sara is running 230 secs || 25004141 markings, 83274271 edges, 97815 markings/sec, 230 secs
lola: sara is running 235 secs || 25543473 markings, 85090332 edges, 107866 markings/sec, 235 secs
lola: sara is running 240 secs || 26072600 markings, 86867128 edges, 105825 markings/sec, 240 secs
lola: sara is running 245 secs || 26600696 markings, 88703197 edges, 105619 markings/sec, 245 secs
lola: sara is running 250 secs || 27124933 markings, 90503658 edges, 104847 markings/sec, 250 secs
lola: sara is running 255 secs || 27607448 markings, 92231649 edges, 96503 markings/sec, 255 secs
lola: sara is running 260 secs || 28116451 markings, 93975585 edges, 101801 markings/sec, 260 secs
lola: sara is running 265 secs || 28638656 markings, 95759648 edges, 104441 markings/sec, 265 secs
lola: sara is running 270 secs || 29167186 markings, 97481646 edges, 105706 markings/sec, 270 secs
lola: sara is running 275 secs || 29672692 markings, 99183506 edges, 101101 markings/sec, 275 secs
lola: sara is running 280 secs || 30158699 markings, 100912077 edges, 97201 markings/sec, 280 secs
lola: sara is running 285 secs || 30682016 markings, 102637433 edges, 104663 markings/sec, 285 secs
lola: sara is running 290 secs || 31220606 markings, 104435084 edges, 107718 markings/sec, 290 secs
lola: sara is running 295 secs || 31731905 markings, 106223304 edges, 102260 markings/sec, 295 secs
lola: sara is running 300 secs || 32270480 markings, 107984357 edges, 107715 markings/sec, 300 secs
lola: sara is running 305 secs || 32735802 markings, 109627571 edges, 93064 markings/sec, 305 secs
lola: sara is running 310 secs || 33199788 markings, 111222185 edges, 92797 markings/sec, 310 secs
lola: sara is running 315 secs || 33686056 markings, 112864665 edges, 97254 markings/sec, 315 secs
lola: sara is running 320 secs || 34172967 markings, 114476076 edges, 97382 markings/sec, 320 secs
lola: sara is running 325 secs || 34675893 markings, 116118202 edges, 100585 markings/sec, 325 secs
lola: sara is running 330 secs || 35195651 markings, 117798771 edges, 103952 markings/sec, 330 secs
lola: sara is running 335 secs || 35651845 markings, 119388114 edges, 91239 markings/sec, 335 secs
lola: sara is running 340 secs || 36138643 markings, 121110442 edges, 97360 markings/sec, 340 secs
lola: sara is running 345 secs || 36647081 markings, 122854461 edges, 101688 markings/sec, 345 secs
lola: sara is running 350 secs || 37164953 markings, 124562977 edges, 103574 markings/sec, 350 secs
lola: sara is running 355 secs || 37648147 markings, 126301136 edges, 96639 markings/sec, 355 secs
lola: sara is running 360 secs || 38201383 markings, 128122761 edges, 110647 markings/sec, 360 secs
lola: sara is running 365 secs || 38746807 markings, 129880444 edges, 109085 markings/sec, 365 secs
lola: sara is running 370 secs || 39313330 markings, 131710103 edges, 113305 markings/sec, 370 secs
lola: sara is running 375 secs || 39848047 markings, 133430387 edges, 106943 markings/sec, 375 secs
lola: sara is running 380 secs || 40370168 markings, 135216438 edges, 104424 markings/sec, 380 secs
lola: sara is running 385 secs || 40902429 markings, 136908117 edges, 106452 markings/sec, 385 secs
lola: sara is running 390 secs || 41423568 markings, 138626389 edges, 104228 markings/sec, 390 secs
lola: sara is running 395 secs || 41901977 markings, 140270517 edges, 95682 markings/sec, 395 secs
lola: sara is running 400 secs || 42413505 markings, 142041588 edges, 102306 markings/sec, 400 secs
lola: sara is running 405 secs || 42929407 markings, 143686489 edges, 103180 markings/sec, 405 secs
lola: sara is running 410 secs || 43419549 markings, 145350396 edges, 98028 markings/sec, 410 secs
lola: sara is running 415 secs || 43905879 markings, 146994469 edges, 97266 markings/sec, 415 secs
lola: sara is running 420 secs || 44386490 markings, 148728167 edges, 96122 markings/sec, 420 secs
lola: sara is running 425 secs || 44950874 markings, 150549733 edges, 112877 markings/sec, 425 secs
lola: sara is running 430 secs || 45460061 markings, 152305455 edges, 101837 markings/sec, 430 secs
lola: sara is running 435 secs || 45977414 markings, 154080832 edges, 103471 markings/sec, 435 secs
lola: sara is running 440 secs || 46488048 markings, 155821531 edges, 102127 markings/sec, 440 secs
lola: sara is running 445 secs || 47006502 markings, 157542929 edges, 103691 markings/sec, 445 secs
lola: sara is running 450 secs || 47548012 markings, 159296917 edges, 108302 markings/sec, 450 secs
lola: sara is running 455 secs || 48059276 markings, 160985539 edges, 102253 markings/sec, 455 secs
lola: sara is running 460 secs || 48588894 markings, 162682961 edges, 105924 markings/sec, 460 secs
lola: sara is running 465 secs || 49049020 markings, 164384242 edges, 92025 markings/sec, 465 secs
lola: sara is running 470 secs || 49549462 markings, 166062283 edges, 100088 markings/sec, 470 secs
lola: sara is running 475 secs || 50062417 markings, 167828450 edges, 102591 markings/sec, 475 secs
lola: sara is running 480 secs || 50592175 markings, 169527361 edges, 105952 markings/sec, 480 secs
lola: sara is running 485 secs || 51081775 markings, 171161344 edges, 97920 markings/sec, 485 secs
lola: sara is running 490 secs || 51545508 markings, 172771776 edges, 92747 markings/sec, 490 secs
lola: sara is running 495 secs || 52061341 markings, 174430327 edges, 103167 markings/sec, 495 secs
lola: sara is running 500 secs || 52549120 markings, 176111176 edges, 97556 markings/sec, 500 secs
lola: sara is running 505 secs || 53019472 markings, 177742959 edges, 94070 markings/sec, 505 secs
lola: sara is running 510 secs || 53519475 markings, 179441426 edges, 100001 markings/sec, 510 secs
lola: sara is running 515 secs || 54003999 markings, 181112185 edges, 96905 markings/sec, 515 secs
lola: sara is running 520 secs || 54503759 markings, 182748439 edges, 99952 markings/sec, 520 secs
lola: sara is running 525 secs || 54992348 markings, 184379018 edges, 97718 markings/sec, 525 secs
lola: sara is running 530 secs || 55471669 markings, 186055989 edges, 95864 markings/sec, 530 secs
lola: sara is running 535 secs || 55938332 markings, 187709099 edges, 93333 markings/sec, 535 secs
lola: sara is running 540 secs || 56410798 markings, 189335965 edges, 94493 markings/sec, 540 secs
lola: sara is running 545 secs || 56920966 markings, 191006466 edges, 102034 markings/sec, 545 secs
lola: sara is running 550 secs || 57413832 markings, 192760503 edges, 98573 markings/sec, 550 secs
lola: sara is running 555 secs || 57915671 markings, 194392319 edges, 100368 markings/sec, 555 secs
lola: sara is running 560 secs || 58374586 markings, 196051446 edges, 91783 markings/sec, 560 secs
lola: sara is running 565 secs || 58817255 markings, 197549695 edges, 88534 markings/sec, 565 secs
lola: sara is running 570 secs || 59291915 markings, 199060119 edges, 94932 markings/sec, 570 secs
lola: sara is running 575 secs || 59750104 markings, 200604177 edges, 91638 markings/sec, 575 secs
lola: sara is running 580 secs || 60258120 markings, 202278799 edges, 101603 markings/sec, 580 secs
lola: sara is running 585 secs || 60740767 markings, 203835332 edges, 96529 markings/sec, 585 secs
lola: sara is running 590 secs || 61203322 markings, 205453454 edges, 92511 markings/sec, 590 secs
lola: sara is running 595 secs || 61714326 markings, 207069808 edges, 102201 markings/sec, 595 secs
lola: sara is running 600 secs || 62190738 markings, 208795843 edges, 95282 markings/sec, 600 secs
lola: sara is running 605 secs || 62721847 markings, 210528636 edges, 106222 markings/sec, 605 secs
lola: sara is running 610 secs || 63265786 markings, 212282195 edges, 108788 markings/sec, 610 secs
lola: sara is running 615 secs || 63830645 markings, 214102533 edges, 112972 markings/sec, 615 secs
lola: sara is running 620 secs || 64398117 markings, 215903375 edges, 113494 markings/sec, 620 secs
lola: sara is running 625 secs || 64901241 markings, 217721142 edges, 100625 markings/sec, 625 secs
lola: sara is running 630 secs || 65457167 markings, 219531067 edges, 111185 markings/sec, 630 secs
lola: sara is running 635 secs || 65961499 markings, 221287563 edges, 100866 markings/sec, 635 secs
lola: sara is running 640 secs || 66499319 markings, 222990245 edges, 107564 markings/sec, 640 secs
lola: sara is running 645 secs || 67025964 markings, 224797566 edges, 105329 markings/sec, 645 secs
lola: sara is running 650 secs || 67533517 markings, 226532920 edges, 101511 markings/sec, 650 secs
lola: sara is running 655 secs || 68029786 markings, 228268221 edges, 99254 markings/sec, 655 secs
lola: sara is running 660 secs || 68538592 markings, 229964805 edges, 101761 markings/sec, 660 secs
lola: sara is running 665 secs || 69031179 markings, 231645009 edges, 98517 markings/sec, 665 secs
lola: sara is running 670 secs || 69548719 markings, 233338068 edges, 103508 markings/sec, 670 secs
lola: sara is running 675 secs || 70075770 markings, 235021117 edges, 105410 markings/sec, 675 secs
lola: sara is running 680 secs || 70532558 markings, 236653681 edges, 91358 markings/sec, 680 secs
lola: sara is running 685 secs || 71027619 markings, 238267590 edges, 99012 markings/sec, 685 secs
lola: sara is running 690 secs || 71486323 markings, 239864723 edges, 91741 markings/sec, 690 secs
lola: sara is running 695 secs || 71968538 markings, 241565564 edges, 96443 markings/sec, 695 secs
lola: sara is running 700 secs || 72484982 markings, 243329449 edges, 103289 markings/sec, 700 secs
lola: sara is running 705 secs || 72989506 markings, 245038895 edges, 100905 markings/sec, 705 secs
lola: sara is running 710 secs || 73489732 markings, 246753922 edges, 100045 markings/sec, 710 secs
lola: sara is running 715 secs || 73967320 markings, 248347069 edges, 95518 markings/sec, 715 secs
lola: sara is running 720 secs || 74459189 markings, 249975105 edges, 98374 markings/sec, 720 secs
lola: sara is running 725 secs || 74940772 markings, 251571377 edges, 96317 markings/sec, 725 secs
lola: sara is running 730 secs || 75376594 markings, 253119598 edges, 87164 markings/sec, 730 secs
lola: sara is running 735 secs || 75873092 markings, 254805040 edges, 99300 markings/sec, 735 secs
lola: sara is running 740 secs || 76338185 markings, 256415218 edges, 93019 markings/sec, 740 secs
lola: sara is running 745 secs || 76815380 markings, 258092637 edges, 95439 markings/sec, 745 secs
lola: sara is running 750 secs || 77291782 markings, 259764756 edges, 95280 markings/sec, 750 secs
lola: sara is running 755 secs || 77762162 markings, 261418696 edges, 94076 markings/sec, 755 secs
lola: sara is running 760 secs || 78258367 markings, 263168549 edges, 99241 markings/sec, 760 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 78539197 markings, 264073863 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: memory consumption: 25636 KB
lola: time consumption: 773 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-10b"
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-10b, 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-158987899900255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b 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 ;