About the Execution of Marcie for IOTPpurchase-PT-C01M01P01D01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3967.470 | 5650.00 | 5019.00 | 30.60 | FTFFTTTTTTFFTFTT | 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 marcie
Input is IOTPpurchase-PT-C01M01P01D01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700080
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-0
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-1
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-15
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-2
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-3
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-4
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-5
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-6
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-7
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-8
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433633405376
Model: IOTPpurchase-PT-C01M01P01D01
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 111 NrTr: 45 NrArc: 224)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m0sec
-> reachability set: #nodes 469 (4.7e+02) #states 204
starting MCC model checker
--------------------------
checking: AG [[~ [1<=p6_1] & [[p3_10<=p3_1 | p2_1<=Delivery_p22_8] | [p7_1<=PaymentAmount_p11_6 | 1<=Order_p20]]]]
normalized: ~ [E [true U ~ [[~ [1<=p6_1] & [[p7_1<=PaymentAmount_p11_6 | 1<=Order_p20] | [p3_10<=p3_1 | p2_1<=Delivery_p22_8]]]]]]
abstracting: (p2_1<=Delivery_p22_8) states: 200
abstracting: (p3_10<=p3_1) states: 200
abstracting: (1<=Order_p20) states: 4
abstracting: (p7_1<=PaymentAmount_p11_6) states: 200
abstracting: (1<=p6_1) states: 4
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[EG [p8_1<=Delivery_p20] | [[p2_1<=Status_p22_7 & 2<=Payment_p20_9] & ~ [Order_p22_3<=PaySchemeData_p21_6]]] | ~ [AF [p6_6<=p4_1]]] | PaymentResponse_p11_12<=Order_p22_10]
normalized: [PaymentResponse_p11_12<=Order_p22_10 | [EG [~ [p6_6<=p4_1]] | [[~ [Order_p22_3<=PaySchemeData_p21_6] & [p2_1<=Status_p22_7 & 2<=Payment_p20_9]] | EG [p8_1<=Delivery_p20]]]]
abstracting: (p8_1<=Delivery_p20) states: 200
...............................................
EG iterations: 47
abstracting: (2<=Payment_p20_9) states: 0
abstracting: (p2_1<=Status_p22_7) states: 200
abstracting: (Order_p22_3<=PaySchemeData_p21_6) states: 200
abstracting: (p6_6<=p4_1) states: 196
.....
EG iterations: 5
abstracting: (PaymentResponse_p11_12<=Order_p22_10) states: 196
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [[EG [Organization_p20_7<=PaySchemeData_p11_10] | 2<=p12_4]] | AF [~ [~ [1<=PaySchemeData_p11_10]]]]
normalized: [~ [EG [~ [1<=PaySchemeData_p11_10]]] | ~ [[2<=p12_4 | EG [Organization_p20_7<=PaySchemeData_p11_10]]]]
abstracting: (Organization_p20_7<=PaySchemeData_p11_10) states: 200
...............................................
EG iterations: 47
abstracting: (2<=p12_4) states: 0
abstracting: (1<=PaySchemeData_p11_10) states: 6
..............................................
EG iterations: 46
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: p6_6<=p2_1
normalized: p6_6<=p2_1
abstracting: (p6_6<=p2_1) states: 196
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [[[Order_p20_8<=Status_p21_9 | ~ [2<=Order_p22_3]] | EG [3<=p11_3]]] & [[[[p10_2<=PaidFor_p11_1 | Payment_p21_7<=p3_5] | [2<=p8_1 & 1<=p4_5]] & ~ [~ [DeliveryResponse_p12_6<=p6_5]]] & [AF [2<=BrandList_p11_2] & ~ [[3<=p6_1 & 2<=Organization_p22_2]]]]]
normalized: [[[~ [[3<=p6_1 & 2<=Organization_p22_2]] & ~ [EG [~ [2<=BrandList_p11_2]]]] & [DeliveryResponse_p12_6<=p6_5 & [[2<=p8_1 & 1<=p4_5] | [p10_2<=PaidFor_p11_1 | Payment_p21_7<=p3_5]]]] & ~ [[EG [3<=p11_3] | [Order_p20_8<=Status_p21_9 | ~ [2<=Order_p22_3]]]]]
abstracting: (2<=Order_p22_3) states: 0
abstracting: (Order_p20_8<=Status_p21_9) states: 200
abstracting: (3<=p11_3) states: 0
.
EG iterations: 1
abstracting: (Payment_p21_7<=p3_5) states: 202
abstracting: (p10_2<=PaidFor_p11_1) states: 200
abstracting: (1<=p4_5) states: 4
abstracting: (2<=p8_1) states: 0
abstracting: (DeliveryResponse_p12_6<=p6_5) states: 204
abstracting: (2<=BrandList_p11_2) states: 0
EG iterations: 0
abstracting: (2<=Organization_p22_2) states: 0
abstracting: (3<=p6_1) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [1<=p11_0]
normalized: ~ [1<=p11_0]
abstracting: (1<=p11_0) states: 200
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [[[[[2<=Organization_p21_2 & 1<=Organization_p22_5] & ~ [1<=p11_11]] | AG [3<=Status_p21_14]] & [[p3_9<=p7_2 & [3<=p2_2 | 3<=p6_7]] & AF [3<=ConsumerPayment_p3]]]]
normalized: ~ [[[~ [EG [~ [3<=ConsumerPayment_p3]]] & [p3_9<=p7_2 & [3<=p2_2 | 3<=p6_7]]] & [~ [E [true U ~ [3<=Status_p21_14]]] | [~ [1<=p11_11] & [2<=Organization_p21_2 & 1<=Organization_p22_5]]]]]
abstracting: (1<=Organization_p22_5) states: 16
abstracting: (2<=Organization_p21_2) states: 0
abstracting: (1<=p11_11) states: 198
abstracting: (3<=Status_p21_14) states: 0
abstracting: (3<=p6_7) states: 0
abstracting: (3<=p2_2) states: 0
abstracting: (p3_9<=p7_2) states: 198
abstracting: (3<=ConsumerPayment_p3) states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AX [[[[2<=PaymentNote_p21_13 | Organization_p21_8<=Status_p20_6] | [1<=p1_3 & p11_3<=p12_0]] & AF [3<=Order_p20]]]
normalized: ~ [EX [~ [[[[1<=p1_3 & p11_3<=p12_0] | [2<=PaymentNote_p21_13 | Organization_p21_8<=Status_p20_6]] & ~ [EG [~ [3<=Order_p20]]]]]]]
abstracting: (3<=Order_p20) states: 0
EG iterations: 0
abstracting: (Organization_p21_8<=Status_p20_6) states: 202
abstracting: (2<=PaymentNote_p21_13) states: 0
abstracting: (p11_3<=p12_0) states: 200
abstracting: (1<=p1_3) states: 4
.-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [EX [AX [3<=Status_p21_11]]]
normalized: ~ [EX [~ [EX [~ [3<=Status_p21_11]]]]]
abstracting: (3<=Status_p21_11) states: 0
..-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [~ [~ [~ [p4_2<=p3_10]]]]
normalized: p4_2<=p3_10
abstracting: (p4_2<=p3_10) states: 200
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AX [AG [2<=PayReceipt_p21_12]]
normalized: ~ [EX [E [true U ~ [2<=PayReceipt_p21_12]]]]
abstracting: (2<=PayReceipt_p21_12) states: 0
.-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [p11_0<=p5_2]
normalized: ~ [E [true U ~ [p11_0<=p5_2]]]
abstracting: (p11_0<=p5_2) states: 6
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: Organization_p20_2<=p3_5
normalized: Organization_p20_2<=p3_5
abstracting: (Organization_p20_2<=p3_5) states: 200
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [[[PaidFor_p11_1<=BrandList_p11_2 | [~ [3<=p11_7] | [p5_3<=Delivery_p22_1 | DeliveryHandlerDelivery_p8_0<=p3_5]]] & 2<=p4_3]]
normalized: ~ [[2<=p4_3 & [PaidFor_p11_1<=BrandList_p11_2 | [~ [3<=p11_7] | [p5_3<=Delivery_p22_1 | DeliveryHandlerDelivery_p8_0<=p3_5]]]]]
abstracting: (DeliveryHandlerDelivery_p8_0<=p3_5) states: 114
abstracting: (p5_3<=Delivery_p22_1) states: 200
abstracting: (3<=p11_7) states: 0
abstracting: (PaidFor_p11_1<=BrandList_p11_2) states: 200
abstracting: (2<=p4_3) states: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [DeliveryHandlerDelivery_p8_0<=p11_0 | AG [EG [2<=WhatDeliver_p12_1]]]
normalized: [DeliveryHandlerDelivery_p8_0<=p11_0 | ~ [E [true U ~ [EG [2<=WhatDeliver_p12_1]]]]]
abstracting: (2<=WhatDeliver_p12_1) states: 0
.
EG iterations: 1
abstracting: (DeliveryHandlerDelivery_p8_0<=p11_0) states: 202
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [EF [~ [[3<=p3_4 & 2<=ConsumerPayment_p3]]] | AG [AF [2<=p4_1]]]
normalized: [E [true U ~ [[3<=p3_4 & 2<=ConsumerPayment_p3]]] | ~ [E [true U EG [~ [2<=p4_1]]]]]
abstracting: (2<=p4_1) states: 0
EG iterations: 0
abstracting: (2<=ConsumerPayment_p3) states: 0
abstracting: (3<=p3_4) states: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m5sec
BK_STOP 1433633411026
--------------------
content from stderr:
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: 0m0sec
iterations count:447 (9), effective:83 (1)
initing FirstDep: 0m0sec
iterations count:249 (5), effective:44 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:51 (1), effective:2 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
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-C01M01P01D01"
export BK_EXAMINATION="CTLCardinality"
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/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C01M01P01D01, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r232su-smll-143354324700080"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;