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 |
3960.930 | 5502.00 | 4889.00 | 140.10 | FFTFFFFTTTTFFFFT | 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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700087
=====================================================================
--------------------
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-ReachabilityCardinality-0
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-1
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-15
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-2
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-3
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-4
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-5
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-6
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-7
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-8
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1433633453874
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=ReachabilityCardinality.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: EF [[[~ [OfferRequest_p10<=PaySchemeData_p21_6] & [3<=p5_2 & 2<=PaySchemeData_p21_10]] & 2<=PaymentRequest_p11_9]]
normalized: E [true U [2<=PaymentRequest_p11_9 & [[3<=p5_2 & 2<=PaySchemeData_p21_10] & ~ [OfferRequest_p10<=PaySchemeData_p21_6]]]]
abstracting: (OfferRequest_p10<=PaySchemeData_p21_6) states: 196
abstracting: (2<=PaySchemeData_p21_10) states: 0
abstracting: (3<=p5_2) states: 0
abstracting: (2<=PaymentRequest_p11_9) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[3<=DeliveryNote_p22_12 | [[Status_p21_9<=PayReceipt_p21_15 & 2<=p3_9] & ~ [3<=DeliveryRequest_p12_5]]]]
normalized: E [true U [3<=DeliveryNote_p22_12 | [[Status_p21_9<=PayReceipt_p21_15 & 2<=p3_9] & ~ [3<=DeliveryRequest_p12_5]]]]
abstracting: (3<=DeliveryRequest_p12_5) states: 0
abstracting: (2<=p3_9) states: 0
abstracting: (Status_p21_9<=PayReceipt_p21_15) states: 202
abstracting: (3<=DeliveryNote_p22_12) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[p6_3<=ConsumerDelivery_p6_0 & [3<=Organization_p21_2 | 3<=p3_6]] | [[p3_6<=PayReceipt_p21_15 | p3_1<=p8_1] & ~ [2<=p4_3]]]]
normalized: ~ [E [true U ~ [[[p6_3<=ConsumerDelivery_p6_0 & [3<=Organization_p21_2 | 3<=p3_6]] | [~ [2<=p4_3] & [p3_6<=PayReceipt_p21_15 | p3_1<=p8_1]]]]]]
abstracting: (p3_1<=p8_1) states: 200
abstracting: (p3_6<=PayReceipt_p21_15) states: 200
abstracting: (2<=p4_3) states: 0
abstracting: (3<=p3_6) states: 0
abstracting: (3<=Organization_p21_2) states: 0
abstracting: (p6_3<=ConsumerDelivery_p6_0) states: 196
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [~ [p12_7<=Status_p21_5]]
normalized: E [true U ~ [p12_7<=Status_p21_5]]
abstracting: (p12_7<=Status_p21_5) states: 12
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [p3_8<=p4_3]
normalized: E [true U p3_8<=p4_3]
abstracting: (p3_8<=p4_3) states: 190
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [3<=p11_4]
normalized: ~ [E [true U ~ [3<=p11_4]]]
abstracting: (3<=p11_4) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[~ [~ [2<=p2_2]] | [p11_3<=PaySchemeData_p11_10 & 2<=p3_10]]]
normalized: E [true U [2<=p2_2 | [p11_3<=PaySchemeData_p11_10 & 2<=p3_10]]]
abstracting: (2<=p3_10) states: 0
abstracting: (p11_3<=PaySchemeData_p11_10) states: 10
abstracting: (2<=p2_2) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [3<=p4_3]
normalized: ~ [E [true U ~ [3<=p4_3]]]
abstracting: (3<=p4_3) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [Status_p22_13<=DeliveryResponse_p12_6]
normalized: ~ [E [true U ~ [Status_p22_13<=DeliveryResponse_p12_6]]]
abstracting: (Status_p22_13<=DeliveryResponse_p12_6) states: 196
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[[PayReceipt_p21_15<=Order_p22_10 & 3<=MerchantOffer_p2] & [p6_2<=p6_2 | p6_4<=PaymentHandlerPayment_p5_0]] | [~ [p6_3<=Organization_p21_2] | [OfferResponce_p10<=MerchantPayment_p4_0 | 1<=p1_2]]]]
normalized: E [true U [[[OfferResponce_p10<=MerchantPayment_p4_0 | 1<=p1_2] | ~ [p6_3<=Organization_p21_2]] | [[PayReceipt_p21_15<=Order_p22_10 & 3<=MerchantOffer_p2] & [p6_2<=p6_2 | p6_4<=PaymentHandlerPayment_p5_0]]]]
abstracting: (p6_4<=PaymentHandlerPayment_p5_0) states: 200
abstracting: (p6_2<=p6_2) states: 204
abstracting: (3<=MerchantOffer_p2) states: 0
abstracting: (PayReceipt_p21_15<=Order_p22_10) states: 200
abstracting: (p6_3<=Organization_p21_2) states: 196
abstracting: (1<=p1_2) states: 20
abstracting: (OfferResponce_p10<=MerchantPayment_p4_0) states: 20
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[PayReceipt_p21_12<=Order_p22_10 | [~ [PaymentRequest_p11_9<=PaymentNote_p21_13] | [p6_2<=p12_3 & p5_4<=ConsumerDelivery_p6_0]]]]
normalized: E [true U [PayReceipt_p21_12<=Order_p22_10 | [[p6_2<=p12_3 & p5_4<=ConsumerDelivery_p6_0] | ~ [PaymentRequest_p11_9<=PaymentNote_p21_13]]]]
abstracting: (PaymentRequest_p11_9<=PaymentNote_p21_13) states: 200
abstracting: (p5_4<=ConsumerDelivery_p6_0) states: 108
abstracting: (p6_2<=p12_3) states: 196
abstracting: (PayReceipt_p21_12<=Order_p22_10) states: 200
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[2<=Organization_p20_2 & 2<=Status_p21_14]]
normalized: ~ [E [true U ~ [[2<=Organization_p20_2 & 2<=Status_p21_14]]]]
abstracting: (2<=Status_p21_14) states: 0
abstracting: (2<=Organization_p20_2) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[3<=p7_1 | 1<=p2_2]]
normalized: ~ [E [true U ~ [[3<=p7_1 | 1<=p2_2]]]]
abstracting: (1<=p2_2) states: 4
abstracting: (3<=p7_1) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[2<=Organization_p21_2 & ~ [[1<=PaymentRequest_p11_9 | 1<=OfferRequest_p10]]]]
normalized: ~ [E [true U ~ [[2<=Organization_p21_2 & ~ [[1<=PaymentRequest_p11_9 | 1<=OfferRequest_p10]]]]]]
abstracting: (1<=OfferRequest_p10) states: 8
abstracting: (1<=PaymentRequest_p11_9) states: 4
abstracting: (2<=Organization_p21_2) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [3<=p5_4]
normalized: E [true U 3<=p5_4]
abstracting: (3<=p5_4) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[~ [BrandSelection_p11_5<=Order_p20] & [p4_2<=p10_0 | 2<=Status_p21_14]] & p3_6<=p4_5]]
normalized: E [true U [p3_6<=p4_5 & [[p4_2<=p10_0 | 2<=Status_p21_14] & ~ [BrandSelection_p11_5<=Order_p20]]]]
abstracting: (BrandSelection_p11_5<=Order_p20) states: 200
abstracting: (2<=Status_p21_14) states: 0
abstracting: (p4_2<=p10_0) states: 204
abstracting: (p3_6<=p4_5) states: 200
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m5sec
BK_STOP 1433633459376
--------------------
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:51 (1), effective:2 (0)
iterations count:62 (1), effective:5 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:251 (5), effective:44 (0)
iterations count:197 (4), effective:35 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:51 (1), effective:1 (0)
iterations count:45 (1), effective:0 (0)
iterations count:250 (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-C01M01P01D01"
export BK_EXAMINATION="ReachabilityCardinality"
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 ReachabilityCardinality"
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-143354324700087"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;