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 IOTPpurchase-PT-C05M04P03D02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913300088
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463723762817


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=ReachabilityCardinality.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.743sec


RS generation: 0m 1.354sec


-> reachability set: #nodes 15027 (1.5e+04) #states 17,406,024 (7)



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

checking: AG [~ [3<=p3_10]]
normalized: ~ [E [true U 3<=p3_10]]

abstracting: (3<=p3_10) states: 5,648 (3)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.851sec

checking: EF [2<=p11_13]
normalized: E [true U 2<=p11_13]

abstracting: (2<=p11_13) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [Organization_p21_8<=ConsumerPayment_p3]
normalized: ~ [E [true U ~ [Organization_p21_8<=ConsumerPayment_p3]]]

abstracting: (Organization_p21_8<=ConsumerPayment_p3) states: 16,285,544 (7)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.262sec

checking: AG [Payment_p21_7<=p3_4]
normalized: ~ [E [true U ~ [Payment_p21_7<=p3_4]]]

abstracting: (Payment_p21_7<=p3_4) states: 16,285,544 (7)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: AG [~ [[3<=p12_3 | 2<=Organization_p21_8]]]
normalized: ~ [E [true U [3<=p12_3 | 2<=Organization_p21_8]]]

abstracting: (2<=Organization_p21_8) states: 56,008 (4)
abstracting: (3<=p12_3) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.242sec

checking: AG [p6_5<=p12_4]
normalized: ~ [E [true U ~ [p6_5<=p12_4]]]

abstracting: (p6_5<=p12_4) states: 13,909,172 (7)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.852sec

checking: AG [p6_6<=p3_1]
normalized: ~ [E [true U ~ [p6_6<=p3_1]]]

abstracting: (p6_6<=p3_1) states: 14,494,080 (7)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.732sec

checking: AG [~ [[3<=Order_p22_10 & ~ [p3_10<=p6_7]]]]
normalized: ~ [E [true U [3<=Order_p22_10 & ~ [p3_10<=p6_7]]]]

abstracting: (p3_10<=p6_7) states: 16,004,388 (7)
abstracting: (3<=Order_p22_10) states: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: AG [[3<=PaymentAmount_p11_6 | p8_3<=p3_8]]
normalized: ~ [E [true U ~ [[3<=PaymentAmount_p11_6 | p8_3<=p3_8]]]]

abstracting: (p8_3<=p3_8) states: 8,862,168 (6)
abstracting: (3<=PaymentAmount_p11_6) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.488sec

checking: AG [[2<=p4_4 | ~ [[3<=p11_4 | 3<=PaymentAmount_p11_6]]]]
normalized: ~ [E [true U ~ [[2<=p4_4 | ~ [[3<=p11_4 | 3<=PaymentAmount_p11_6]]]]]]

abstracting: (3<=PaymentAmount_p11_6) states: 0
abstracting: (3<=p11_4) states: 0
abstracting: (2<=p4_4) states: 117,800 (5)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[[2<=Order_p22_6 | 1<=p3_6] | p8_3<=p1_1]]
normalized: ~ [E [true U ~ [[p8_3<=p1_1 | [2<=Order_p22_6 | 1<=p3_6]]]]]

abstracting: (1<=p3_6) states: 1,647,592 (6)
abstracting: (2<=Order_p22_6) states: 1,138,304 (6)
abstracting: (p8_3<=p1_1) states: 7,862,268 (6)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.790sec

checking: EF [[[~ [Status_p21_11<=PaymentNote_p21_16] | 2<=p4_2] | 3<=Organization_p21_8]]
normalized: E [true U [3<=Organization_p21_8 | [2<=p4_2 | ~ [Status_p21_11<=PaymentNote_p21_16]]]]

abstracting: (Status_p21_11<=PaymentNote_p21_16) states: 15,404,340 (7)
abstracting: (2<=p4_2) states: 117,800 (5)
abstracting: (3<=Organization_p21_8) states: 1,310 (3)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.327sec

