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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951600291
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495823365506

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

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

net check time: 0m 0.001sec

init dd package: 0m 1.348sec


RS generation: 0m29.417sec


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



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

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

abstracting: (3<=p243)
states: 0

after gc: zbdd nodes used:233468, unused:18516532-> the formula is TRUE

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

MC time: 0m37.009sec

checking: AG [p82<=p197]
normalized: ~ [E [true U ~ [p82<=p197]]]

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

FORMULA DLCround-PT-08a-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: EX [[EG [3<=p120] | AG [1<=p220]]]
normalized: EX [[~ [E [true U ~ [1<=p220]]] | EG [3<=p120]]]

abstracting: (3<=p120)
states: 0
.
after gc: zbdd nodes used:1933755, unused:35566245
EG iterations: 1
abstracting: (1<=p220)
states: 2,401,000,000,000 (12)

after gc: zbdd nodes used:476843, unused:74523157MC time: 4m13.129sec

checking: EF [[~ [1<=p193] & EX [3<=p47]]]
normalized: E [true U [EX [3<=p47] & ~ [1<=p193]]]

abstracting: (1<=p193)
states: 2,401,000,000,000 (12)
abstracting: (3<=p47)
states: 0
.-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.309sec

checking: [3<=p147 | EF [2<=p25]]
normalized: [3<=p147 | E [true U 2<=p25]]

abstracting: (2<=p25)
states: 0
abstracting: (3<=p147)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [p58<=p135]
normalized: ~ [E [true U ~ [p58<=p135]]]

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

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

MC time: 0m 0.094sec

checking: [EF [EF [3<=p216]] & p102<=p259]
normalized: [p102<=p259 & E [true U E [true U 3<=p216]]]

abstracting: (3<=p216)
states: 0
abstracting: (p102<=p259)
states: 2,401,000,000,001 (12)
-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [[3<=p250 & ~ [p163<=p168]] U EF [1<=p105]]
normalized: [~ [E [~ [E [true U 1<=p105]] U [~ [E [true U 1<=p105]] & ~ [[3<=p250 & ~ [p163<=p168]]]]]] & ~ [EG [~ [E [true U 1<=p105]]]]]

abstracting: (1<=p105)
states: 240,100,000,000 (11)
.
EG iterations: 1
abstracting: (p163<=p168)
states: 2,401,000,000,001 (12)
abstracting: (3<=p250)
states: 0
abstracting: (1<=p105)
states: 240,100,000,000 (11)
abstracting: (1<=p105)
states: 240,100,000,000 (11)
-> the formula is TRUE

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

MC time: 0m16.197sec

checking: E [[~ [3<=p190] | p40<=p202] U 2<=p145]
normalized: E [[p40<=p202 | ~ [3<=p190]] U 2<=p145]

abstracting: (2<=p145)
states: 0
abstracting: (3<=p190)
states: 0
abstracting: (p40<=p202)
states: 2,401,000,000,001 (12)
-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: AG [[[~ [p217<=p174] & p70<=p237] | ~ [2<=p189]]]
normalized: ~ [E [true U ~ [[~ [2<=p189] | [p70<=p237 & ~ [p217<=p174]]]]]]

abstracting: (p217<=p174)
states: 2,401,000,000,001 (12)
abstracting: (p70<=p237)
states: 2,401,000,000,001 (12)
abstracting: (2<=p189)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-08a-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [~ [p233<=p4] | EF [[[1<=p65 & p35<=p69] & ~ [2<=p235]]]]
normalized: [E [true U [~ [2<=p235] & [1<=p65 & p35<=p69]]] | ~ [p233<=p4]]

abstracting: (p233<=p4)
states: 343,000,000,001 (11)
abstracting: (p35<=p69)
states: 2,184,910,000,001 (12)
abstracting: (1<=p65)
states: 240,100,000,000 (11)
abstracting: (2<=p235)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-08a-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.679sec

checking: [[~ [EF [3<=p18]] | AG [[p40<=p68 & p150<=p120]]] & EG [p211<=p213]]
normalized: [EG [p211<=p213] & [~ [E [true U ~ [[p40<=p68 & p150<=p120]]]] | ~ [E [true U 3<=p18]]]]

abstracting: (3<=p18)
states: 0
abstracting: (p150<=p120)
states: 2,401,000,000,001 (12)
abstracting: (p40<=p68)
states: 2,184,910,000,001 (12)
abstracting: (p211<=p213)
states: 2,401,000,000,001 (12)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m16.921sec

checking: [p15<=p183 & [AG [~ [1<=p65]] | [AG [3<=p191] | [[p175<=p86 | 3<=p186] & [1<=p36 & 1<=p226]]]]]
normalized: [p15<=p183 & [[[[1<=p36 & 1<=p226] & [p175<=p86 | 3<=p186]] | ~ [E [true U ~ [3<=p191]]]] | ~ [E [true U 1<=p65]]]]

