About the Execution of Marcie for S_IOTPpurchase-PT-C05M04P03D02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5616.020 | 16075.00 | 16029.00 | 20.00 | FFFTTTTFFTTFFFTT | 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-2979
Executing tool marcie
Input is S_IOTPpurchase-PT-C05M04P03D02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418100084
=====================================================================
--------------------
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-C05M04P03D02-CTLCardinality-0
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-1
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-3
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-4
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-5
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-6
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-7
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-8
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464330606886
Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: IOTPpurchase_PT_C05M04P03D02
(NrP: 111 NrTr: 45 NrArc: 224)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m 3.986sec
RS generation: 0m 1.034sec
-> reachability set: #nodes 15027 (1.5e+04) #states 17,406,024 (7)
starting MCC model checker
--------------------------
checking: ~ [EF [EF [1<=ConsumerDelivery_p6_0]]]
normalized: ~ [E [true U E [true U 1<=ConsumerDelivery_p6_0]]]
abstracting: (1<=ConsumerDelivery_p6_0) states: 1,647,592 (6)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.565sec
checking: A [EF [3<=ConsumerOffer_p1] U AG [3<=PayReceipt_p21_15]]
normalized: [~ [EG [E [true U ~ [3<=PayReceipt_p21_15]]]] & ~ [E [E [true U ~ [3<=PayReceipt_p21_15]] U [~ [E [true U 3<=ConsumerOffer_p1]] & E [true U ~ [3<=PayReceipt_p21_15]]]]]]
abstracting: (3<=PayReceipt_p21_15) states: 5,648 (3)
abstracting: (3<=ConsumerOffer_p1) states: 36,512 (4)
abstracting: (3<=PayReceipt_p21_15) states: 5,648 (3)
abstracting: (3<=PayReceipt_p21_15) states: 5,648 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.667sec
checking: EG [AG [Status_p21_14<=Status_p20_6]]
normalized: EG [~ [E [true U ~ [Status_p21_14<=Status_p20_6]]]]
abstracting: (Status_p21_14<=Status_p20_6) states: 15,870,720 (7)
.
EG iterations: 1
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.368sec
checking: EG [EX [p6_2<=p3_10]]
normalized: EG [EX [p6_2<=p3_10]]
abstracting: (p6_2<=p3_10) states: 11,246,876 (7)
.......................
EG iterations: 22
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.640sec
checking: E [EF [Organization_p21_8<=Status_p21_14] U AG [3<=p6_5]]
normalized: E [E [true U Organization_p21_8<=Status_p21_14] U ~ [E [true U ~ [3<=p6_5]]]]
abstracting: (3<=p6_5) states: 101,360 (5)
abstracting: (Organization_p21_8<=Status_p21_14) states: 16,285,544 (7)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.145sec
checking: E [3<=PaySchemeData_p21_6 U EG [p7_1<=p5_1]]
normalized: E [3<=PaySchemeData_p21_6 U EG [p7_1<=p5_1]]
abstracting: (p7_1<=p5_1) states: 15,841,202 (7)
..........................................
EG iterations: 42
abstracting: (3<=PaySchemeData_p21_6) states: 5,648 (3)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.765sec
checking: EG [[p3_1<=p10_0 | EF [3<=Status_p20_6]]]
normalized: EG [[p3_1<=p10_0 | E [true U 3<=Status_p20_6]]]
abstracting: (3<=Status_p20_6) states: 5,648 (3)
abstracting: (p3_1<=p10_0) states: 17,066,928 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.229sec
checking: ~ [[AF [[PayReceipt_p21_12<=PayReceipt_p21_15 & 2<=p7_2]] & ~ [1<=Status_p21_9]]]
normalized: ~ [[~ [1<=Status_p21_9] & ~ [EG [~ [[PayReceipt_p21_12<=PayReceipt_p21_15 & 2<=p7_2]]]]]]
abstracting: (2<=p7_2) states: 117,800 (5)
abstracting: (PayReceipt_p21_12<=PayReceipt_p21_15) states: 15,404,340 (7)
.
EG iterations: 1
abstracting: (1<=Status_p21_9) states: 1,204,696 (6)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.147sec
checking: AG [EF [[OfferResponce_p10<=p11_4 & Order_p22_6<=Organization_p22_9]]]
normalized: ~ [E [true U ~ [E [true U [OfferResponce_p10<=p11_4 & Order_p22_6<=Organization_p22_9]]]]]
abstracting: (Order_p22_6<=Organization_p22_9) states: 11,944,584 (7)
abstracting: (OfferResponce_p10<=p11_4) states: 15,977,632 (7)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.361sec
checking: AG [[~ [[3<=PaySchemeData_p21_10 & 2<=p6_7]] | ~ [[1<=p4_4 & 3<=p5_2]]]]
normalized: ~ [E [true U ~ [[~ [[3<=PaySchemeData_p21_10 & 2<=p6_7]] | ~ [[1<=p4_4 & 3<=p5_2]]]]]]
abstracting: (3<=p5_2) states: 1,310 (3)
abstracting: (1<=p4_4) states: 1,647,592 (6)
abstracting: (2<=p6_7) states: 403,776 (5)
abstracting: (3<=PaySchemeData_p21_10) states: 5,240 (3)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.035sec
checking: AG [~ [[[1<=p3_6 & 3<=PaymentAmount_p11_6] & [Status_p22_11<=Status_p20 & 2<=p7_2]]]]
normalized: ~ [E [true U [[1<=p3_6 & 3<=PaymentAmount_p11_6] & [Status_p22_11<=Status_p20 & 2<=p7_2]]]]
abstracting: (2<=p7_2) states: 117,800 (5)
abstracting: (Status_p22_11<=Status_p20) states: 13,835,560 (7)
abstracting: (3<=PaymentAmount_p11_6) states: 0
abstracting: (1<=p3_6) states: 1,647,592 (6)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: AG [[[[3<=Organization_p22_9 & 1<=Organization_p20_7] & [3<=Status_p22_13 | 1<=p3_6]] | EX [PaidFor_p11_1<=p5_2]]]
normalized: ~ [E [true U ~ [[[[3<=Status_p22_13 | 1<=p3_6] & [3<=Organization_p22_9 & 1<=Organization_p20_7]] | EX [PaidFor_p11_1<=p5_2]]]]]
abstracting: (PaidFor_p11_1<=p5_2) states: 15,953,524 (7)
.abstracting: (1<=Organization_p20_7) states: 1,647,592 (6)
abstracting: (3<=Organization_p22_9) states: 0
abstracting: (1<=p3_6) states: 1,647,592 (6)
abstracting: (3<=Status_p22_13) states: 36,512 (4)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.225sec
checking: [AG [[2<=p11_11 | [p6_4<=p3_10 | 3<=p12_4]]] & EX [AG [Order_p22_10<=BrandList_p11_2]]]
normalized: [EX [~ [E [true U ~ [Order_p22_10<=BrandList_p11_2]]]] & ~ [E [true U ~ [[2<=p11_11 | [p6_4<=p3_10 | 3<=p12_4]]]]]]
abstracting: (3<=p12_4) states: 0
abstracting: (p6_4<=p3_10) states: 14,494,080 (7)
abstracting: (2<=p11_11) states: 0
abstracting: (Order_p22_10<=BrandList_p11_2) states: 15,559,224 (7)
.-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.813sec
checking: A [~ [[3<=p6_3 & 1<=p1_2]] U [[Payment_p20_9<=p7_1 & 3<=Status_p22_13] & PaymentResponse_p11_12<=WhatDeliver_p12_1]]
normalized: [~ [EG [~ [[PaymentResponse_p11_12<=WhatDeliver_p12_1 & [Payment_p20_9<=p7_1 & 3<=Status_p22_13]]]]] & ~ [E [~ [[PaymentResponse_p11_12<=WhatDeliver_p12_1 & [Payment_p20_9<=p7_1 & 3<=Status_p22_13]]] U [[3<=p6_3 & 1<=p1_2] & ~ [[PaymentResponse_p11_12<=WhatDeliver_p12_1 & [Payment_p20_9<=p7_1 & 3<=Status_p22_13]]]]]]]
abstracting: (3<=Status_p22_13) states: 36,512 (4)
abstracting: (Payment_p20_9<=p7_1) states: 15,870,720 (7)
abstracting: (PaymentResponse_p11_12<=WhatDeliver_p12_1) states: 14,873,412 (7)
abstracting: (1<=p1_2) states: 6,620,472 (6)
abstracting: (3<=p6_3) states: 36,512 (4)
abstracting: (3<=Status_p22_13) states: 36,512 (4)
abstracting: (Payment_p20_9<=p7_1) states: 15,870,720 (7)
abstracting: (PaymentResponse_p11_12<=WhatDeliver_p12_1) states: 14,873,412 (7)
abstracting: (3<=Status_p22_13) states: 36,512 (4)
abstracting: (Payment_p20_9<=p7_1) states: 15,870,720 (7)
abstracting: (PaymentResponse_p11_12<=WhatDeliver_p12_1) states: 14,873,412 (7)
.
EG iterations: 1
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.304sec
checking: [AX [[p3_2<=p4_2 & [3<=Delivery_p22_4 | 1<=p6_1]]] | [~ [EG [p8_2<=p10_0]] & [EG [p7_2<=p1_2] & EF [3<=Status_p20]]]]
normalized: [[[E [true U 3<=Status_p20] & EG [p7_2<=p1_2]] & ~ [EG [p8_2<=p10_0]]] | ~ [EX [~ [[p3_2<=p4_2 & [3<=Delivery_p22_4 | 1<=p6_1]]]]]]
abstracting: (1<=p6_1) states: 1,647,592 (6)
abstracting: (3<=Delivery_p22_4) states: 139,688 (5)
abstracting: (p3_2<=p4_2) states: 13,013,936 (7)
.abstracting: (p8_2<=p10_0) states: 17,059,848 (7)
.
EG iterations: 1
abstracting: (p7_2<=p1_2) states: 16,256,668 (7)
.
EG iterations: 1
abstracting: (3<=Status_p20) states: 5,648 (3)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.164sec
checking: [[[EF [2<=p3_8] & [Status_p20_6<=HowDeliver_p12_2 | [p1_1<=Delivery_p20 & DeliveryNote_p22_14<=p8_1]]] & AX [[1<=p11_11 | 1<=p8_1]]] | [EF [[1<=Order_p22_10 | 2<=PaymentResponse_p11_12]] & EG [[BrandList_p11_2<=p4_3 | Organization_p20_7<=PaySchemeData_p21_10]]]]
normalized: [[[E [true U 2<=p3_8] & [Status_p20_6<=HowDeliver_p12_2 | [p1_1<=Delivery_p20 & DeliveryNote_p22_14<=p8_1]]] & ~ [EX [~ [[1<=p11_11 | 1<=p8_1]]]]] | [EG [[BrandList_p11_2<=p4_3 | Organization_p20_7<=PaySchemeData_p21_10]] & E [true U [1<=Order_p22_10 | 2<=PaymentResponse_p11_12]]]]
abstracting: (2<=PaymentResponse_p11_12) states: 0
abstracting: (1<=Order_p22_10) states: 1,996,632 (6)
abstracting: (Organization_p20_7<=PaySchemeData_p21_10) states: 15,921,352 (7)
abstracting: (BrandList_p11_2<=p4_3) states: 17,406,024 (7)
EG iterations: 0
abstracting: (1<=p8_1) states: 1,996,632 (6)
abstracting: (1<=p11_11) states: 15,039,348 (7)
.abstracting: (DeliveryNote_p22_14<=p8_1) states: 14,495,564 (7)
abstracting: (p1_1<=Delivery_p20) states: 14,494,080 (7)
abstracting: (Status_p20_6<=HowDeliver_p12_2) states: 15,979,728 (7)
abstracting: (2<=p3_8) states: 703,128 (5)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.672sec
Total processing time: 0m16.036sec
BK_STOP 1464330622961
--------------------
content from stderr:
check for maximal unmarked siphon
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
22702
iterations count:1581 (35), effective:301 (6)
initing FirstDep: 0m 0.000sec
iterations count:257 (5), effective:44 (0)
iterations count:45 (1), effective:0 (0)
iterations count:51 (1), effective:2 (0)
iterations count:567 (12), effective:132 (2)
iterations count:51 (1), effective:2 (0)
iterations count:51 (1), effective:2 (0)
iterations count:337 (7), effective:67 (1)
iterations count:53 (1), effective:4 (0)
iterations count:64 (1), effective:8 (0)
iterations count:47 (1), effective:1 (0)
iterations count:678 (15), effective:132 (2)
iterations count:100 (2), effective:16 (0)
iterations count:970 (21), effective:190 (4)
iterations count:267 (5), effective:50 (1)
iterations count:351 (7), effective:71 (1)
iterations count:756 (16), effective:144 (3)
iterations count:666 (14), effective:129 (2)
iterations count:257 (5), effective:44 (0)
iterations count:446 (9), effective:81 (1)
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_IOTPpurchase-PT-C05M04P03D02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/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_IOTPpurchase-PT-C05M04P03D02.tgz
mv S_IOTPpurchase-PT-C05M04P03D02 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_IOTPpurchase-PT-C05M04P03D02, 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 r161kn-blw3-146416418100084"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;