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-3254
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 r141-csrt-149443423800003
=====================================================================

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

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: Raft_PT_02
(NrP: 28 NrTr: 52 NrArc: 159)

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

net check time: 0m 0.000sec

init dd package: 0m 1.116sec


RS generation: 0m 0.004sec


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



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

checking: ~ [EG [EF [2<=p0]]]
normalized: ~ [EG [E [true U 2<=p0]]]

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

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

MC time: 0m 0.000sec

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

abstracting: (3<=p24)
states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AF [AG [~ [2<=p19]]]
normalized: ~ [EG [E [true U 2<=p19]]]

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

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

MC time: 0m 0.000sec

checking: EF [[EF [2<=p12] & 2<=p1]]
normalized: E [true U [E [true U 2<=p12] & 2<=p1]]

abstracting: (2<=p1)
states: 0
abstracting: (2<=p12)
states: 0
-> 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: EG [EF [[2<=p18 & 2<=p26]]]
normalized: EG [E [true U [2<=p18 & 2<=p26]]]

abstracting: (2<=p26)
states: 0
abstracting: (2<=p18)
states: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[EG [2<=p0] & AF [p15<=p0]]]
normalized: E [true U [~ [EG [~ [p15<=p0]]] & EG [2<=p0]]]

abstracting: (2<=p0)
states: 0
.
EG iterations: 1
abstracting: (p15<=p0)
states: 4,881 (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: 0m 0.000sec

checking: E [EX [p9<=p23] U AG [2<=p3]]
normalized: E [EX [p9<=p23] U ~ [E [true U ~ [2<=p3]]]]

abstracting: (2<=p3)
states: 0
abstracting: (p9<=p23)
states: 6,405 (3)
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [~ [EF [[3<=p8 & p16<=p17]]]]
normalized: E [true U [3<=p8 & p16<=p17]]

abstracting: (p16<=p17)
states: 6,161 (3)
abstracting: (3<=p8)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: ~ [E [[p26<=p7 | 3<=p10] U 3<=p18]]
normalized: ~ [E [[p26<=p7 | 3<=p10] U 3<=p18]]

abstracting: (3<=p18)
states: 0
abstracting: (3<=p10)
states: 0
abstracting: (p26<=p7)
states: 5,841 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [EF [EG [2<=p2]] | A [[p3<=p22 | 2<=p7] U ~ [p13<=p23]]]
normalized: [[~ [EG [p13<=p23]] & ~ [E [p13<=p23 U [~ [[p3<=p22 | 2<=p7]] & p13<=p23]]]] | E [true U EG [2<=p2]]]

abstracting: (2<=p2)
states: 0
.
EG iterations: 1
abstracting: (p13<=p23)
states: 6,405 (3)
abstracting: (2<=p7)
states: 0
abstracting: (p3<=p22)
states: 6,405 (3)
abstracting: (p13<=p23)
states: 6,405 (3)
abstracting: (p13<=p23)
states: 6,405 (3)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: [[p24<=p24 & [p17<=p5 | EX [1<=p23]]] & AG [~ [[p12<=p6 & 3<=p17]]]]
normalized: [~ [E [true U [p12<=p6 & 3<=p17]]] & [[EX [1<=p23] | p17<=p5] & p24<=p24]]

abstracting: (p24<=p24)
states: 7,381 (3)
abstracting: (p17<=p5)
states: 6,661 (3)
abstracting: (1<=p23)
states: 1,476 (3)
.abstracting: (3<=p17)
states: 0
abstracting: (p12<=p6)
states: 6,341 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: E [~ [[1<=p19 | 1<=p11]] U [[1<=p23 & 2<=p14] & [p4<=p0 & p10<=p0]]]
normalized: E [~ [[1<=p19 | 1<=p11]] U [[p4<=p0 & p10<=p0] & [1<=p23 & 2<=p14]]]

abstracting: (2<=p14)
states: 0
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p10<=p0)
states: 4,881 (3)
abstracting: (p4<=p0)
states: 6,161 (3)
abstracting: (1<=p11)
states: 1,220 (3)
abstracting: (1<=p19)
states: 1,220 (3)
-> 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: E [[[p15<=p27 | 3<=p18] | [2<=p3 & 1<=p13]] U ~ [[3<=p4 | p18<=p18]]]
normalized: E [[[2<=p3 & 1<=p13] | [p15<=p27 | 3<=p18]] U ~ [[3<=p4 | p18<=p18]]]

