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-3254
Executing tool marcie
Input is ResAllocation-PT-R003C050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r061-csrt-149440955200106
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494705863001

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: ResAllocation_PT_R003C050
(NrP: 300 NrTr: 200 NrArc: 894)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec

net check time: 0m 0.000sec

init dd package: 0m 1.333sec


RS generation: 0m 0.051sec


-> reachability set: #nodes 1126 (1.1e+03) #states 48,717,538,008,124,384,423,924,727,808 (28)



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

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

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

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [2<=p_11_2]]
normalized: ~ [E [true U 2<=p_11_2]]

abstracting: (2<=p_11_2)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=p_5_0]
normalized: E [true U 1<=p_5_0]

abstracting: (1<=p_5_0)
states: 6,131,904,548,197,852,224,207,978,496 (27)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.165sec

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

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

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=p_0_1]
normalized: E [true U 1<=p_0_1]

abstracting: (1<=p_0_1)
states: 19,186,260,041,456,683,176,337,342,464 (28)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.103sec

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

abstracting: (r_39_1<=r_39_1)
states: 48,717,538,008,124,384,423,924,727,808 (28)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [3<=r_42_0] | 1<=r_20_1]]
normalized: ~ [E [true U ~ [[1<=r_20_1 | ~ [3<=r_42_0]]]]]

abstracting: (3<=r_42_0)
states: 0
abstracting: (1<=r_20_1)
states: 23,680,916,088,284,512,563,895,468,032 (28)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [~ [~ [p_40_2<=r_11_0]]]]
normalized: E [true U ~ [p_40_2<=r_11_0]]

abstracting: (p_40_2<=r_11_0)
states: 45,415,506,461,446,447,405,398,491,136 (28)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.145sec

checking: EF [[3<=r_26_2 & p_0_0<=p_0_2]]
normalized: E [true U [3<=r_26_2 & p_0_0<=p_0_2]]

abstracting: (p_0_0<=p_0_2)
states: 33,349,648,767,987,181,936,023,961,600 (28)
abstracting: (3<=r_26_2)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[~ [[r_21_2<=p_47_2 | p_13_2<=r_22_0]] & 3<=p_36_2]]
normalized: E [true U [~ [[r_21_2<=p_47_2 | p_13_2<=r_22_0]] & 3<=p_36_2]]

abstracting: (3<=p_36_2)
states: 0
abstracting: (p_13_2<=r_22_0)
states: 38,910,518,089,479,467,993,747,423,232 (28)
abstracting: (r_21_2<=p_47_2)
states: 35,016,139,146,808,713,208,538,333,184 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[r_26_1<=p_4_1 & [~ [3<=p_14_2] & [3<=p_19_0 | 3<=r_37_1]]]]
normalized: E [true U [[[3<=p_19_0 | 3<=r_37_1] & ~ [3<=p_14_2]] & r_26_1<=p_4_1]]

abstracting: (r_26_1<=p_4_1)
states: 31,433,989,979,957,951,684,916,805,632 (28)
abstracting: (3<=p_14_2)
states: 0
abstracting: (3<=r_37_1)
states: 0
abstracting: (3<=p_19_0)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[p_25_0<=p_18_1 | r_34_2<=p_23_0] | [2<=p_11_0 & r_6_0<=r_2_0]]]]
normalized: E [true U ~ [[[2<=p_11_0 & r_6_0<=r_2_0] | [p_25_0<=p_18_1 | r_34_2<=p_23_0]]]]

abstracting: (r_34_2<=p_23_0)
states: 28,359,065,412,825,117,381,082,742,784 (28)
abstracting: (p_25_0<=p_18_1)
states: 43,927,870,927,597,956,639,796,232,192 (28)
abstracting: (r_6_0<=r_2_0)
states: 36,235,450,999,562,108,754,154,487,808 (28)
abstracting: (2<=p_11_0)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.140sec

checking: AG [[[[1<=p_42_1 | p_42_1<=p_7_1] | [2<=r_3_2 | p_0_2<=p_47_1]] | r_33_2<=p_11_1]]
normalized: ~ [E [true U ~ [[[[2<=r_3_2 | p_0_2<=p_47_1] | [1<=p_42_1 | p_42_1<=p_7_1]] | r_33_2<=p_11_1]]]]

abstracting: (r_33_2<=p_11_1)
states: 31,303,151,458,612,133,455,995,076,608 (28)
abstracting: (p_42_1<=p_7_1)
states: 39,465,577,795,499,131,887,404,711,936 (28)
abstracting: (1<=p_42_1)
states: 12,416,537,044,430,229,076,237,615,104 (28)
abstracting: (p_0_2<=p_47_1)
states: 38,820,513,791,250,894,021,560,631,296 (28)
abstracting: (2<=r_3_2)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[[[2<=r_32_2 & p_47_2<=r_4_2] & ~ [r_47_1<=p_20_1]] & [[p_17_1<=p_38_2 & 3<=r_31_2] | [2<=r_28_2 | 3<=r_30_2]]]]
normalized: E [true U [[[2<=r_32_2 & p_47_2<=r_4_2] & ~ [r_47_1<=p_20_1]] & [[2<=r_28_2 | 3<=r_30_2] | [p_17_1<=p_38_2 & 3<=r_31_2]]]]

abstracting: (3<=r_31_2)
states: 0
abstracting: (p_17_1<=p_38_2)
states: 37,838,257,607,682,060,095,525,486,592 (28)
abstracting: (3<=r_30_2)
states: 0
abstracting: (2<=r_28_2)
states: 0
abstracting: (r_47_1<=p_20_1)
states: 29,690,617,368,542,004,418,353,037,312 (28)
abstracting: (p_47_2<=r_4_2)
states: 38,113,070,417,987,067,317,908,930,560 (28)
abstracting: (2<=r_32_2)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

totally nodes used: 1258128(1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 211398 822011 1033409
used/not used/entry size/cache size: 812072 66296792 16 1024MB
basic ops cache: hits/miss/sum: 405842 1423432 1829274
used/not used/entry size/cache size: 3088999 13688217 12 192MB
unary ops cache: hits/miss/sum: 0 11175 11175
used/not used/entry size/cache size: 11175 8377433 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 4879 15692 20571
used/not used/entry size/cache size: 15664 2081488 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65858962
1 1241697
2 8184
3 21
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.711sec


BK_STOP 1494705865743

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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


iterations count:1526 (7), effective:300 (1)

initing FirstDep: 0m 0.000sec


iterations count:302 (1), effective:15 (0)

iterations count:220 (1), effective:5 (0)

iterations count:368 (1), effective:26 (0)

iterations count:352 (1), effective:22 (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="ResAllocation-PT-R003C050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/ResAllocation-PT-R003C050.tgz
mv ResAllocation-PT-R003C050 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is ResAllocation-PT-R003C050, 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 r061-csrt-149440955200106"
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 ;