About the Execution of Marcie for DotAndBoxes-COL-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5438.130 | 6314.00 | 6009.00 | 30.30 | 1 2 1 2 1 0 2 8 1 1 1 2 2 1 1 8 | normal |
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 marcie
Input is DotAndBoxes-COL-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r029kn-smll-146348015100317
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-0
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-1
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-10
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-11
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-12
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-13
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-14
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-15
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-2
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-3
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-4
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-5
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-6
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-7
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-8
FORMULA_NAME DotAndBoxes-COL-2-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1463635200462
Marcie rev. 8535M (built: crohr on 2016-04-27)
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Unfolding complete |P|=62|T|=164|A|=1616
Time for unfolding: 0m 0.795sec
Net: DotAndBoxes_COL_2
(NrP: 62 NrTr: 164 NrArc: 1616)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
init dd package: 0m 3.726sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 287 (2.9e+02) #states 11
starting MCC model checker
--------------------------
checking: place_bound(Idle_Player1,Idle_Player2)
normalized: place_bound(Idle_Player1,Idle_Player2)
-> the formula is 1
FORMULA DotAndBoxes-COL-2-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Idle_Player1,Idle_Player2)
normalized: place_bound(Idle_Player1,Idle_Player2)
-> the formula is 1
FORMULA DotAndBoxes-COL-2-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Idle_Player1,Idle_Player2)
normalized: place_bound(Idle_Player1,Idle_Player2)
-> the formula is 1
FORMULA DotAndBoxes-COL-2-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Idle_Player1,Idle_Player2)
normalized: place_bound(Idle_Player1,Idle_Player2)
-> the formula is 1
FORMULA DotAndBoxes-COL-2-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(End_Player1,End_Player2)
normalized: place_bound(End_Player1,End_Player2)
-> the formula is 0
FORMULA DotAndBoxes-COL-2-UpperBounds-13 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(IsWinner_Player1_Bool0,IsWinner_Player1_Bool1,IsWinner_Player2_Bool0,IsWinner_Player2_Bool1)
normalized: place_bound(IsWinner_Player1_Bool0,IsWinner_Player1_Bool1,IsWinner_Player2_Bool0,IsWinner_Player2_Bool1)
-> the formula is 2
FORMULA DotAndBoxes-COL-2-UpperBounds-1 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(IsWinner_Player1_Bool0,IsWinner_Player1_Bool1,IsWinner_Player2_Bool0,IsWinner_Player2_Bool1)
normalized: place_bound(IsWinner_Player1_Bool0,IsWinner_Player1_Bool1,IsWinner_Player2_Bool0,IsWinner_Player2_Bool1)
-> the formula is 2
FORMULA DotAndBoxes-COL-2-UpperBounds-6 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(FreePositions_Direction0_Position0_Position0,FreePositions_Direction0_Position0_Position1,FreePositions_Direction0_Position1_Position0,FreePositions_Direction0_Position1_Position1,FreePositions_Direction1_Position0_Position0,FreePositions_Direction1_Position0_Position1,FreePositions_Direction1_Position1_Position0,FreePositions_Direction1_Position1_Position1)
normalized: place_bound(FreePositions_Direction0_Position0_Position0,FreePositions_Direction0_Position0_Position1,FreePositions_Direction0_Position1_Position0,FreePositions_Direction0_Position1_Position1,FreePositions_Direction1_Position0_Position0,FreePositions_Direction1_Position0_Position1,FreePositions_Direction1_Position1_Position0,FreePositions_Direction1_Position1_Position1)
-> the formula is 8
FORMULA DotAndBoxes-COL-2-UpperBounds-9 8 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(OccupiedPositions_Direction0_Position0_Position0,OccupiedPositions_Direction0_Position0_Position1,OccupiedPositions_Direction0_Position1_Position0,OccupiedPositions_Direction0_Position1_Position1,OccupiedPositions_Direction1_Position0_Position0,OccupiedPositions_Direction1_Position0_Position1,OccupiedPositions_Direction1_Position1_Position0,OccupiedPositions_Direction1_Position1_Position1)
normalized: place_bound(OccupiedPositions_Direction0_Position0_Position0,OccupiedPositions_Direction0_Position0_Position1,OccupiedPositions_Direction0_Position1_Position0,OccupiedPositions_Direction0_Position1_Position1,OccupiedPositions_Direction1_Position0_Position0,OccupiedPositions_Direction1_Position0_Position1,OccupiedPositions_Direction1_Position1_Position0,OccupiedPositions_Direction1_Position1_Position1)
-> the formula is 1
FORMULA DotAndBoxes-COL-2-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(FreePositions_Direction0_Position0_Position0,FreePositions_Direction0_Position0_Position1,FreePositions_Direction0_Position1_Position0,FreePositions_Direction0_Position1_Position1,FreePositions_Direction1_Position0_Position0,FreePositions_Direction1_Position0_Position1,FreePositions_Direction1_Position1_Position0,FreePositions_Direction1_Position1_Position1)
normalized: place_bound(FreePositions_Direction0_Position0_Position0,FreePositions_Direction0_Position0_Position1,FreePositions_Direction0_Position1_Position0,FreePositions_Direction0_Position1_Position1,FreePositions_Direction1_Position0_Position0,FreePositions_Direction1_Position0_Position1,FreePositions_Direction1_Position1_Position0,FreePositions_Direction1_Position1_Position1)
-> the formula is 8
FORMULA DotAndBoxes-COL-2-UpperBounds-15 8 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Score_Player1_Count0,Score_Player1_Count1,Score_Player1_Count2,Score_Player1_Count3,Score_Player1_Count4,Score_Player2_Count0,Score_Player2_Count1,Score_Player2_Count2,Score_Player2_Count3,Score_Player2_Count4)
normalized: place_bound(Score_Player1_Count0,Score_Player1_Count1,Score_Player1_Count2,Score_Player1_Count3,Score_Player1_Count4,Score_Player2_Count0,Score_Player2_Count1,Score_Player2_Count2,Score_Player2_Count3,Score_Player2_Count4)
-> the formula is 2
FORMULA DotAndBoxes-COL-2-UpperBounds-5 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Score_Player1_Count0,Score_Player1_Count1,Score_Player1_Count2,Score_Player1_Count3,Score_Player1_Count4,Score_Player2_Count0,Score_Player2_Count1,Score_Player2_Count2,Score_Player2_Count3,Score_Player2_Count4)
normalized: place_bound(Score_Player1_Count0,Score_Player1_Count1,Score_Player1_Count2,Score_Player1_Count3,Score_Player1_Count4,Score_Player2_Count0,Score_Player2_Count1,Score_Player2_Count2,Score_Player2_Count3,Score_Player2_Count4)
-> the formula is 2
FORMULA DotAndBoxes-COL-2-UpperBounds-11 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Score_Player1_Count0,Score_Player1_Count1,Score_Player1_Count2,Score_Player1_Count3,Score_Player1_Count4,Score_Player2_Count0,Score_Player2_Count1,Score_Player2_Count2,Score_Player2_Count3,Score_Player2_Count4)
normalized: place_bound(Score_Player1_Count0,Score_Player1_Count1,Score_Player1_Count2,Score_Player1_Count3,Score_Player1_Count4,Score_Player2_Count0,Score_Player2_Count1,Score_Player2_Count2,Score_Player2_Count3,Score_Player2_Count4)
-> the formula is 2
FORMULA DotAndBoxes-COL-2-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Eval1_Player1_Direction0_Position0_Position0,Eval1_Player1_Direction0_Position0_Position1,Eval1_Player1_Direction0_Position1_Position0,Eval1_Player1_Direction1_Position0_Position0,Eval1_Player1_Direction1_Position0_Position1,Eval1_Player1_Direction1_Position1_Position0,Eval1_Player2_Direction0_Position0_Position0,Eval1_Player2_Direction0_Position0_Position1,Eval1_Player2_Direction0_Position1_Position0,Eval1_Player2_Direction1_Position0_Position0,Eval1_Player2_Direction1_Position0_Position1,Eval1_Player2_Direction1_Position1_Position0)
normalized: place_bound(Eval1_Player1_Direction0_Position0_Position0,Eval1_Player1_Direction0_Position0_Position1,Eval1_Player1_Direction0_Position1_Position0,Eval1_Player1_Direction1_Position0_Position0,Eval1_Player1_Direction1_Position0_Position1,Eval1_Player1_Direction1_Position1_Position0,Eval1_Player2_Direction0_Position0_Position0,Eval1_Player2_Direction0_Position0_Position1,Eval1_Player2_Direction0_Position1_Position0,Eval1_Player2_Direction1_Position0_Position0,Eval1_Player2_Direction1_Position0_Position1,Eval1_Player2_Direction1_Position1_Position0)
-> the formula is 1
FORMULA DotAndBoxes-COL-2-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Chosed_Player1_Direction0_Position0_Position0,Chosed_Player1_Direction0_Position0_Position1,Chosed_Player1_Direction0_Position1_Position0,Chosed_Player1_Direction0_Position1_Position1,Chosed_Player1_Direction1_Position0_Position0,Chosed_Player1_Direction1_Position0_Position1,Chosed_Player1_Direction1_Position1_Position0,Chosed_Player1_Direction1_Position1_Position1,Chosed_Player2_Direction0_Position0_Position0,Chosed_Player2_Direction0_Position0_Position1,Chosed_Player2_Direction0_Position1_Position0,Chosed_Player2_Direction0_Position1_Position1,Chosed_Player2_Direction1_Position0_Position0,Chosed_Player2_Direction1_Position0_Position1,Chosed_Player2_Direction1_Position1_Position0,Chosed_Player2_Direction1_Position1_Position1)
normalized: place_bound(Chosed_Player1_Direction0_Position0_Position0,Chosed_Player1_Direction0_Position0_Position1,Chosed_Player1_Direction0_Position1_Position0,Chosed_Player1_Direction0_Position1_Position1,Chosed_Player1_Direction1_Position0_Position0,Chosed_Player1_Direction1_Position0_Position1,Chosed_Player1_Direction1_Position1_Position0,Chosed_Player1_Direction1_Position1_Position1,Chosed_Player2_Direction0_Position0_Position0,Chosed_Player2_Direction0_Position0_Position1,Chosed_Player2_Direction0_Position1_Position0,Chosed_Player2_Direction0_Position1_Position1,Chosed_Player2_Direction1_Position0_Position0,Chosed_Player2_Direction1_Position0_Position1,Chosed_Player2_Direction1_Position1_Position0,Chosed_Player2_Direction1_Position1_Position1)
-> the formula is 1
FORMULA DotAndBoxes-COL-2-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Chosed_Player1_Direction0_Position0_Position0,Chosed_Player1_Direction0_Position0_Position1,Chosed_Player1_Direction0_Position1_Position0,Chosed_Player1_Direction0_Position1_Position1,Chosed_Player1_Direction1_Position0_Position0,Chosed_Player1_Direction1_Position0_Position1,Chosed_Player1_Direction1_Position1_Position0,Chosed_Player1_Direction1_Position1_Position1,Chosed_Player2_Direction0_Position0_Position0,Chosed_Player2_Direction0_Position0_Position1,Chosed_Player2_Direction0_Position1_Position0,Chosed_Player2_Direction0_Position1_Position1,Chosed_Player2_Direction1_Position0_Position0,Chosed_Player2_Direction1_Position0_Position1,Chosed_Player2_Direction1_Position1_Position0,Chosed_Player2_Direction1_Position1_Position1)
normalized: place_bound(Chosed_Player1_Direction0_Position0_Position0,Chosed_Player1_Direction0_Position0_Position1,Chosed_Player1_Direction0_Position1_Position0,Chosed_Player1_Direction0_Position1_Position1,Chosed_Player1_Direction1_Position0_Position0,Chosed_Player1_Direction1_Position0_Position1,Chosed_Player1_Direction1_Position1_Position0,Chosed_Player1_Direction1_Position1_Position1,Chosed_Player2_Direction0_Position0_Position0,Chosed_Player2_Direction0_Position0_Position1,Chosed_Player2_Direction0_Position1_Position0,Chosed_Player2_Direction0_Position1_Position1,Chosed_Player2_Direction1_Position0_Position0,Chosed_Player2_Direction1_Position0_Position1,Chosed_Player2_Direction1_Position1_Position0,Chosed_Player2_Direction1_Position1_Position1)
-> the formula is 1
FORMULA DotAndBoxes-COL-2-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
Total processing time: 0m 6.278sec
BK_STOP 1463635206776
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
Chosed_Player2_Direction0_Position0_Position0
Chosed_Player2_Direction0_Position0_Position1
Chosed_Player2_Direction0_Position1_Position0
Eval1_Player2_Direction1_Position0_Position1
Eval1_Player2_Direction1_Position0_Position0
Eval1_Player2_Direction0_Position1_Position0
Eval1_Player2_Direction0_Position0_Position1
Eval1_Player2_Direction0_Position0_Position0
Eval1_Player1_Direction1_Position1_Position0
Eval1_Player1_Direction1_Position0_Position1
Eval1_Player1_Direction0_Position1_Position0
Eval1_Player1_Direction0_Position0_Position1
End_Player2
End_Player1
Chosed_Player2_Direction1_Position1_Position1
Chosed_Player2_Direction1_Position1_Position0
Chosed_Player2_Direction1_Position0_Position1
Chosed_Player2_Direction1_Position0_Position0
Chosed_Player2_Direction0_Position1_Position1
Idle_Player2
Eval1_Player2_Direction1_Position1_Position0
IsWinner_Player2_Bool0
Score_Player2_Count3
Score_Player2_Count4
Score_Player2_Count1
Score_Player2_Count2
The net has transition(s) that can never fire:
Win2H_0_0_0_1_1_0
Win2V_0_0_3_1_0_1
Win2V_0_0_1_0_0_1
AWin_0
AWin_1
Win2V_0_0_0_0_0_1
Win2V_0_1_1_0_0_1
Lose2_0_0_0_1_0_1_0
Win2V_0_1_3_0_0_1
Win2V_0_0_4_0_0_1
Win2V_0_1_4_1_0_1
Win2V_0_0_3_0_0_1
Win2V_0_0_0_1_0_1
Win2V_0_1_0_0_0_1
Win2H_0_0_3_1_1_0
Win2V_1_0_4_1_0_1
Win2V_1_0_0_1_0_1
Win2V_1_1_1_1_0_1
Win2V_1_0_1_0_0_1
Lose2_0_1_0_0_1_1_0
Lose2_1_0_0_1_0_1_0
Lose2_0_1_0_0_1_1_1
Lose1_0_0_0_0_1_0_1
Lose2_0_1_1_0_1_0_0
Win2H_0_1_4_1_1_0
Win2V_1_0_1_1_0_1
Win2H_0_0_1_1_1_0
Win2H_0_1_0_1_1_0
Win2V_1_0_2_0_0_1
Win2H_0_0_4_0_1_0
Win2H_0_0_2_0_1_0
Win2H_0_1_3_0_1_0
Win2V_1_0_2_1_0_1
Win2H_0_0_2_1_1_0
Win2H_0_1_2_1_1_0
Win2V_1_0_3_0_0_1
Win2H_0_0_3_0_1_0
Win2V_1_0_3_1_0_1
Win2H_0_1_2_0_1_0
Win2V_1_0_4_0_0_1
Win2H_1_0_2_1_1_0
Lose2_0_0_0_1_0_1_1
Win2H_0_1_1_1_1_0
Win1_1_0_2_1_0_0
Win2H_0_0_4_1_1_0
Win2H_0_1_1_0_1_0
Win2V_1_1_0_0_0_1
Win2H_0_1_0_0_1_0
Win2H_1_0_0_0_1_0
Lose2_0_0_0_1_0_0_1
Win2V_1_1_0_1_0_1
Win2V_1_1_1_0_0_1
Win2H_1_0_3_0_1_0
Win2V_1_1_2_0_0_1
Win2V_1_1_2_1_0_1
Win2V_1_1_3_0_0_1
Win2V_1_1_3_1_0_1
Win2V_1_1_4_0_0_1
Win2V_1_1_4_1_0_1
Lose2_0_0_0_1_0_0_0
Lose2_0_1_0_0_1_0_0
Lose2_0_1_1_0_1_0_1
Lose1_0_0_0_0_0_1_1
Lose2_0_1_0_0_1_0_1
Lose1_0_0_1_0_0_0_1
Win1_0_0_1_1_0_0
Win1_0_1_2_1_0_0
Lose1_1_0_0_0_1_1_1
Lose1_1_0_0_0_1_0_1
Lose2_1_0_0_1_0_1_1
Win2H_0_1_4_0_1_0
Win2H_0_0_0_0_1_0
Win2H_1_0_1_1_1_0
Win2H_0_1_3_1_1_0
Win1_1_0_0_1_0_0
Win1_1_0_1_1_0_0
Win2H_1_0_2_0_1_0
Win2H_1_0_3_1_1_0
Win2H_1_0_4_0_1_0
Win2H_1_0_4_1_1_0
Win2H_1_1_0_0_1_0
Win2H_1_1_0_1_1_0
Win2H_1_1_1_0_1_0
Win2H_1_1_1_1_1_0
Win2H_1_1_2_0_1_0
Win2H_1_1_2_1_1_0
Win2H_1_1_3_0_1_0
Win2H_1_1_3_1_1_0
Win2H_1_1_4_0_1_0
Win2H_1_1_4_1_1_0
Lose1_0_0_1_0_0_1_1
Win1_0_1_1_1_0_0
Win1_0_0_2_1_0_0
Win1_0_0_0_1_0_0
Win1_0_0_4_1_0_0
Win1_0_0_3_1_0_0
Win1_0_1_0_1_0_0
Win1_0_1_3_1_0_0
Win1_0_1_4_1_0_0
Win1_1_0_3_1_0_0
Win1_1_0_4_1_0_0
Win1_1_1_0_1_0_0
Win1_1_1_1_1_0_0
Win1_1_1_2_1_0_0
Win1_1_1_3_1_0_0
Win1_1_1_4_1_0_0
Play_0_1_0_0
Play_0_1_0_1
Play_0_1_1_0
Play_0_1_1_1
Play_1_1_0_1
Play_1_1_0_0
Play_1_1_1_0
Play_1_1_1_1
Win2V_0_1_0_1_0_1
Win2V_0_0_2_1_0_1
Win2V_0_0_1_1_0_1
Win2V_0_1_2_1_0_1
Win2H_0_0_1_0_1_0
Win2V_0_1_2_0_0_1
Win2V_1_0_0_0_0_1
Win2V_0_0_4_1_0_1
Win2V_0_1_4_0_0_1
Win2V_0_0_2_0_0_1
Win2H_1_0_1_0_1_0
Win2H_1_0_0_1_1_0
Win2V_0_1_1_1_0_1
NoWin_0
Win2V_0_1_3_1_0_1
NoWin_1
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
...
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="DotAndBoxes-COL-2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
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/DotAndBoxes-COL-2.tgz
mv DotAndBoxes-COL-2 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is DotAndBoxes-COL-2, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r029kn-smll-146348015100317"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
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 ;