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 Dekker-PT-015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r029kn-smll-146348014700016
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463480723528


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: Dekker_PT_015
(NrP: 75 NrTr: 255 NrArc: 1830)

net check time: 0m 0.000sec

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

init dd package: 0m 3.869sec


RS generation: 0m 0.098sec


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



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

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

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

FORMULA Dekker-PT-015-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Dekker-PT-015-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Dekker-PT-015-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Dekker-PT-015-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[1<=flag_1_0 & 3<=flag_1_3] | 3<=flag_1_4]]]
normalized: ~ [E [true U [3<=flag_1_4 | [1<=flag_1_0 & 3<=flag_1_3]]]]

abstracting: (3<=flag_1_3) states: 0
abstracting: (1<=flag_1_0) states: 147,456 (5)
abstracting: (3<=flag_1_4) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[2<=p1_6 & flag_0_9<=p0_14]]
normalized: E [true U [2<=p1_6 & flag_0_9<=p0_14]]

abstracting: (flag_0_9<=p0_14) states: 208,896 (5)
abstracting: (2<=p1_6) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[3<=p1_12 & p1_7<=p0_5]]]
normalized: ~ [E [true U [3<=p1_12 & p1_7<=p0_5]]]

abstracting: (p1_7<=p0_5) states: 208,896 (5)
abstracting: (3<=p1_12) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [flag_1_13<=p3_12] & 2<=flag_1_7]]
normalized: E [true U [2<=flag_1_7 & ~ [flag_1_13<=p3_12]]]

abstracting: (flag_1_13<=p3_12) states: 139,264 (5)
abstracting: (2<=flag_1_7) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[p1_4<=flag_1_7 | p3_5<=flag_0_10] | 2<=p0_10]]]
normalized: E [true U ~ [[2<=p0_10 | [p1_4<=flag_1_7 | p3_5<=flag_0_10]]]]

abstracting: (p3_5<=flag_0_10) states: 270,336 (5)
abstracting: (p1_4<=flag_1_7) states: 217,088 (5)
abstracting: (2<=p0_10) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

checking: AG [~ [[[flag_0_0<=p1_11 & 1<=p0_12] & [2<=p3_12 & 2<=p0_4]]]]
normalized: ~ [E [true U [[2<=p3_12 & 2<=p0_4] & [flag_0_0<=p1_11 & 1<=p0_12]]]]

abstracting: (1<=p0_12) states: 131,072 (5)
abstracting: (flag_0_0<=p1_11) states: 208,896 (5)
abstracting: (2<=p0_4) states: 0
abstracting: (2<=p3_12) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [2<=p3_6] | [p0_0<=flag_0_3 & p3_2<=p1_7]] & 2<=flag_0_12]]
normalized: E [true U [2<=flag_0_12 & [~ [2<=p3_6] | [p0_0<=flag_0_3 & p3_2<=p1_7]]]]

abstracting: (p3_2<=p1_7) states: 270,336 (5)
abstracting: (p0_0<=flag_0_3) states: 208,896 (5)
abstracting: (2<=p3_6) states: 0
abstracting: (2<=flag_0_12) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[p1_0<=p1_13 & 3<=p3_5] & ~ [1<=p1_14]] & ~ [[2<=p3_1 & flag_1_8<=flag_1_10]]]]
normalized: E [true U [[~ [1<=p1_14] & [p1_0<=p1_13 & 3<=p3_5]] & ~ [[2<=p3_1 & flag_1_8<=flag_1_10]]]]

abstracting: (flag_1_8<=flag_1_10) states: 208,896 (5)
abstracting: (2<=p3_1) states: 0
abstracting: (3<=p3_5) states: 0
abstracting: (p1_0<=p1_13) states: 208,896 (5)
abstracting: (1<=p1_14) states: 131,072 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[p3_0<=flag_1_1 & flag_0_0<=p1_10] & p3_9<=flag_0_7] | ~ [~ [p3_10<=flag_0_0]]]]
normalized: ~ [E [true U ~ [[p3_10<=flag_0_0 | [p3_9<=flag_0_7 & [p3_0<=flag_1_1 & flag_0_0<=p1_10]]]]]]

abstracting: (flag_0_0<=p1_10) states: 208,896 (5)
abstracting: (p3_0<=flag_1_1) states: 270,336 (5)
abstracting: (p3_9<=flag_0_7) states: 270,336 (5)
abstracting: (p3_10<=flag_0_0) states: 270,336 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[p3_10<=flag_0_2 | 1<=flag_1_10] | [p3_5<=p1_2 | p0_13<=p1_3]] | flag_0_9<=flag_1_11]]
normalized: ~ [E [true U ~ [[flag_0_9<=flag_1_11 | [[p3_5<=p1_2 | p0_13<=p1_3] | [p3_10<=flag_0_2 | 1<=flag_1_10]]]]]]

abstracting: (1<=flag_1_10) states: 147,456 (5)
abstracting: (p3_10<=flag_0_2) states: 270,336 (5)
abstracting: (p0_13<=p1_3) states: 208,896 (5)
abstracting: (p3_5<=p1_2) states: 270,336 (5)
abstracting: (flag_0_9<=flag_1_11) states: 217,088 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[2<=p3_12 & 3<=flag_1_2] | [3<=p0_14 & 1<=flag_0_8]] | [~ [flag_1_5<=flag_0_13] & [3<=p1_6 & p3_3<=p3_13]]]]
normalized: E [true U [[~ [flag_1_5<=flag_0_13] & [3<=p1_6 & p3_3<=p3_13]] | [[3<=p0_14 & 1<=flag_0_8] | [2<=p3_12 & 3<=flag_1_2]]]]

abstracting: (3<=flag_1_2) states: 0
abstracting: (2<=p3_12) states: 0
abstracting: (1<=flag_0_8) states: 131,072 (5)
abstracting: (3<=p0_14) states: 0
abstracting: (p3_3<=p3_13) states: 262,144 (5)
abstracting: (3<=p1_6) states: 0
abstracting: (flag_1_5<=flag_0_13) states: 200,704 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[2<=p0_3 | 2<=flag_1_1] & [flag_0_10<=p3_2 | p1_6<=p0_14]] & ~ [[2<=p3_3 & p3_2<=p3_7]]]]
normalized: E [true U [~ [[2<=p3_3 & p3_2<=p3_7]] & [[flag_0_10<=p3_2 | p1_6<=p0_14] & [2<=p0_3 | 2<=flag_1_1]]]]

abstracting: (2<=flag_1_1) states: 0
abstracting: (2<=p0_3) states: 0
abstracting: (p1_6<=p0_14) states: 208,896 (5)
abstracting: (flag_0_10<=p3_2) states: 155,648 (5)
abstracting: (p3_2<=p3_7) states: 262,144 (5)
abstracting: (2<=p3_3) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec


Total processing time: 0m 5.541sec


BK_STOP 1463480729105

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

137 187 221 366 579
iterations count:5002 (19), effective:190 (0)

initing FirstDep: 0m 0.000sec

394 513
iterations count:2301 (9), effective:61 (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="Dekker-PT-015"
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/Dekker-PT-015.tgz
mv Dekker-PT-015 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 Dekker-PT-015, 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 r029kn-smll-146348014700016"
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 ;