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 GlobalResAllocation-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050kn-smll-146358762800196
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463615571151

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ GlobalResAllocation-PT-03
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-03-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: 4824/65536 symbol table entries, 2874 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 4791 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 243 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: read: AG (((!(pr_in_2 + pr_in_1 + pr_in_3 <= pr_in_2 + pr_in_1 + pr_in_3) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 <= pr_released_2 + pr_released_3 + pr_released_1 OR 3 <= pr_in_2 + pr_in_1 + pr_in_3)) OR ((2 <= pr_released_2 + pr_released_3 + pr_released_1 OR pr_released_2 + pr_released_3 + pr_released_1 <= pr_released_2 + pr_released_3 + pr_released_1) AND ... (shortened)
lola: formula length: 8922
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (in_critical_s_3_6 + in_critical_s_3_5 + in_critical_s_3_4 + in_critical_s_3_3 + in_critical_s_3_2 + in_critical_s_3_1 + in_critical_s_2_6 + in_critical_s_1_6 + in_critical_s_2_1 + in_critical_s_2_2 + in_critical_s_2_3 + in_critical_s_2_4 + in_critical_s_1_5 + in_critical_s_1_4 + in_critical_s_1_3 + in_critical_s_1_2 + in_critical_s_1_1 + in_critical_s_2_5 + -pr_in_3 + -pr_in_2 + -pr_in_1 <= 0)... (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 84 bytes per marking, with 0 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 invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Resources_6 + Processes_3 + Processes_2 + Processes_1 + -Resources_5 + -Resources_4 + -Resources_3 + -Resources_2 + -Resources_1 > 0 OR (Resources_6 + -Processes_3 + -Processes_2 + -Processes_1 + Resources_5 + Resources_4 + Resources_3 + Resources_2 + Resources_1 <= 0 AND -pr_released_1 + -pr_released_2 + -pr_released_3 <= -3)) AND (in_critical_s_3_6 + in_critical_s_3_5 + in_critical_s_3_4 ... (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 84 bytes per marking, with 0 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 7 literals
lola: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Resources_6 + Resources_5 + Resources_4 + Resources_3 + Resources_2 + Resources_1 + -pr_in_3 + -pr_in_2 + -pr_in_1 <= 0 AND (-pr_released_1 + -pr_released_2 + -pr_released_3 <= -2 AND -Processes_3 + -Processes_2 + -Processes_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 84 bytes per marking, with 0 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: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((in_critical_s_3_6 + in_critical_s_3_5 + in_critical_s_3_4 + in_critical_s_3_3 + in_critical_s_3_2 + in_critical_s_3_1 + in_critical_s_2_6 + in_critical_s_1_6 + -pr_released_1 + -pr_released_2 + -pr_released_3 + in_critical_s_2_1 + in_critical_s_2_2 + in_critical_s_2_3 + in_critical_s_2_4 + in_critical_s_1_5 + in_critical_s_1_4 + in_critical_s_1_3 + in_critical_s_1_2 + in_critical_s_1_1 + in_c... (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 84 bytes per marking, with 0 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: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Processes_3 + -Processes_2 + -Processes_1 > -1 OR (-in_critical_s_3_6 + -in_critical_s_3_5 + -in_critical_s_3_4 + -in_critical_s_3_3 + -in_critical_s_3_2 + -in_critical_s_3_1 + -in_critical_s_2_6 + -in_critical_s_1_6 + -in_critical_s_2_1 + -in_critical_s_2_2 + -in_critical_s_2_3 + -in_critical_s_2_4 + -in_critical_s_1_5 + -in_critical_s_1_4 + -in_critical_s_1_3 + -in_critical_s_1_2 + -in_cri... (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 84 bytes per marking, with 0 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: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-9.sara.
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-pr_in_3 + -pr_in_2 + -pr_in_1 <= -3 OR Processes_3 + Processes_2 + Processes_1 + -pr_in_3 + -pr_in_2 + -pr_in_1 <= 0) AND -pr_released_1 + -pr_released_2 + -pr_released_3 <= -2) OR -Processes_3 + -Processes_2 + -Processes_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 84 bytes per marking, with 0 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 GlobalResAllocation-COL-03-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-pr_released_1 + -pr_released_2 + -pr_released_3 + Processes_3 + Processes_2 + Processes_1 > 0 OR (in_critical_s_3_6 + in_critical_s_3_5 + in_critical_s_3_4 + in_critical_s_3_3 + in_critical_s_3_2 + in_critical_s_3_1 + in_critical_s_2_6 + in_critical_s_1_6 + in_critical_s_2_1 + in_critical_s_2_2 + in_critical_s_2_3 + in_critical_s_2_4 + in_critical_s_1_5 + in_critical_s_1_4 + in_critical_s_1_... (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 84 bytes per marking, with 0 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: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1176 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((pr_released_1 + pr_released_2 + pr_released_3 + -pr_in_3 + -pr_in_2 + -pr_in_1 > 0 AND (-pr_released_1 + -pr_released_2 + -pr_released_3 + Processes_3 + Processes_2 + Processes_1 <= 0 AND (-in_critical_s_3_6 + -in_critical_s_3_5 + -in_critical_s_3_4 + -in_critical_s_3_3 + -in_critical_s_3_2 + -in_critical_s_3_1 + -in_critical_s_2_6 + Resources_6 + -in_critical_s_1_6 + -in_critical_s_2_1 + -in... (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 84 bytes per marking, with 0 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: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Resources_6 + -Resources_5 + -Resources_4 + -Resources_3 + -Resources_2 + -Resources_1 <= -3 OR (-in_critical_s_3_6 + -in_critical_s_3_5 + -in_critical_s_3_4 + -in_critical_s_3_3 + -in_critical_s_3_2 + -in_critical_s_3_1 + -in_critical_s_2_6 + -in_critical_s_1_6 + -in_critical_s_2_1 + -in_critical_s_2_2 + -in_critical_s_2_3 + -in_critical_s_2_4 + -in_critical_s_1_5 + -in_critical_s_1_4 + -in... (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 84 bytes per marking, with 0 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 invariant.
lola: write sara problem file to GlobalResAllocation-COL-03-ReachabilityCardinality-14.sara
lola: subprocess 15 will run for 3526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-03-ReachabilityCardinality.task
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-ReachabilityCardinality-14.sara.
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: RESULT
lola: summary: yes yes yes no no no yes no yes yes yes no yes no yes yes
lola: ========================================

BK_STOP 1463615585839

--------------------
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="GlobalResAllocation-PT-03"
export BK_EXAMINATION="ReachabilityCardinality"
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/GlobalResAllocation-PT-03.tgz
mv GlobalResAllocation-PT-03 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 GlobalResAllocation-PT-03, 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 r050kn-smll-146358762800196"
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 ;