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 HexagonalGrid-PT-816, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034600243
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496505390904


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


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-816: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ HexagonalGrid-PT-816 @ 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: 9565/65536 symbol table entries, 1336 collisions
lola: preprocessing...
lola: finding significant places
lola: 3391 places, 6174 transitions, 2117 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7447 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-816-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(ti6_4_5_6) OR (NOT FIREABLE(ti5_4_8_1) AND NOT FIREABLE(ti5_4_3_2) AND NOT FIREABLE(ti3_1_10_12))))) : E (F ((NOT FIREABLE(ti1_5_10_8) AND NOT FIREABLE(ti1_6_7_7) AND (FIREABLE(ti1_2_13_2) OR FIREABLE(ti4_6_14_7) OR (FIREABLE(ti3_1_11_8) AND FIREABLE(ti1_6_14_9))) AND (FIREABLE(ti5_1_13_6) OR NOT FIREABLE(to4_13_6))))) : A (G ((NOT FIREABLE(to4_1_2) OR NOT FIREABLE(to3_12_7) OR NOT FIREABLE(ti1_4_8_12) OR NOT FIREABLE(ti2_5_14_6) OR NOT FIREABLE(ti2_5_12_2)))) : A (G ((FIREABLE(ti3_6_4_8) OR NOT FIREABLE(ti4_5_15_4)))) : E (F ((FIREABLE(ti6_1_12_5) AND (NOT FIREABLE(ti6_2_6_4) OR NOT FIREABLE(ti1_2_9_1)) AND (FIREABLE(ti5_1_2_5) OR FIREABLE(ti4_5_4_10))))) : E (F (FIREABLE(ti4_2_9_1))) : A (G ((NOT FIREABLE(ti3_1_11_1) OR NOT FIREABLE(ti5_2_15_4)))) : E (F (((NOT FIREABLE(to4_12_4) OR NOT FIREABLE(to1_11_1) OR (NOT FIREABLE(to2_1_7) AND NOT FIREABLE(ti3_4_5_3))) AND FIREABLE(ti5_2_5_11)))) : A (G ((NOT FIREABLE(ti4_6_3_10) OR NOT FIREABLE(ti1_4_9_3)))) : E (F ((FIREABLE(ti4_3_10_6) AND FIREABLE(ti6_2_7_9) AND ((FIREABLE(to5_1_3) AND FIREABLE(ti1_4_10_4)) OR NOT FIREABLE(ti4_1_12_9)) AND (FIREABLE(ti2_4_4_8) OR FIREABLE(ti3_6_12_7) OR FIREABLE(ti3_1_2_4))))) : A (G ((NOT FIREABLE(ti6_2_13_7) OR NOT FIREABLE(ti5_1_9_12) OR NOT FIREABLE(ti3_6_6_11) OR NOT FIREABLE(to4_5_10)))) : A (G ((NOT FIREABLE(ti2_1_4_8) OR (NOT FIREABLE(to5_4_1) AND NOT FIREABLE(ti4_5_4_1)) OR NOT FIREABLE(ti4_5_12_6) OR NOT FIREABLE(ti6_1_10_10) OR FIREABLE(ti6_3_12_11)))) : A (G ((NOT FIREABLE(ti4_3_7_8) OR NOT FIREABLE(ti5_3_5_1) OR NOT FIREABLE(t1_1_3) OR (FIREABLE(to5_10_2) AND (NOT FIREABLE(ti3_2_4_9) OR NOT FIREABLE(ti2_1_5_3)))))) : E (F ((FIREABLE(ti4_6_7_14) AND (FIREABLE(ti1_4_9_14) OR FIREABLE(ti4_1_13_4) OR NOT FIREABLE(ti3_5_8_13)) AND FIREABLE(ti3_5_4_8)))) : E (F (((FIREABLE(ti2_3_7_9) OR NOT FIREABLE(to5_9_4) OR (NOT FIREABLE(to3_5_6) AND NOT FIREABLE(ti3_1_14_4))) AND ((FIREABLE(ti5_4_5_11) AND FIREABLE(ti4_6_10_2)) OR (FIREABLE(ti4_1_12_4) AND FIREABLE(to2_12_1)) OR FIREABLE(ti5_2_9_1))))) : A (G (((FIREABLE(ti4_1_13_6) AND FIREABLE(ti5_6_11_10)) OR NOT FIREABLE(ti3_2_11_12) OR (NOT FIREABLE(ti3_2_10_4) AND (FIREABLE(ti5_3_10_2) OR FIREABLE(ti3_2_10_13))) OR NOT FIREABLE(ti4_2_10_3) OR NOT FIREABLE(to6_3_2) OR NOT FIREABLE(ti4_6_12_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 ((NOT FIREABLE(ti6_4_5_6) OR (NOT FIREABLE(ti5_4_8_1) AND NOT FIREABLE(ti5_4_3_2) AND NOT FIREABLE(ti3_1_10_12)))))
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 8468 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ti1_5_10_8) AND NOT FIREABLE(ti1_6_7_7) AND (FIREABLE(ti1_2_13_2) OR FIREABLE(ti4_6_14_7) OR (FIREABLE(ti3_1_11_8) AND FIREABLE(ti1_6_14_9))) AND (FIREABLE(ti5_1_13_6) OR NOT FIREABLE(to4_13_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 8468 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 216 literals and 36 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(to4_1_2) OR NOT FIREABLE(to3_12_7) OR NOT FIREABLE(ti1_4_8_12) OR NOT FIREABLE(ti2_5_14_6) OR NOT FIREABLE(ti2_5_12_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 8468 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 10 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(ti3_6_4_8) OR NOT FIREABLE(ti4_5_15_4))))
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 8468 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ti6_1_12_5) AND (NOT FIREABLE(ti6_2_6_4) OR NOT FIREABLE(ti1_2_9_1)) AND (FIREABLE(ti5_1_2_5) OR FIREABLE(ti4_5_4_10)))))
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 8468 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 40 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-4.sara
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(ti4_2_9_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 8468 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-5.sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ti3_1_11_1) OR NOT FIREABLE(ti5_2_15_4))))
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 8468 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-6.sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(to4_12_4) OR NOT FIREABLE(to1_11_1) OR (NOT FIREABLE(to2_1_7) AND NOT FIREABLE(ti3_4_5_3))) AND FIREABLE(ti5_2_5_11))))
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 8468 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 28 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ti4_6_3_10) OR NOT FIREABLE(ti1_4_9_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 8468 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ti4_3_10_6) AND FIREABLE(ti6_2_7_9) AND ((FIREABLE(to5_1_3) AND FIREABLE(ti1_4_10_4)) OR NOT FIREABLE(ti4_1_12_9)) AND (FIREABLE(ti2_4_4_8) OR FIREABLE(ti3_6_12_7) OR FIREABLE(ti3_1_2_4)))))
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 8468 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 72 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-9.sara
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ti6_2_13_7) OR NOT FIREABLE(ti5_1_9_12) OR NOT FIREABLE(ti3_6_6_11) OR NOT FIREABLE(to4_5_10))))
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 8468 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 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-10.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ti2_1_4_8) OR (NOT FIREABLE(to5_4_1) AND NOT FIREABLE(ti4_5_4_1)) OR NOT FIREABLE(ti4_5_12_6) OR NOT FIREABLE(ti6_1_10_10) OR FIREABLE(ti6_3_12_11))))
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 8468 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 36 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-11.sara
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(ti4_3_7_8) OR NOT FIREABLE(ti5_3_5_1) OR NOT FIREABLE(t1_1_3) OR (FIREABLE(to5_10_2) AND (NOT FIREABLE(ti3_2_4_9) OR NOT FIREABLE(ti2_1_5_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 8468 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 24 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-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 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ti4_6_7_14) AND (FIREABLE(ti1_4_9_14) OR FIREABLE(ti4_1_13_4) OR NOT FIREABLE(ti3_5_8_13)) AND FIREABLE(ti3_5_4_8))))
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 8468 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 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(ti2_3_7_9) OR NOT FIREABLE(to5_9_4) OR (NOT FIREABLE(to3_5_6) AND NOT FIREABLE(ti3_1_14_4))) AND ((FIREABLE(ti5_4_5_11) AND FIREABLE(ti4_6_10_2)) OR (FIREABLE(ti4_1_12_4) AND FIREABLE(to2_12_1)) OR FIREABLE(ti5_2_9_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 8468 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 106 literals and 21 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HexagonalGrid-PT-816-ReachabilityFireability-14.sara
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(ti4_1_13_6) AND FIREABLE(ti5_6_11_10)) OR NOT FIREABLE(ti3_2_11_12) OR (NOT FIREABLE(ti3_2_10_4) AND (FIREABLE(ti5_3_10_2) OR FIREABLE(ti3_2_10_13))) OR NOT FIREABLE(ti4_2_10_3) OR NOT FIREABLE(to6_3_2) OR NOT FIREABLE(ti4_6_12_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 8468 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 220 literals and 20 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: no yes no no yes yes no yes no yes no no no yes yes no
lola: ========================================
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-816-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496505391296

--------------------
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="HexagonalGrid-PT-816"
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/HexagonalGrid-PT-816.tgz
mv HexagonalGrid-PT-816 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 HexagonalGrid-PT-816, 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 r188-blw3-149581034600243"
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 ;