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-03, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r058kn-blw3-143254861900777
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432595096604

---> classicSEQ --- TAPAAL Classic Sequential

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

verifypn -n -r 1 -x 1 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-0: place-bound EF ("HasRight_2" < 0) and ("HasRight_1" < 0) and ("HasRight_3" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-0 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places HasRight_2, HasRight_1 and HasRight_3: 2


verifypn -n -r 1 -x 2 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-1: place-bound EF ("WaitRight_1" < 0) and ("WaitRight_2" < 0) and ("WaitRight_3" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitRight_1, WaitRight_2 and WaitRight_3: 3


verifypn -n -r 1 -x 3 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-2: place-bound EF ("Forks_1" < 0) and ("Forks_2" < 0) and ("Forks_3" < 0)

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

Maximum number of tokens in places Forks_1, Forks_2 and Forks_3: 2


verifypn -n -r 1 -x 4 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-3: place-bound EF ("Neighbourhood_1_2" < 0) and ("Neighbourhood_2_2" < 0) and ("Neighbourhood_3_3" < 0) and ("Neighbourhood_1_1" < 0) and ("Neighbourhood_2_3" < 0) and ("Neighbourhood_2_1" < 0) and ("Neighbourhood_1_3" < 0) and ("Neighbourhood_3_2" < 0) and ("Neighbourhood_3_1" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-3 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Neighbourhood_1_2, Neighbourhood_2_2, Neighbourhood_3_3, Neighbourhood_1_1, Neighbourhood_2_3, Neighbourhood_2_1, Neighbourhood_1_3, Neighbourhood_3_2 and Neighbourhood_3_1: 3


verifypn -n -r 1 -x 5 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-4: place-bound EF ("WaitLeft_2" < 0) and ("WaitLeft_3" < 0) and ("WaitLeft_1" < 0)

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

Maximum number of tokens in places WaitLeft_2, WaitLeft_3 and WaitLeft_1: 3


verifypn -n -r 1 -x 6 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-5: place-bound EF ("Neighbourhood_1_2" < 0) and ("Neighbourhood_2_2" < 0) and ("Neighbourhood_3_3" < 0) and ("Neighbourhood_1_1" < 0) and ("Neighbourhood_2_3" < 0) and ("Neighbourhood_2_1" < 0) and ("Neighbourhood_1_3" < 0) and ("Neighbourhood_3_2" < 0) and ("Neighbourhood_3_1" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-5 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Neighbourhood_1_2, Neighbourhood_2_2, Neighbourhood_3_3, Neighbourhood_1_1, Neighbourhood_2_3, Neighbourhood_2_1, Neighbourhood_1_3, Neighbourhood_3_2 and Neighbourhood_3_1: 3


verifypn -n -r 1 -x 7 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-6: place-bound EF ("WaitLeft_2" < 0) and ("WaitLeft_3" < 0) and ("WaitLeft_1" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-6 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitLeft_2, WaitLeft_3 and WaitLeft_1: 3


verifypn -n -r 1 -x 8 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-7: place-bound EF ("Neighbourhood_1_2" < 0) and ("Neighbourhood_2_2" < 0) and ("Neighbourhood_3_3" < 0) and ("Neighbourhood_1_1" < 0) and ("Neighbourhood_2_3" < 0) and ("Neighbourhood_2_1" < 0) and ("Neighbourhood_1_3" < 0) and ("Neighbourhood_3_2" < 0) and ("Neighbourhood_3_1" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-7 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Neighbourhood_1_2, Neighbourhood_2_2, Neighbourhood_3_3, Neighbourhood_1_1, Neighbourhood_2_3, Neighbourhood_2_1, Neighbourhood_1_3, Neighbourhood_3_2 and Neighbourhood_3_1: 3


verifypn -n -r 1 -x 9 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-8: place-bound EF ("HasLeft_2" < 0) and ("HasLeft_3" < 0) and ("HasLeft_1" < 0)

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

Maximum number of tokens in places HasLeft_2, HasLeft_3 and HasLeft_1: 2


verifypn -n -r 1 -x 10 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-9: place-bound EF ("Neighbourhood_1_2" < 0) and ("Neighbourhood_2_2" < 0) and ("Neighbourhood_3_3" < 0) and ("Neighbourhood_1_1" < 0) and ("Neighbourhood_2_3" < 0) and ("Neighbourhood_2_1" < 0) and ("Neighbourhood_1_3" < 0) and ("Neighbourhood_3_2" < 0) and ("Neighbourhood_3_1" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-9 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Neighbourhood_1_2, Neighbourhood_2_2, Neighbourhood_3_3, Neighbourhood_1_1, Neighbourhood_2_3, Neighbourhood_2_1, Neighbourhood_1_3, Neighbourhood_3_2 and Neighbourhood_3_1: 3


verifypn -n -r 1 -x 11 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-10: place-bound EF ("Neighbourhood_1_2" < 0) and ("Neighbourhood_2_2" < 0) and ("Neighbourhood_3_3" < 0) and ("Neighbourhood_1_1" < 0) and ("Neighbourhood_2_3" < 0) and ("Neighbourhood_2_1" < 0) and ("Neighbourhood_1_3" < 0) and ("Neighbourhood_3_2" < 0) and ("Neighbourhood_3_1" < 0)

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

Maximum number of tokens in places Neighbourhood_1_2, Neighbourhood_2_2, Neighbourhood_3_3, Neighbourhood_1_1, Neighbourhood_2_3, Neighbourhood_2_1, Neighbourhood_1_3, Neighbourhood_3_2 and Neighbourhood_3_1: 3


verifypn -n -r 1 -x 12 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-11: place-bound EF ("Outside_3" < 0) and ("Outside_2" < 0) and ("Outside_1" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-11 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Outside_3, Outside_2 and Outside_1: 3


verifypn -n -r 1 -x 13 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-12: place-bound EF ("Forks_1" < 0) and ("Forks_2" < 0) and ("Forks_3" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-12 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Forks_1, Forks_2 and Forks_3: 2


verifypn -n -r 1 -x 14 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-13: place-bound EF ("WaitLeft_2" < 0) and ("WaitLeft_3" < 0) and ("WaitLeft_1" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-13 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places WaitLeft_2, WaitLeft_3 and WaitLeft_1: 3


verifypn -n -r 1 -x 15 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-14: place-bound EF ("HasLeft_2" < 0) and ("HasLeft_3" < 0) and ("HasLeft_1" < 0)

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

Maximum number of tokens in places HasLeft_2, HasLeft_3 and HasLeft_1: 2


verifypn -n -r 1 -x 16 model.pnml ReachabilityComputeBounds.xml
PhilosophersDyn-COL-03-ReachabilityComputeBounds-15: place-bound EF ("HasLeft_2" < 0) and ("HasLeft_3" < 0) and ("HasLeft_1" < 0)

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-15 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places HasLeft_2, HasLeft_3 and HasLeft_1: 2


BK_STOP 1432595097055

--------------------
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-03"
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-03.tgz
mv PhilosophersDyn-PT-03 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-03, 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-143254861900777"
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 ;