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 S_Dekker-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416257900003
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464163911152


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: Dekker_PT_010
(NrP: 50 NrTr: 120 NrArc: 820)

net check time: 0m 0.000sec

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

init dd package: 0m45.742sec


RS generation: 0m 0.036sec


-> reachability set: #nodes 200 (2.0e+02) #states 6,144 (3)



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

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

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

FORMULA Dekker-PT-010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [EX [[1<=p34 | 1<=flag_1_5]]]
normalized: ~ [E [true U ~ [EX [[1<=p34 | 1<=flag_1_5]]]]]

abstracting: (1<=flag_1_5) states: 3,328 (3)
abstracting: (1<=p34) states: 512
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: E [EF [1<=p3_3] U AX [2<=flag_1_1]]
normalized: E [E [true U 1<=p3_3] U ~ [EX [~ [2<=flag_1_1]]]]

abstracting: (2<=flag_1_1) states: 0
.abstracting: (1<=p3_3) states: 512
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: A [~ [~ [p0_8<=p0_4]] U EF [2<=p0_8]]
normalized: [~ [E [~ [E [true U 2<=p0_8]] U [~ [E [true U 2<=p0_8]] & ~ [p0_8<=p0_4]]]] & ~ [EG [~ [E [true U 2<=p0_8]]]]]

abstracting: (2<=p0_8) states: 0

EG iterations: 0
abstracting: (p0_8<=p0_4) states: 4,608 (3)
abstracting: (2<=p0_8) states: 0
abstracting: (2<=p0_8) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EF [~ [~ [3<=p0_0]]] & EG [EG [p1_7<=p3_9]]]
normalized: [E [true U 3<=p0_0] & EG [EG [p1_7<=p3_9]]]

abstracting: (p1_7<=p3_9) states: 3,584 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (3<=p0_0) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: E [flag_1_8<=p3_2 U 3<=p3_2]
normalized: E [flag_1_8<=p3_2 U 3<=p3_2]

abstracting: (3<=p3_2) states: 0
abstracting: (flag_1_8<=p3_2) states: 3,072 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [p3_0<=p1_5 U AF [3<=flag_1_7]]
normalized: E [p3_0<=p1_5 U ~ [EG [~ [3<=flag_1_7]]]]

abstracting: (3<=flag_1_7) states: 0

EG iterations: 0
abstracting: (p3_0<=p1_5) states: 5,888 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[flag_0_3<=p3_3 & 2<=flag_0_2]]]]
normalized: E [true U [flag_0_3<=p3_3 & 2<=flag_0_2]]

abstracting: (2<=flag_0_2) states: 0
abstracting: (flag_0_3<=p3_3) states: 3,328 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [EF [flag_1_8<=p1_9] U AF [3<=p3_3]]
normalized: E [E [true U flag_1_8<=p1_9] U ~ [EG [~ [3<=p3_3]]]]

abstracting: (3<=p3_3) states: 0

EG iterations: 0
abstracting: (flag_1_8<=p1_9) states: 4,352 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [EF [[2<=p0_8 & p3_0<=p34]]]
normalized: EX [E [true U [2<=p0_8 & p3_0<=p34]]]

abstracting: (p3_0<=p34) states: 5,632 (3)
abstracting: (2<=p0_8) states: 0
.-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[EF [2<=p3_2] & AG [p1_6<=flag_0_1]]]
normalized: E [true U [E [true U 2<=p3_2] & ~ [E [true U ~ [p1_6<=flag_0_1]]]]]

abstracting: (p1_6<=flag_0_1) states: 4,608 (3)
abstracting: (2<=p3_2) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: E [~ [[p1_0<=flag_1_3 & 3<=flag_0_8]] U AG [2<=p1_0]]
normalized: E [~ [[p1_0<=flag_1_3 & 3<=flag_0_8]] U ~ [E [true U ~ [2<=p1_0]]]]

