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 Raft-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r061-csrt-149440955000007
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494705758910

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=ReachabilityCardinality.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.187sec


RS generation: 0m 0.005sec


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



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

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

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

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

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-02-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-02-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (2<=p4)
states: 0
abstracting: (p7<=p26)
states: 6,466 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [~ [[~ [3<=p1] & [1<=p22 & 1<=p6]]]]
normalized: ~ [E [true U [[1<=p22 & 1<=p6] & ~ [3<=p1]]]]

abstracting: (3<=p1)
states: 0
abstracting: (1<=p6)
states: 1,220 (3)
abstracting: (1<=p22)
states: 1,476 (3)
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: EF [~ [~ [[p12<=p9 & 3<=p22]]]]
normalized: E [true U [p12<=p9 & 3<=p22]]

abstracting: (3<=p22)
states: 0
abstracting: (p12<=p9)
states: 6,341 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[p24<=p0 & 3<=p11] | 2<=p25] & 1<=p17]]
normalized: E [true U [[[p24<=p0 & 3<=p11] | 2<=p25] & 1<=p17]]

abstracting: (1<=p17)
states: 1,220 (3)
abstracting: (2<=p25)
states: 0
abstracting: (3<=p11)
states: 0
abstracting: (p24<=p0)
states: 5,905 (3)
-> the formula is FALSE

FORMULA Raft-PT-02-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[p3<=p25 | [p6<=p6 | 2<=p3]]]]
normalized: E [true U ~ [[[p6<=p6 | 2<=p3] | p3<=p25]]]

abstracting: (p3<=p25)
states: 6,466 (3)
abstracting: (2<=p3)
states: 0
abstracting: (p6<=p6)
states: 7,381 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [~ [[[p12<=p19 | p11<=p26] & 3<=p21]]]
normalized: ~ [E [true U [[p12<=p19 | p11<=p26] & 3<=p21]]]

abstracting: (3<=p21)
states: 0
abstracting: (p11<=p26)
states: 6,466 (3)
abstracting: (p12<=p19)
states: 6,341 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[p8<=p7 & [[1<=p1 | p12<=p15] & [2<=p15 & 2<=p24]]]]
normalized: E [true U [[[2<=p15 & 2<=p24] & [1<=p1 | p12<=p15]] & p8<=p7]]

abstracting: (p8<=p7)
states: 6,161 (3)
abstracting: (p12<=p15)
states: 6,161 (3)
abstracting: (1<=p1)
states: 1,220 (3)
abstracting: (2<=p24)
states: 0
abstracting: (2<=p15)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[p25<=p26 & 3<=p13] & [3<=p10 & 3<=p27]] & ~ [p17<=p27]]]
normalized: E [true U [~ [p17<=p27] & [[3<=p10 & 3<=p27] & [p25<=p26 & 3<=p13]]]]

abstracting: (3<=p13)
states: 0
abstracting: (p25<=p26)
states: 5,536 (3)
abstracting: (3<=p27)
states: 0
abstracting: (3<=p10)
states: 0
abstracting: (p17<=p27)
states: 6,466 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[p1<=p17 & 2<=p27] | [p14<=p17 & 3<=p26]] & ~ [[3<=p20 & 3<=p19]]]]
normalized: E [true U [~ [[3<=p20 & 3<=p19]] & [[p14<=p17 & 3<=p26] | [p1<=p17 & 2<=p27]]]]

abstracting: (2<=p27)
states: 0
abstracting: (p1<=p17)
states: 6,341 (3)
abstracting: (3<=p26)
states: 0
abstracting: (p14<=p17)
states: 6,341 (3)
abstracting: (3<=p19)
states: 0
abstracting: (3<=p20)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[p12<=p9 | [~ [p1<=p2] | [p0<=p21 | p2<=p10]]]]
normalized: ~ [E [true U ~ [[[[p0<=p21 | p2<=p10] | ~ [p1<=p2]] | p12<=p9]]]]

abstracting: (p12<=p9)
states: 6,341 (3)
abstracting: (p1<=p2)
states: 6,161 (3)
abstracting: (p2<=p10)
states: 6,661 (3)
abstracting: (p0<=p21)
states: 7,380 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

totally nodes used: 11954(1.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 15645 26176 41821
used/not used/entry size/cache size: 21146 67087718 16 1024MB
basic ops cache: hits/miss/sum: 17538 23961 41499
used/not used/entry size/cache size: 46979 16730237 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: 302 350 652
used/not used/entry size/cache size: 350 2096802 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 67096911
1 11952
2 1
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.723sec


BK_STOP 1494705760663

--------------------
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:809 (15), effective:52 (1)

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="ReachabilityCardinality"
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/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-3254"
echo " Executing tool marcie"
echo " Input is Raft-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r061-csrt-149440955000007"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;