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 DNAwalker-PT-02track12Block2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027200286
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464971869336


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: DNAwalker_PT_02track12Block2
(NrP: 14 NrTr: 84 NrArc: 244)

net check time: 0m 0.000sec

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

init dd package: 0m 4.211sec


RS generation: 0m 0.058sec


-> reachability set: #nodes 123 (1.2e+02) #states 5,459 (3)



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

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

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

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [3<=A4] & ~ [3<=A8]]]]
normalized: E [true U ~ [[~ [3<=A4] & ~ [3<=A8]]]]

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

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[A7<=A7 | ~ [~ [3<=A11]]]]
normalized: ~ [E [true U ~ [[A7<=A7 | 3<=A11]]]]

abstracting: (3<=A11) states: 0
abstracting: (A7<=A7) states: 5,459 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [~ [3<=A12]] & ~ [A3<=A8]]]
normalized: E [true U [3<=A12 & ~ [A3<=A8]]]

abstracting: (A3<=A8) states: 4,996 (3)
abstracting: (3<=A12) states: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[B5<=A7 & 3<=A11]]]
normalized: ~ [E [true U [B5<=A7 & 3<=A11]]]

abstracting: (3<=A11) states: 0
abstracting: (B5<=A7) states: 4,839 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [A8<=A6] | 1<=B6] | ~ [[3<=A9 & 3<=A2]]]]
normalized: ~ [E [true U ~ [[~ [[3<=A9 & 3<=A2]] | [1<=B6 | ~ [A8<=A6]]]]]]

abstracting: (A8<=A6) states: 1,717 (3)
abstracting: (1<=B6) states: 1,611 (3)
abstracting: (3<=A2) states: 0
abstracting: (3<=A9) states: 0
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [3<=A1] | [3<=A10 | A5<=B5]] | ~ [3<=A11]]]
normalized: ~ [E [true U ~ [[~ [3<=A11] | [~ [3<=A1] | [3<=A10 | A5<=B5]]]]]]

abstracting: (A5<=B5) states: 3,609 (3)
abstracting: (3<=A10) states: 0
abstracting: (3<=A1) states: 0
abstracting: (3<=A11) states: 0
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[A4<=A12 | A7<=A4]] & A11<=A6]]
normalized: E [true U [A11<=A6 & ~ [[A4<=A12 | A7<=A4]]]]

abstracting: (A7<=A4) states: 3,687 (3)
abstracting: (A4<=A12) states: 4,996 (3)
abstracting: (A11<=A6) states: 3,295 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[B6<=A1 | A9<=B6] & A6<=A6] & 3<=A3]]
normalized: E [true U [3<=A3 & [A6<=A6 & [B6<=A1 | A9<=B6]]]]

abstracting: (A9<=B6) states: 3,513 (3)
abstracting: (B6<=A1) states: 3,851 (3)
abstracting: (A6<=A6) states: 5,459 (3)
abstracting: (3<=A3) states: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[A11<=A12 & [3<=B5 & 3<=A8]] & ~ [[1<=B6 & A11<=A4]]]]
normalized: E [true U [~ [[1<=B6 & A11<=A4]] & [A11<=A12 & [3<=B5 & 3<=A8]]]]

abstracting: (3<=A8) states: 0
abstracting: (3<=B5) states: 0
abstracting: (A11<=A12) states: 4,988 (3)
abstracting: (A11<=A4) states: 3,680 (3)
abstracting: (1<=B6) states: 1,611 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[A9<=B6 | 2<=B5]] & [[1<=A12 & 1<=A1] & ~ [A10<=A7]]]]
normalized: E [true U [[~ [A10<=A7] & [1<=A12 & 1<=A1]] & ~ [[A9<=B6 | 2<=B5]]]]

abstracting: (2<=B5) states: 0
abstracting: (A9<=B6) states: 3,513 (3)
abstracting: (1<=A1) states: 9
abstracting: (1<=A12) states: 5,459 (3)
abstracting: (A10<=A7) states: 3,994 (3)
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=A5 & [[1<=A4 | A5<=A6] | [B5<=A12 & A7<=A10]]]]
normalized: E [true U [3<=A5 & [[B5<=A12 & A7<=A10] | [1<=A4 | A5<=A6]]]]

abstracting: (A5<=A6) states: 4,137 (3)
abstracting: (1<=A4) states: 2,594 (3)
abstracting: (A7<=A10) states: 3,725 (3)
abstracting: (B5<=A12) states: 5,459 (3)
abstracting: (3<=A5) states: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[3<=A6 & A4<=A8] & [[A8<=A8 & 1<=A2] | [2<=B5 | 3<=A7]]]]
normalized: E [true U [[[2<=B5 | 3<=A7] | [A8<=A8 & 1<=A2]] & [3<=A6 & A4<=A8]]]

abstracting: (A4<=A8) states: 4,996 (3)
abstracting: (3<=A6) states: 0
abstracting: (1<=A2) states: 2,805 (3)
abstracting: (A8<=A8) states: 5,459 (3)
abstracting: (3<=A7) states: 0
abstracting: (2<=B5) states: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[2<=A10 & A12<=A4]] & [3<=A4 & [A12<=A4 & A8<=A8]]]]
normalized: E [true U [~ [[2<=A10 & A12<=A4]] & [3<=A4 & [A12<=A4 & A8<=A8]]]]

abstracting: (A8<=A8) states: 5,459 (3)
abstracting: (A12<=A4) states: 2,225 (3)
abstracting: (3<=A4) states: 0
abstracting: (A12<=A4) states: 2,225 (3)
abstracting: (2<=A10) states: 471
-> the formula is FALSE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[A3<=A10 | [A6<=A2 | A10<=A12]] | ~ [[B5<=B6 | A11<=A1]]]]
normalized: ~ [E [true U ~ [[~ [[B5<=B6 | A11<=A1]] | [A3<=A10 | [A6<=A2 | A10<=A12]]]]]]

abstracting: (A10<=A12) states: 4,988 (3)
abstracting: (A6<=A2) states: 4,364 (3)
abstracting: (A3<=A10) states: 3,970 (3)
abstracting: (A11<=A1) states: 2,364 (3)
abstracting: (B5<=B6) states: 4,364 (3)
-> the formula is TRUE

FORMULA DNAwalker-PT-02track12Block2-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m 5.706sec


BK_STOP 1464971875078

--------------------
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

64 83 108 92 128 139 91 141 156 145 139
iterations count:11678 (139), effective:561 (6)

initing FirstDep: 0m 0.000sec

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="DNAwalker-PT-02track12Block2"
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/DNAwalker-PT-02track12Block2.tgz
mv DNAwalker-PT-02track12Block2 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 DNAwalker-PT-02track12Block2, 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 r221su-smll-146468027200286"
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 ;