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 DNAwalker-PT-16redondantChoiceR, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r021-blw3-149440254900142
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494448699579

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: 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.200sec

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


RS generation: 30m38.297sec


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



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

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

abstracting: (2<=B30)
states: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

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

abstracting: (2<=A31)
states: 18,040,767,532 (10)
abstracting: (1<=A30)
states: 270,433,396,238 (11)

before gc: list nodes free: 313710

after gc: idd nodes used:359334, unused:63640666; list nodes free:389812881
MC time: 1m58.178sec

checking: AG [A32<=A8]
normalized: ~ [E [true U ~ [A32<=A8]]]

abstracting: (A32<=A8)
states: 386,975,943,928 (11)
MC time: 1m50.063sec

checking: AG [A30<=A27]
normalized: ~ [E [true U ~ [A30<=A27]]]

abstracting: (A30<=A27)
states: 657,495,845,636 (11)
MC time: 1m42.081sec

checking: AG [A26<=A17]
normalized: ~ [E [true U ~ [A26<=A17]]]

abstracting: (A26<=A17)
states: 601,004,889,696 (11)
-> the formula is FALSE

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.312sec

checking: EF [~ [~ [[2<=B30 & 3<=A17]]]]
normalized: E [true U [2<=B30 & 3<=A17]]

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

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [~ [[~ [A18<=A10] | ~ [2<=A16]]]]
normalized: E [true U ~ [[~ [2<=A16] | ~ [A18<=A10]]]]

abstracting: (A18<=A10)
states: 582,819,881,876 (11)
abstracting: (2<=A16)
states: 17,901,952,864 (10)
MC time: 1m45.016sec

checking: EF [[3<=B14 & [~ [A10<=B31] & ~ [3<=B29]]]]
normalized: E [true U [3<=B14 & [~ [3<=B29] & ~ [A10<=B31]]]]

abstracting: (A10<=B31)
states: 520,781,075,790 (11)
abstracting: (3<=B29)
states: 0
abstracting: (3<=B14)
states: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.460sec

checking: AG [[A16<=A16 | B14<=A15]]
normalized: ~ [E [true U ~ [[A16<=A16 | B14<=A15]]]]

abstracting: (B14<=A15)
states: 631,343,690,304 (11)
abstracting: (A16<=A16)
states: 800,319,630,216 (11)
-> the formula is TRUE

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EF [~ [[[A8<=A11 & 1<=A20] | A1<=A32]]]
normalized: E [true U ~ [[A1<=A32 | [A8<=A11 & 1<=A20]]]]

abstracting: (1<=A20)
states: 408,719,320,606 (11)
abstracting: (A8<=A11)
states: 583,285,337,744 (11)
abstracting: (A1<=A32)
states: 800,319,571,167 (11)
-> the formula is FALSE

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.246sec

checking: AG [[2<=A21 | [A27<=B31 | [A24<=A7 | 1<=A8]]]]
normalized: ~ [E [true U ~ [[2<=A21 | [A27<=B31 | [A24<=A7 | 1<=A8]]]]]]

abstracting: (1<=A8)
states: 412,143,344,456 (11)
abstracting: (A24<=A7)
states: 592,172,580,152 (11)
abstracting: (A27<=B31)
states: 515,890,032,764 (11)
abstracting: (2<=A21)
states: 26,765,290,198 (10)
MC time: 2m 5.180sec

checking: EF [[[~ [B14<=A24] & [A2<=B6 & 2<=B13]] & [A30<=A2 & ~ [3<=A31]]]]
normalized: E [true U [[A30<=A2 & ~ [3<=A31]] & [[A2<=B6 & 2<=B13] & ~ [B14<=A24]]]]

abstracting: (B14<=A24)
states: 668,637,815,604 (11)
abstracting: (2<=B13)
states: 0
abstracting: (A2<=B6)
states: 523,058,467,414 (11)
abstracting: (3<=A31)
states: 0
abstracting: (A30<=A2)
states: 655,567,428,118 (11)
-> the formula is FALSE

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

MC time: 0m 0.581sec

