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 DLCround-PT-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951600295
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495823489813

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: DLCround_PT_08a
(NrP: 263 NrTr: 1907 NrArc: 7354)

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

net check time: 0m 0.001sec

init dd package: 0m 1.279sec


RS generation: 0m21.411sec


-> reachability set: #nodes 233468 (2.3e+05) #states 2,401,000,000,001 (12)



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

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

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

FORMULA DLCround-PT-08a-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: AG [p202<=p257]
normalized: ~ [E [true U ~ [p202<=p257]]]

abstracting: (p202<=p257)
states: 2,401,000,000,001 (12)
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p191<=p147]
normalized: ~ [E [true U ~ [p191<=p147]]]

abstracting: (p191<=p147)
states: 2,401,000,000,001 (12)
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [p187<=p167]
normalized: ~ [E [true U ~ [p187<=p167]]]

abstracting: (p187<=p167)
states: 2,401,000,000,001 (12)
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: AG [p250<=p140]
normalized: ~ [E [true U ~ [p250<=p140]]]

abstracting: (p250<=p140)
states: 2,401,000,000,001 (12)
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[p179<=p135 | 3<=p176]]
normalized: ~ [E [true U ~ [[p179<=p135 | 3<=p176]]]]

abstracting: (3<=p176)
states: 0
abstracting: (p179<=p135)
states: 2,401,000,000,001 (12)
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: AG [[~ [[1<=p240 & 2<=p82]] | 3<=p223]]
normalized: ~ [E [true U ~ [[3<=p223 | ~ [[1<=p240 & 2<=p82]]]]]]

abstracting: (2<=p82)
states: 0
abstracting: (1<=p240)
states: 2,401,000,000,000 (12)
abstracting: (3<=p223)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p152<=p231 | p175<=p107]]
normalized: ~ [E [true U ~ [[p152<=p231 | p175<=p107]]]]

abstracting: (p175<=p107)
states: 240,100,000,001 (11)
abstracting: (p152<=p231)
states: 2,401,000,000,001 (12)
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: EF [[~ [~ [3<=p54]] & [[1<=p231 & 1<=p177] | 1<=p209]]]
normalized: E [true U [3<=p54 & [1<=p209 | [1<=p231 & 1<=p177]]]]

abstracting: (1<=p177)
states: 2,401,000,000,000 (12)
abstracting: (1<=p231)
states: 2,401,000,000,000 (12)
abstracting: (1<=p209)
states: 2,401,000,000,000 (12)
abstracting: (3<=p54)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-08a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AG [[1<=p151 | [~ [p221<=p181] | ~ [2<=p261]]]]
normalized: ~ [E [true U ~ [[1<=p151 | [~ [2<=p261] | ~ [p221<=p181]]]]]]

abstracting: (p221<=p181)
states: 2,401,000,000,001 (12)
abstracting: (2<=p261)
states: 0
abstracting: (1<=p151)
states: 2,401,000,000,000 (12)
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: EF [[2<=p200 & ~ [[p4<=p219 & p83<=p58]]]]
normalized: E [true U [2<=p200 & ~ [[p4<=p219 & p83<=p58]]]]

abstracting: (p83<=p58)
states: 2,184,910,000,001 (12)
abstracting: (p4<=p219)
states: 2,401,000,000,001 (12)
abstracting: (2<=p200)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-08a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EF [[~ [[p250<=p170 | 3<=p0]] & ~ [[p113<=p232 & 1<=p56]]]]
normalized: E [true U [~ [[p250<=p170 | 3<=p0]] & ~ [[p113<=p232 & 1<=p56]]]]

abstracting: (1<=p56)
states: 240,100,000,000 (11)
abstracting: (p113<=p232)
states: 2,401,000,000,001 (12)
abstracting: (3<=p0)
states: 0
abstracting: (p250<=p170)
states: 2,401,000,000,001 (12)
-> the formula is FALSE

