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 S_Railroad-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800070
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496439540643


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Railroad-PT-100: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_Railroad-PT-100: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_Railroad-PT-100 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 11524/65536 symbol table entries, 3643 collisions
lola: preprocessing...
lola: finding significant places
lola: 1018 places, 10506 transitions, 407 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 612 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-100-ReachabilityCardinality.task
lola: E (F (((2 <= pl_P502_51) AND (pl_P148_1 <= pl_P497_1)))) : E (F ((3 <= pl_P335_1))) : E (F (((1 <= pl_P376_1) AND ((pl_P218_54 <= 2) OR (pl_P115_1 <= 0))))) : E (F ((pl_P61_1 + 1 <= pl_P304_69))) : E (F ((3 <= pl_P29_6))) : A (G (((pl_P353_1 <= pl_P227_1) OR (2 <= pl_P435_19) OR (1 <= pl_P502_30) OR (3 <= pl_P10_1) OR (2 <= pl_P502_3)))) : E (F (((pl_P304_53 + 1 <= pl_P29_81) AND (pl_P289_1 <= 0) AND ((pl_P29_81 <= 2) OR (pl_P435_33 <= 2))))) : A (G (((((pl_P95_1 <= pl_P218_100) AND (pl_P384_1 <= pl_P304_86)) OR (pl_P435_46 <= pl_P425_1)) AND ((3 <= pl_P304_11) OR (pl_P384_1 <= pl_P304_77) OR (pl_P259_1 + 1 <= pl_P502_45))))) : A (G (((pl_P502_50 <= pl_P320_1) OR ((pl_P304_19 + 1 <= pl_P306_1) AND (pl_P170_1 <= 0))))) : E (F (((1 <= pl_P29_66) AND (2 <= pl_P335_1) AND (1 <= pl_P218_3) AND ((2 <= pl_P310_1) OR (pl_P391_1 <= pl_P345_1) OR (pl_P43_1 + 1 <= pl_P29_14))))) : E (F ((1 <= pl_P502_7))) : A (G (((pl_P438_1 <= pl_P231_1) OR ((pl_P275_1 <= 0) AND ((pl_P418_1 <= pl_P19_1) OR (pl_P218_5 <= pl_P29_43)))))) : A (G (((2 <= pl_P395_1) OR (pl_P502_19 <= pl_P138_1) OR (2 <= pl_P502_90) OR ((1 <= pl_P29_15) AND (1 <= pl_P218_45) AND (pl_P474_1 + 1 <= pl_P304_63))))) : E (F (((1 <= pl_P79_1) AND (pl_P304_1 <= pl_P387_1) AND (1 <= pl_P289_1) AND (pl_P402_1 <= pl_P113_1) AND (3 <= pl_P45_1)))) : A (G (((pl_P488_1 <= pl_P173_1) OR (pl_P319_1 <= 1) OR (pl_P371_1 <= pl_P468_1)))) : A (G (((pl_P352_1 <= pl_P304_58) OR (pl_P220_1 <= 1) OR (((pl_P429_1 <= pl_P502_48) OR (3 <= pl_P158_1)) AND (pl_P39_1 <= 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: E (F (((2 <= pl_P502_51) AND (pl_P148_1 <= pl_P497_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 1628 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P335_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 1628 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-100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 5014 markings, 6051 edges, 1003 markings/sec, 0 secs
lola: sara is running 5 secs || 11481 markings, 14087 edges, 1293 markings/sec, 5 secs
lola: sara is running 10 secs || 18203 markings, 22719 edges, 1344 markings/sec, 10 secs
lola: sara is running 15 secs || 24480 markings, 30866 edges, 1255 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 30753 markings, 39096 edges, 1255 markings/sec, 20 secs
lola: sara is running 25 secs || 37363 markings, 47533 edges, 1322 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= pl_P376_1) AND ((pl_P218_54 <= 2) OR (pl_P115_1 <= 0)))))
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 1628 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-100-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pl_P61_1 + 1 <= pl_P304_69)))
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 1628 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-100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P29_6)))
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 1628 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-100-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 5396 markings, 6514 edges, 1079 markings/sec, 0 secs
lola: sara is running 5 secs || 12039 markings, 14847 edges, 1329 markings/sec, 5 secs
lola: sara is running 10 secs || 18346 markings, 22921 edges, 1261 markings/sec, 10 secs
lola: sara is running 15 secs || 24393 markings, 30766 edges, 1209 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 30532 markings, 38733 edges, 1228 markings/sec, 20 secs
lola: sara is running 25 secs || 36648 markings, 46586 edges, 1223 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P353_1 <= pl_P227_1) OR (2 <= pl_P435_19) OR (1 <= pl_P502_30) OR (3 <= pl_P10_1) OR (2 <= pl_P502_3))))
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 1628 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 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P304_53 + 1 <= pl_P29_81) AND (pl_P289_1 <= 0) AND ((pl_P29_81 <= 2) OR (pl_P435_33 <= 2)))))
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 1628 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-100-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((pl_P95_1 <= pl_P218_100) AND (pl_P384_1 <= pl_P304_86)) OR (pl_P435_46 <= pl_P425_1)) AND ((3 <= pl_P304_11) OR (pl_P384_1 <= pl_P304_77) OR (pl_P259_1 + 1 <= pl_P502_45)))))
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 1628 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P502_50 <= pl_P320_1) OR ((pl_P304_19 + 1 <= pl_P306_1) AND (pl_P170_1 <= 0)))))
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 1628 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-100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 5204 markings, 6282 edges, 1041 markings/sec, 0 secs
lola: sara is running 5 secs || 11582 markings, 14217 edges, 1276 markings/sec, 5 secs
lola: sara is running 10 secs || 17796 markings, 22198 edges, 1243 markings/sec, 10 secs
lola: sara is running 15 secs || 24107 markings, 30368 edges, 1262 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 30381 markings, 38610 edges, 1255 markings/sec, 20 secs

