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 DLCshifumi-PT-5a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309400504
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494646944116


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ DLCshifumi-PT-5a @ 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: 17027/65536 symbol table entries, 5854 collisions
lola: preprocessing...
lola: finding significant places
lola: 2162 places, 14865 transitions, 784 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 12838 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-5a-ReachabilityFireability.task
lola: E (F (FIREABLE(t1712))) : E (F ((FIREABLE(t9569) OR (FIREABLE(t318) AND FIREABLE(t5620) AND NOT FIREABLE(t8824)) OR FIREABLE(t12621)))) : A (G ((NOT FIREABLE(t142) OR NOT FIREABLE(t9769) OR NOT FIREABLE(t12470) OR NOT FIREABLE(t6398) OR NOT FIREABLE(t13968) OR NOT FIREABLE(t14833)))) : E (F (FIREABLE(t9664))) : E (F (((FIREABLE(t5328) AND FIREABLE(t3840)) OR FIREABLE(t7247)))) : E (F ((FIREABLE(t6376) AND ((NOT FIREABLE(t95) AND NOT FIREABLE(t3232)) OR (NOT FIREABLE(t14304) AND NOT FIREABLE(t6797)))))) : E (F ((NOT FIREABLE(t14545) AND NOT FIREABLE(t3086) AND NOT FIREABLE(t10037) AND NOT FIREABLE(t12889) AND FIREABLE(t1333)))) : E (F ((FIREABLE(t2690) AND FIREABLE(t6629) AND FIREABLE(t365) AND FIREABLE(t6068) AND FIREABLE(t13386) AND (NOT FIREABLE(t2857) OR NOT FIREABLE(t14011))))) : E (F ((FIREABLE(t5128) AND FIREABLE(t10993) AND (FIREABLE(t3260) OR FIREABLE(t5481))))) : E (F (FIREABLE(t1996))) : E (F (((FIREABLE(t7684) OR FIREABLE(t10699)) AND FIREABLE(t3223) AND FIREABLE(t2963) AND NOT FIREABLE(t5475) AND NOT FIREABLE(t10224) AND FIREABLE(t10379)))) : E (F ((FIREABLE(t9272) AND NOT FIREABLE(t4943)))) : E (F ((NOT FIREABLE(t4994) AND (FIREABLE(t6086) OR FIREABLE(t9230))))) : A (G ((FIREABLE(t14533) OR NOT FIREABLE(t719)))) : E (F ((FIREABLE(t1880) AND (FIREABLE(t11917) OR FIREABLE(t1130) OR FIREABLE(t5723) OR (FIREABLE(t14562) AND FIREABLE(t9306) AND NOT FIREABLE(t3444)))))) : E (F ((FIREABLE(t9647) AND FIREABLE(t9200) AND (FIREABLE(t2047) OR FIREABLE(t14534)) AND FIREABLE(t6381) AND FIREABLE(t4689) AND FIREABLE(t773) AND (FIREABLE(t7249) OR FIREABLE(t1438)) AND ((FIREABLE(t11490) AND FIREABLE(t4742)) OR NOT FIREABLE(t6530)))))
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 (FIREABLE(t1712)))
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 100 bytes per marking, with 16 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-5a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t9569) OR (FIREABLE(t318) AND FIREABLE(t5620) AND NOT FIREABLE(t8824)) OR FIREABLE(t12621))))
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 100 bytes per marking, with 16 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-5a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t142) OR NOT FIREABLE(t9769) OR NOT FIREABLE(t12470) OR NOT FIREABLE(t6398) OR NOT FIREABLE(t13968) OR NOT FIREABLE(t14833))))
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 100 bytes per marking, with 16 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t9664)))
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 100 bytes per marking, with 16 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-5a-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t5328) AND FIREABLE(t3840)) OR FIREABLE(t7247))))
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 100 bytes per marking, with 16 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 DLCshifumi-PT-5a-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6376) AND ((NOT FIREABLE(t95) AND NOT FIREABLE(t3232)) OR (NOT FIREABLE(t14304) AND NOT FIREABLE(t6797))))))
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 100 bytes per marking, with 16 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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t14545) AND NOT FIREABLE(t3086) AND NOT FIREABLE(t10037) AND NOT FIREABLE(t12889) AND FIREABLE(t1333))))
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 100 bytes per marking, with 16 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 48 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2690) AND FIREABLE(t6629) AND FIREABLE(t365) AND FIREABLE(t6068) AND FIREABLE(t13386) AND (NOT FIREABLE(t2857) OR NOT FIREABLE(t14011)))))
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 100 bytes per marking, with 16 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 30 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-7.sara.
lola: sara is running 0 secs || 1005 markings, 48592 edges, 201 markings/sec, 0 secs
lola: sara is running 5 secs || 2083 markings, 106516 edges, 216 markings/sec, 5 secs
lola: sara is running 10 secs || 3148 markings, 161394 edges, 213 markings/sec, 10 secs
lola: sara is running 15 secs || 4188 markings, 216628 edges, 208 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 5219 markings, 270378 edges, 206 markings/sec, 20 secs

lola: sara is running 25 secs || 6230 markings, 321528 edges, 202 markings/sec, 25 secs
lola: sara is running 30 secs || 7223 markings, 375339 edges, 199 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t5128) AND FIREABLE(t10993) AND (FIREABLE(t3260) OR FIREABLE(t5481)))))
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 100 bytes per marking, with 16 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1996)))
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 100 bytes per marking, with 16 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-5a-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t7684) OR FIREABLE(t10699)) AND FIREABLE(t3223) AND FIREABLE(t2963) AND NOT FIREABLE(t5475) AND NOT FIREABLE(t10224) AND FIREABLE(t10379))))
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 100 bytes per marking, with 16 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 60 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 700 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t9272) AND NOT FIREABLE(t4943))))
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 100 bytes per marking, with 16 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 DLCshifumi-PT-5a-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 876 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t4994) AND (FIREABLE(t6086) OR FIREABLE(t9230)))))
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 100 bytes per marking, with 16 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: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1167 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t14533) OR NOT FIREABLE(t719))))
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 100 bytes per marking, with 16 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-5a-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1751 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1880) AND (FIREABLE(t11917) OR FIREABLE(t1130) OR FIREABLE(t5723) OR (FIREABLE(t14562) AND FIREABLE(t9306) AND NOT FIREABLE(t3444))))))
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 100 bytes per marking, with 16 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 23 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t9647) AND FIREABLE(t9200) AND (FIREABLE(t2047) OR FIREABLE(t14534)) AND FIREABLE(t6381) AND FIREABLE(t4689) AND FIREABLE(t773) AND (FIREABLE(t7249) OR FIREABLE(t1438)) AND ((FIREABLE(t11490) AND FIREABLE(t4742)) OR NOT FIREABLE(t6530)))))
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 100 bytes per marking, with 16 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 174 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes yes no yes yes yes yes yes no yes yes
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494646981413

--------------------
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="DLCshifumi-PT-5a"
export BK_EXAMINATION="ReachabilityFireability"
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/DLCshifumi-PT-5a.tgz
mv DLCshifumi-PT-5a 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 DLCshifumi-PT-5a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-ebro-149436309400504"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;