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

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

=== Now, execution of the tool begins

BK_START 1495823125676

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_05a
(NrP: 167 NrTr: 1055 NrArc: 3985)

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

net check time: 0m 0.000sec

init dd package: 0m 1.302sec


RS generation: 0m 1.276sec


-> reachability set: #nodes 19656 (2.0e+04) #states 2,401,000,001 (9)



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

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

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

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

MC time: 0m 1.543sec

checking: AX [AG [1<=p122]]
normalized: ~ [EX [E [true U ~ [1<=p122]]]]

abstracting: (1<=p122)
states: 2,401,000,000 (9)
.-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: EF [EX [~ [1<=p140]]]
normalized: E [true U EX [~ [1<=p140]]]

abstracting: (1<=p140)
states: 2,401,000,000 (9)
.-> the formula is FALSE

FORMULA DLCround-PT-05a-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

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

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

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

MC time: 0m 0.000sec

checking: ~ [EF [EX [2<=p97]]]
normalized: ~ [E [true U EX [2<=p97]]]

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

FORMULA DLCround-PT-05a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=p160)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [AG [EF [1<=p126]] | ~ [AX [1<=p164]]]
normalized: [~ [E [true U ~ [E [true U 1<=p126]]]] | EX [~ [1<=p164]]]

abstracting: (1<=p164)
states: 2,401,000,000 (9)
.abstracting: (1<=p126)
states: 2,401,000,000 (9)
-> the formula is TRUE

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

MC time: 0m 0.008sec

checking: ~ [AG [~ [[3<=p129 | 1<=p44]]]]
normalized: E [true U [3<=p129 | 1<=p44]]

abstracting: (1<=p44)
states: 240,100,000 (8)
abstracting: (3<=p129)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.606sec

checking: AG [EF [[2<=p99 | p159<=p90]]]
normalized: ~ [E [true U ~ [E [true U [2<=p99 | p159<=p90]]]]]

abstracting: (p159<=p90)
states: 2,401,000,001 (9)
abstracting: (2<=p99)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.017sec

checking: AG [[3<=p64 | p111<=p164]]
normalized: ~ [E [true U ~ [[3<=p64 | p111<=p164]]]]

abstracting: (p111<=p164)
states: 2,401,000,001 (9)
abstracting: (3<=p64)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-05a-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EX [1<=p119] & EX [EF [p156<=p74]]]
normalized: [EX [1<=p119] & EX [E [true U p156<=p74]]]

abstracting: (p156<=p74)
states: 240,100,001 (8)
.abstracting: (1<=p119)
states: 2,401,000,000 (9)
.-> the formula is TRUE

FORMULA DLCround-PT-05a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.839sec

checking: [EF [AX [2<=p61]] | [AF [p29<=p44] & A [p8<=p54 U 2<=p12]]]
normalized: [E [true U ~ [EX [~ [2<=p61]]]] | [~ [EG [~ [p29<=p44]]] & [~ [EG [~ [2<=p12]]] & ~ [E [~ [2<=p12] U [~ [p8<=p54] & ~ [2<=p12]]]]]]]

abstracting: (2<=p12)
states: 0
abstracting: (p8<=p54)
states: 2,092,300,001 (9)
abstracting: (2<=p12)
states: 0
abstracting: (2<=p12)
states: 0

EG iterations: 0
abstracting: (p29<=p44)
states: 2,184,910,001 (9)
.
EG iterations: 1
abstracting: (2<=p61)
states: 0
.-> the formula is FALSE

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

MC time: 0m 1.935sec

checking: [p127<=p147 & EF [[1<=p39 & [p95<=p45 | 2<=p106]]]]
normalized: [p127<=p147 & E [true U [[p95<=p45 | 2<=p106] & 1<=p39]]]

abstracting: (1<=p39)
states: 240,100,000 (8)
abstracting: (2<=p106)
states: 0
abstracting: (p95<=p45)
states: 240,100,001 (8)
abstracting: (p127<=p147)
states: 2,401,000,001 (9)
-> the formula is FALSE

FORMULA DLCround-PT-05a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [[AF [p57<=p58] | [[p86<=p145 & p125<=p100] & ~ [2<=p106]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [p57<=p58]]] | [~ [2<=p106] & [p86<=p145 & p125<=p100]]]]]]

abstracting: (p125<=p100)
states: 2,401,000,001 (9)
abstracting: (p86<=p145)
states: 2,401,000,001 (9)
abstracting: (2<=p106)
states: 0
abstracting: (p57<=p58)
states: 2,160,900,001 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.137sec

checking: [[~ [[[2<=p153 & 3<=p69] | [p134<=p76 | p1<=p69]]] & ~ [[~ [p158<=p64] | 2<=p54]]] | AG [EF [p71<=p113]]]
normalized: [~ [E [true U ~ [E [true U p71<=p113]]]] | [~ [[[p134<=p76 | p1<=p69] | [2<=p153 & 3<=p69]]] & ~ [[~ [p158<=p64] | 2<=p54]]]]

abstracting: (2<=p54)
states: 0
abstracting: (p158<=p64)
states: 240,100,001 (8)
abstracting: (3<=p69)
states: 0
abstracting: (2<=p153)
states: 0
abstracting: (p1<=p69)
states: 2,092,300,001 (9)
abstracting: (p134<=p76)
states: 240,100,001 (8)
abstracting: (p71<=p113)
states: 2,401,000,001 (9)
-> the formula is TRUE

FORMULA DLCround-PT-05a-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [[[[2<=p113 & ~ [p53<=p134]] | p158<=p130] | [[~ [2<=p153] | [1<=p114 | 3<=p114]] | ~ [[1<=p55 & p26<=p95]]]] & ~ [AG [[3<=p96 | p9<=p129]]]]
normalized: [E [true U ~ [[3<=p96 | p9<=p129]]] & [[~ [[1<=p55 & p26<=p95]] | [[1<=p114 | 3<=p114] | ~ [2<=p153]]] | [p158<=p130 | [2<=p113 & ~ [p53<=p134]]]]]

abstracting: (p53<=p134)
states: 2,401,000,001 (9)
abstracting: (2<=p113)
states: 0
abstracting: (p158<=p130)
states: 2,401,000,001 (9)
abstracting: (2<=p153)
states: 0
abstracting: (3<=p114)
states: 0
abstracting: (1<=p114)
states: 2,401,000,000 (9)
abstracting: (p26<=p95)
states: 2,401,000,001 (9)
abstracting: (1<=p55)
states: 240,100,000 (8)
abstracting: (p9<=p129)
states: 2,401,000,001 (9)
abstracting: (3<=p96)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.027sec

totally nodes used: 4699450(4.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4604515 17489519 22094034
used/not used/entry size/cache size: 15072307 52036557 16 1024MB
basic ops cache: hits/miss/sum: 2402804 11796039 14198843
used/not used/entry size/cache size: 11658247 5118969 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: 15583 50955 66538
used/not used/entry size/cache size: 50387 2046765 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 62555288
1 4410444
2 140417
3 2688
4 27
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 9.890sec


BK_STOP 1495823135595

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


iterations count:26337 (24), effective:79 (0)

initing FirstDep: 0m 0.010sec


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

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

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

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

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

iterations count:3474 (3), effective:9 (0)

iterations count:2529 (2), effective:8 (0)

iterations count:1055 (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-05a"
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-05a.tgz
mv DLCround-PT-05a 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-05a, 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-149580951500237"
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 ;