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-2979
Executing tool lola
Input is Philosophers-PT-000005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088400322
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463703547307

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Philosophers-PT-000005
FORMULA Philosophers-COL-000005-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000005-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000005-ReachabilityCardinality.task
lola: read: EF (!(((3 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 AND 3 <= Eat_1 + Eat_3 + Eat_2 + Eat_5 + Eat_4) AND !(2 <= Catch2_2 + Catch2_1 + Catch2_4 + Catch2_3 + Catch2_5)))) : EF (Think_1 + Think_2 + Think_3 + Think_4 + Think_5 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5) : EF ((!((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_5 + Catch1_4 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 AND Fork_1 + Fork_... (shortened)
lola: formula length: 4408
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 > -3 OR (-Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 > -3 OR -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 > 0 OR -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 > 0) AND -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 > -3 AND -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 > -1) OR -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: SUBRESULT
lola: write sara problem file to Philosophers-COL-000005-ReachabilityCardinality-3.sara
lola: result: yes
lola: The predicate is reachable.
lola: lola: ========================================calling and running sara

lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 <= 0 AND (-Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 <= -3 AND -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -3)) OR Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 > -1 AND (-Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 <= 0 AND -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 <= 0)) OR (-Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 <= -3 AND (-Eat_5 + -Eat_4 + -Eat_3 +... (shortened)
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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 <= -2 OR -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 <= -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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
sara: try reading problem file Philosophers-COL-000005-ReachabilityCardinality-3.sara.
lola: Transformation into DNF: expect 2 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -3)
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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 + Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 > 0 OR (Catch1_5 + Catch1_4 + Catch1_3 + Catch1_2 + Catch1_1 + -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 > 0 OR (-Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 > -2 AND (-Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -2 AND Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + -Catch2... (shortened)
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 4 bytes per marking, with 17 unused bits
sara: lola: place or transition ordering is non-deterministic
using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 > 0 AND (Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 <= 0 OR -Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================

lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + Catch2_5 + Catch2_4 + Catch2_3 + Catch2_2 + Catch2_1 <= 0 OR (-Fork_5 + -Fork_4 + -Fork_3 + -Fork_2 + -Fork_1 <= -1 AND -Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_1 <= -2)) AND -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Fork_5 + Fork_4 + Fork_3 + Fork_2 + Fork_1 > 0 AND -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + Catch2_5 + Catch2_4 + Catch2_3 + Catch2_2 + Catch2_1 <= 0) OR (-Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + Catch2_5 + Catch2_4 + Catch2_3 + Catch2_2 + Catch2_1 <= 0 OR (Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + -Eat_5 + -Eat... (shortened)
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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: write sara problem file to Philosophers-COL-000005-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Catch2_5 + -Catch2_4 + -Catch2_3 + -Catch2_2 + -Catch2_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 4 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes yes no no no yes yes yes no yes yes no yes yes

BK_STOP 1463703547599

--------------------
content from 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="Philosophers-PT-000005"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is Philosophers-PT-000005, 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 r086kn-ebro-146369088400322"
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 ;