About the Execution of Marcie for IOTPpurchase-PT-C05M04P03D02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4668.750 | 287520.00 | 287009.00 | 30.30 | FFFTFFTTTFTFFTFF | 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-C05M04P03D02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324800106
=====================================================================
--------------------
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 1433633616141
Model: IOTPpurchase-PT-C05M04P03D02
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 5226 (5.2e+03) #states 17,406,024 (7)
starting MCC model checker
--------------------------
checking: ~ [[~ [3<=p4_3] & EG [DeliveryNote_p22_14<=PaySchemeData_p21_6]]]
normalized: ~ [[EG [DeliveryNote_p22_14<=PaySchemeData_p21_6] & ~ [3<=p4_3]]]
abstracting: (3<=p4_3) states: 63,424 (4)
abstracting: (DeliveryNote_p22_14<=PaySchemeData_p21_6) states: 14,494,080 (7)
...............................................................................
EG iterations: 79
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m25sec
checking: AG [~ [~ [p7_3<=p12_4]]]
normalized: ~ [E [true U ~ [p7_3<=p12_4]]]
abstracting: (p7_3<=p12_4) states: 14,417,544 (7)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m3sec
checking: EF [[[[p4_4<=p1_1 & 3<=p1_1] | [3<=p3_10 | Status_p20<=p6_4]] & [[1<=Payment_p20 & 3<=p5_1] & [PaymentHandlerPayment_p5_0<=p10_0 | p1_1<=p7_3]]]]
normalized: E [true U [[[1<=Payment_p20 & 3<=p5_1] & [PaymentHandlerPayment_p5_0<=p10_0 | p1_1<=p7_3]] & [[3<=p3_10 | Status_p20<=p6_4] | [p4_4<=p1_1 & 3<=p1_1]]]]
abstracting: (3<=p1_1) states: 36,512 (4)
abstracting: (p4_4<=p1_1) states: 16,004,388 (7)
abstracting: (Status_p20<=p6_4) states: 16,004,388 (7)
abstracting: (3<=p3_10) states: 5,648 (3)
abstracting: (p1_1<=p7_3) states: 15,752,232 (7)
abstracting: (PaymentHandlerPayment_p5_0<=p10_0) states: 8,819,221 (6)
abstracting: (3<=p5_1) states: 1,310 (3)
abstracting: (1<=Payment_p20) states: 1,647,592 (6)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m0sec
checking: [~ [EG [~ [3<=PaymentNote_p21_13]]] & EF [AG [p12_0<=Delivery_p22_8]]]
normalized: [E [true U ~ [E [true U ~ [p12_0<=Delivery_p22_8]]]] & ~ [EG [~ [3<=PaymentNote_p21_13]]]]
abstracting: (3<=PaymentNote_p21_13) states: 2,552 (3)
.
EG iterations: 1
abstracting: (p12_0<=Delivery_p22_8) states: 3,374,424 (6)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m6sec
checking: [~ [EF [[PaymentResponse_p11_12<=Status_p21_14 & 3<=p11_8]]] & EG [EX [DeliveryNote_p22_12<=p6_7]]]
normalized: [EG [EX [DeliveryNote_p22_12<=p6_7]] & ~ [E [true U [PaymentResponse_p11_12<=Status_p21_14 & 3<=p11_8]]]]
abstracting: (3<=p11_8) states: 0
abstracting: (PaymentResponse_p11_12<=Status_p21_14) states: 14,883,688 (7)
abstracting: (DeliveryNote_p22_12<=p6_7) states: 15,659,156 (7)
..
EG iterations: 1
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m33sec
checking: [EF [AG [Organization_p20_2<=p8_2]] | AX [AG [1<=p5_4]]]
normalized: [~ [EX [E [true U ~ [1<=p5_4]]]] | E [true U ~ [E [true U ~ [Organization_p20_2<=p8_2]]]]]
abstracting: (Organization_p20_2<=p8_2) states: 15,915,888 (7)
abstracting: (1<=p5_4) states: 12,608,338 (7)
.-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m7sec
checking: [[~ [[MerchantOffer_p2<=Delivery_p22_8 | [1<=p3_5 & Delivery_p22_4<=Organization_p21_4]]] | E [p4_3<=Organization_p20_2 U 1<=p3_6]] & [AF [[p3_6<=p1_3 & 2<=p11_7]] & EG [[3<=ConsumerPayment_p3 | Order_p20<=p11_4]]]]
normalized: [[EG [[3<=ConsumerPayment_p3 | Order_p20<=p11_4]] & ~ [EG [~ [[p3_6<=p1_3 & 2<=p11_7]]]]] & [E [p4_3<=Organization_p20_2 U 1<=p3_6] | ~ [[MerchantOffer_p2<=Delivery_p22_8 | [1<=p3_5 & Delivery_p22_4<=Organization_p21_4]]]]]
abstracting: (Delivery_p22_4<=Organization_p21_4) states: 12,336,384 (7)
abstracting: (1<=p3_5) states: 5,713,568 (6)
abstracting: (MerchantOffer_p2<=Delivery_p22_8) states: 10,776,624 (7)
abstracting: (1<=p3_6) states: 1,647,592 (6)
abstracting: (p4_3<=Organization_p20_2) states: 12,078,728 (7)
abstracting: (2<=p11_7) states: 0
abstracting: (p3_6<=p1_3) states: 15,870,720 (7)
EG iterations: 0
abstracting: (Order_p20<=p11_4) states: 17,181,448 (7)
abstracting: (3<=ConsumerPayment_p3) states: 5,648 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m8sec
checking: E [[~ [3<=DeliveryNote_p22_14] | 2<=Status_p22_13] U EF [3<=Organization_p22_2]]
normalized: E [[2<=Status_p22_13 | ~ [3<=DeliveryNote_p22_14]] U E [true U 3<=Organization_p22_2]]
abstracting: (3<=Organization_p22_2) states: 5,648 (3)
abstracting: (3<=DeliveryNote_p22_14) states: 36,512 (4)
abstracting: (2<=Status_p22_13) states: 403,776 (5)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [EF [EF [2<=Delivery_p22_8]]]
normalized: ~ [E [true U E [true U 2<=Delivery_p22_8]]]
abstracting: (2<=Delivery_p22_8) states: 118,920 (5)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AX [[AX [1<=Delivery_p20_10] | AF [2<=p3_7]]]
normalized: ~ [EX [~ [[~ [EG [~ [2<=p3_7]]] | ~ [EX [~ [1<=Delivery_p20_10]]]]]]]
abstracting: (1<=Delivery_p20_10) states: 1,647,592 (6)
.abstracting: (2<=p3_7) states: 117,800 (5)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [[[~ [~ [Payment_p21_3<=p4_4]] & EG [p3_8<=p3_7]] & EF [[DeliveryResponse_p12_6<=Delivery_p22_8 & 1<=p5_3]]]]
normalized: ~ [[E [true U [DeliveryResponse_p12_6<=Delivery_p22_8 & 1<=p5_3]] & [Payment_p21_3<=p4_4 & EG [p3_8<=p3_7]]]]
abstracting: (p3_8<=p3_7) states: 12,117,460 (7)
.
EG iterations: 1
abstracting: (Payment_p21_3<=p4_4) states: 14,442,328 (7)
abstracting: (1<=p5_3) states: 2,157,288 (6)
abstracting: (DeliveryResponse_p12_6<=Delivery_p22_8) states: 14,865,588 (7)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17sec
checking: [[EG [[PayReceipt_p21_12<=p3_4 | 1<=DeliveryHandlerDelivery_p8_0]] & [[2<=Order_p22_3 | 3<=Status_p22_13] | Order_p22_3<=p7_3]] & Status_p21_9<=p8_3]
normalized: [Status_p21_9<=p8_3 & [[Order_p22_3<=p7_3 | [2<=Order_p22_3 | 3<=Status_p22_13]] & EG [[PayReceipt_p21_12<=p3_4 | 1<=DeliveryHandlerDelivery_p8_0]]]]
abstracting: (1<=DeliveryHandlerDelivery_p8_0) states: 10,779,912 (7)
abstracting: (PayReceipt_p21_12<=p3_4) states: 15,404,340 (7)
.
EG iterations: 1
abstracting: (3<=Status_p22_13) states: 36,512 (4)
abstracting: (2<=Order_p22_3) states: 117,800 (5)
abstracting: (Order_p22_3<=p7_3) states: 16,300,456 (7)
abstracting: (Status_p21_9<=p8_3) states: 16,935,180 (7)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12sec
checking: A [AX [p5_1<=Organization_p22_2] U ~ [[PaymentAmount_p11_6<=MerchantOffer_p2 | 3<=p3_7]]]
normalized: [~ [EG [[PaymentAmount_p11_6<=MerchantOffer_p2 | 3<=p3_7]]] & ~ [E [EX [~ [p5_1<=Organization_p22_2]] U [EX [~ [p5_1<=Organization_p22_2]] & [PaymentAmount_p11_6<=MerchantOffer_p2 | 3<=p3_7]]]]]
abstracting: (3<=p3_7) states: 5,648 (3)
abstracting: (PaymentAmount_p11_6<=MerchantOffer_p2) states: 16,410,432 (7)
abstracting: (p5_1<=Organization_p22_2) states: 16,285,544 (7)
.abstracting: (p5_1<=Organization_p22_2) states: 16,285,544 (7)
.abstracting: (3<=p3_7) states: 5,648 (3)
abstracting: (PaymentAmount_p11_6<=MerchantOffer_p2) states: 16,410,432 (7)
...........................................................................
EG iterations: 75
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m4sec
checking: EG [p3_4<=Status_p21_9]
normalized: EG [p3_4<=Status_p21_9]
abstracting: (p3_4<=Status_p21_9) states: 15,841,202 (7)
.........................................................................................................................................................
EG iterations: 153
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
checking: [[~ [1<=Organization_p22_5] | [3<=Payment_p21_7 | [DeliveryNote_p22_12<=p3_2 & [Delivery_p20_10<=PaymentRequest_p11_9 & 3<=Status_p21_9]]]] & [~ [[Status_p21_11<=Status_p20_6 & [PaymentRequest_p11_9<=p12_4 | p6_7<=p1_1]]] | A [ConsumerDelivery_p6_0<=p4_2 U p12_7<=p8_1]]]
normalized: [[[~ [EG [~ [p12_7<=p8_1]]] & ~ [E [~ [ConsumerDelivery_p6_0<=p4_2] U [~ [ConsumerDelivery_p6_0<=p4_2] & ~ [p12_7<=p8_1]]]]] | ~ [[Status_p21_11<=Status_p20_6 & [PaymentRequest_p11_9<=p12_4 | p6_7<=p1_1]]]] & [[3<=Payment_p21_7 | [DeliveryNote_p22_12<=p3_2 & [Delivery_p20_10<=PaymentRequest_p11_9 & 3<=Status_p21_9]]] | ~ [1<=Organization_p22_5]]]
abstracting: (1<=Organization_p22_5) states: 5,891,424 (6)
abstracting: (3<=Status_p21_9) states: 1,310 (3)
abstracting: (Delivery_p20_10<=PaymentRequest_p11_9) states: 15,865,208 (7)
abstracting: (DeliveryNote_p22_12<=p3_2) states: 15,974,608 (7)
abstracting: (3<=Payment_p21_7) states: 1,310 (3)
abstracting: (p6_7<=p1_1) states: 14,627,748 (7)
abstracting: (PaymentRequest_p11_9<=p12_4) states: 17,184,132 (7)
abstracting: (Status_p21_11<=Status_p20_6) states: 15,404,340 (7)
abstracting: (p12_7<=p8_1) states: 4,537,068 (6)
abstracting: (ConsumerDelivery_p6_0<=p4_2) states: 15,870,720 (7)
abstracting: (ConsumerDelivery_p6_0<=p4_2) states: 15,870,720 (7)
abstracting: (p12_7<=p8_1) states: 4,537,068 (6)
...............................................................................................................................................................................................................
EG iterations: 207
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m29sec
checking: A [EF [1<=PaymentNote_p21_16] U EG [p6_4<=p3_8]]
normalized: [~ [EG [~ [EG [p6_4<=p3_8]]]] & ~ [E [~ [E [true U 1<=PaymentNote_p21_16]] U [~ [E [true U 1<=PaymentNote_p21_16]] & ~ [EG [p6_4<=p3_8]]]]]]
abstracting: (p6_4<=p3_8) states: 15,093,990 (7)
...............................................
EG iterations: 47
abstracting: (1<=PaymentNote_p21_16) states: 1,647,592 (6)
abstracting: (1<=PaymentNote_p21_16) states: 1,647,592 (6)
abstracting: (p6_4<=p3_8) states: 15,093,990 (7)
...............................................
EG iterations: 47
...............................................................................................................
EG iterations: 111
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m7sec
Total processing time: 4m47sec
BK_STOP 1433633903661
--------------------
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
8457
iterations count:1506 (33), effective:301 (6)
initing FirstDep: 0m0sec
iterations count:264 (5), effective:47 (1)
iterations count:932 (20), effective:175 (3)
iterations count:51 (1), effective:2 (0)
iterations count:256 (5), effective:47 (1)
iterations count:46 (1), effective:1 (0)
iterations count:401 (8), effective:72 (1)
iterations count:622 (13), effective:117 (2)
iterations count:45 (1), effective:0 (0)
iterations count:443 (9), effective:82 (1)
iterations count:45 (1), effective:0 (0)
iterations count:251 (5), effective:44 (0)
iterations count:107 (2), effective:20 (0)
iterations count:49 (1), effective:2 (0)
iterations count:251 (5), effective:44 (0)
iterations count:251 (5), effective:44 (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-C05M04P03D02"
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-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 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-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 r232su-smll-143354324800106"
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 ;