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-3254
Executing tool lola
Input is Railroad-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963100052
=====================================================================

--------------------
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 Railroad-PT-020-ReachabilityCardinality-0
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-1
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-10
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-11
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-12
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-13
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-14
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-15
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-2
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-3
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-4
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-5
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-6
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-7
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-8
FORMULA_NAME Railroad-PT-020-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494799813752


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ Railroad-PT-020 @ 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: 724/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 218 places, 506 transitions, 87 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 132 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-020-ReachabilityCardinality.task
lola: A (G (((3 <= pl_P57_1) OR (pl_P100_4 <= 2) OR (3 <= pl_P100_13)))) : A (G (((1 <= pl_P21_8) OR (pl_P110_1 <= pl_P61_5) OR (pl_P61_4 <= pl_P20_1) OR (1 <= pl_P23_14) OR (pl_P100_15 <= pl_P21_5) OR (1 <= pl_P14_1) OR ((pl_P77_1 <= pl_P4_1) AND (3 <= pl_P39_1))))) : A (G (((pl_P59_13 <= pl_P23_14) OR (pl_P59_4 <= pl_P107_1)))) : A (G (((pl_P100_2 <= 0) OR (pl_P109_1 <= 2) OR ((pl_P21_6 <= 2) AND (pl_P85_1 + 1 <= pl_P37_1))))) : A (G (((pl_P53_1 <= 2) OR (pl_P59_21 <= 0) OR (3 <= pl_P75_1)))) : A (G ((pl_P23_19 <= pl_P6_1))) : A (G (((pl_P35_1 <= 1) AND (pl_P21_21 <= 0) AND (pl_P23_3 <= pl_P61_7)))) : E (F ((3 <= pl_P21_7))) : E (F (((pl_P59_17 + 1 <= pl_P100_18) AND (pl_P23_2 <= 1) AND (pl_P81_1 + 1 <= pl_P23_7)))) : E (F (((2 <= pl_P59_7) AND (pl_P111_1 <= pl_P82_1)))) : E (F ((((2 <= pl_P23_14) AND (pl_P21_21 + 1 <= pl_P23_11)) OR ((pl_P61_20 <= pl_P31_1) AND (3 <= pl_P59_4) AND (2 <= pl_P59_20))))) : E (F ((1 <= pl_P64_1))) : A (G (((1 <= pl_P17_1) OR ((pl_P21_20 <= 0) AND (pl_P112_1 <= 2))))) : A (G ((pl_P100_19 <= pl_P82_1))) : E (F ((3 <= pl_P100_14))) : A (G (((pl_P23_16 <= 1) OR (pl_P54_1 <= pl_P23_21) OR ((pl_P15_1 <= pl_P100_18) AND (pl_P100_4 <= pl_P111_1) AND (pl_P29_1 <= pl_P76_1)))))
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 (((3 <= pl_P57_1) OR (pl_P100_4 <= 2) OR (3 <= pl_P100_13))))
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 348 bytes per marking, with 0 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 Railroad-PT-020-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pl_P21_8) OR (pl_P110_1 <= pl_P61_5) OR (pl_P61_4 <= pl_P20_1) OR (1 <= pl_P23_14) OR (pl_P100_15 <= pl_P21_5) OR (1 <= pl_P14_1) OR ((pl_P77_1 <= pl_P4_1) AND (3 <= pl_P39_1)))))
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 348 bytes per marking, with 0 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 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P59_13 <= pl_P23_14) OR (pl_P59_4 <= pl_P107_1))))
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 348 bytes per marking, with 0 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 Railroad-PT-020-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P100_2 <= 0) OR (pl_P109_1 <= 2) OR ((pl_P21_6 <= 2) AND (pl_P85_1 + 1 <= pl_P37_1)))))
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 348 bytes per marking, with 0 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P53_1 <= 2) OR (pl_P59_21 <= 0) OR (3 <= pl_P75_1))))
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 348 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-4.sara
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: lola: lola: ========================================state equation: calling and running sara

========================================
lola: ...considering subproblem: A (G ((pl_P23_19 <= pl_P6_1)))
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 348 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-4.sara.state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-5.sara

lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P35_1 <= 1) AND (pl_P21_21 <= 0) AND (pl_P23_3 <= pl_P61_7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: lola: using a bit-perfect encoder (--encoder=bit)
lola: ========================================
using 348 bytes per marking, with 0 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: calling and running sara
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P21_7)))
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 348 bytes per marking, with 0 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 Railroad-PT-020-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 212824 markings, 482244 edges, 42565 markings/sec, 0 secs

