fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r198st-blw3-143341196300582
Last Updated
August 19, 2015

About the Execution of TAPAAL(SEQ) for S_Philosophers-PT-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
127.090 47917.00 47960.00 19.80 10 10 5 10 10 10 10 5 10 10 10 10 10 10 10 5 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-2270
Executing tool classicSEQ
Input is S_Philosophers-PT-000010, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r198st-blw3-143341196300582
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1433481685608

---> classicSEQ --- TAPAAL Classic Sequential

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

verifypn -n -r 1 -x 1 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-0: place-bound EF ("Catch2_2" < 0) and ("Catch2_3" < 0) and ("Catch2_1" < 0) and ("Catch2_6" < 0) and ("Catch2_7" < 0) and ("Catch2_4" < 0) and ("Catch2_5" < 0) and ("Catch2_10" < 0) and ("Catch2_8" < 0) and ("Catch2_9" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-0 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Catch2_2, Catch2_3, Catch2_1, Catch2_6, Catch2_7, Catch2_4, Catch2_5, Catch2_10, Catch2_8 and Catch2_9: 10


verifypn -n -r 1 -x 2 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-1: place-bound EF ("Catch2_2" < 0) and ("Catch2_3" < 0) and ("Catch2_1" < 0) and ("Catch2_6" < 0) and ("Catch2_7" < 0) and ("Catch2_4" < 0) and ("Catch2_5" < 0) and ("Catch2_10" < 0) and ("Catch2_8" < 0) and ("Catch2_9" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-1 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Catch2_2, Catch2_3, Catch2_1, Catch2_6, Catch2_7, Catch2_4, Catch2_5, Catch2_10, Catch2_8 and Catch2_9: 10


verifypn -n -r 1 -x 3 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-2: place-bound EF ("Catch2_2" < 0) and ("Catch2_3" < 0) and ("Catch2_1" < 0) and ("Catch2_6" < 0) and ("Catch2_7" < 0) and ("Catch2_4" < 0) and ("Catch2_5" < 0) and ("Catch2_10" < 0) and ("Catch2_8" < 0) and ("Catch2_9" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Catch2_2, Catch2_3, Catch2_1, Catch2_6, Catch2_7, Catch2_4, Catch2_5, Catch2_10, Catch2_8 and Catch2_9: 10


verifypn -n -r 1 -x 4 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-3: place-bound EF ("Fork_1" < 0) and ("Fork_2" < 0) and ("Fork_3" < 0) and ("Fork_5" < 0) and ("Fork_4" < 0) and ("Fork_7" < 0) and ("Fork_6" < 0) and ("Fork_9" < 0) and ("Fork_8" < 0) and ("Fork_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Fork_1, Fork_2, Fork_3, Fork_5, Fork_4, Fork_7, Fork_6, Fork_9, Fork_8 and Fork_10: 10


verifypn -n -r 1 -x 5 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-4: place-bound EF ("Fork_1" < 0) and ("Fork_2" < 0) and ("Fork_3" < 0) and ("Fork_5" < 0) and ("Fork_4" < 0) and ("Fork_7" < 0) and ("Fork_6" < 0) and ("Fork_9" < 0) and ("Fork_8" < 0) and ("Fork_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-4 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Fork_1, Fork_2, Fork_3, Fork_5, Fork_4, Fork_7, Fork_6, Fork_9, Fork_8 and Fork_10: 10


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

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-5 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

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


verifypn -n -r 1 -x 7 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-6: place-bound EF ("Fork_1" < 0) and ("Fork_2" < 0) and ("Fork_3" < 0) and ("Fork_5" < 0) and ("Fork_4" < 0) and ("Fork_7" < 0) and ("Fork_6" < 0) and ("Fork_9" < 0) and ("Fork_8" < 0) and ("Fork_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-6 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Fork_1, Fork_2, Fork_3, Fork_5, Fork_4, Fork_7, Fork_6, Fork_9, Fork_8 and Fork_10: 10


verifypn -n -r 1 -x 8 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-7: place-bound EF ("Fork_1" < 0) and ("Fork_2" < 0) and ("Fork_3" < 0) and ("Fork_5" < 0) and ("Fork_4" < 0) and ("Fork_7" < 0) and ("Fork_6" < 0) and ("Fork_9" < 0) and ("Fork_8" < 0) and ("Fork_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-7 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Fork_1, Fork_2, Fork_3, Fork_5, Fork_4, Fork_7, Fork_6, Fork_9, Fork_8 and Fork_10: 10


verifypn -n -r 1 -x 9 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-8: place-bound EF ("Catch1_1" < 0) and ("Catch1_3" < 0) and ("Catch1_2" < 0) and ("Catch1_5" < 0) and ("Catch1_4" < 0) and ("Catch1_7" < 0) and ("Catch1_6" < 0) and ("Catch1_9" < 0) and ("Catch1_8" < 0) and ("Catch1_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Catch1_1, Catch1_3, Catch1_2, Catch1_5, Catch1_4, Catch1_7, Catch1_6, Catch1_9, Catch1_8 and Catch1_10: 10


verifypn -n -r 1 -x 10 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-9: place-bound EF ("Eat_1" < 0) and ("Eat_4" < 0) and ("Eat_5" < 0) and ("Eat_2" < 0) and ("Eat_3" < 0) and ("Eat_9" < 0) and ("Eat_8" < 0) and ("Eat_7" < 0) and ("Eat_6" < 0) and ("Eat_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-9 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Eat_1, Eat_4, Eat_5, Eat_2, Eat_3, Eat_9, Eat_8, Eat_7, Eat_6 and Eat_10: 5


verifypn -n -r 1 -x 11 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-10: place-bound EF ("Eat_1" < 0) and ("Eat_4" < 0) and ("Eat_5" < 0) and ("Eat_2" < 0) and ("Eat_3" < 0) and ("Eat_9" < 0) and ("Eat_8" < 0) and ("Eat_7" < 0) and ("Eat_6" < 0) and ("Eat_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-10 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Eat_1, Eat_4, Eat_5, Eat_2, Eat_3, Eat_9, Eat_8, Eat_7, Eat_6 and Eat_10: 5


verifypn -n -r 1 -x 12 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-11: place-bound EF ("Catch1_1" < 0) and ("Catch1_3" < 0) and ("Catch1_2" < 0) and ("Catch1_5" < 0) and ("Catch1_4" < 0) and ("Catch1_7" < 0) and ("Catch1_6" < 0) and ("Catch1_9" < 0) and ("Catch1_8" < 0) and ("Catch1_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Catch1_1, Catch1_3, Catch1_2, Catch1_5, Catch1_4, Catch1_7, Catch1_6, Catch1_9, Catch1_8 and Catch1_10: 10


verifypn -n -r 1 -x 13 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-12: place-bound EF ("Catch2_2" < 0) and ("Catch2_3" < 0) and ("Catch2_1" < 0) and ("Catch2_6" < 0) and ("Catch2_7" < 0) and ("Catch2_4" < 0) and ("Catch2_5" < 0) and ("Catch2_10" < 0) and ("Catch2_8" < 0) and ("Catch2_9" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Catch2_2, Catch2_3, Catch2_1, Catch2_6, Catch2_7, Catch2_4, Catch2_5, Catch2_10, Catch2_8 and Catch2_9: 10


verifypn -n -r 1 -x 14 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-13: place-bound EF ("Catch1_1" < 0) and ("Catch1_3" < 0) and ("Catch1_2" < 0) and ("Catch1_5" < 0) and ("Catch1_4" < 0) and ("Catch1_7" < 0) and ("Catch1_6" < 0) and ("Catch1_9" < 0) and ("Catch1_8" < 0) and ("Catch1_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-13 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Catch1_1, Catch1_3, Catch1_2, Catch1_5, Catch1_4, Catch1_7, Catch1_6, Catch1_9, Catch1_8 and Catch1_10: 10


verifypn -n -r 1 -x 15 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-14: place-bound EF ("Fork_1" < 0) and ("Fork_2" < 0) and ("Fork_3" < 0) and ("Fork_5" < 0) and ("Fork_4" < 0) and ("Fork_7" < 0) and ("Fork_6" < 0) and ("Fork_9" < 0) and ("Fork_8" < 0) and ("Fork_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Fork_1, Fork_2, Fork_3, Fork_5, Fork_4, Fork_7, Fork_6, Fork_9, Fork_8 and Fork_10: 10


verifypn -n -r 1 -x 16 model.pnml ReachabilityComputeBounds.xml
Philosophers-COL-000010-ReachabilityComputeBounds-15: place-bound EF ("Eat_1" < 0) and ("Eat_4" < 0) and ("Eat_5" < 0) and ("Eat_2" < 0) and ("Eat_3" < 0) and ("Eat_9" < 0) and ("Eat_8" < 0) and ("Eat_7" < 0) and ("Eat_6" < 0) and ("Eat_10" < 0)

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-15 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STRUCTURAL_REDUCTION

Maximum number of tokens in places Eat_1, Eat_4, Eat_5, Eat_2, Eat_3, Eat_9, Eat_8, Eat_7, Eat_6 and Eat_10: 5


BK_STOP 1433481733525

--------------------
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="S_Philosophers-PT-000010"
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/S_Philosophers-PT-000010.tgz
mv S_Philosophers-PT-000010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool classicSEQ"
echo " Input is S_Philosophers-PT-000010, 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 r198st-blw3-143341196300582"
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 ;