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

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

=== Now, execution of the tool begins

BK_START 1464164069887


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_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: 0m34.370sec


RS generation: 0m 0.119sec


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



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

checking: AX [AG [~ [2<=p3_8]]]
normalized: ~ [EX [E [true U 2<=p3_8]]]

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

FORMULA Dekker-PT-015-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 1<=flag_0_8
normalized: 1<=flag_0_8

abstracting: (1<=flag_0_8) states: 131,072 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EG [[3<=p3_11 & 2<=flag_1_11]]]
normalized: E [true U EG [[3<=p3_11 & 2<=flag_1_11]]]

abstracting: (2<=flag_1_11) states: 0
abstracting: (3<=p3_11) states: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [EX [[2<=flag_0_10 | 3<=flag_0_13]]]
normalized: E [true U EX [[2<=flag_0_10 | 3<=flag_0_13]]]

abstracting: (3<=flag_0_13) states: 0
abstracting: (2<=flag_0_10) states: 0
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AF [~ [p1_2<=p3_2]]
normalized: ~ [EG [p1_2<=p3_2]]

abstracting: (p1_2<=p3_2) states: 147,456 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.057sec

checking: EF [AG [[p3_12<=p1_10 | 3<=p0_4]]]
normalized: E [true U ~ [E [true U ~ [[p3_12<=p1_10 | 3<=p0_4]]]]]

abstracting: (3<=p0_4) states: 0
abstracting: (p3_12<=p1_10) states: 270,336 (5)
-> the formula is FALSE

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

MC time: 0m 0.155sec

checking: AG [[EF [flag_1_5<=p1_2] | AG [1<=flag_0_1]]]
normalized: ~ [E [true U ~ [[E [true U flag_1_5<=p1_2] | ~ [E [true U ~ [1<=flag_0_1]]]]]]]

abstracting: (1<=flag_0_1) states: 131,072 (5)
abstracting: (flag_1_5<=p1_2) states: 200,704 (5)
-> the formula is TRUE

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

MC time: 0m 0.016sec

checking: EF [~ [[~ [2<=p1_0] | ~ [p1_7<=flag_0_1]]]]
normalized: E [true U ~ [[~ [2<=p1_0] | ~ [p1_7<=flag_0_1]]]]

abstracting: (p1_7<=flag_0_1) states: 208,896 (5)
abstracting: (2<=p1_0) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[~ [flag_0_1<=flag_1_8] & EG [3<=flag_1_7]]]
normalized: ~ [E [true U ~ [[~ [flag_0_1<=flag_1_8] & EG [3<=flag_1_7]]]]]

abstracting: (3<=flag_1_7) states: 0
.
EG iterations: 1
abstracting: (flag_0_1<=flag_1_8) states: 217,088 (5)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[EX [p1_3<=flag_1_2] | AX [p3_5<=p3_8]]]
normalized: ~ [E [true U ~ [[EX [p1_3<=flag_1_2] | ~ [EX [~ [p3_5<=p3_8]]]]]]]

abstracting: (p3_5<=p3_8) states: 262,144 (5)
.abstracting: (p1_3<=flag_1_2) states: 217,088 (5)
.-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: AG [EG [[flag_1_3<=flag_0_13 | p3_10<=flag_1_13]]]
normalized: ~ [E [true U ~ [EG [[flag_1_3<=flag_0_13 | p3_10<=flag_1_13]]]]]

abstracting: (p3_10<=flag_1_13) states: 270,336 (5)
abstracting: (flag_1_3<=flag_0_13) states: 200,704 (5)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: ~ [E [[flag_1_5<=flag_0_1 | 1<=flag_1_6] U 3<=p1_6]]
normalized: ~ [E [[flag_1_5<=flag_0_1 | 1<=flag_1_6] U 3<=p1_6]]

abstracting: (3<=p1_6) states: 0
abstracting: (1<=flag_1_6) states: 147,456 (5)
abstracting: (flag_1_5<=flag_0_1) states: 200,704 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [EF [[p3_4<=p1_14 | p3_9<=p0_13]]]
normalized: ~ [E [true U ~ [E [true U [p3_4<=p1_14 | p3_9<=p0_13]]]]]

abstracting: (p3_9<=p0_13) states: 270,336 (5)
abstracting: (p3_4<=p1_14) states: 270,336 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [p3_14<=p3_6 & ~ [[EF [3<=p0_14] & ~ [2<=p3_6]]]]
normalized: [p3_14<=p3_6 & ~ [[~ [2<=p3_6] & E [true U 3<=p0_14]]]]

abstracting: (3<=p0_14) states: 0
abstracting: (2<=p3_6) states: 0
abstracting: (p3_14<=p3_6) states: 262,144 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [[p3_8<=p0_5 | [AF [2<=flag_1_11] & ~ [[2<=flag_0_12 & p3_11<=p1_11]]]] | 2<=flag_1_2]
normalized: [2<=flag_1_2 | [p3_8<=p0_5 | [~ [[2<=flag_0_12 & p3_11<=p1_11]] & ~ [EG [~ [2<=flag_1_11]]]]]]

abstracting: (2<=flag_1_11) states: 0

EG iterations: 0
abstracting: (p3_11<=p1_11) states: 262,144 (5)
abstracting: (2<=flag_0_12) states: 0
abstracting: (p3_8<=p0_5) states: 270,336 (5)
abstracting: (2<=flag_1_2) states: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: [~ [EX [1<=flag_1_4]] & ~ [[[[p0_0<=p3_4 & 3<=p3_3] & 1<=p1_1] & [[3<=flag_1_2 | p0_0<=p1_0] & ~ [p1_2<=flag_0_8]]]]]
normalized: [~ [[[~ [p1_2<=flag_0_8] & [3<=flag_1_2 | p0_0<=p1_0]] & [1<=p1_1 & [p0_0<=p3_4 & 3<=p3_3]]]] & ~ [EX [1<=flag_1_4]]]

abstracting: (1<=flag_1_4) states: 147,456 (5)
.abstracting: (3<=p3_3) states: 0
abstracting: (p0_0<=p3_4) states: 155,648 (5)
abstracting: (1<=p1_1) states: 131,072 (5)
abstracting: (p0_0<=p1_0) states: 147,456 (5)
abstracting: (3<=flag_1_2) states: 0
abstracting: (p1_2<=flag_0_8) states: 208,896 (5)
-> the formula is FALSE

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

MC time: 0m 0.058sec


Total processing time: 0m37.045sec


BK_STOP 1464164106990

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

340 340 396 413 444 513
iterations count:6155 (24), effective:212 (0)

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

iterations count:266 (1), effective:2 (0)

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

iterations count:255 (1), effective:0 (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-015"
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-015.tgz
mv S_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 S_Dekker-PT-015, 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-146416257900012"
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 ;