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-3254
Executing tool marcie
Input is IOTPpurchase-PT-C12M10P15D17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473800110
=====================================================================

--------------------
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 IOTPpurchase-PT-C12M10P15D17-UpperBounds-0
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-1
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-15
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-2
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-3
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-4
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-5
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-6
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-7
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-8
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1494452250903

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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 --memory=6

parse successfull
net created successfully

Net: IOTPpurchase_PT_C12M10P15D17
(NrP: 111 NrTr: 45 NrArc: 224)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 1.068sec

parse successfull
net created successfully

Net: IOTPpurchase_PT_C12M10P15D17
(NrP: 111 NrTr: 45 NrArc: 224)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.469sec


RS generation: 3m56.409sec


-> reachability set: #nodes 730767 (7.3e+05) #states 92,677,131,972,792 (13)



starting MCC model checker
--------------------------

checking: place_bound(Delivery_p22_4)
normalized: place_bound(Delivery_p22_4)

-> the formula is 12

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-0 12 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ConsumerDelivery_p6_0)
normalized: place_bound(ConsumerDelivery_p6_0)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-1 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p12_7)
normalized: place_bound(p12_7)

-> the formula is 1

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p4_1)
normalized: place_bound(p4_1)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Status_p22_7)
normalized: place_bound(Status_p22_7)

-> the formula is 12

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-4 12 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p7_1)
normalized: place_bound(p7_1)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-5 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Payment_p21_7)
normalized: place_bound(Payment_p21_7)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-6 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Status_p20_6)
normalized: place_bound(Status_p20_6)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-7 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Delivery_p20)
normalized: place_bound(Delivery_p20)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Delivery_p20_10)
normalized: place_bound(Delivery_p20_10)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(MerchantDelivery_p4_6)
normalized: place_bound(MerchantDelivery_p4_6)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p6_1)
normalized: place_bound(p6_1)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Payment_p20_9)
normalized: place_bound(Payment_p20_9)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Organization_p22_2)
normalized: place_bound(Organization_p22_2)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-13 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p3_6)
normalized: place_bound(p3_6)

-> the formula is 10

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p6_3)
normalized: place_bound(p6_3)

-> the formula is 12

FORMULA IOTPpurchase-PT-C12M10P15D17-UpperBounds-15 12 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 19917391 (2.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 95974686 245692891 341667577
used/not used/entry size/cache size: 65711493 1397371 16 1024MB
basic ops cache: hits/miss/sum: 4441062 9718618 14159680
used/not used/entry size/cache size: 8147799 8629417 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 255575 730801 986376
used/not used/entry size/cache size: 700703 7687905 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 50591481
1 13609092
2 2476989
3 377115
4 48556
5 5148
6 432
7 39
8 5
9 1
>= 10 6

Total processing time: 4m 7.309sec


BK_STOP 1494452498434

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
ok
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


initing FirstDep: 0m 0.000sec


iterations count:5976 (132), effective:1208 (26)

initing FirstDep: 0m 0.000sec

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="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C12M10P15D17, 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 r031-blw7-149440473800110"
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 '' UpperBounds.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 ;