lola: sara is running 5 secs || 421354 markings, 998759 edges, 41706 markings/sec, 5 secs
lola: sara is running 10 secs || 622080 markings, 1499490 edges, 40145 markings/sec, 10 secs
lola: sara is running 15 secs || 824365 markings, 2009938 edges, 40457 markings/sec, 15 secs
lola: sara is running 20 secs || 1026267 markings, 2520257 edges, 40380 markings/sec, 20 secs
lola: sara is running 25 secs || 1226903 markings, 3031829 edges, 40127 markings/sec, 25 secs
lola: sara is running 30 secs || 1432684 markings, 3564102 edges, 41156 markings/sec, 30 secs
lola: sara is running 35 secs || 1642696 markings, 4113423 edges, 42002 markings/sec, 35 secs
lola: sara is running 40 secs || 1851164 markings, 4665576 edges, 41694 markings/sec, 40 secs
lola: sara is running 45 secs || 2060917 markings, 5223804 edges, 41951 markings/sec, 45 secs
lola: sara is running 50 secs || 2270981 markings, 5777326 edges, 42013 markings/sec, 50 secs
lola: sara is running 55 secs || 2473133 markings, 6316619 edges, 40430 markings/sec, 55 secs
lola: sara is running 60 secs || 2674509 markings, 6851649 edges, 40275 markings/sec, 60 secs
lola: sara is running 65 secs || 2871361 markings, 7381990 edges, 39370 markings/sec, 65 secs
lola: sara is running 70 secs || 3068119 markings, 7915855 edges, 39352 markings/sec, 70 secs
lola: sara is running 75 secs || 3263950 markings, 8442308 edges, 39166 markings/sec, 75 secs
lola: sara is running 80 secs || 3467122 markings, 8984164 edges, 40634 markings/sec, 80 secs
lola: sara is running 85 secs || 3666221 markings, 9517982 edges, 39820 markings/sec, 85 secs
lola: sara is running 90 secs || 3866746 markings, 10051984 edges, 40105 markings/sec, 90 secs
lola: sara is running 95 secs || 4064689 markings, 10587927 edges, 39589 markings/sec, 95 secs
lola: sara is running 100 secs || 4262545 markings, 11119843 edges, 39571 markings/sec, 100 secs
lola: sara is running 105 secs || 4457511 markings, 11650756 edges, 38993 markings/sec, 105 secs
lola: sara is running 110 secs || 4653935 markings, 12185263 edges, 39285 markings/sec, 110 secs
lola: sara is running 115 secs || 4851688 markings, 12715151 edges, 39551 markings/sec, 115 secs
lola: sara is running 120 secs || 5049504 markings, 13248852 edges, 39563 markings/sec, 120 secs
lola: sara is running 125 secs || 5246734 markings, 13790721 edges, 39446 markings/sec, 125 secs
lola: sara is running 130 secs || 5442438 markings, 14321655 edges, 39141 markings/sec, 130 secs
lola: sara is running 135 secs || 5638126 markings, 14855571 edges, 39138 markings/sec, 135 secs
lola: sara is running 140 secs || 5835032 markings, 15390118 edges, 39381 markings/sec, 140 secs
lola: sara is running 145 secs || 6030286 markings, 15924987 edges, 39051 markings/sec, 145 secs
lola: sara is running 150 secs || 6226980 markings, 16463624 edges, 39339 markings/sec, 150 secs
lola: sara is running 155 secs || 6421380 markings, 16993418 edges, 38880 markings/sec, 155 secs
lola: sara is running 160 secs || 6614165 markings, 17522163 edges, 38557 markings/sec, 160 secs
lola: sara is running 165 secs || 6809483 markings, 18056128 edges, 39064 markings/sec, 165 secs
lola: sara is running 170 secs || 7008404 markings, 18601820 edges, 39784 markings/sec, 170 secs
lola: sara is running 175 secs || 7211593 markings, 19161216 edges, 40638 markings/sec, 175 secs
lola: sara is running 180 secs || 7408627 markings, 19703658 edges, 39407 markings/sec, 180 secs
lola: sara is running 185 secs || 7607901 markings, 20242785 edges, 39855 markings/sec, 185 secs
lola: sara is running 190 secs || 7802367 markings, 20782145 edges, 38893 markings/sec, 190 secs
lola: sara is running 195 secs || 7999041 markings, 21321956 edges, 39335 markings/sec, 195 secs
lola: sara is running 200 secs || 8191932 markings, 21857917 edges, 38578 markings/sec, 200 secs
lola: sara is running 205 secs || 8385228 markings, 22394564 edges, 38659 markings/sec, 205 secs
lola: sara is running 210 secs || 8578408 markings, 22936895 edges, 38636 markings/sec, 210 secs
lola: sara is running 215 secs || 8769234 markings, 23468738 edges, 38165 markings/sec, 215 secs
lola: sara is running 220 secs || 8962324 markings, 24005808 edges, 38618 markings/sec, 220 secs
lola: sara is running 225 secs || 9155224 markings, 24538350 edges, 38580 markings/sec, 225 secs
lola: sara is running 230 secs || 9344837 markings, 25068059 edges, 37923 markings/sec, 230 secs
lola: sara is running 235 secs || 9537164 markings, 25605107 edges, 38465 markings/sec, 235 secs
lola: sara is running 240 secs || 9733431 markings, 26149832 edges, 39253 markings/sec, 240 secs
lola: sara is running 245 secs || 9937722 markings, 26721237 edges, 40858 markings/sec, 245 secs
lola: sara is running 250 secs || 10138691 markings, 27284298 edges, 40194 markings/sec, 250 secs
lola: sara is running 255 secs || 10339181 markings, 27848545 edges, 40098 markings/sec, 255 secs
lola: sara is running 260 secs || 10537813 markings, 28407928 edges, 39726 markings/sec, 260 secs
lola: sara is running 265 secs || 10737330 markings, 28964313 edges, 39903 markings/sec, 265 secs
lola: sara is running 270 secs || 10936814 markings, 29526716 edges, 39897 markings/sec, 270 secs
lola: sara is running 275 secs || 11131915 markings, 30073486 edges, 39020 markings/sec, 275 secs
lola: sara is running 280 secs || 11321812 markings, 30605907 edges, 37979 markings/sec, 280 secs
lola: sara is running 285 secs || 11513658 markings, 31142716 edges, 38369 markings/sec, 285 secs
lola: sara is running 290 secs || 11704585 markings, 31680824 edges, 38185 markings/sec, 290 secs
lola: sara is running 295 secs || 11893374 markings, 32216834 edges, 37758 markings/sec, 295 secs
lola: sara is running 300 secs || 12083290 markings, 32752414 edges, 37983 markings/sec, 300 secs
lola: sara is running 305 secs || 12272632 markings, 33281922 edges, 37868 markings/sec, 305 secs
lola: sara is running 310 secs || 12463207 markings, 33817712 edges, 38115 markings/sec, 310 secs
lola: sara is running 315 secs || 12650444 markings, 34345343 edges, 37447 markings/sec, 315 secs
lola: sara is running 320 secs || 12839945 markings, 34880306 edges, 37900 markings/sec, 320 secs
lola: sara is running 325 secs || 13028284 markings, 35408871 edges, 37668 markings/sec, 325 secs
lola: sara is running 330 secs || 13218046 markings, 35943507 edges, 37952 markings/sec, 330 secs
lola: sara is running 335 secs || 13407311 markings, 36481175 edges, 37853 markings/sec, 335 secs
lola: sara is running 340 secs || 13594806 markings, 37014660 edges, 37499 markings/sec, 340 secs
lola: sara is running 345 secs || 13783115 markings, 37548989 edges, 37662 markings/sec, 345 secs
lola: sara is running 350 secs || 13971932 markings, 38086305 edges, 37763 markings/sec, 350 secs
lola: sara is running 355 secs || 14159241 markings, 38619593 edges, 37462 markings/sec, 355 secs
lola: sara is running 360 secs || 14347415 markings, 39153712 edges, 37635 markings/sec, 360 secs
lola: sara is running 365 secs || 14535145 markings, 39687922 edges, 37546 markings/sec, 365 secs
lola: sara is running 370 secs || 14723498 markings, 40221407 edges, 37671 markings/sec, 370 secs
lola: sara is running 375 secs || 14910472 markings, 40754486 edges, 37395 markings/sec, 375 secs
lola: sara is running 380 secs || 15098995 markings, 41290281 edges, 37705 markings/sec, 380 secs
lola: sara is running 385 secs || 15286487 markings, 41824253 edges, 37498 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P59_17 + 1 <= pl_P100_18) AND (pl_P23_2 <= 1) AND (pl_P81_1 + 1 <= pl_P23_7))))
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 348 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P59_7) AND (pl_P111_1 <= pl_P82_1))))
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 348 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-9.sara
lola: The predicate is unreachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= pl_P23_14) AND (pl_P21_21 + 1 <= pl_P23_11)) OR ((pl_P61_20 <= pl_P31_1) AND (3 <= pl_P59_4) AND (2 <= pl_P59_20)))))
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 348 bytes per marking, with 0 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
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-9.sara.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= pl_P64_1)))
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 348 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pl_P17_1) OR ((pl_P21_20 <= 0) AND (pl_P112_1 <= 2)))))
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 348 bytes per marking, with 0 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 Railroad-PT-020-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pl_P100_19 <= pl_P82_1)))
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 348 bytes per marking, with 0 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 Railroad-PT-020-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1572 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P100_14)))
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 348 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3145 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P23_16 <= 1) OR (pl_P54_1 <= pl_P23_21) OR ((pl_P15_1 <= pl_P100_18) AND (pl_P100_4 <= pl_P111_1) AND (pl_P29_1 <= pl_P76_1)))))
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 348 bytes per marking, with 0 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 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-15.saralola:
RESULT
lola:
SUMMARY: yes yes yes yes yes no no unknown no no no no no yes no yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-15.sara.
FORMULA Railroad-PT-020-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494800208359

--------------------
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="Railroad-PT-020"
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/Railroad-PT-020.tgz
mv Railroad-PT-020 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is Railroad-PT-020, 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 r068-csrt-149440963100052"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;