FORMULA DLCround-PT-08a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [[~ [[2<=p167 & 2<=p99]] | [[1<=p158 & 1<=p75] | [2<=p168 & 3<=p66]]]]
normalized: ~ [E [true U ~ [[[[2<=p168 & 3<=p66] | [1<=p158 & 1<=p75]] | ~ [[2<=p167 & 2<=p99]]]]]]

abstracting: (2<=p99)
states: 0
abstracting: (2<=p167)
states: 0
abstracting: (1<=p75)
states: 240,100,000,000 (11)
abstracting: (1<=p158)
states: 2,401,000,000,000 (12)
abstracting: (3<=p66)
states: 0
abstracting: (2<=p168)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [[1<=p88 & p234<=p225]] | [[p73<=p21 | 1<=p199] & ~ [2<=p222]]]]
normalized: ~ [E [true U ~ [[[[p73<=p21 | 1<=p199] & ~ [2<=p222]] | ~ [[1<=p88 & p234<=p225]]]]]]

abstracting: (p234<=p225)
states: 2,401,000,000,001 (12)
abstracting: (1<=p88)
states: 240,100,000,000 (11)
abstracting: (2<=p222)
states: 0
abstracting: (1<=p199)
states: 2,401,000,000,000 (12)
abstracting: (p73<=p21)
states: 2,195,200,000,001 (12)
-> the formula is TRUE

FORMULA DLCround-PT-08a-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: EF [[[[3<=p37 | 3<=p41] | 2<=p52] | ~ [[p66<=p5 | p51<=p259]]]]
normalized: E [true U [~ [[p66<=p5 | p51<=p259]] | [2<=p52 | [3<=p37 | 3<=p41]]]]

abstracting: (3<=p41)
states: 0
abstracting: (3<=p37)
states: 0
abstracting: (2<=p52)
states: 0
abstracting: (p51<=p259)
states: 2,401,000,000,001 (12)
abstracting: (p66<=p5)
states: 2,195,200,000,001 (12)
-> the formula is FALSE

FORMULA DLCround-PT-08a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: AG [[[~ [2<=p179] | [p228<=p246 | p195<=p124]] & [3<=p190 | [p78<=p79 | p42<=p53]]]]
normalized: ~ [E [true U ~ [[[3<=p190 | [p78<=p79 | p42<=p53]] & [[p228<=p246 | p195<=p124] | ~ [2<=p179]]]]]]

abstracting: (2<=p179)
states: 0
abstracting: (p195<=p124)
states: 2,401,000,000,001 (12)
abstracting: (p228<=p246)
states: 2,401,000,000,001 (12)
abstracting: (p42<=p53)
states: 2,184,910,000,001 (12)
abstracting: (p78<=p79)
states: 2,184,910,000,001 (12)
abstracting: (3<=p190)
states: 0

after gc: zbdd nodes used:433523, unused:18316477-> the formula is FALSE

FORMULA DLCround-PT-08a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.647sec

totally nodes used: 25771966(2.6e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 49560264 242129693 291689957
used/not used/entry size/cache size: 54341925 12766939 16 1024MB
basic ops cache: hits/miss/sum: 6663254 32792202 39455456
used/not used/entry size/cache size: 15044772 1732444 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: 89092 398219 487311
used/not used/entry size/cache size: 0 2097152 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 52163719
1 13200401
2 1611855
3 125512
4 7057
5 306
6 14
7 0
8 0
9 0
>= 10 0

Total processing time: 1m 6.414sec


BK_STOP 1495823556259

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


iterations count:69574 (36), effective:106 (0)

initing FirstDep: 0m 0.017sec


iterations count:13087 (6), effective:21 (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="DLCround-PT-08a"
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/DLCround-PT-08a.tgz
mv DLCround-PT-08a 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 DLCround-PT-08a, 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 r171-csrt-149580951600295"
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 ;