abstracting: (2<=p1_0) states: 0
abstracting: (3<=flag_0_8) states: 0
abstracting: (p1_0<=flag_1_3) states: 4,864 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [[EF [2<=flag_1_5] & [[3<=p1_7 | 2<=flag_0_8] | ~ [2<=p0_1]]]]
normalized: ~ [EX [~ [[[~ [2<=p0_1] | [3<=p1_7 | 2<=flag_0_8]] & E [true U 2<=flag_1_5]]]]]

abstracting: (2<=flag_1_5) states: 0
abstracting: (2<=flag_0_8) states: 0
abstracting: (3<=p1_7) states: 0
abstracting: (2<=p0_1) states: 0
.-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EF [2<=p0_6] & E [~ [flag_1_0<=flag_1_3] U [2<=p3_5 | 1<=flag_0_0]]]
normalized: [E [true U 2<=p0_6] & E [~ [flag_1_0<=flag_1_3] U [2<=p3_5 | 1<=flag_0_0]]]

abstracting: (1<=flag_0_0) states: 2,816 (3)
abstracting: (2<=p3_5) states: 0
abstracting: (flag_1_0<=flag_1_3) states: 4,608 (3)
abstracting: (2<=p0_6) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: E [~ [[flag_0_8<=flag_1_2 & 1<=flag_1_7]] U [[3<=flag_1_8 & 1<=p1_6] & [3<=p3_0 | 1<=flag_0_2]]]
normalized: E [~ [[flag_0_8<=flag_1_2 & 1<=flag_1_7]] U [[3<=p3_0 | 1<=flag_0_2] & [3<=flag_1_8 & 1<=p1_6]]]

abstracting: (1<=p1_6) states: 2,816 (3)
abstracting: (3<=flag_1_8) states: 0
abstracting: (1<=flag_0_2) states: 2,816 (3)
abstracting: (3<=p3_0) states: 0
abstracting: (1<=flag_1_7) states: 3,328 (3)
abstracting: (flag_0_8<=flag_1_2) states: 4,864 (3)
-> the formula is FALSE

FORMULA Dekker-PT-010-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [EF [3<=flag_1_0]] | [[~ [[3<=p0_7 & 3<=flag_1_7]] | EG [flag_0_7<=p3_6]] & [~ [[1<=flag_0_3 | p3_1<=flag_1_2]] | 3<=p0_1]]]
normalized: [[[3<=p0_1 | ~ [[1<=flag_0_3 | p3_1<=flag_1_2]]] & [EG [flag_0_7<=p3_6] | ~ [[3<=p0_7 & 3<=flag_1_7]]]] | ~ [E [true U 3<=flag_1_0]]]

abstracting: (3<=flag_1_0) states: 0
abstracting: (3<=flag_1_7) states: 0
abstracting: (3<=p0_7) states: 0
abstracting: (flag_0_7<=p3_6) states: 3,584 (3)
.
EG iterations: 1
abstracting: (p3_1<=flag_1_2) states: 5,888 (3)
abstracting: (1<=flag_0_3) states: 2,816 (3)
abstracting: (3<=p0_1) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec


Total processing time: 0m47.337sec


BK_STOP 1464163958531

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

162
iterations count:1679 (13), effective:93 (0)

initing FirstDep: 0m 0.000sec


iterations count:120 (1), effective:0 (0)

iterations count:743 (6), effective:30 (0)

iterations count:252 (2), effective:4 (0)

iterations count:238 (1), effective:3 (0)

iterations count:138 (1), effective:3 (0)

iterations count:120 (1), effective:0 (0)

iterations count:128 (1), effective:3 (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="S_Dekker-PT-010"
export BK_EXAMINATION="CTLCardinality"
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/S_Dekker-PT-010.tgz
mv S_Dekker-PT-010 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 S_Dekker-PT-010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r149kn-smll-146416257900003"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;