checking: EF [[1<=p6_5 | [[3<=p11_13 & 1<=Status_p21_5] & ~ [3<=p3_10]]]]
normalized: E [true U [1<=p6_5 | [[3<=p11_13 & 1<=Status_p21_5] & ~ [3<=p3_10]]]]

abstracting: (3<=p3_10) states: 5,648 (3)
abstracting: (1<=Status_p21_5) states: 1,647,592 (6)
abstracting: (3<=p11_13) states: 0
abstracting: (1<=p6_5) states: 8,205,528 (6)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.789sec

checking: AG [[[Payment_p21_1<=ConsumerPayment_p3 | [1<=p10_2 | p8_1<=Organization_p22_9]] | 2<=p6_5]]
normalized: ~ [E [true U ~ [[2<=p6_5 | [Payment_p21_1<=ConsumerPayment_p3 | [1<=p10_2 | p8_1<=Organization_p22_9]]]]]]

abstracting: (p8_1<=Organization_p22_9) states: 17,406,024 (7)
abstracting: (1<=p10_2) states: 1,535,304 (6)
abstracting: (Payment_p21_1<=ConsumerPayment_p3) states: 15,870,720 (7)
abstracting: (2<=p6_5) states: 1,478,848 (6)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: AG [[[~ [p11_4<=ConsumerPayment_p3] | [Delivery_p22_4<=Order_p20 | Delivery_p22_8<=p6_1]] | ~ [~ [BrandList_p11_2<=Payment_p21_1]]]]
normalized: ~ [E [true U ~ [[BrandList_p11_2<=Payment_p21_1 | [[Delivery_p22_4<=Order_p20 | Delivery_p22_8<=p6_1] | ~ [p11_4<=ConsumerPayment_p3]]]]]]

abstracting: (p11_4<=ConsumerPayment_p3) states: 3,070,608 (6)
abstracting: (Delivery_p22_8<=p6_1) states: 15,569,184 (7)
abstracting: (Delivery_p22_4<=Order_p20) states: 11,937,696 (7)
abstracting: (BrandList_p11_2<=Payment_p21_1) states: 15,983,008 (7)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.866sec

checking: AG [[[~ [p6_2<=ConsumerPayment_p3] | [Delivery_p22_8<=p3_4 | p7_1<=DeliveryNote_p22_14]] | ~ [PaySchemeData_p21_10<=PaySchemeData_p21_10]]]
normalized: ~ [E [true U ~ [[~ [PaySchemeData_p21_10<=PaySchemeData_p21_10] | [~ [p6_2<=ConsumerPayment_p3] | [Delivery_p22_8<=p3_4 | p7_1<=DeliveryNote_p22_14]]]]]]

abstracting: (p7_1<=DeliveryNote_p22_14) states: 16,004,388 (7)
abstracting: (Delivery_p22_8<=p3_4) states: 15,569,184 (7)
abstracting: (p6_2<=ConsumerPayment_p3) states: 11,246,876 (7)
abstracting: (PaySchemeData_p21_10<=PaySchemeData_p21_10) states: 17,406,024 (7)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.602sec


Total processing time: 0m17.117sec


BK_STOP 1463723779971

--------------------
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.001sec

22702
iterations count:1581 (35), effective:301 (6)

initing FirstDep: 0m 0.000sec


iterations count:678 (15), effective:132 (2)

iterations count:317 (7), effective:60 (1)

iterations count:304 (6), effective:54 (1)

iterations count:469 (10), effective:88 (1)

iterations count:246 (5), effective:40 (0)

iterations count:398 (8), effective:87 (1)

iterations count:314 (6), effective:65 (1)

iterations count:513 (11), effective:104 (2)

iterations count:264 (5), effective:46 (1)

iterations count:246 (5), effective:40 (0)

iterations count:868 (19), effective:168 (3)

iterations count:712 (15), effective:142 (3)

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="ReachabilityCardinality"
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/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-2979"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C05M04P03D02, 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 r065kn-blw3-146358913300088"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 '' ReachabilityCardinality.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 ;