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-2270
Executing tool marcie
Input is Raft-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r246su-smll-143368767200132
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433891878380

Model: Raft-PT-02
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 28 NrTr: 52 NrArc: 159)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 151 (1.5e+02) #states 7,381 (3)



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

checking: [EF [AX [2<=p0]] & [AX [[p24<=p14 & 2<=p20]] | EF [[3<=p18 | p12<=p19]]]]
normalized: [E [true U ~ [EX [~ [2<=p0]]]] & [~ [EX [~ [[p24<=p14 & 2<=p20]]]] | E [true U [3<=p18 | p12<=p19]]]]

abstracting: (p12<=p19) states: 6,341 (3)
abstracting: (3<=p18) states: 0
abstracting: (2<=p20) states: 0
abstracting: (p24<=p14) states: 6,149 (3)
.abstracting: (2<=p0) states: 0
.-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[p22<=p19 | 3<=p19] | AF [p0<=p27]]]
normalized: ~ [E [true U ~ [[[p22<=p19 | 3<=p19] | ~ [EG [~ [p0<=p27]]]]]]]

abstracting: (p0<=p27) states: 7,380 (3)
..
EG iterations: 2
abstracting: (3<=p19) states: 0
abstracting: (p22<=p19) states: 6,149 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[EX [3<=p13] & ~ [1<=p20]]]
normalized: E [true U [~ [1<=p20] & EX [3<=p13]]]

abstracting: (3<=p13) states: 0
.abstracting: (1<=p20) states: 2,500 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [EF [[3<=p14 & 3<=p5]]] | AG [~ [2<=p27]]]
normalized: [~ [E [true U 2<=p27]] | ~ [E [true U [3<=p14 & 3<=p5]]]]

abstracting: (3<=p5) states: 0
abstracting: (3<=p14) states: 0
abstracting: (2<=p27) states: 0
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [[AF [[p10<=p13 & p7<=p23]] & EF [[2<=p3 & p5<=p2]]]]
normalized: ~ [[E [true U [2<=p3 & p5<=p2]] & ~ [EG [~ [[p10<=p13 & p7<=p23]]]]]]

abstracting: (p7<=p23) states: 6,405 (3)
abstracting: (p10<=p13) states: 5,381 (3)
.
EG iterations: 1
abstracting: (p5<=p2) states: 4,881 (3)
abstracting: (2<=p3) states: 0
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [EG [p26<=p11] U 3<=p10]
normalized: E [EG [p26<=p11] U 3<=p10]

abstracting: (3<=p10) states: 0
abstracting: (p26<=p11) states: 5,841 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[EF [3<=p16] | AX [3<=p10]] & AG [[2<=p15 & 1<=p7]]] | EF [[[3<=p26 & p26<=p4] | [3<=p23 & 2<=p8]]]]
normalized: [E [true U [[3<=p23 & 2<=p8] | [3<=p26 & p26<=p4]]] | [~ [E [true U ~ [[2<=p15 & 1<=p7]]]] & [~ [EX [~ [3<=p10]]] | E [true U 3<=p16]]]]

abstracting: (3<=p16) states: 0
abstracting: (3<=p10) states: 0
.abstracting: (1<=p7) states: 1,220 (3)
abstracting: (2<=p15) states: 0
abstracting: (p26<=p4) states: 5,841 (3)
abstracting: (3<=p26) states: 0
abstracting: (2<=p8) states: 0
abstracting: (3<=p23) states: 0
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [E [p24<=p26 U 2<=p23]]
normalized: EG [E [p24<=p26 U 2<=p23]]

abstracting: (2<=p23) states: 0
abstracting: (p24<=p26) states: 6,274 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=p11) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Raft-PT-02-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [A [p25<=p4 U 2<=p7]]
normalized: E [true U [~ [EG [~ [2<=p7]]] & ~ [E [~ [p25<=p4] U [~ [p25<=p4] & ~ [2<=p7]]]]]]

abstracting: (2<=p7) states: 0
abstracting: (p25<=p4) states: 5,841 (3)
abstracting: (p25<=p4) states: 5,841 (3)
abstracting: (2<=p7) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [EF [~ [p7<=p5]]]
normalized: ~ [E [true U ~ [E [true U ~ [p7<=p5]]]]]

abstracting: (p7<=p5) states: 6,661 (3)
-> the formula is TRUE

FORMULA Raft-PT-02-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[3<=p24 & 2<=p16] & 1<=p7] | EF [3<=p16]] | [[[p16<=p17 | p8<=p14] | ~ [1<=p27]] & ~ [[p6<=p1 | 2<=p4]]]] | 3<=p5]
normalized: [3<=p5 | [[~ [[p6<=p1 | 2<=p4]] & [~ [1<=p27] | [p16<=p17 | p8<=p14]]] | [E [true U 3<=p16] | [1<=p7 & [3<=p24 & 2<=p16]]]]]

abstracting: (2<=p16) states: 0
abstracting: (3<=p24) states: 0
abstracting: (1<=p7) states: 1,220 (3)
abstracting: (3<=p16) states: 0
abstracting: (p8<=p14) states: 6,341 (3)
abstracting: (p16<=p17) states: 6,161 (3)
abstracting: (1<=p27) states: 1,845 (3)
abstracting: (2<=p4) states: 0
abstracting: (p6<=p1) states: 6,341 (3)
abstracting: (3<=p5) states: 0
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [AX [~ [3<=p12]]]
normalized: ~ [E [true U EX [3<=p12]]]

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

FORMULA Raft-PT-02-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [E [[p26<=p9 & p4<=p24] U p15<=p7] & E [[1<=p18 | p25<=p20] U 3<=p14]]
normalized: [E [[1<=p18 | p25<=p20] U 3<=p14] & E [[p26<=p9 & p4<=p24] U p15<=p7]]

abstracting: (p15<=p7) states: 5,381 (3)
abstracting: (p4<=p24) states: 6,405 (3)
abstracting: (p26<=p9) states: 5,841 (3)
abstracting: (3<=p14) states: 0
abstracting: (p25<=p20) states: 6,161 (3)
abstracting: (1<=p18) states: 1,220 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[EF [2<=p23] & [[2<=p24 & p13<=p5] | 2<=p19]]]
normalized: E [true U [[2<=p19 | [2<=p24 & p13<=p5]] & E [true U 2<=p23]]]

abstracting: (2<=p23) states: 0
abstracting: (p13<=p5) states: 6,661 (3)
abstracting: (2<=p24) states: 0
abstracting: (2<=p19) states: 0
-> the formula is FALSE

FORMULA Raft-PT-02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433891883005

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

159 151
iterations count:2006 (38), effective:128 (2)

initing FirstDep: 0m0sec


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

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

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

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

iterations count:444 (8), effective:26 (0)

iterations count:207 (3), effective:8 (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="Raft-PT-02"
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/Raft-PT-02.tgz
mv Raft-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is Raft-PT-02, 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 r246su-smll-143368767200132"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;