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_HypercubeGrid-PT-C4K3P3B12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649700016
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496347011124


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


checking for too many tokens
===========================================================================================
S_HypercubeGrid-PT-C4K3P3B12: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_HypercubeGrid-PT-C4K3P3B12 @ 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: 7857/65536 symbol table entries, 1827 collisions
lola: preprocessing...
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6345 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality.task
lola: E (F ((((pb_d1_n1_3_3_2_2 <= pil_d1_n1_4_1_3_1) AND (pi_d4_n1_1_3_2_2 <= pb_d1_n2_1_1_3_1) AND (po_d1_n1_4_2_2_2 + 1 <= pb_d3_n2_1_1_3_1)) OR ((pil_d1_n1_1_2_2_3 + 1 <= po_d1_n1_3_3_3_1) AND (po_d2_n1_3_2_1_2 <= 1))))) : E (F (((2 <= pol_d4_n1_3_2_1_3) OR (3 <= pol_d4_n1_3_2_3_1)))) : E (F ((pb_d3_n1_1_2_3_2 <= pil_d2_n1_1_1_3_1))) : A (G ((po_d4_n1_3_3_3_4 <= po_d2_n1_1_4_2_3))) : E (F (((3 <= pi_d4_n1_3_3_1_4) AND (pil_d3_n1_3_3_2_3 <= pil_d3_n1_1_3_2_1)))) : E (F (((pb_d1_n1_1_2_2_1 <= 2) AND (pi_d4_n1_2_2_2_2 <= 0) AND (pb_d4_n2_3_3_2_3 <= pi_d4_n1_3_2_3_4)))) : E (F ((((pil_d3_n1_3_2_4_2 <= 0) OR (pol_d1_n1_2_2_2_3 + 1 <= pil_d1_n1_1_2_2_3)) AND (pil_d2_n1_1_1_1_1 <= pi_d4_n1_2_3_3_1)))) : E (F (((2 <= pil_d2_n1_2_2_2_1) AND (po_d3_n1_1_1_4_3 <= po_d1_n1_3_2_1_2) AND ((1 <= pi_d4_n1_3_2_3_3) OR (1 <= pb_d4_n2_1_1_2_2)) AND (pb_d3_n1_2_1_2_3 <= pi_d3_n1_2_3_3_1) AND (po_d4_n1_1_3_3_4 <= pi_d3_n1_2_2_4_2) AND (pi_d4_n1_2_1_3_2 <= pol_d3_n1_3_1_2_1)))) : A (G (((pol_d2_n1_2_3_2_2 <= pb_d3_n2_2_3_1_3) OR (pil_d2_n1_2_1_2_1 <= pb_d3_n2_3_1_1_1) OR (pi_d4_n1_2_2_3_3 <= pb_d1_n1_2_1_1_3) OR ((pil_d2_n1_3_1_3_2 + 1 <= pol_d2_n1_2_1_2_1) AND (pol_d4_n1_1_3_3_3 + 1 <= pil_d2_n1_3_3_3_3))))) : A (G ((po_d1_n1_3_1_2_1 <= 1))) : A (G (((3 <= pi_d2_n1_1_4_3_1) OR (po_d3_n1_3_2_2_3 <= 1) OR ((pil_d1_n1_3_3_2_3 <= po_d2_n1_3_2_3_2) AND (pi_d3_n1_3_3_2_3 <= 1))))) : E (F (((pol_d3_n1_1_2_3_2 + 1 <= pil_d3_n1_2_3_3_2) AND (pil_d1_n1_3_1_3_1 + 1 <= pil_d4_n1_1_2_1_2)))) : A (G (((po_d1_n1_4_1_2_2 + 1 <= pol_d1_n1_2_1_1_2) OR (pil_d1_n1_3_2_1_3 <= 1) OR (po_d3_n1_1_3_1_1 <= pb_d2_n1_1_1_2_3) OR (pol_d4_n1_1_2_2_4 <= pbl_3_3_2_1) OR (1 <= pb_d1_n1_1_2_1_1) OR (pol_d2_n1_2_3_2_2 <= pi_d3_n1_1_1_4_1)))) : E (F (((3 <= pi_d3_n1_2_3_2_1) AND (1 <= pbl_1_1_3_2)))) : E (F (((2 <= po_d3_n1_2_3_1_3) OR (pb_d3_n2_3_3_3_2 <= pi_d4_n1_3_3_3_1)))) : E (F ((pb_d2_n1_2_1_3_1 + 1 <= pil_d4_n1_2_2_3_4)))
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 ((((pb_d1_n1_3_3_2_2 <= pil_d1_n1_4_1_3_1) AND (pi_d4_n1_1_3_2_2 <= pb_d1_n2_1_1_3_1) AND (po_d1_n1_4_2_2_2 + 1 <= pb_d3_n2_1_1_3_1)) OR ((pil_d1_n1_1_2_2_3 + 1 <= po_d1_n1_3_3_3_1) AND (po_d2_n1_3_2_1_2 <= 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 6044 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 HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality.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 (((2 <= pol_d4_n1_3_2_1_3) OR (3 <= pol_d4_n1_3_2_3_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 6044 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 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 105733 markings, 115733 edges, 21147 markings/sec, 0 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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d3_n1_1_2_3_2 <= pil_d2_n1_1_1_3_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 6044 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 HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((po_d4_n1_3_3_3_4 <= po_d2_n1_1_4_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-2.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pi_d4_n1_3_3_1_4) AND (pil_d3_n1_3_3_2_3 <= pil_d3_n1_1_3_2_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 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara is running 0 secs || 173496 markings, 182542 edges, 34699 markings/sec, 0 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 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pb_d1_n1_1_2_2_1 <= 2) AND (pi_d4_n1_2_2_2_2 <= 0) AND (pb_d4_n2_3_3_2_3 <= pi_d4_n1_3_2_3_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 6044 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 HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pil_d3_n1_3_2_4_2 <= 0) OR (pol_d1_n1_2_2_2_3 + 1 <= pil_d1_n1_1_2_2_3)) AND (pil_d2_n1_1_1_1_1 <= pi_d4_n1_2_3_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-5.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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 HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pil_d2_n1_2_2_2_1) AND (po_d3_n1_1_1_4_3 <= po_d1_n1_3_2_1_2) AND ((1 <= pi_d4_n1_3_2_3_3) OR (1 <= pb_d4_n2_1_1_2_2)) AND (pb_d3_n1_2_1_2_3 <= pi_d3_n1_2_3_3_1) AND (po_d4_n1_1_3_3_4 <= pi_d3_n1_2_2_4_2) AND (pi_d4_n1_2_1_3_2 <= pol_d3_n1_3_1_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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)
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-6.sara.
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 HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic



lola: sara is running 0 secs || 194645 markings, 199488 edges, 38929 markings/sec, 0 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 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d2_n1_2_3_2_2 <= pb_d3_n2_2_3_1_3) OR (pil_d2_n1_2_1_2_1 <= pb_d3_n2_3_1_1_1) OR (pi_d4_n1_2_2_3_3 <= pb_d1_n1_2_1_1_3) OR ((pil_d2_n1_3_1_3_2 + 1 <= pol_d2_n1_2_1_2_1) AND (pol_d4_n1_1_3_3_3 + 1 <= pil_d2_n1_3_3_3_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 6044 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((po_d1_n1_3_1_2_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 6044 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 HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 189813 markings, 193418 edges, 37963 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= pi_d2_n1_1_4_3_1) OR (po_d3_n1_3_2_2_3 <= 1) OR ((pil_d1_n1_3_3_2_3 <= po_d2_n1_3_2_3_2) AND (pi_d3_n1_3_3_2_3 <= 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 6044 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 HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 333542 markings, 335347 edges, 66708 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pol_d3_n1_1_2_3_2 + 1 <= pil_d3_n1_2_3_3_2) AND (pil_d1_n1_3_1_3_1 + 1 <= pil_d4_n1_1_2_1_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 6044 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: ========================================
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d1_n1_4_1_2_2 + 1 <= pol_d1_n1_2_1_1_2) OR (pil_d1_n1_3_2_1_3 <= 1) OR (po_d3_n1_1_3_1_1 <= pb_d2_n1_1_1_2_3) OR (pol_d4_n1_1_2_2_4 <= pbl_3_3_2_1) OR (1 <= pb_d1_n1_1_2_1_1) OR (pol_d2_n1_2_3_2_2 <= pi_d3_n1_1_1_4_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 6044 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 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 202481 markings, 209161 edges, 40496 markings/sec, 0 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 1169 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pi_d3_n1_2_3_2_1) AND (1 <= pbl_1_1_3_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 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 401504 markings, 435202 edges, 80301 markings/sec, 0 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 1751 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= po_d3_n1_2_3_1_3) OR (pb_d3_n2_3_3_3_2 <= pi_d4_n1_3_3_3_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 6044 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 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d2_n1_2_1_3_1 + 1 <= pil_d4_n1_2_2_3_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 6044 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 HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes no no yes yes yes yes no yes yes
lola: ========================================
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496347049170

--------------------
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_HypercubeGrid-PT-C4K3P3B12"
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_HypercubeGrid-PT-C4K3P3B12.tgz
mv S_HypercubeGrid-PT-C4K3P3B12 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_HypercubeGrid-PT-C4K3P3B12, 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 r118-blw7-149441649700016"
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 ;