About the Execution of LoLA for S_DLCshifumi-PT-4b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 759.200 | 840970.00 | 1684416.00 | 160.10 | ?TFFFFFTTFFFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_DLCshifumi-PT-4b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488456000493
=====================================================================
--------------------
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 DLCshifumi-PT-4b-ReachabilityCardinality-0
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-1
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-15
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-2
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-3
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-4
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-5
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-6
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-7
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-8
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496470205121
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DLCshifumi-PT-4b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_DLCshifumi-PT-4b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_DLCshifumi-PT-4b @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 36356/65536 symbol table entries, 13849 collisions
lola: preprocessing...
lola: finding significant places
lola: 15015 places, 21341 transitions, 14324 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28617 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-4b-ReachabilityCardinality.task
lola: A (G (((p4383 + 1 <= p8543) OR (p259 <= 1) OR ((3 <= p2207) AND (2 <= p14674) AND ((p1241 <= p5433) OR (1 <= p7513)))))) : E (F ((1 <= p12883))) : E (F (((3 <= p14898) OR (1 <= p11697)))) : A (G (((p4295 <= p9789) OR (p8651 <= p889)))) : A (G ((p7577 <= p7024))) : E (F ((3 <= p11234))) : A (G ((((p2730 <= 1) AND (p7577 + 1 <= p2099)) OR ((p11066 <= p6232) AND (p6275 <= p14431))))) : E (F ((((p8551 + 1 <= p9340) OR (p2747 + 1 <= p3617)) AND ((p5497 <= 1) OR (1 <= p3744))))) : E (F (((1 <= p14646) OR (1 <= p13727)))) : E (F (((p8492 + 1 <= p5853) OR (2 <= p1840)))) : A (G ((p2761 <= p100))) : A (G ((((p3667 + 1 <= p11887) AND (p10649 <= 0)) OR (p59 <= p2714)))) : E (F ((((p10238 <= p10948) OR (p8752 <= p9316)) AND ((p7696 <= p9829) OR (p5400 <= p9253)) AND (3 <= p5234)))) : E (F (((3 <= p3701) AND (p7865 + 1 <= p11450) AND (p11174 <= p8425)))) : A (G ((((p3216 <= p8677) AND ((p11575 <= p2267) OR (2 <= p7175))) OR (p11130 <= p7064)))) : E (F ((1 <= p364)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4383 + 1 <= p8543) OR (p259 <= 1) OR ((3 <= p2207) AND (2 <= p14674) AND ((p1241 <= p5433) OR (1 <= p7513))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 14983 markings, 16948 edges, 2997 markings/sec, 0 secs
lola: sara is running 5 secs || 32327 markings, 36525 edges, 3469 markings/sec, 5 secs
lola: sara is running 10 secs || 51788 markings, 58486 edges, 3892 markings/sec, 10 secs
lola: sara is running 15 secs || 75006 markings, 84698 edges, 4644 markings/sec, 15 secs
lola: sara is running 20 secs || 102813 markings, 116092 edges, 5561 markings/sec, 20 secs
lola: sara is running 25 secs || 128880 markings, 145511 edges, 5213 markings/sec, 25 secs
lola: sara is running 30 secs || 159459 markings, 180086 edges, 6116 markings/sec, 30 secs
lola: sara is running 35 secs || 192416 markings, 218813 edges, 6591 markings/sec, 35 secs
lola: sara is running 40 secs || 226481 markings, 260290 edges, 6813 markings/sec, 40 secs
lola: sara is running 45 secs || 260149 markings, 301210 edges, 6734 markings/sec, 45 secs
lola: sara is running 50 secs || 293478 markings, 341832 edges, 6666 markings/sec, 50 secs
lola: sara is running 55 secs || 326139 markings, 381627 edges, 6532 markings/sec, 55 secs
lola: sara is running 60 secs || 358632 markings, 421076 edges, 6499 markings/sec, 60 secs
lola: sara is running 65 secs || 390844 markings, 460367 edges, 6442 markings/sec, 65 secs
lola: sara is running 70 secs || 422784 markings, 499272 edges, 6388 markings/sec, 70 secs
lola: sara is running 75 secs || 454582 markings, 537942 edges, 6360 markings/sec, 75 secs
lola: sara is running 80 secs || 485918 markings, 576117 edges, 6267 markings/sec, 80 secs
lola: sara is running 85 secs || 517102 markings, 614054 edges, 6237 markings/sec, 85 secs
lola: sara is running 90 secs || 548125 markings, 651742 edges, 6205 markings/sec, 90 secs
lola: sara is running 95 secs || 578738 markings, 689089 edges, 6123 markings/sec, 95 secs
lola: sara is running 100 secs || 609236 markings, 726177 edges, 6100 markings/sec, 100 secs
lola: sara is running 105 secs || 639084 markings, 762474 edges, 5970 markings/sec, 105 secs
lola: sara is running 110 secs || 668636 markings, 798455 edges, 5910 markings/sec, 110 secs
lola: sara is running 115 secs || 698492 markings, 834589 edges, 5971 markings/sec, 115 secs
lola: sara is running 120 secs || 727976 markings, 870364 edges, 5897 markings/sec, 120 secs
lola: sara is running 125 secs || 757065 markings, 905593 edges, 5818 markings/sec, 125 secs
lola: sara is running 130 secs || 785586 markings, 940164 edges, 5704 markings/sec, 130 secs
lola: sara is running 135 secs || 813608 markings, 974182 edges, 5604 markings/sec, 135 secs
lola: sara is running 140 secs || 841908 markings, 1008532 edges, 5660 markings/sec, 140 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 145 secs || 869659 markings, 1042052 edges, 5550 markings/sec, 145 secs
lola: sara is running 150 secs || 897463 markings, 1075780 edges, 5561 markings/sec, 150 secs
lola: sara is running 155 secs || 924793 markings, 1108877 edges, 5466 markings/sec, 155 secs
lola: sara is running 160 secs || 951906 markings, 1141793 edges, 5423 markings/sec, 160 secs
lola: sara is running 165 secs || 977023 markings, 1172410 edges, 5023 markings/sec, 165 secs
lola: sara is running 170 secs || 1002630 markings, 1203526 edges, 5121 markings/sec, 170 secs
lola: sara is running 175 secs || 1028772 markings, 1235529 edges, 5228 markings/sec, 175 secs
lola: sara is running 180 secs || 1053314 markings, 1265334 edges, 4908 markings/sec, 180 secs
lola: sara is running 185 secs || 1078573 markings, 1295803 edges, 5052 markings/sec, 185 secs
lola: sara is running 190 secs || 1103764 markings, 1326497 edges, 5038 markings/sec, 190 secs
lola: sara is running 195 secs || 1128546 markings, 1356486 edges, 4956 markings/sec, 195 secs
lola: sara is running 200 secs || 1153909 markings, 1387230 edges, 5073 markings/sec, 200 secs
lola: sara is running 205 secs || 1178179 markings, 1416495 edges, 4854 markings/sec, 205 secs
lola: sara is running 210 secs || 1203961 markings, 1448091 edges, 5156 markings/sec, 210 secs
lola: sara is running 215 secs || 1228936 markings, 1478443 edges, 4995 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p12883)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p14898) OR (1 <= p11697))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 9159 markings, 10789 edges, 1832 markings/sec, 0 secs
lola: sara is running 5 secs || 18274 markings, 21479 edges, 1823 markings/sec, 5 secs
lola: sara is running 10 secs || 27645 markings, 32464 edges, 1874 markings/sec, 10 secs
lola: sara is running 15 secs || 39020 markings, 46118 edges, 2275 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4295 <= p9789) OR (p8651 <= p889))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p7577 <= p7024)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p11234)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2730 <= 1) AND (p7577 + 1 <= p2099)) OR ((p11066 <= p6232) AND (p6275 <= p14431)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p8551 + 1 <= p9340) OR (p2747 + 1 <= p3617)) AND ((p5497 <= 1) OR (1 <= p3744)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p14646) OR (1 <= p13727))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((p8492 + 1 <= p5853) OR (2 <= p1840))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2761 <= p100)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 7105 markings, 8930 edges, 1421 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3667 + 1 <= p11887) AND (p10649 <= 0)) OR (p59 <= p2714))))
lola: ========================================
lola: SUBTASK
lola: lola: checking invariance ========================================
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p10238 <= p10948) OR (p8752 <= p9316)) AND ((p7696 <= p9829) OR (p5400 <= p9253)) AND (3 <= p5234))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 15722 markings, 17800 edges, 3144 markings/sec, 0 secs
lola: sara is running 5 secs || 35971 markings, 41355 edges, 4050 markings/sec, 5 secs
lola: sara is running 10 secs || 57627 markings, 66843 edges, 4331 markings/sec, 10 secs
lola: sara is running 15 secs || 80033 markings, 93310 edges, 4481 markings/sec, 15 secs
lola: sara is running 20 secs || 98149 markings, 114629 edges, 3623 markings/sec, 20 secs
lola: sara is running 25 secs || 121063 markings, 141614 edges, 4583 markings/sec, 25 secs
lola: sara is running 30 secs || 144484 markings, 169008 edges, 4684 markings/sec, 30 secs
lola: sara is running 35 secs || 167793 markings, 196477 edges, 4662 markings/sec, 35 secs
lola: sara is running 40 secs || 190986 markings, 224162 edges, 4639 markings/sec, 40 secs
lola: sara is running 45 secs || 213618 markings, 250682 edges, 4526 markings/sec, 45 secs
lola: sara is running 50 secs || 234807 markings, 275480 edges, 4238 markings/sec, 50 secs
lola: sara is running 55 secs || 256441 markings, 300829 edges, 4327 markings/sec, 55 secs
lola: sara is running 60 secs || 278800 markings, 326984 edges, 4472 markings/sec, 60 secs
lola: sara is running 65 secs || 301631 markings, 353862 edges, 4566 markings/sec, 65 secs
lola: sara is running 70 secs || 323640 markings, 379533 edges, 4402 markings/sec, 70 secs
lola: sara is running 75 secs || 345681 markings, 405403 edges, 4408 markings/sec, 75 secs
lola: sara is running 80 secs || 368394 markings, 432168 edges, 4543 markings/sec, 80 secs
lola: sara is running 85 secs || 390464 markings, 458233 edges, 4414 markings/sec, 85 secs
lola: sara is running 90 secs || 412441 markings, 484045 edges, 4395 markings/sec, 90 secs
lola: sara is running 95 secs || 434598 markings, 510083 edges, 4431 markings/sec, 95 secs
lola: sara is running 100 secs || 456459 markings, 535907 edges, 4372 markings/sec, 100 secs
lola: sara is running 105 secs || 478509 markings, 561824 edges, 4410 markings/sec, 105 secs
lola: sara is running 110 secs || 500492 markings, 587543 edges, 4397 markings/sec, 110 secs
lola: sara is running 115 secs || 522598 markings, 613517 edges, 4421 markings/sec, 115 secs
lola: sara is running 120 secs || 544722 markings, 639560 edges, 4425 markings/sec, 120 secs
lola: sara is running 125 secs || 566507 markings, 665055 edges, 4357 markings/sec, 125 secs
lola: sara is running 130 secs || 588779 markings, 691129 edges, 4454 markings/sec, 130 secs
lola: sara is running 135 secs || 611395 markings, 717791 edges, 4523 markings/sec, 135 secs
lola: sara is running 140 secs || 633486 markings, 743703 edges, 4418 markings/sec, 140 secs
lola: sara is running 145 secs || 655571 markings, 769577 edges, 4417 markings/sec, 145 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 150 secs || 677714 markings, 795621 edges, 4429 markings/sec, 150 secs
lola: sara is running 155 secs || 699090 markings, 820748 edges, 4275 markings/sec, 155 secs
lola: sara is running 160 secs || 720247 markings, 845469 edges, 4231 markings/sec, 160 secs
lola: sara is running 165 secs || 741761 markings, 870780 edges, 4303 markings/sec, 165 secs
lola: sara is running 170 secs || 762777 markings, 895423 edges, 4203 markings/sec, 170 secs
lola: sara is running 175 secs || 783493 markings, 919686 edges, 4143 markings/sec, 175 secs
lola: sara is running 180 secs || 804547 markings, 944428 edges, 4211 markings/sec, 180 secs
lola: sara is running 185 secs || 825159 markings, 968649 edges, 4122 markings/sec, 185 secs
lola: sara is running 190 secs || 845846 markings, 992801 edges, 4137 markings/sec, 190 secs
lola: sara is running 195 secs || 867115 markings, 1017897 edges, 4254 markings/sec, 195 secs
lola: sara is running 200 secs || 887839 markings, 1042159 edges, 4145 markings/sec, 200 secs
lola: sara is running 205 secs || 907878 markings, 1065593 edges, 4008 markings/sec, 205 secs
lola: sara is running 210 secs || 928692 markings, 1090142 edges, 4163 markings/sec, 210 secs
lola: sara is running 215 secs || 948800 markings, 1113629 edges, 4022 markings/sec, 215 secs
lola: sara is running 220 secs || 969242 markings, 1137721 edges, 4088 markings/sec, 220 secs
lola: sara is running 225 secs || 988783 markings, 1160646 edges, 3908 markings/sec, 225 secs
lola: sara is running 230 secs || 1008991 markings, 1184185 edges, 4042 markings/sec, 230 secs
lola: sara is running 235 secs || 1030169 markings, 1209153 edges, 4236 markings/sec, 235 secs
lola: sara is running 240 secs || 1050588 markings, 1233103 edges, 4084 markings/sec, 240 secs
lola: sara is running 245 secs || 1070684 markings, 1256669 edges, 4019 markings/sec, 245 secs
lola: sara is running 250 secs || 1091638 markings, 1281315 edges, 4191 markings/sec, 250 secs
lola: sara is running 255 secs || 1112606 markings, 1305940 edges, 4194 markings/sec, 255 secs
lola: sara is running 260 secs || 1131983 markings, 1328632 edges, 3875 markings/sec, 260 secs
lola: sara is running 265 secs || 1152738 markings, 1352979 edges, 4151 markings/sec, 265 secs
lola: sara is running 270 secs || 1173156 markings, 1377174 edges, 4084 markings/sec, 270 secs
lola: sara is running 275 secs || 1193224 markings, 1400728 edges, 4014 markings/sec, 275 secs
lola: sara is running 280 secs || 1213143 markings, 1424021 edges, 3984 markings/sec, 280 secs
lola: sara is running 285 secs || 1234398 markings, 1448899 edges, 4251 markings/sec, 285 secs
lola: sara is running 290 secs || 1255877 markings, 1473960 edges, 4296 markings/sec, 290 secs
lola: sara is running 295 secs || 1277859 markings, 1499911 edges, 4396 markings/sec, 295 secs
lola: sara is running 300 secs || 1298436 markings, 1524084 edges, 4115 markings/sec, 300 secs
lola: sara is running 305 secs || 1319905 markings, 1549093 edges, 4294 markings/sec, 305 secs
lola: sara is running 310 secs || 1341590 markings, 1574550 edges, 4337 markings/sec, 310 secs
lola: sara is running 315 secs || 1361451 markings, 1597887 edges, 3972 markings/sec, 315 secs
lola: sara is running 320 secs || 1381169 markings, 1620773 edges, 3944 markings/sec, 320 secs
lola: sara is running 325 secs || 1401722 markings, 1645056 edges, 4111 markings/sec, 325 secs
lola: sara is running 330 secs || 1420902 markings, 1667466 edges, 3836 markings/sec, 330 secs
lola: sara is running 335 secs || 1442067 markings, 1692278 edges, 4233 markings/sec, 335 secs
lola: sara is running 340 secs || 1464431 markings, 1718703 edges, 4473 markings/sec, 340 secs
lola: sara is running 345 secs || 1486013 markings, 1744136 edges, 4316 markings/sec, 345 secs
lola: sara is running 350 secs || 1507859 markings, 1769888 edges, 4369 markings/sec, 350 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 977 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p3701) AND (p7865 + 1 <= p11450) AND (p11174 <= p8425))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 25301 markings, 26877 edges, 5060 markings/sec, 0 secs
lola: sara is running 5 secs || 42510 markings, 45862 edges, 3442 markings/sec, 5 secs
lola: sara is running 10 secs || 57996 markings, 63012 edges, 3097 markings/sec, 10 secs
lola: sara is running 15 secs || 74347 markings, 80942 edges, 3270 markings/sec, 15 secs
lola: sara is running 20 secs || 88099 markings, 96060 edges, 2750 markings/sec, 20 secs
lola: sara is running 25 secs || 100391 markings, 109577 edges, 2458 markings/sec, 25 secs
lola: sara is running 30 secs || 110809 markings, 120905 edges, 2084 markings/sec, 30 secs
lola: sara is running 35 secs || 120921 markings, 131909 edges, 2022 markings/sec, 35 secs
lola: sara is running 40 secs || 131392 markings, 143317 edges, 2094 markings/sec, 40 secs
lola: sara is running 45 secs || 140975 markings, 153772 edges, 1917 markings/sec, 45 secs
lola: sara is running 50 secs || 150747 markings, 164444 edges, 1954 markings/sec, 50 secs
lola: sara is running 55 secs || 160653 markings, 175220 edges, 1981 markings/sec, 55 secs
lola: sara is running 60 secs || 170701 markings, 186150 edges, 2010 markings/sec, 60 secs
lola: sara is running 65 secs || 180638 markings, 196966 edges, 1987 markings/sec, 65 secs
lola: sara is running 70 secs || 190461 markings, 207718 edges, 1965 markings/sec, 70 secs
lola: sara is running 75 secs || 200913 markings, 219099 edges, 2090 markings/sec, 75 secs
lola: sara is running 80 secs || 210678 markings, 229755 edges, 1953 markings/sec, 80 secs
lola: sara is running 85 secs || 220504 markings, 240481 edges, 1965 markings/sec, 85 secs
lola: sara is running 90 secs || 230551 markings, 251428 edges, 2009 markings/sec, 90 secs
lola: sara is running 95 secs || 240617 markings, 262361 edges, 2013 markings/sec, 95 secs
lola: sara is running 100 secs || 250165 markings, 272828 edges, 1910 markings/sec, 100 secs
lola: sara is running 105 secs || 260142 markings, 283679 edges, 1995 markings/sec, 105 secs
lola: sara is running 110 secs || 270351 markings, 294796 edges, 2042 markings/sec, 110 secs
lola: sara is running 115 secs || 279933 markings, 305247 edges, 1916 markings/sec, 115 secs
lola: sara is running 120 secs || 289759 markings, 315979 edges, 1965 markings/sec, 120 secs
lola: sara is running 125 secs || 299740 markings, 326850 edges, 1996 markings/sec, 125 secs
lola: sara is running 130 secs || 309946 markings, 337942 edges, 2041 markings/sec, 130 secs
lola: sara is running 135 secs || 319791 markings, 348734 edges, 1969 markings/sec, 135 secs
lola: sara is running 140 secs || 329962 markings, 359786 edges, 2034 markings/sec, 140 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 145 secs || 340407 markings, 371156 edges, 2089 markings/sec, 145 secs
lola: sara is running 150 secs || 350167 markings, 381811 edges, 1952 markings/sec, 150 secs
lola: sara is running 155 secs || 360058 markings, 392616 edges, 1978 markings/sec, 155 secs
lola: sara is running 160 secs || 370133 markings, 403583 edges, 2015 markings/sec, 160 secs
lola: sara is running 165 secs || 380585 markings, 414958 edges, 2090 markings/sec, 165 secs
lola: sara is running 170 secs || 390961 markings, 426244 edges, 2075 markings/sec, 170 secs
lola: sara is running 175 secs || 401408 markings, 437607 edges, 2089 markings/sec, 175 secs
lola: sara is running 180 secs || 412119 markings, 449271 edges, 2142 markings/sec, 180 secs
lola: sara is running 185 secs || 422746 markings, 460855 edges, 2125 markings/sec, 185 secs
lola: sara is running 190 secs || 432993 markings, 472042 edges, 2049 markings/sec, 190 secs
lola: sara is running 195 secs || 444005 markings, 484086 edges, 2202 markings/sec, 195 secs
lola: sara is running 200 secs || 453969 markings, 494972 edges, 1993 markings/sec, 200 secs
lola: sara is running 205 secs || 464019 markings, 505935 edges, 2010 markings/sec, 205 secs
lola: sara is running 210 secs || 474177 markings, 517010 edges, 2032 markings/sec, 210 secs
lola: sara is running 215 secs || 484334 markings, 528106 edges, 2031 markings/sec, 215 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3216 <= p8677) AND ((p11575 <= p2267) OR (2 <= p7175))) OR (p11130 <= p7064))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 11641 markings, 12846 edges, 2328 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p364)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1792 bytes per marking, with 12 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: unknown yes yes no no no no yes yes yes no no no no no yes
lola: ========================================
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496471046091
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_DLCshifumi-PT-4b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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
tar xzf /home/mcc/BenchKit/INPUTS/S_DLCshifumi-PT-4b.tgz
mv S_DLCshifumi-PT-4b execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DLCshifumi-PT-4b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-ebro-149488456000493"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
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 ;