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 S_DNAwalker-PT-16redondantChoiceR, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441598700138
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494867708818

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: DNAwalker_PT_16redondantChoiceR
(NrP: 43 NrTr: 490 NrArc: 1438)

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

net check time: 0m 0.000sec

init dd package: 0m 1.218sec

parse successfull
net created successfully

Net: DNAwalker_PT_16redondantChoiceR
(NrP: 43 NrTr: 490 NrArc: 1438)

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

net check time: 0m 0.000sec

init dd package: 0m 3.904sec


RS generation: 31m 4.754sec


-> reachability set: #nodes 47899 (4.8e+04) #states 800,319,630,216 (11)



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

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

abstracting: (2<=A30)
states: 18,253,389,660 (10)
-> the formula is TRUE

FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.686sec

checking: ~ [AF [EX [2<=B31]]]
normalized: EG [~ [EX [2<=B31]]]

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

FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.075sec

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

abstracting: (2<=A26)
states: 26,822,689,812 (10)

before gc: list nodes free: 2007097

after gc: idd nodes used:442328, unused:63557672; list nodes free:388745010
-> the formula is TRUE

FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.511sec

checking: ~ [EX [AG [A19<=A19]]]
normalized: ~ [EX [~ [E [true U ~ [A19<=A19]]]]]

abstracting: (A19<=A19)
states: 800,319,630,216 (11)
.-> the formula is FALSE

FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.747sec

checking: EG [A2<=A8]
normalized: EG [A2<=A8]

abstracting: (A2<=A8)
states: 595,896,863,712 (11)
..........10:57779...
EG iterations: 13
-> the formula is TRUE

FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.627sec

checking: EG [A [2<=B16 U A18<=A4]]
normalized: EG [[~ [EG [~ [A18<=A4]]] & ~ [E [~ [A18<=A4] U [~ [2<=B16] & ~ [A18<=A4]]]]]]

abstracting: (A18<=A4)
states: 573,353,726,936 (11)
abstracting: (2<=B16)
states: 0
abstracting: (A18<=A4)
states: 573,353,726,936 (11)
abstracting: (A18<=A4)
states: 573,353,726,936 (11)
..........10:33695...
EG iterations: 13
.MC time: 2m14.066sec

checking: AG [AF [[B15<=B30 | 2<=A29]]]
normalized: ~ [E [true U EG [~ [[B15<=B30 | 2<=A29]]]]]

abstracting: (2<=A29)
states: 18,030,299,844 (10)
abstracting: (B15<=B30)
states: 623,805,055,734 (11)
.....MC time: 2m 1.017sec

checking: AG [AF [[A33<=A29 | 3<=A7]]]
normalized: ~ [E [true U EG [~ [[A33<=A29 | 3<=A7]]]]]

abstracting: (3<=A7)
states: 0
abstracting: (A33<=A29)
states: 255,383,284,351 (11)
.
EG iterations: 1
MC time: 1m50.451sec

checking: EF [A [A31<=B14 U 2<=A16]]
normalized: E [true U [~ [EG [~ [2<=A16]]] & ~ [E [~ [2<=A16] U [~ [A31<=B14] & ~ [2<=A16]]]]]]

abstracting: (2<=A16)
states: 17,901,952,864 (10)
abstracting: (A31<=B14)
states: 608,364,355,486 (11)
abstracting: (2<=A16)
states: 17,901,952,864 (10)
MC time: 1m40.437sec

checking: A [~ [[2<=B14 | A8<=B15]] U AF [2<=A29]]
normalized: [~ [EG [EG [~ [2<=A29]]]] & ~ [E [EG [~ [2<=A29]] U [[2<=B14 | A8<=B15] & EG [~ [2<=A29]]]]]]

abstracting: (2<=A29)
states: 18,030,299,844 (10)
......MC time: 1m31.020sec

checking: A [AF [A8<=B29] U A9<=A15]
normalized: [~ [EG [~ [A9<=A15]]] & ~ [E [~ [A9<=A15] U [EG [~ [A8<=B29]] & ~ [A9<=A15]]]]]

abstracting: (A9<=A15)
states: 543,633,178,502 (11)
abstracting: (A8<=B29)
states: 510,995,178,269 (11)
..........10:44747..
EG iterations: 12
abstracting: (A9<=A15)
states: 543,633,178,502 (11)
MC time: 1m23.085sec

checking: AX [A [A1<=A20 U A2<=A12]]
normalized: ~ [EX [~ [[~ [EG [~ [A2<=A12]]] & ~ [E [~ [A2<=A12] U [~ [A1<=A20] & ~ [A2<=A12]]]]]]]]

