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 FlexibleBarrier-PT-12a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581023800079
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495813790872

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: FlexibleBarrier_PT_12a
(NrP: 147 NrTr: 448 NrArc: 2045)

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

net check time: 0m 0.000sec

init dd package: 0m 1.194sec


after gc: zbdd nodes used:134213, unused:18615787
RS generation: 0m42.325sec


-> reachability set: #nodes 180293 (1.8e+05) #states 8,916,100,448,257 (12)



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

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

abstracting: (1<=p91)
states: 743,008,370,688 (11)

after gc: zbdd nodes used:307265, unused:37192735
after gc: zbdd nodes used:240707, unused:74759293-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m32.961sec

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

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

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

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

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

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p99<=p79]
normalized: ~ [E [true U ~ [p99<=p79]]]

abstracting: (p99<=p79)
states: 8,235,009,441,793 (12)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 8.518sec

checking: AG [p79<=p23]
normalized: ~ [E [true U ~ [p79<=p23]]]

abstracting: (p79<=p23)
states: 8,235,009,441,793 (12)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 8.005sec

checking: AG [p112<=p22]
normalized: ~ [E [true U ~ [p112<=p22]]]

abstracting: (p112<=p22)
states: 8,235,009,441,793 (12)

after gc: zbdd nodes used:593047, unused:149406953-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 2.546sec

checking: AG [p133<=p21]
normalized: ~ [E [true U ~ [p133<=p21]]]

abstracting: (p133<=p21)
states: 8,235,009,441,793 (12)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.364sec

checking: AG [~ [~ [p6<=p119]]]
normalized: ~ [E [true U ~ [p6<=p119]]]

abstracting: (p6<=p119)
states: 8,235,009,441,793 (12)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 4.666sec

checking: AG [p65<=p107]
normalized: ~ [E [true U ~ [p65<=p107]]]

abstracting: (p65<=p107)
states: 8,235,009,441,793 (12)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 4.393sec

checking: AG [~ [[1<=p29 & [1<=p27 | 1<=p59]]]]
normalized: ~ [E [true U [1<=p29 & [1<=p27 | 1<=p59]]]]

abstracting: (1<=p59)
states: 743,008,370,688 (11)
abstracting: (1<=p27)
states: 743,008,370,688 (11)
abstracting: (1<=p29)
states: 743,008,370,688 (11)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.149sec

checking: EF [~ [[[3<=p134 | 3<=p9] | p122<=p66]]]
normalized: E [true U ~ [[p122<=p66 | [3<=p134 | 3<=p9]]]]

abstracting: (3<=p9)
states: 0
abstracting: (3<=p134)
states: 0
abstracting: (p122<=p66)
states: 8,235,009,441,793 (12)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m27.966sec

checking: AG [~ [[[p125<=p32 & 3<=p146] & ~ [1<=p10]]]]
normalized: ~ [E [true U [~ [1<=p10] & [p125<=p32 & 3<=p146]]]]

abstracting: (3<=p146)
states: 0
abstracting: (p125<=p32)
states: 8,235,009,441,793 (12)
abstracting: (1<=p10)
states: 743,008,370,688 (11)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.668sec

checking: AG [[~ [3<=p143] & [p37<=p72 | ~ [p49<=p88]]]]
normalized: ~ [E [true U ~ [[[p37<=p72 | ~ [p49<=p88]] & ~ [3<=p143]]]]]

abstracting: (3<=p143)
states: 0
abstracting: (p49<=p88)
states: 8,235,009,441,793 (12)
abstracting: (p37<=p72)
states: 8,235,009,441,793 (12)

after gc: zbdd nodes used:1262406, unused:298737594-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m33.518sec

checking: AG [[[~ [p35<=p91] | p36<=p84] | p126<=p126]]
normalized: ~ [E [true U ~ [[p126<=p126 | [p36<=p84 | ~ [p35<=p91]]]]]]

abstracting: (p35<=p91)
states: 8,235,009,441,793 (12)
abstracting: (p36<=p84)
states: 8,235,009,441,793 (12)
abstracting: (p126<=p126)
states: 8,916,100,448,257 (12)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.340sec

checking: AG [[[[1<=p47 | p21<=p26] | [1<=p54 | p46<=p41]] | ~ [~ [1<=p41]]]]
normalized: ~ [E [true U ~ [[1<=p41 | [[1<=p54 | p46<=p41] | [1<=p47 | p21<=p26]]]]]]

abstracting: (p21<=p26)
states: 8,235,009,441,793 (12)
abstracting: (1<=p47)
states: 743,008,370,688 (11)
abstracting: (p46<=p41)
states: 8,173,092,077,569 (12)
abstracting: (1<=p54)
states: 743,008,370,688 (11)
abstracting: (1<=p41)
states: 743,008,370,688 (11)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m13.723sec

checking: EF [[[[p76<=p132 | p129<=p114] & ~ [p54<=p78]] & [2<=p101 & [2<=p72 | p94<=p106]]]]
normalized: E [true U [[2<=p101 & [2<=p72 | p94<=p106]] & [~ [p54<=p78] & [p76<=p132 | p129<=p114]]]]

abstracting: (p129<=p114)
states: 8,235,009,441,793 (12)
abstracting: (p76<=p132)
states: 8,235,009,441,793 (12)
abstracting: (p54<=p78)
states: 8,235,009,441,793 (12)
abstracting: (p94<=p106)
states: 8,235,009,441,793 (12)
abstracting: (2<=p72)
states: 0
abstracting: (2<=p101)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.091sec

totally nodes used: 366031494(3.7e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 409724264 471788029 881512293
used/not used/entry size/cache size: 48425758 18683106 16 1024MB
basic ops cache: hits/miss/sum: 737057058 911023547 1648080605
used/not used/entry size/cache size: 16777171 45 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: 2172405 2248903 4421308
used/not used/entry size/cache size: 603513 1493639 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 21017463
1 24392239
2 14160474
3 5485044
4 1595419
5 371656
6 72481
7 12068
8 1728
9 251
>= 10 41

Total processing time: 14m14.321sec


BK_STOP 1495814645424

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


iterations count:13189 (29), effective:254 (0)

initing FirstDep: 0m 0.001sec


iterations count:2284 (5), effective:23 (0)

iterations count:2327 (5), effective:24 (0)

iterations count:2340 (5), effective:24 (0)

iterations count:2505 (5), effective:24 (0)

iterations count:1423 (3), effective:13 (0)

iterations count:2045 (4), effective:24 (0)

iterations count:2323 (5), effective:24 (0)

iterations count:3165 (7), effective:45 (0)

iterations count:2782 (6), effective:24 (0)

iterations count:2757 (6), effective:37 (0)

iterations count:3194 (7), effective:47 (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="FlexibleBarrier-PT-12a"
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/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a 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 FlexibleBarrier-PT-12a, 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 r181-blw3-149581023800079"
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 ;