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 ResAllocation-PT-R003C015, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140600315
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463788427903

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ ResAllocation-PT-R003C015
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-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: 150/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 90 places, 60 transitions, 45 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 105 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: read: EF (((!((FIREABLE(t_12_0) OR FIREABLE(t_10_2))) AND ((FIREABLE(t_13_0) AND FIREABLE(t_1_1)) OR (FIREABLE(t_8_1) OR FIREABLE(t_0_1)))) AND !(((FIREABLE(t_2_0) OR FIREABLE(t_2_1)) OR (FIREABLE(t_7_1) OR FIREABLE(t_3_2)))))) : EF (!((!((FIREABLE(t_10_2) AND FIREABLE(t_3_2))) OR !((FIREABLE(t_3_3) OR FIREABLE(t_12_2)))))) : AG (((!(!(FIREABLE(t_5_3))) OR FIREABLE(t_5_2)) OR ((FIREABLE(t_12_1) OR !(FIR... (shortened)
lola: formula length: 2312
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 ((! FIREABLE(t_12_0) AND (! FIREABLE(t_10_2) AND (((FIREABLE(t_13_0) AND FIREABLE(t_1_1)) OR (FIREABLE(t_8_1) OR FIREABLE(t_0_1))) AND (! FIREABLE(t_2_0) AND (! FIREABLE(t_2_1) AND (! FIREABLE(t_7_1) AND ! FIREABLE(t_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 8 bytes per marking, with 19 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 3252 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 ((FIREABLE(t_10_2) AND (FIREABLE(t_3_2) AND (FIREABLE(t_3_3) OR FIREABLE(t_12_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 8 bytes per marking, with 19 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 17 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: AG ((FIREABLE(t_5_3) OR (FIREABLE(t_5_2) OR ((FIREABLE(t_12_1) OR ! FIREABLE(t_13_1)) AND ! FIREABLE(t_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 8 bytes per marking, with 19 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 126 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(t_7_2) AND ! FIREABLE(t_3_2)) OR (! FIREABLE(t_2_1) OR ! FIREABLE(t_10_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 8 bytes per marking, with 19 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 14 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t_4_1) AND (FIREABLE(t_10_2) AND (FIREABLE(t_7_2) AND ! FIREABLE(t_13_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 8 bytes per marking, with 19 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 30 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t_8_0) OR (! FIREABLE(t_4_3) OR ((FIREABLE(t_0_2) AND FIREABLE(t_6_3)) OR ((FIREABLE(t_0_2) AND FIREABLE(t_12_3)) OR (FIREABLE(t_11_2) OR (FIREABLE(t_2_0) OR (FIREABLE(t_10_2) OR FIREABLE(t_5_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 8 bytes per marking, with 19 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 702 literals
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: EF ((FIREABLE(t_12_2) AND ((FIREABLE(t_13_0) OR FIREABLE(t_14_3)) AND ((FIREABLE(t_14_2) OR (FIREABLE(t_3_1) OR ! FIREABLE(t_0_3))) AND ! FIREABLE(t_14_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 8 bytes per marking, with 19 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 88 literals
lola: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-6.sara
lola: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 82)
sara: warning: empty constraint in comparison
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t_2_2) OR FIREABLE(t_1_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 8 bytes per marking, with 19 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 8 literals
lola: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(t_8_0) AND (FIREABLE(t_3_3) AND (FIREABLE(t_4_0) OR FIREABLE(t_4_3)))) OR FIREABLE(t_6_3)) AND (FIREABLE(t_3_2) AND ((FIREABLE(t_14_3) AND FIREABLE(t_10_3)) OR (FIREABLE(t_5_3) AND FIREABLE(t_2_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 8 bytes per marking, with 19 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 57 literals
lola: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t_11_0) AND (! FIREABLE(t_4_0) AND (! FIREABLE(t_8_3) AND (FIREABLE(t_9_3) OR (! FIREABLE(t_0_2) OR FIREABLE(t_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 8 bytes per marking, with 19 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 31 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t_11_1) AND (! FIREABLE(t_7_2) AND (FIREABLE(t_10_1) AND (FIREABLE(t_4_0) AND (FIREABLE(t_4_0) AND FIREABLE(t_4_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 8 bytes per marking, with 19 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 42 literals
lola: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t_6_2) OR ((FIREABLE(t_6_2) AND FIREABLE(t_9_2)) OR (FIREABLE(t_1_0) OR (! FIREABLE(t_11_3) OR FIREABLE(t_11_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 8 bytes per marking, with 19 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 81 literals
lola: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t_11_3) OR ((! FIREABLE(t_13_3) AND ! FIREABLE(t_6_0)) OR (! FIREABLE(t_10_3) OR (! FIREABLE(t_2_2) OR FIREABLE(t_3_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 8 bytes per marking, with 19 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 92 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t_4_0) AND (FIREABLE(t_0_1) AND (! FIREABLE(t_2_2) AND (FIREABLE(t_7_2) AND (FIREABLE(t_4_3) OR (FIREABLE(t_14_3) OR FIREABLE(t_2_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 8 bytes per marking, with 19 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 71 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(t_6_0) OR FIREABLE(t_1_3)) AND (! FIREABLE(t_5_2) AND (FIREABLE(t_1_0) AND (FIREABLE(t_11_1) AND (! FIREABLE(t_0_0) AND FIREABLE(t_14_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 8 bytes per marking, with 19 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: yes
lola: The predicate is reachable.
lola: Transformation into DNF: expect 66 literals
lola: ========================================
lola: subprocess 15 will run for 3533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t_8_3) AND (! FIREABLE(t_2_1) AND (! FIREABLE(t_8_0) AND (FIREABLE(t_3_1) OR (! FIREABLE(t_5_1) AND ! FIREABLE(t_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 8 bytes per marking, with 19 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: yes
lola: The predicate is reachable.
lola: lola: RESULT
lola: Transformation into DNF: expect 146 literals
summary: yes yes no no yes no yes no yes yes no yes no yes yes yes
lola: ========================================

BK_STOP 1463788435009

--------------------
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="ResAllocation-PT-R003C015"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ResAllocation-PT-R003C015, 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 r098kn-smll-146369140600315"
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 ;