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-2265
Executing tool classicSEQ
Input is PhilosophersDyn-PT-10, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r058kn-blw3-143254861900790
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432595191338

---> classicSEQ --- TAPAAL Classic Sequential

***********************************************
TAPAAL classicSEQ verifying ReachabilityComputeBounds
***********************************************

verifypn -n -r 1 -x 1 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-0: place-bound EF ("Think_9" < 0) and ("Think_8" < 0) and ("Think_1" < 0) and ("Think_2" < 0) and ("Think_3" < 0) and ("Think_7" < 0) and ("Think_6" < 0) and ("Think_4" < 0) and ("Think_5" < 0) and ("Think_10" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-0 4 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Think_9, Think_8, Think_1, Think_2, Think_3, Think_7, Think_6, Think_4, Think_5 and Think_10: 4


verifypn -n -r 1 -x 2 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-1: place-bound EF ("Forks_10" < 0) and ("Forks_8" < 0) and ("Forks_1" < 0) and ("Forks_7" < 0) and ("Forks_6" < 0) and ("Forks_5" < 0) and ("Forks_4" < 0) and ("Forks_3" < 0) and ("Forks_9" < 0) and ("Forks_2" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-1 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Forks_10, Forks_8, Forks_1, Forks_7, Forks_6, Forks_5, Forks_4, Forks_3, Forks_9 and Forks_2: 2


verifypn -n -r 1 -x 3 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-2: place-bound EF ("Outside_10" < 0) and ("Outside_4" < 0) and ("Outside_3" < 0) and ("Outside_5" < 0) and ("Outside_6" < 0) and ("Outside_7" < 0) and ("Outside_8" < 0) and ("Outside_9" < 0) and ("Outside_2" < 0) and ("Outside_1" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Outside_10, Outside_4, Outside_3, Outside_5, Outside_6, Outside_7, Outside_8, Outside_9, Outside_2 and Outside_1: 10


verifypn -n -r 1 -x 4 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-3: place-bound EF ("Neighbourhood_7_3" < 0) and ("Neighbourhood_2_10" < 0) and ("Neighbourhood_9_1" < 0) and ("Neighbourhood_3_8" < 0) and ("Neighbourhood_8_2" < 0) and ("Neighbourhood_5_5" < 0) and ("Neighbourhood_8_9" < 0) and ("Neighbourhood_3_4" < 0) and ("Neighbourhood_7_7" < 0) and ("Neighbourhood_3_6" < 0) and ("Neighbourhood_4_8" < 0) and ("Neighbourhood_5_10" < 0) and ("Neighbourhood_5_1" < 0) and ("Neighbourhood_6_5" < 0) and ("Neighbourhood_1_9" < 0) and ("Neighbourhood_1_7" < 0) and ("Neighbourhood_6_3" < 0) and ("Neighbourhood_9_2" < 0) and ("Neighbourhood_2_2" < 0) and ("Neighbourhood_10_4" < 0) and ("Neighbourhood_7_5" < 0) and ("Neighbourhood_1_2" < 0) and ("Neighbourhood_5_8" < 0) and ("Neighbourhood_6_1" < 0) and ("Neighbourhood_9_9" < 0) and ("Neighbourhood_2_7" < 0) and ("Neighbourhood_6_7" < 0) and ("Neighbourhood_10_2" < 0) and ("Neighbourhood_4_4" < 0) and ("Neighbourhood_2_6" < 0) and ("Neighbourhood_5_3" < 0) and ("Neighbourhood_4_10" < 0) and ("Neighbourhood_3_1" < 0) and ("Neighbourhood_9_4" < 0) and ("Neighbourhood_9_7" < 0) and ("Neighbourhood_8_5" < 0) and ("Neighbourhood_4_3" < 0) and ("Neighbourhood_6_8" < 0) and ("Neighbourhood_9_6" < 0) and ("Neighbourhood_10_8" < 0) and ("Neighbourhood_1_6" < 0) and ("Neighbourhood_9_8" < 0) and ("Neighbourhood_1_4" < 0) and ("Neighbourhood_6_9" < 0) and ("Neighbourhood_7_10" < 0) and ("Neighbourhood_8_7" < 0) and ("Neighbourhood_7_8" < 0) and ("Neighbourhood_4_1" < 0) and ("Neighbourhood_6_10" < 0) and ("Neighbourhood_4_2" < 0) and ("Neighbourhood_3_3" < 0) and ("Neighbourhood_1_5" < 0) and ("Neighbourhood_2_4" < 0) and ("Neighbourhood_8_8" < 0) and ("Neighbourhood_7_9" < 0) and ("Neighbourhood_10_6" < 0) and ("Neighbourhood_10_5" < 0) and ("Neighbourhood_3_2" < 0) and ("Neighbourhood_9_3" < 0) and ("Neighbourhood_4_7" < 0) and ("Neighbourhood_6_4" < 0) and ("Neighbourhood_2_3" < 0) and ("Neighbourhood_5_2" < 0) and ("Neighbourhood_6_6" < 0) and ("Neighbourhood_8_1" < 0) and ("Neighbourhood_10_3" < 0) and ("Neighbourhood_2_5" < 0) and ("Neighbourhood_1_1" < 0) and ("Neighbourhood_10_7" < 0) and ("Neighbourhood_1_3" < 0) and ("Neighbourhood_9_5" < 0) and ("Neighbourhood_7_1" < 0) and ("Neighbourhood_3_7" < 0) and ("Neighbourhood_8_6" < 0) and ("Neighbourhood_6_2" < 0) and ("Neighbourhood_5_4" < 0) and ("Neighbourhood_8_10" < 0) and ("Neighbourhood_5_9" < 0) and ("Neighbourhood_9_10" < 0) and ("Neighbourhood_4_9" < 0) and ("Neighbourhood_7_6" < 0) and ("Neighbourhood_2_1" < 0) and ("Neighbourhood_1_8" < 0) and ("Neighbourhood_3_5" < 0) and ("Neighbourhood_10_9" < 0) and ("Neighbourhood_3_9" < 0) and ("Neighbourhood_8_4" < 0) and ("Neighbourhood_5_6" < 0) and ("Neighbourhood_10_1" < 0) and ("Neighbourhood_7_2" < 0) and ("Neighbourhood_4_5" < 0) and ("Neighbourhood_2_8" < 0) and ("Neighbourhood_10_10" < 0) and ("Neighbourhood_4_6" < 0) and ("Neighbourhood_7_4" < 0) and ("Neighbourhood_8_3" < 0) and ("Neighbourhood_1_10" < 0) and ("Neighbourhood_2_9" < 0) and ("Neighbourhood_5_7" < 0) and ("Neighbourhood_3_10" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-3 4 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Neighbourhood_7_3, Neighbourhood_2_10, Neighbourhood_9_1, Neighbourhood_3_8, Neighbourhood_8_2, Neighbourhood_5_5, Neighbourhood_8_9, Neighbourhood_3_4, Neighbourhood_7_7, Neighbourhood_3_6, Neighbourhood_4_8, Neighbourhood_5_10, Neighbourhood_5_1, Neighbourhood_6_5, Neighbourhood_1_9, Neighbourhood_1_7, Neighbourhood_6_3, Neighbourhood_9_2, Neighbourhood_2_2, Neighbourhood_10_4, Neighbourhood_7_5, Neighbourhood_1_2, Neighbourhood_5_8, Neighbourhood_6_1, Neighbourhood_9_9, Neighbourhood_2_7, Neighbourhood_6_7, Neighbourhood_10_2, Neighbourhood_4_4, Neighbourhood_2_6, Neighbourhood_5_3, Neighbourhood_4_10, Neighbourhood_3_1, Neighbourhood_9_4, Neighbourhood_9_7, Neighbourhood_8_5, Neighbourhood_4_3, Neighbourhood_6_8, Neighbourhood_9_6, Neighbourhood_10_8, Neighbourhood_1_6, Neighbourhood_9_8, Neighbourhood_1_4, Neighbourhood_6_9, Neighbourhood_7_10, Neighbourhood_8_7, Neighbourhood_7_8, Neighbourhood_4_1, Neighbourhood_6_10, Neighbourhood_4_2, Neighbourhood_3_3, Neighbourhood_1_5, Neighbourhood_2_4, Neighbourhood_8_8, Neighbourhood_7_9, Neighbourhood_10_6, Neighbourhood_10_5, Neighbourhood_3_2, Neighbourhood_9_3, Neighbourhood_4_7, Neighbourhood_6_4, Neighbourhood_2_3, Neighbourhood_5_2, Neighbourhood_6_6, Neighbourhood_8_1, Neighbourhood_10_3, Neighbourhood_2_5, Neighbourhood_1_1, Neighbourhood_10_7, Neighbourhood_1_3, Neighbourhood_9_5, Neighbourhood_7_1, Neighbourhood_3_7, Neighbourhood_8_6, Neighbourhood_6_2, Neighbourhood_5_4, Neighbourhood_8_10, Neighbourhood_5_9, Neighbourhood_9_10, Neighbourhood_4_9, Neighbourhood_7_6, Neighbourhood_2_1, Neighbourhood_1_8, Neighbourhood_3_5, Neighbourhood_10_9, Neighbourhood_3_9, Neighbourhood_8_4, Neighbourhood_5_6, Neighbourhood_10_1, Neighbourhood_7_2, Neighbourhood_4_5, Neighbourhood_2_8, Neighbourhood_10_10, Neighbourhood_4_6, Neighbourhood_7_4, Neighbourhood_8_3, Neighbourhood_1_10, Neighbourhood_2_9, Neighbourhood_5_7 and Neighbourhood_3_10: 4


verifypn -n -r 1 -x 5 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-4: place-bound EF ("HasLeft_6" < 0) and ("HasLeft_1" < 0) and ("HasLeft_8" < 0) and ("HasLeft_9" < 0) and ("HasLeft_3" < 0) and ("HasLeft_10" < 0) and ("HasLeft_2" < 0) and ("HasLeft_5" < 0) and ("HasLeft_4" < 0) and ("HasLeft_7" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-4 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places HasLeft_6, HasLeft_1, HasLeft_8, HasLeft_9, HasLeft_3, HasLeft_10, HasLeft_2, HasLeft_5, HasLeft_4 and HasLeft_7: 2


verifypn -n -r 1 -x 6 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-5: place-bound EF ("WaitRight_5" < 0) and ("WaitRight_10" < 0) and ("WaitRight_1" < 0) and ("WaitRight_9" < 0) and ("WaitRight_2" < 0) and ("WaitRight_8" < 0) and ("WaitRight_3" < 0) and ("WaitRight_7" < 0) and ("WaitRight_6" < 0) and ("WaitRight_4" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-5 4 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitRight_5, WaitRight_10, WaitRight_1, WaitRight_9, WaitRight_2, WaitRight_8, WaitRight_3, WaitRight_7, WaitRight_6 and WaitRight_4: 4


verifypn -n -r 1 -x 7 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-6: place-bound EF ("WaitLeft_7" < 0) and ("WaitLeft_4" < 0) and ("WaitLeft_10" < 0) and ("WaitLeft_5" < 0) and ("WaitLeft_2" < 0) and ("WaitLeft_3" < 0) and ("WaitLeft_1" < 0) and ("WaitLeft_8" < 0) and ("WaitLeft_9" < 0) and ("WaitLeft_6" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-6 4 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitLeft_7, WaitLeft_4, WaitLeft_10, WaitLeft_5, WaitLeft_2, WaitLeft_3, WaitLeft_1, WaitLeft_8, WaitLeft_9 and WaitLeft_6: 4


verifypn -n -r 1 -x 8 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-7: place-bound EF ("HasRight_9" < 0) and ("HasRight_2" < 0) and ("HasRight_3" < 0) and ("HasRight_8" < 0) and ("HasRight_1" < 0) and ("HasRight_10" < 0) and ("HasRight_6" < 0) and ("HasRight_7" < 0) and ("HasRight_4" < 0) and ("HasRight_5" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-7 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places HasRight_9, HasRight_2, HasRight_3, HasRight_8, HasRight_1, HasRight_10, HasRight_6, HasRight_7, HasRight_4 and HasRight_5: 2


verifypn -n -r 1 -x 9 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-8: place-bound EF ("HasLeft_6" < 0) and ("HasLeft_1" < 0) and ("HasLeft_8" < 0) and ("HasLeft_9" < 0) and ("HasLeft_3" < 0) and ("HasLeft_10" < 0) and ("HasLeft_2" < 0) and ("HasLeft_5" < 0) and ("HasLeft_4" < 0) and ("HasLeft_7" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-8 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places HasLeft_6, HasLeft_1, HasLeft_8, HasLeft_9, HasLeft_3, HasLeft_10, HasLeft_2, HasLeft_5, HasLeft_4 and HasLeft_7: 2


verifypn -n -r 1 -x 10 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-9: place-bound EF ("WaitLeft_7" < 0) and ("WaitLeft_4" < 0) and ("WaitLeft_10" < 0) and ("WaitLeft_5" < 0) and ("WaitLeft_2" < 0) and ("WaitLeft_3" < 0) and ("WaitLeft_1" < 0) and ("WaitLeft_8" < 0) and ("WaitLeft_9" < 0) and ("WaitLeft_6" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-9 4 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitLeft_7, WaitLeft_4, WaitLeft_10, WaitLeft_5, WaitLeft_2, WaitLeft_3, WaitLeft_1, WaitLeft_8, WaitLeft_9 and WaitLeft_6: 4


verifypn -n -r 1 -x 11 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-10: place-bound EF ("WaitLeft_7" < 0) and ("WaitLeft_4" < 0) and ("WaitLeft_10" < 0) and ("WaitLeft_5" < 0) and ("WaitLeft_2" < 0) and ("WaitLeft_3" < 0) and ("WaitLeft_1" < 0) and ("WaitLeft_8" < 0) and ("WaitLeft_9" < 0) and ("WaitLeft_6" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-10 4 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitLeft_7, WaitLeft_4, WaitLeft_10, WaitLeft_5, WaitLeft_2, WaitLeft_3, WaitLeft_1, WaitLeft_8, WaitLeft_9 and WaitLeft_6: 4


verifypn -n -r 1 -x 12 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-11: place-bound EF ("HasRight_9" < 0) and ("HasRight_2" < 0) and ("HasRight_3" < 0) and ("HasRight_8" < 0) and ("HasRight_1" < 0) and ("HasRight_10" < 0) and ("HasRight_6" < 0) and ("HasRight_7" < 0) and ("HasRight_4" < 0) and ("HasRight_5" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-11 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places HasRight_9, HasRight_2, HasRight_3, HasRight_8, HasRight_1, HasRight_10, HasRight_6, HasRight_7, HasRight_4 and HasRight_5: 2


verifypn -n -r 1 -x 13 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-12: place-bound EF ("WaitLeft_7" < 0) and ("WaitLeft_4" < 0) and ("WaitLeft_10" < 0) and ("WaitLeft_5" < 0) and ("WaitLeft_2" < 0) and ("WaitLeft_3" < 0) and ("WaitLeft_1" < 0) and ("WaitLeft_8" < 0) and ("WaitLeft_9" < 0) and ("WaitLeft_6" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-12 4 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitLeft_7, WaitLeft_4, WaitLeft_10, WaitLeft_5, WaitLeft_2, WaitLeft_3, WaitLeft_1, WaitLeft_8, WaitLeft_9 and WaitLeft_6: 4


verifypn -n -r 1 -x 14 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-13: place-bound EF ("Forks_10" < 0) and ("Forks_8" < 0) and ("Forks_1" < 0) and ("Forks_7" < 0) and ("Forks_6" < 0) and ("Forks_5" < 0) and ("Forks_4" < 0) and ("Forks_3" < 0) and ("Forks_9" < 0) and ("Forks_2" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-13 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Forks_10, Forks_8, Forks_1, Forks_7, Forks_6, Forks_5, Forks_4, Forks_3, Forks_9 and Forks_2: 2


verifypn -n -r 1 -x 15 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-14: place-bound EF ("Forks_10" < 0) and ("Forks_8" < 0) and ("Forks_1" < 0) and ("Forks_7" < 0) and ("Forks_6" < 0) and ("Forks_5" < 0) and ("Forks_4" < 0) and ("Forks_3" < 0) and ("Forks_9" < 0) and ("Forks_2" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Forks_10, Forks_8, Forks_1, Forks_7, Forks_6, Forks_5, Forks_4, Forks_3, Forks_9 and Forks_2: 2


verifypn -n -r 1 -x 16 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-10-ReachabilityComputeBounds-15: place-bound EF ("WaitLeft_7" < 0) and ("WaitLeft_4" < 0) and ("WaitLeft_10" < 0) and ("WaitLeft_5" < 0) and ("WaitLeft_2" < 0) and ("WaitLeft_3" < 0) and ("WaitLeft_1" < 0) and ("WaitLeft_8" < 0) and ("WaitLeft_9" < 0) and ("WaitLeft_6" < 0)

FORMULA PhilosophersDyn-COL-10-ReachabilityComputeBounds-15 4 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitLeft_7, WaitLeft_4, WaitLeft_10, WaitLeft_5, WaitLeft_2, WaitLeft_3, WaitLeft_1, WaitLeft_8, WaitLeft_9 and WaitLeft_6: 4


BK_STOP 1432596229801

--------------------
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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="ReachabilityComputeBounds"
export BK_TOOL="classicSEQ"
export BK_RESULT_DIR="/user/u8/hulinhub/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/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool classicSEQ"
echo " Input is PhilosophersDyn-PT-10, examination is ReachabilityComputeBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r058kn-blw3-143254861900790"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityComputeBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityComputeBounds" != "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 "ReachabilityComputeBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityComputeBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityComputeBounds.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 '' ReachabilityComputeBounds.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 ;