checking: EF [[~ [[1<=A12 | 3<=A2]] & [A28<=A24 | [A9<=B6 & B13<=A30]]]]
normalized: E [true U [[A28<=A24 | [A9<=B6 & B13<=A30]] & ~ [[1<=A12 | 3<=A2]]]]

abstracting: (3<=A2)
states: 0
abstracting: (1<=A12)
states: 407,723,017,760 (11)
abstracting: (B13<=A30)
states: 629,818,413,424 (11)
abstracting: (A9<=B6)
states: 533,109,842,603 (11)
abstracting: (A28<=A24)
states: 651,065,177,900 (11)

before gc: list nodes free: 1996434

after gc: idd nodes used:644954, unused:63355046; list nodes free:438549808
MC time: 2m 5.121sec

checking: EF [[[1<=A15 | [2<=A5 | 3<=A30]] & [[1<=A6 & 2<=A29] | [B14<=A12 & 3<=A28]]]]
normalized: E [true U [[[B14<=A12 & 3<=A28] | [1<=A6 & 2<=A29]] & [1<=A15 | [2<=A5 | 3<=A30]]]]

abstracting: (3<=A30)
states: 0
abstracting: (2<=A5)
states: 16,806,250,021 (10)
abstracting: (1<=A15)
states: 274,778,594,376 (11)
abstracting: (2<=A29)
states: 18,030,299,844 (10)
abstracting: (1<=A6)
states: 272,756,488,153 (11)
abstracting: (3<=A28)
states: 0
abstracting: (B14<=A12)
states: 674,536,712,290 (11)
-> the formula is TRUE

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m18.721sec

checking: AG [[[~ [3<=A6] & [1<=A22 | A7<=A2]] | [[2<=A21 | A26<=A30] | [1<=A26 & A26<=A28]]]]
normalized: ~ [E [true U ~ [[[[1<=A26 & A26<=A28] | [2<=A21 | A26<=A30]] | [[1<=A22 | A7<=A2] & ~ [3<=A6]]]]]]

abstracting: (3<=A6)
states: 0
abstracting: (A7<=A2)
states: 583,701,691,536 (11)
abstracting: (1<=A22)
states: 416,782,848,772 (11)
abstracting: (A26<=A30)
states: 526,553,326,840 (11)
abstracting: (2<=A21)
states: 26,765,290,198 (10)
abstracting: (A26<=A28)
states: 528,706,639,891 (11)
abstracting: (1<=A26)
states: 397,665,914,572 (11)
MC time: 1m55.087sec

checking: AG [[[[A16<=A24 & 2<=A10] | [2<=A10 & 1<=A31]] | [[A13<=A6 | 1<=B16] | [3<=A25 | A29<=A4]]]]
normalized: ~ [E [true U ~ [[[[3<=A25 | A29<=A4] | [A13<=A6 | 1<=B16]] | [[2<=A10 & 1<=A31] | [A16<=A24 & 2<=A10]]]]]]

abstracting: (2<=A10)
states: 25,629,265,920 (10)
abstracting: (A16<=A24)
states: 650,547,834,448 (11)
abstracting: (1<=A31)
states: 273,132,591,286 (11)
abstracting: (2<=A10)
states: 25,629,265,920 (10)
abstracting: (1<=B16)
states: 257,611,503,736 (11)
abstracting: (A13<=A6)
states: 613,051,652,869 (11)
abstracting: (A29<=A4)
states: 647,196,551,472 (11)
abstracting: (3<=A25)
states: 0
MC time: 1m41.007sec

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

abstracting: (2<=A31)
states: 18,040,767,532 (10)
abstracting: (1<=A30)
states: 270,433,396,238 (11)

before gc: list nodes free: 7146141

after gc: idd nodes used:928311, unused:63071689; list nodes free:437082228
-> the formula is TRUE

FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m46.140sec

checking: AG [A32<=A8]
normalized: ~ [E [true U ~ [A32<=A8]]]

abstracting: (A32<=A8)
states: 386,975,943,928 (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 117 sec

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

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

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

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

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

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

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

.........10 32579......

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="DNAwalker-PT-16redondantChoiceR"
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/DNAwalker-PT-16redondantChoiceR.tgz
mv 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 DNAwalker-PT-16redondantChoiceR, 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 r021-blw3-149440254900142"
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 ;