abstracting: (A2<=A12)
states: 593,826,221,308 (11)
abstracting: (A1<=A20)
states: 800,319,571,167 (11)
abstracting: (A2<=A12)
states: 593,826,221,308 (11)
abstracting: (A2<=A12)
states: 593,826,221,308 (11)
..........10:21736..
EG iterations: 12
.-> the formula is TRUE

FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.532sec

checking: EF [[AG [1<=A25] | [~ [A10<=A24] & [2<=A32 & A21<=A8]]]]
normalized: E [true U [~ [E [true U ~ [1<=A25]]] | [[2<=A32 & A21<=A8] & ~ [A10<=A24]]]]

abstracting: (A10<=A24)
states: 584,202,748,544 (11)
abstracting: (A21<=A8)
states: 587,020,581,986 (11)
abstracting: (2<=A32)
states: 50,406,001,088 (10)
abstracting: (1<=A25)
states: 388,076,083,632 (11)

before gc: list nodes free: 1888227

after gc: idd nodes used:406770, unused:63593230; list nodes free:448535596
MC time: 1m20.123sec

checking: E [[[A14<=A23 | B31<=A25] | A6<=A24] U ~ [[A20<=A10 | 1<=A6]]]
normalized: E [[A6<=A24 | [A14<=A23 | B31<=A25]] U ~ [[A20<=A10 | 1<=A6]]]

abstracting: (1<=A6)
states: 272,756,488,153 (11)
abstracting: (A20<=A10)
states: 581,583,039,876 (11)
abstracting: (B31<=A25)
states: 667,279,084,560 (11)
abstracting: (A14<=A23)
states: 652,971,699,000 (11)
abstracting: (A6<=A24)
states: 652,596,575,526 (11)
MC time: 1m12.034sec

checking: [EG [[[3<=B30 | B13<=A17] | ~ [A7<=B28]]] | E [[3<=A6 & 2<=A21] U [3<=A27 & 1<=A18]]]
normalized: [E [[3<=A6 & 2<=A21] U [3<=A27 & 1<=A18]] | EG [[~ [A7<=B28] | [3<=B30 | B13<=A17]]]]

abstracting: (B13<=A17)
states: 682,036,247,552 (11)
abstracting: (3<=B30)
states: 0
abstracting: (A7<=B28)
states: 516,087,085,453 (11)
MC time: 1m 5.020sec

checking: [A [A29<=B15 U [B14<=A31 & A20<=A23]] | [[AG [A27<=A22] | AG [B14<=B29]] & [[[A12<=A6 & A26<=A28] | 1<=A22] | ~ [[3<=A8 | B13<=A11]]]]]
normalized: [[[~ [[3<=A8 | B13<=A11]] | [1<=A22 | [A12<=A6 & A26<=A28]]] & [~ [E [true U ~ [B14<=B29]]] | ~ [E [true U ~ [A27<=A22]]]]] | [~ [EG [~ [[B14<=A31 & A20<=A23]]]] & ~ [E [~ [[B14<=A31 & A20<=A23]] U [~ [A29<=B15] & ~ [[B14<=A31 & A20<=A23]]]]]]]

abstracting: (A20<=A23)
states: 582,931,693,228 (11)
abstracting: (B14<=A31)
states: 630,829,639,276 (11)
abstracting: (A29<=B15)
states: 609,351,271,886 (11)
abstracting: (A20<=A23)
states: 582,931,693,228 (11)
abstracting: (B14<=A31)
states: 630,829,639,276 (11)
MC time: 0m58.115sec

checking: EG [A [2<=B16 U A18<=A4]]
normalized: EG [[~ [EG [~ [A18<=A4]]] & ~ [E [~ [A18<=A4] U [~ [2<=B16] & ~ [A18<=A4]]]]]]

abstracting: (A18<=A4)
states: 573,353,726,936 (11)
abstracting: (2<=B16)
states: 0
abstracting: (A18<=A4)
states: 573,353,726,936 (11)

BK_TIME_CONFINEMENT_REACHED

--------------------
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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

.........10 171651.........20 570752.........30 48117...................
net_ddint.h:596: Timeout: after 133 sec


net_ddint.h:596: Timeout: after 120 sec

.
net_ddint.h:596: Timeout: after 109 sec

.
net_ddint.h:596: Timeout: after 99 sec


net_ddint.h:596: Timeout: after 90 sec

.
net_ddint.h:596: Timeout: after 82 sec

...
net_ddint.h:596: Timeout: after 79 sec

..
net_ddint.h:596: Timeout: after 71 sec


net_ddint.h:596: Timeout: after 64 sec


net_ddint.h:596: Timeout: after 57 sec

.

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="S_DNAwalker-PT-16redondantChoiceR"
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/S_DNAwalker-PT-16redondantChoiceR.tgz
mv S_DNAwalker-PT-16redondantChoiceR 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 S_DNAwalker-PT-16redondantChoiceR, 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 r101-blw3-149441598700138"
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 ;