abstracting: (p18<=p18)
states: 7,381 (3)
abstracting: (3<=p4)
states: 0
abstracting: (3<=p18)
states: 0
abstracting: (p15<=p27)
states: 5,506 (3)
abstracting: (1<=p13)
states: 1,220 (3)
abstracting: (2<=p3)
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 [[[~ [p22<=p26] | [1<=p23 | 2<=p14]] & [p13<=p8 & [1<=p10 | 1<=p17]]]]
normalized: E [true U [[[1<=p10 | 1<=p17] & p13<=p8] & [[1<=p23 | 2<=p14] | ~ [p22<=p26]]]]

abstracting: (p22<=p26)
states: 6,274 (3)
abstracting: (2<=p14)
states: 0
abstracting: (1<=p23)
states: 1,476 (3)
abstracting: (p13<=p8)
states: 6,341 (3)
abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (1<=p10)
states: 2,500 (3)
-> the formula is TRUE

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

MC time: 0m 0.007sec

checking: [[AX [2<=p10] & [[[p15<=p15 | 2<=p14] | ~ [p14<=p12]] | EF [p19<=p1]]] | AG [~ [[2<=p18 & p7<=p6]]]]
normalized: [~ [E [true U [2<=p18 & p7<=p6]]] | [[E [true U p19<=p1] | [~ [p14<=p12] | [p15<=p15 | 2<=p14]]] & ~ [EX [~ [2<=p10]]]]]

abstracting: (2<=p10)
states: 0
.abstracting: (2<=p14)
states: 0
abstracting: (p15<=p15)
states: 7,381 (3)
abstracting: (p14<=p12)
states: 6,161 (3)
abstracting: (p19<=p1)
states: 6,341 (3)
abstracting: (p7<=p6)
states: 6,161 (3)
abstracting: (2<=p18)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [[[~ [p14<=p11] & AX [p15<=p0]] | E [p1<=p11 U 2<=p4]] | [[[[p12<=p14 & 1<=p8] & [p3<=p25 | 3<=p16]] | 2<=p10] | AX [[2<=p15 & p15<=p12]]]]
normalized: [[~ [EX [~ [[2<=p15 & p15<=p12]]]] | [[[p3<=p25 | 3<=p16] & [p12<=p14 & 1<=p8]] | 2<=p10]] | [E [p1<=p11 U 2<=p4] | [~ [EX [~ [p15<=p0]]] & ~ [p14<=p11]]]]

abstracting: (p14<=p11)
states: 6,161 (3)
abstracting: (p15<=p0)
states: 4,881 (3)
.abstracting: (2<=p4)
states: 0
abstracting: (p1<=p11)
states: 6,341 (3)
abstracting: (2<=p10)
states: 0
abstracting: (1<=p8)
states: 1,220 (3)
abstracting: (p12<=p14)
states: 6,161 (3)
abstracting: (3<=p16)
states: 0
abstracting: (p3<=p25)
states: 6,466 (3)
abstracting: (p15<=p12)
states: 4,881 (3)
abstracting: (2<=p15)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.000sec

totally nodes used: 25531(2.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 24485 39458 63943
used/not used/entry size/cache size: 32606 67076258 16 1024MB
basic ops cache: hits/miss/sum: 32432 44487 76919
used/not used/entry size/cache size: 94464 16682752 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 455 523 978
used/not used/entry size/cache size: 523 2096629 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67083340
1 25517
2 7
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.668sec


BK_STOP 1495084955782

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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


iterations count:3486 (67), effective:148 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:820 (15), effective:47 (0)

iterations count:881 (16), effective:56 (1)

iterations count:59 (1), effective:1 (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="/tmp/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-3254"
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 r141-csrt-149443423800003"
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 ;