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_Raft-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128000138
=====================================================================

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


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: Raft_PT_02
(NrP: 28 NrTr: 52 NrArc: 159)

net check time: 0m 0.000sec

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

init dd package: 0m 3.756sec


RS generation: 0m 0.015sec


-> reachability set: #nodes 94 (9.4e+01) #states 7,381 (3)



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

checking: ~ [AG [EF [1<=p8]]]
normalized: E [true U ~ [E [true U 1<=p8]]]

abstracting: (1<=p8) states: 1,220 (3)
-> the formula is FALSE

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

MC time: 0m 0.005sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (3<=p7) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: ~ [AG [EX [p14<=p7]]]
normalized: E [true U ~ [EX [p14<=p7]]]

abstracting: (p14<=p7) states: 6,341 (3)
.-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (2<=p14) states: 0

EG iterations: 0
abstracting: (2<=p14) states: 0
abstracting: (2<=p6) states: 0
abstracting: (2<=p14) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [AG [[2<=p20 | 1<=p27]]]
normalized: E [true U ~ [E [true U ~ [[2<=p20 | 1<=p27]]]]]

abstracting: (1<=p27) states: 1,845 (3)
abstracting: (2<=p20) states: 0
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: EF [AX [[3<=p6 | 1<=p0]]]
normalized: E [true U ~ [EX [~ [[3<=p6 | 1<=p0]]]]]

abstracting: (1<=p0) states: 1
abstracting: (3<=p6) states: 0
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [AX [~ [p17<=p25]]]
normalized: E [true U ~ [EX [p17<=p25]]]

abstracting: (p17<=p25) states: 6,466 (3)
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: E [EF [p6<=p5] U 2<=p17]
normalized: E [E [true U p6<=p5] U 2<=p17]

abstracting: (2<=p17) states: 0
abstracting: (p6<=p5) states: 6,661 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: A [~ [[3<=p14 | 3<=p4]] U EF [3<=p11]]
normalized: [~ [EG [~ [E [true U 3<=p11]]]] & ~ [E [~ [E [true U 3<=p11]] U [~ [E [true U 3<=p11]] & [3<=p14 | 3<=p4]]]]]

abstracting: (3<=p4) states: 0
abstracting: (3<=p14) states: 0
abstracting: (3<=p11) states: 0
abstracting: (3<=p11) states: 0
abstracting: (3<=p11) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AX [E [p24<=p16 U 3<=p17]]
normalized: ~ [EX [~ [E [p24<=p16 U 3<=p17]]]]

abstracting: (3<=p17) states: 0
abstracting: (p24<=p16) states: 6,149 (3)
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [E [~ [1<=p22] U [3<=p0 | 2<=p5]] | AG [AX [1<=p17]]]
normalized: [E [~ [1<=p22] U [3<=p0 | 2<=p5]] | ~ [E [true U EX [~ [1<=p17]]]]]

abstracting: (1<=p17) states: 1,220 (3)
.abstracting: (2<=p5) states: 0
abstracting: (3<=p0) states: 0
abstracting: (1<=p22) states: 1,476 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: E [p6<=p23 U AG [p0<=p24]]
normalized: E [p6<=p23 U ~ [E [true U ~ [p0<=p24]]]]

abstracting: (p0<=p24) states: 7,380 (3)
abstracting: (p6<=p23) states: 6,405 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [AG [EF [p7<=p17]] | ~ [EX [[p14<=p12 | 2<=p14]]]]
normalized: [~ [EX [[p14<=p12 | 2<=p14]]] | ~ [E [true U ~ [E [true U p7<=p17]]]]]

abstracting: (p7<=p17) states: 6,341 (3)
abstracting: (2<=p14) states: 0
abstracting: (p14<=p12) states: 6,161 (3)
.-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [[~ [[1<=p10 & 2<=p26]] | [p24<=p15 & [2<=p26 & 3<=p15]]]]
normalized: ~ [E [true U ~ [[[p24<=p15 & [2<=p26 & 3<=p15]] | ~ [[1<=p10 & 2<=p26]]]]]]

abstracting: (2<=p26) states: 0
abstracting: (1<=p10) states: 2,500 (3)
abstracting: (3<=p15) states: 0
abstracting: (2<=p26) states: 0
abstracting: (p24<=p15) states: 6,405 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec


Total processing time: 0m 5.414sec


BK_STOP 1464560648002

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

85 114 102
iterations count:3486 (67), effective:148 (2)

initing FirstDep: 0m 0.000sec


iterations count:356 (6), effective:21 (0)

iterations count:302 (5), effective:16 (0)

iterations count:115 (2), effective:5 (0)

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

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

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

iterations count:113 (2), effective:5 (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_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/S_Raft-PT-02.tgz
mv S_Raft-PT-02 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_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 r185kn-smll-146444128000138"
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 ;