abstracting: (1<=p65)
states: 240,100,000,000 (11)
abstracting: (3<=p191)
states: 0
abstracting: (3<=p186)
states: 0
abstracting: (p175<=p86)
states: 240,100,000,001 (11)
abstracting: (1<=p226)
states: 2,401,000,000,000 (12)
abstracting: (1<=p36)
states: 240,100,000,000 (11)
abstracting: (p15<=p183)
states: 2,401,000,000,001 (12)
-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.681sec

checking: E [AF [p11<=p216] U [[p165<=p13 | p136<=p113] & [2<=p234 & p231<=p34]]]
normalized: E [~ [EG [~ [p11<=p216]]] U [[2<=p234 & p231<=p34] & [p165<=p13 | p136<=p113]]]

abstracting: (p136<=p113)
states: 240,100,000,001 (11)
abstracting: (p165<=p13)
states: 343,000,000,001 (11)
abstracting: (p231<=p34)
states: 240,100,000,001 (11)
abstracting: (2<=p234)
states: 0
abstracting: (p11<=p216)
states: 2,401,000,000,001 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.295sec

checking: AG [[[[p158<=p224 & 2<=p129] & [3<=p164 | p23<=p255]] | [~ [p133<=p256] | [2<=p137 | p64<=p57]]]]
normalized: ~ [E [true U ~ [[[[2<=p137 | p64<=p57] | ~ [p133<=p256]] | [[3<=p164 | p23<=p255] & [p158<=p224 & 2<=p129]]]]]]

abstracting: (2<=p129)
states: 0
abstracting: (p158<=p224)
states: 2,401,000,000,001 (12)
abstracting: (p23<=p255)
states: 2,401,000,000,001 (12)
abstracting: (3<=p164)
states: 0
abstracting: (p133<=p256)
states: 2,401,000,000,001 (12)
abstracting: (p64<=p57)
states: 2,184,910,000,001 (12)
abstracting: (2<=p137)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-08a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.124sec

checking: [[[[[p194<=p89 & p134<=p207] & p124<=p11] | [~ [3<=p141] | ~ [2<=p15]]] & AX [[p21<=p113 | p144<=p90]]] | [[AG [p50<=p143] | [[p68<=p176 & 3<=p141] & [2<=p175 & p76<=p67]]] & ~ [~ [[p76<=p92 & p135<=p170]]]]]
normalized: [[[p76<=p92 & p135<=p170] & [[[2<=p175 & p76<=p67] & [p68<=p176 & 3<=p141]] | ~ [E [true U ~ [p50<=p143]]]]] | [~ [EX [~ [[p21<=p113 | p144<=p90]]]] & [[~ [2<=p15] | ~ [3<=p141]] | [p124<=p11 & [p194<=p89 & p134<=p207]]]]]

abstracting: (p134<=p207)
states: 2,401,000,000,001 (12)
abstracting: (p194<=p89)
states: 240,100,000,001 (11)
abstracting: (p124<=p11)
states: 343,000,000,001 (11)
abstracting: (3<=p141)
states: 0
abstracting: (2<=p15)
states: 0
abstracting: (p144<=p90)
states: 240,100,000,001 (11)
abstracting: (p21<=p113)
states: 2,092,300,000,001 (12)
.abstracting: (p50<=p143)
states: 2,401,000,000,001 (12)
abstracting: (3<=p141)
states: 0
abstracting: (p68<=p176)
states: 2,401,000,000,001 (12)
abstracting: (p76<=p67)
states: 2,184,910,000,001 (12)
abstracting: (2<=p175)
states: 0
abstracting: (p135<=p170)
states: 2,401,000,000,001 (12)
abstracting: (p76<=p92)
states: 2,184,910,000,001 (12)
-> the formula is TRUE

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

MC time: 0m29.108sec

checking: EX [[EG [3<=p120] | AG [1<=p220]]]
normalized: EX [[~ [E [true U ~ [1<=p220]]] | EG [3<=p120]]]

abstracting: (3<=p120)
states: 0
.
EG iterations: 1
abstracting: (1<=p220)
states: 2,401,000,000,000 (12)

after gc: zbdd nodes used:30357438, unused:119642562.-> the formula is TRUE

FORMULA DLCround-PT-08a-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m54.974sec

totally nodes used: 137993464(1.4e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 93054341 440462180 533516521
used/not used/entry size/cache size: 67654 67041210 16 1024MB
basic ops cache: hits/miss/sum: 154444594 1130276683 1284721277
used/not used/entry size/cache size: 16639913 137303 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: 349978 1627895 1977873
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 42656537
1 19354210
2 4365863
3 652537
4 72681
5 6551
6 455
7 28
8 2
9 0
>= 10 0

Total processing time: 9m33.350sec


BK_STOP 1495823938889

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


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

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

net_ddint.h:596: Timeout: after 252 sec


iterations count:7630 (4), effective:10 (0)

iterations count:7630 (4), effective:10 (0)

iterations count:7630 (4), effective:10 (0)

iterations count:5834 (3), effective:11 (0)

iterations count:6285 (3), effective:11 (0)

iterations count:5680 (2), effective:10 (0)

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

iterations count:6447 (3), effective:11 (0)

iterations count:1907 (1), effective:0 (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="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/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 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 r171-csrt-149580951600291"
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 ;