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-2265
Executing tool marcie
Input is S_ResAllocation-PT-R015C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r218st-ebro-143344930401153
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433783137654

Model: S_ResAllocation-PT-R015C002
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: 60 NrTr: 32 NrArc: 150)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 160 (1.6e+02) #states 278,528 (5)



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

checking: AG [~ [[[1<=p_1_13 | 1<=r_1_13] & [3<=r_1_14 & r_1_0<=p_0_5]]]]
normalized: ~ [E [true U [[1<=p_1_13 | 1<=r_1_13] & [3<=r_1_14 & r_1_0<=p_0_5]]]]

abstracting: (r_1_0<=p_0_5) states: 106,496 (5)
abstracting: (3<=r_1_14) states: 0
abstracting: (1<=r_1_13) states: 155,648 (5)
abstracting: (1<=p_1_13) states: 122,880 (5)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[~ [p_0_12<=r_1_5] & [2<=r_1_12 | p_0_14<=p_1_14]] & ~ [~ [r_1_1<=p_1_7]]]]
normalized: E [true U [r_1_1<=p_1_7 & [[2<=r_1_12 | p_0_14<=p_1_14] & ~ [p_0_12<=r_1_5]]]]

abstracting: (p_0_12<=r_1_5) states: 278,528 (5)
abstracting: (p_0_14<=p_1_14) states: 262,144 (5)
abstracting: (2<=r_1_12) states: 0
abstracting: (r_1_1<=p_1_7) states: 86,016 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [~ [p_0_5<=r_0_7]] | p_1_1<=r_1_8]]
normalized: ~ [E [true U ~ [[p_0_5<=r_0_7 | p_1_1<=r_1_8]]]]

abstracting: (p_1_1<=r_1_8) states: 266,240 (5)
abstracting: (p_0_5<=r_0_7) states: 229,376 (5)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (3<=p_0_2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [3<=p_1_14]
normalized: E [true U 3<=p_1_14]

abstracting: (3<=p_1_14) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (p_0_1<=r_1_3) states: 266,240 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[[r_0_12<=p_1_6 | p_0_13<=r_1_3] | 1<=r_1_8] | [[3<=p_0_5 | 3<=r_1_2] | p_0_9<=p_1_6]]]
normalized: ~ [E [true U ~ [[[p_0_9<=p_1_6 | [3<=p_0_5 | 3<=r_1_2]] | [1<=r_1_8 | [r_0_12<=p_1_6 | p_0_13<=r_1_3]]]]]]

abstracting: (p_0_13<=r_1_3) states: 278,528 (5)
abstracting: (r_0_12<=p_1_6) states: 180,224 (5)
abstracting: (1<=r_1_8) states: 196,608 (5)
abstracting: (3<=r_1_2) states: 0
abstracting: (3<=p_0_5) states: 0
abstracting: (p_0_9<=p_1_6) states: 221,184 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [~ [3<=r_1_5]] & ~ [~ [1<=p_1_4]]]]
normalized: E [true U [3<=r_1_5 & 1<=p_1_4]]

abstracting: (1<=p_1_4) states: 49,152 (4)
abstracting: (3<=r_1_5) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=r_0_3) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (p_1_3<=r_1_2) states: 262,144 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [1<=p_0_10] | [~ [2<=r_1_2] & ~ [r_0_12<=p_0_8]]]]
normalized: ~ [E [true U ~ [[[~ [2<=r_1_2] & ~ [r_0_12<=p_0_8]] | ~ [1<=p_0_10]]]]]

abstracting: (1<=p_0_10) states: 49,152 (4)
abstracting: (r_0_12<=p_0_8) states: 176,128 (5)
abstracting: (2<=r_1_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [2<=r_1_10] & [[2<=p_0_3 | 3<=r_1_4] & [1<=r_0_5 & r_0_7<=r_0_6]]]]
normalized: E [true U [~ [2<=r_1_10] & [[2<=p_0_3 | 3<=r_1_4] & [1<=r_0_5 & r_0_7<=r_0_6]]]]

abstracting: (r_0_7<=r_0_6) states: 208,896 (5)
abstracting: (1<=r_0_5) states: 131,072 (5)
abstracting: (3<=r_1_4) states: 0
abstracting: (2<=p_0_3) states: 0
abstracting: (2<=r_1_10) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [[p_0_9<=r_1_8 & 3<=r_1_3]] | ~ [[2<=r_0_2 | r_0_12<=p_0_12]]]]
normalized: ~ [E [true U ~ [[~ [[2<=r_0_2 | r_0_12<=p_0_12]] | ~ [[p_0_9<=r_1_8 & 3<=r_1_3]]]]]]

abstracting: (3<=r_1_3) states: 0
abstracting: (p_0_9<=r_1_8) states: 278,528 (5)
abstracting: (r_0_12<=p_0_12) states: 147,456 (5)
abstracting: (2<=r_0_2) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[p_0_14<=r_0_9 | [1<=r_0_9 | 1<=r_1_4]] & [p_0_14<=r_1_8 & ~ [3<=r_1_11]]]]
normalized: ~ [E [true U ~ [[[p_0_14<=r_1_8 & ~ [3<=r_1_11]] & [p_0_14<=r_0_9 | [1<=r_0_9 | 1<=r_1_4]]]]]]

abstracting: (1<=r_1_4) states: 229,376 (5)
abstracting: (1<=r_0_9) states: 131,072 (5)
abstracting: (p_0_14<=r_0_9) states: 270,336 (5)
abstracting: (3<=r_1_11) states: 0
abstracting: (p_0_14<=r_1_8) states: 278,528 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

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

abstracting: (3<=p_1_8) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m10sec


BK_STOP 1433783148320

--------------------
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:871 (27), effective:240 (7)

initing FirstDep: 0m0sec


iterations count:359 (11), effective:95 (2)

iterations count:430 (13), effective:116 (3)

iterations count:327 (10), effective:95 (2)

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_ResAllocation-PT-R015C002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_ResAllocation-PT-R015C002.tgz
mv S_ResAllocation-PT-R015C002 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is S_ResAllocation-PT-R015C002, 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 r218st-ebro-143344930401153"
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 '' 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 ;