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 SquareGrid-PT-100510, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008300153
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494934805736


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ SquareGrid-PT-100510 @ 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: 3020/65536 symbol table entries, 416 collisions
lola: preprocessing...
lola: finding significant places
lola: 1380 places, 1640 transitions, 839 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2180 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-100510-ReachabilityFireability.task
lola: E (F (((FIREABLE(tf_r_7) AND NOT FIREABLE(t4o_6_2)) OR FIREABLE(t2i1_4_10)))) : E (F ((((FIREABLE(t2i1_3_2) AND FIREABLE(t1i4_8_10)) OR FIREABLE(t2i3_5_8)) AND (FIREABLE(t4i2_10_8) OR FIREABLE(t2i3_9_1)) AND FIREABLE(t3i4_5_6)))) : E (F ((FIREABLE(t4i3_5_2) AND FIREABLE(t4o_8_1) AND FIREABLE(t2o_3_7) AND ((FIREABLE(t3i4_9_2) AND FIREABLE(t3i1_2_1)) OR (FIREABLE(tf_d_6) AND FIREABLE(t3i2_4_7))) AND FIREABLE(t3i1_3_1)))) : E (F ((FIREABLE(tf_r_8) AND (FIREABLE(t4i3_1_8) OR FIREABLE(t1i3_9_6) OR (FIREABLE(t4i3_7_1) AND FIREABLE(t3i4_10_6)) OR FIREABLE(t4i1_6_4))))) : E (F ((FIREABLE(t3i4_5_5) AND FIREABLE(t1i4_2_6) AND NOT FIREABLE(t3i2_2_10)))) : E (F ((FIREABLE(t3i1_4_5) AND FIREABLE(t4i2_1_10) AND FIREABLE(t1i4_4_3) AND NOT FIREABLE(t1o_7_9) AND NOT FIREABLE(tf_r_6) AND NOT FIREABLE(tf_l_5) AND (NOT FIREABLE(t3i4_1_4) OR NOT FIREABLE(t2i4_2_1))))) : A (G (NOT FIREABLE(t4i3_9_1))) : E (F ((FIREABLE(t4i3_4_8) AND FIREABLE(t3i2_9_10)))) : A (G ((NOT FIREABLE(t1i2_8_4) OR NOT FIREABLE(t2i4_8_2) OR NOT FIREABLE(t3i1_10_2)))) : A (G ((FIREABLE(t1o_1_9) OR FIREABLE(t2o_10_4)))) : E (F ((FIREABLE(t2i3_10_4) AND FIREABLE(tf_l_4) AND NOT FIREABLE(t2i3_6_5)))) : A (G ((NOT FIREABLE(tf_r_2) OR NOT FIREABLE(t4i1_8_2)))) : E (F (((FIREABLE(t3i4_7_3) AND FIREABLE(t4i1_6_4) AND (FIREABLE(t4i2_3_1) OR FIREABLE(t3i2_10_3)) AND FIREABLE(t2o_6_9)) OR (NOT FIREABLE(t2i1_4_6) AND (FIREABLE(t1i4_1_9) OR FIREABLE(t3i1_7_9)) AND FIREABLE(t3i2_1_10))))) : A (G ((NOT FIREABLE(t4o_9_6) OR (FIREABLE(t1o_8_2) AND FIREABLE(t3o_1_4)) OR (NOT FIREABLE(t1i3_5_3) AND NOT FIREABLE(tf_d_3)) OR NOT FIREABLE(t3i2_8_8)))) : E (F (((NOT FIREABLE(t4i1_3_2) OR NOT FIREABLE(t2i3_4_6)) AND ((FIREABLE(t4i1_9_2) AND FIREABLE(t2i1_5_1)) OR NOT FIREABLE(t2i4_6_7)) AND FIREABLE(t2i1_5_10)))) : A (G ((FIREABLE(t1o_5_9) OR FIREABLE(t2i3_3_5) OR NOT FIREABLE(tf_u_1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(tf_r_7) AND NOT FIREABLE(t4o_6_2)) OR FIREABLE(t2i1_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 3356 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 3 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-100510-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(t2i1_3_2) AND FIREABLE(t1i4_8_10)) OR FIREABLE(t2i3_5_8)) AND (FIREABLE(t4i2_10_8) OR FIREABLE(t2i3_9_1)) AND FIREABLE(t3i4_5_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 3356 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 4 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-100510-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: E (F ((FIREABLE(t4i3_5_2) AND FIREABLE(t4o_8_1) AND FIREABLE(t2o_3_7) AND ((FIREABLE(t3i4_9_2) AND FIREABLE(t3i1_2_1)) OR (FIREABLE(tf_d_6) AND FIREABLE(t3i2_4_7))) AND FIREABLE(t3i1_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 3356 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 2 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-100510-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tf_r_8) AND (FIREABLE(t4i3_1_8) OR FIREABLE(t1i3_9_6) OR (FIREABLE(t4i3_7_1) AND FIREABLE(t3i4_10_6)) OR FIREABLE(t4i1_6_4)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: lola: lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
========================================state equation: calling and running sara

lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 18 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3i4_5_5) AND FIREABLE(t1i4_2_6) AND NOT FIREABLE(t3i2_2_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file SquareGrid-PT-100510-ReachabilityFireability-2.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3356 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 2 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 SquareGrid-PT-100510-ReachabilityFireability-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3i1_4_5) AND FIREABLE(t4i2_1_10) AND FIREABLE(t1i4_4_3) AND NOT FIREABLE(t1o_7_9) AND NOT FIREABLE(tf_r_6) AND NOT FIREABLE(tf_l_5) AND (NOT FIREABLE(t3i4_1_4) OR NOT FIREABLE(t2i4_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 3356 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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t4i3_9_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 3356 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4i3_4_8) AND FIREABLE(t3i2_9_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 3356 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to SquareGrid-PT-100510-ReachabilityFireability-7.sara
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1i2_8_4) OR NOT FIREABLE(t2i4_8_2) OR NOT FIREABLE(t3i1_10_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 3356 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1o_1_9) OR FIREABLE(t2o_10_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 3356 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 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2i3_10_4) AND FIREABLE(tf_l_4) AND NOT FIREABLE(t2i3_6_5))))
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 3356 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 2 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 SquareGrid-PT-100510-ReachabilityFireability-10.sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tf_r_2) OR NOT FIREABLE(t4i1_8_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 3356 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 SquareGrid-PT-100510-ReachabilityFireability-11.sara
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t3i4_7_3) AND FIREABLE(t4i1_6_4) AND (FIREABLE(t4i2_3_1) OR FIREABLE(t3i2_10_3)) AND FIREABLE(t2o_6_9)) OR (NOT FIREABLE(t2i1_4_6) AND (FIREABLE(t1i4_1_9) OR FIREABLE(t3i1_7_9)) AND FIREABLE(t3i2_1_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 3356 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 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t4o_9_6) OR (FIREABLE(t1o_8_2) AND FIREABLE(t3o_1_4)) OR (NOT FIREABLE(t1i3_5_3) AND NOT FIREABLE(tf_d_3)) OR NOT FIREABLE(t3i2_8_8))))
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 3356 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 56 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t4i1_3_2) OR NOT FIREABLE(t2i3_4_6)) AND ((FIREABLE(t4i1_9_2) AND FIREABLE(t2i1_5_1)) OR NOT FIREABLE(t2i4_6_7)) AND FIREABLE(t2i1_5_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 3356 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 60 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1o_5_9) OR FIREABLE(t2i3_3_5) OR NOT FIREABLE(tf_u_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 3356 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 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no yes no no yes no yes no yes no
FORMULA SquareGrid-PT-100510-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-100510-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494934806100

--------------------
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="SquareGrid-PT-100510"
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/SquareGrid-PT-100510.tgz
mv SquareGrid-PT-100510 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 SquareGrid-PT-100510, 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 r078-ebro-149441008300153"
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 ;