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 Eratosthenes-PT-500, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050kn-smll-146358762600054
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463597110010

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Eratosthenes-PT-500
FORMULA Eratosthenes-PT-500-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-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: 2690/65536 symbol table entries, 58 collisions
lola: preprocessing...
lola: finding significant places
lola: 499 places, 2191 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2438 transition conflict sets
lola: TASK
lola: reading formula from Eratosthenes-PT-500-ReachabilityFireability.task
lola: read: EF ((!(((FIREABLE(t105.15) OR FIREABLE(t198.11)) AND (FIREABLE(t352.16) OR FIREABLE(t432.144)))) AND ((FIREABLE(t480.32) AND (FIREABLE(t376.47) AND FIREABLE(t408.136))) AND !(!(FIREABLE(t420.21)))))) : EF (!((FIREABLE(t322.23) OR (FIREABLE(t357.3) AND FIREABLE(t168.24))))) : AG ((!(!(!(FIREABLE(t294.49)))) OR (((FIREABLE(t84.6) AND FIREABLE(t108.3)) OR (FIREABLE(t408.8) AND FIREABLE(t240.20))) OR ... (shortened)
lola: formula length: 2229
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(t105.15) AND ! FIREABLE(t198.11)) OR (! FIREABLE(t352.16) AND ! FIREABLE(t432.144))) AND (FIREABLE(t480.32) AND (FIREABLE(t376.47) AND (FIREABLE(t408.136) AND FIREABLE(t420.21))))))
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 52 bytes per marking, with 12 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 64 literals
lola: write sara problem file to Eratosthenes-PT-500-ReachabilityFireability.sara
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(t322.23) AND (! FIREABLE(t357.3) OR ! FIREABLE(t168.24))))
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 52 bytes per marking, with 12 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 16 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(t294.49) OR ((FIREABLE(t84.6) AND FIREABLE(t108.3)) OR ((FIREABLE(t408.8) AND FIREABLE(t240.20)) OR (FIREABLE(t396.4) OR ! FIREABLE(t434.217))))))
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 52 bytes per marking, with 12 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 164 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: EF (((! FIREABLE(t140.5) AND (! FIREABLE(t198.18) AND FIREABLE(t115.5))) OR (! FIREABLE(t216.12) AND (! FIREABLE(t216.6) AND ! FIREABLE(t456.228)))))
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 52 bytes per marking, with 12 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 38 literals
lola: write sara problem file to Eratosthenes-PT-500-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file Eratosthenes-PT-500-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t408.24) OR FIREABLE(t225.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 52 bytes per marking, with 12 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 Eratosthenes-PT-500-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file Eratosthenes-PT-500-ReachabilityFireability-4.sara.
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: EF ((! FIREABLE(t238.7) AND ! FIREABLE(t245.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 52 bytes per marking, with 12 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 Eratosthenes-PT-500-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file Eratosthenes-PT-500-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(t498.2) AND ! FIREABLE(t207.69)) OR (! FIREABLE(t400.10) OR ! FIREABLE(t232.116))) AND (! FIREABLE(t445.5) OR (! FIREABLE(t280.4) OR (! FIREABLE(t189.3) AND ! FIREABLE(t280.28))))))
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 52 bytes per marking, with 12 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 168 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t30.5) OR FIREABLE(t330.6)))
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 52 bytes per marking, with 12 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 Eratosthenes-PT-500-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file Eratosthenes-PT-500-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(t348.29) AND (FIREABLE(t255.3) AND (FIREABLE(t339.113) AND FIREABLE(t388.97)))) OR (FIREABLE(t162.3) OR (FIREABLE(t416.8) AND FIREABLE(t91.13)))))
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 52 bytes per marking, with 12 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 168 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t490.49) OR (FIREABLE(t266.7) OR ! FIREABLE(t141.47))))
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 52 bytes per marking, with 12 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 16 literals
lola: write sara problem file to Eratosthenes-PT-500-ReachabilityFireability-9.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(t332.166) OR (! FIREABLE(t441.7) OR (! FIREABLE(t386.193) OR ! FIREABLE(t168.6)))) AND (FIREABLE(t237.79) AND ! FIREABLE(t458.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 52 bytes per marking, with 12 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 64 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(t168.28) AND (FIREABLE(t238.2) AND FIREABLE(t57.3))) OR (! FIREABLE(t140.2) OR ((FIREABLE(t406.14) AND FIREABLE(t244.122)) OR ((! FIREABLE(t108.18) OR ! FIREABLE(t462.22)) AND FIREABLE(t466.233))))))
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 52 bytes per marking, with 12 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 324 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(t468.9) OR ! FIREABLE(t480.240)) AND ((! FIREABLE(t423.141) OR ! FIREABLE(t196.49)) AND (FIREABLE(t222.37) OR (! FIREABLE(t24.6) OR (FIREABLE(t300.2) AND FIREABLE(t378.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 52 bytes per marking, with 12 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 220 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 ((FIREABLE(t248.8) OR (FIREABLE(t378.3) OR FIREABLE(t158.79))))
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 52 bytes per marking, with 12 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 22 literals
lola: write sara problem file to Eratosthenes-PT-500-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file Eratosthenes-PT-500-ReachabilityFireability-13.sara.
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 ((! FIREABLE(t390.15) AND ! FIREABLE(t80.16)))
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 52 bytes per marking, with 12 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 Eratosthenes-PT-500-ReachabilityFireability-14.sara
lola: calling and running 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 ((! FIREABLE(t296.8) AND ((FIREABLE(t494.2) OR FIREABLE(t336.24)) AND (FIREABLE(t265.53) AND (FIREABLE(t252.84) AND (FIREABLE(t288.72) AND (FIREABLE(t438.6) AND ((FIREABLE(t358.179) OR FIREABLE(t280.56)) AND (! FIREABLE(t465.93) AND (FIREABLE(t423.3) AND (FIREABLE(t315.105) AND (FIREABLE(t364.14) OR FIREABLE(t340.68)))))))))))))
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 52 bytes per marking, with 12 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 442 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes no yes no yes yes no no no yes no yes no yes yes

BK_STOP 1463597110315

--------------------
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="Eratosthenes-PT-500"
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/Eratosthenes-PT-500.tgz
mv Eratosthenes-PT-500 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 Eratosthenes-PT-500, 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 r050kn-smll-146358762600054"
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 ;