lola: sara is running 25 secs || 36529 markings, 46473 edges, 1230 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= pl_P29_66) AND (2 <= pl_P335_1) AND (1 <= pl_P218_3) AND ((2 <= pl_P310_1) OR (pl_P391_1 <= pl_P345_1) OR (pl_P43_1 + 1 <= pl_P29_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 1628 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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 4341 markings, 8211 edges, 868 markings/sec, 0 secs
lola: sara is running 5 secs || 9750 markings, 19094 edges, 1082 markings/sec, 5 secs
lola: sara is running 10 secs || 15030 markings, 29880 edges, 1056 markings/sec, 10 secs
lola: sara is running 15 secs || 20179 markings, 39863 edges, 1030 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 25695 markings, 50743 edges, 1103 markings/sec, 20 secs

lola: sara is running 25 secs || 30856 markings, 60308 edges, 1032 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 568 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= pl_P502_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 1628 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: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-10.sara
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: state equation: calling and running sara
lola: ...considering subproblem: A (G (((pl_P438_1 <= pl_P231_1) OR ((pl_P275_1 <= 0) AND ((pl_P418_1 <= pl_P19_1) OR (pl_P218_5 <= pl_P29_43))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-10.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-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 852 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= pl_P395_1) OR (pl_P502_19 <= pl_P138_1) OR (2 <= pl_P502_90) OR ((1 <= pl_P29_15) AND (1 <= pl_P218_45) AND (pl_P474_1 + 1 <= pl_P304_63)))))
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 1628 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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 5228 markings, 6330 edges, 1046 markings/sec, 0 secs
lola: sara is running 5 secs || 11641 markings, 14263 edges, 1283 markings/sec, 5 secs
lola: sara is running 10 secs || 17802 markings, 22122 edges, 1232 markings/sec, 10 secs
lola: sara is running 15 secs || 23943 markings, 30101 edges, 1228 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 30137 markings, 38207 edges, 1239 markings/sec, 20 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1127 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= pl_P79_1) AND (pl_P304_1 <= pl_P387_1) AND (1 <= pl_P289_1) AND (pl_P402_1 <= pl_P113_1) AND (3 <= pl_P45_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 1628 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 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 6483 markings, 7955 edges, 1297 markings/sec, 0 secs
lola: sara is running 5 secs || 13150 markings, 16209 edges, 1333 markings/sec, 5 secs
lola: sara is running 10 secs || 19513 markings, 24144 edges, 1273 markings/sec, 10 secs
lola: sara is running 15 secs || 25806 markings, 32244 edges, 1259 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 31976 markings, 40195 edges, 1234 markings/sec, 20 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 1677 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P488_1 <= pl_P173_1) OR (pl_P319_1 <= 1) OR (pl_P371_1 <= pl_P468_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 1628 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-100-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 5015 markings, 6051 edges, 1003 markings/sec, 0 secs
lola: sara is running 5 secs || 11371 markings, 13944 edges, 1271 markings/sec, 5 secs
lola: sara is running 10 secs || 17513 markings, 21823 edges, 1228 markings/sec, 10 secs
lola: sara is running 15 secs || 23694 markings, 29841 edges, 1236 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 29835 markings, 37892 edges, 1228 markings/sec, 20 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P352_1 <= pl_P304_58) OR (pl_P220_1 <= 1) OR (((pl_P429_1 <= pl_P502_48) OR (3 <= pl_P158_1)) AND (pl_P39_1 <= 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 1628 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 4099 markings, 5722 edges, 820 markings/sec, 0 secs
lola: sara is running 5 secs || 8305 markings, 11554 edges, 841 markings/sec, 5 secs
lola: sara is running 10 secs || 12628 markings, 17572 edges, 865 markings/sec, 10 secs
lola: sara is running 15 secs || 16965 markings, 23549 edges, 867 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 21123 markings, 29570 edges, 832 markings/sec, 20 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no no yes no yes no no no yes no yes yes
FORMULA Railroad-PT-100-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496439782285

--------------------
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_Railroad-PT-100"
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_Railroad-PT-100.tgz
mv S_Railroad-PT-100 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 S_Railroad-PT-100, 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 r148-csrt-149443432800070"
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 ;