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-12ringLLLarge, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r021-blw3-149440254800106
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494448637275

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_12ringLLLarge
(NrP: 33 NrTr: 312 NrArc: 916)

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

net check time: 0m 0.000sec

init dd package: 0m 1.052sec

parse successfull
net created successfully

Net: DNAwalker_PT_12ringLLLarge
(NrP: 33 NrTr: 312 NrArc: 916)

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

net check time: 0m 0.000sec

init dd package: 0m 3.549sec


RS generation: 0m36.368sec


-> reachability set: #nodes 12114 (1.2e+04) #states 1,885,372,776 (9)



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

checking: AG [1<=A24]
normalized: ~ [E [true U ~ [1<=A24]]]

abstracting: (1<=A24)
states: 985,996,215 (8)
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.736sec

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

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

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[A25<=B18 & 3<=B2]]
normalized: E [true U [A25<=B18 & 3<=B2]]

abstracting: (3<=B2)
states: 0
abstracting: (A25<=B18)
states: 1,212,653,415 (9)
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EF [[3<=A23 & ~ [[1<=B18 & B17<=A22]]]]
normalized: E [true U [3<=A23 & ~ [[1<=B18 & B17<=A22]]]]

abstracting: (B17<=A22)
states: 1,885,372,776 (9)
abstracting: (1<=B18)
states: 600,278,025 (8)
abstracting: (3<=A23)
states: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: AG [~ [[[3<=A25 | 3<=A12] & ~ [A9<=A26]]]]
normalized: ~ [E [true U [~ [A9<=A26] & [3<=A25 | 3<=A12]]]]

abstracting: (3<=A12)
states: 0
abstracting: (3<=A25)
states: 0
abstracting: (A9<=A26)
states: 883,963,716 (8)
-> the formula is TRUE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: AG [~ [[[1<=B18 & 3<=A27] & [2<=A25 | 1<=B17]]]]
normalized: ~ [E [true U [[2<=A25 | 1<=B17] & [1<=B18 & 3<=A27]]]]

abstracting: (3<=A27)
states: 0
abstracting: (1<=B18)
states: 600,278,025 (8)
abstracting: (1<=B17)
states: 594,065,215 (8)
abstracting: (2<=A25)
states: 73,657,226 (7)
-> the formula is TRUE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: AG [~ [[[A21<=A3 & 3<=A18] & ~ [1<=B5]]]]
normalized: ~ [E [true U [~ [1<=B5] & [A21<=A3 & 3<=A18]]]]

abstracting: (3<=A18)
states: 0
abstracting: (A21<=A3)
states: 1,264,971,187 (9)
abstracting: (1<=B5)
states: 594,446,472 (8)
-> the formula is TRUE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: EF [~ [[[A21<=B2 | 1<=A4] | [B2<=A7 | 2<=A6]]]]
normalized: E [true U ~ [[[B2<=A7 | 2<=A6] | [A21<=B2 | 1<=A4]]]]

abstracting: (1<=A4)
states: 632,196,820 (8)
abstracting: (A21<=B2)
states: 1,233,486,060 (9)
abstracting: (2<=A6)
states: 71,198,929 (7)
abstracting: (B2<=A7)
states: 1,622,108,658 (9)
-> the formula is TRUE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.100sec

checking: AG [[[A4<=A8 | A25<=A8] | A27<=A15]]
normalized: ~ [E [true U ~ [[A27<=A15 | [A4<=A8 | A25<=A8]]]]]

abstracting: (A25<=A8)
states: 1,348,380,420 (9)
abstracting: (A4<=A8)
states: 1,526,485,936 (9)
abstracting: (A27<=A15)
states: 1,380,297,100 (9)
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.415sec

checking: AG [[A3<=A7 | [[1<=A20 | 1<=A21] | [3<=B18 | 1<=B2]]]]
normalized: ~ [E [true U ~ [[A3<=A7 | [[3<=B18 | 1<=B2] | [1<=A20 | 1<=A21]]]]]]

abstracting: (1<=A21)
states: 881,365,320 (8)
abstracting: (1<=A20)
states: 973,214,356 (8)
abstracting: (1<=B2)
states: 556,663,898 (8)
abstracting: (3<=B18)
states: 0
abstracting: (A3<=A7)
states: 1,567,020,734 (9)
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36.319sec

checking: EF [[~ [[A17<=A11 | 1<=A17]] & ~ [[A24<=B17 | 2<=A2]]]]
normalized: E [true U [~ [[A24<=B17 | 2<=A2]] & ~ [[A17<=A11 | 1<=A17]]]]

abstracting: (1<=A17)
states: 642,168,245 (8)
abstracting: (A17<=A11)
states: 1,550,262,700 (9)
abstracting: (2<=A2)
states: 48,480,572 (7)
abstracting: (A24<=B17)
states: 1,185,810,704 (9)
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.097sec

checking: AG [[~ [[3<=A25 | 3<=B18]] | [A1<=A7 | [3<=A23 & B3<=A17]]]]
normalized: ~ [E [true U ~ [[[A1<=A7 | [3<=A23 & B3<=A17]] | ~ [[3<=A25 | 3<=B18]]]]]]

abstracting: (3<=B18)
states: 0
abstracting: (3<=A25)
states: 0
abstracting: (B3<=A17)
states: 1,507,760,317 (9)
abstracting: (3<=A23)
states: 0
abstracting: (A1<=A7)
states: 1,885,372,047 (9)
-> the formula is TRUE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[~ [[B2<=A27 & 3<=A3]] & [[3<=A18 | B5<=A20] & ~ [A10<=A10]]]]
normalized: E [true U [[~ [A10<=A10] & [3<=A18 | B5<=A20]] & ~ [[B2<=A27 & 3<=A3]]]]

abstracting: (3<=A3)
states: 0
abstracting: (B2<=A27)
states: 1,585,741,110 (9)
abstracting: (B5<=A20)
states: 1,597,514,420 (9)
abstracting: (3<=A18)
states: 0
abstracting: (A10<=A10)
states: 1,885,372,776 (9)
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: AG [[[[3<=A9 & B2<=A10] & [2<=A16 | 1<=A13]] | [[1<=A9 | 3<=B17] | A7<=A13]]]
normalized: ~ [E [true U ~ [[[[2<=A16 | 1<=A13] & [3<=A9 & B2<=A10]] | [A7<=A13 | [1<=A9 | 3<=B17]]]]]]

abstracting: (3<=B17)
states: 0
abstracting: (1<=A9)
states: 1,885,372,776 (9)
abstracting: (A7<=A13)
states: 1,367,223,260 (9)
abstracting: (B2<=A10)
states: 1,580,337,176 (9)
abstracting: (3<=A9)
states: 0
abstracting: (1<=A13)
states: 964,646,513 (8)
abstracting: (2<=A16)
states: 69,365,904 (7)
-> the formula is TRUE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [[[[A19<=B4 | A24<=A22] & [B3<=A20 | A2<=A20]] | 3<=A26]]
normalized: ~ [E [true U ~ [[3<=A26 | [[B3<=A20 | A2<=A20] & [A19<=B4 | A24<=A22]]]]]]

abstracting: (A24<=A22)
states: 1,811,699,450 (9)
abstracting: (A19<=B4)
states: 1,203,823,110 (9)
abstracting: (A2<=A20)
states: 1,565,061,934 (9)
abstracting: (B3<=A20)
states: 1,607,020,870 (9)
abstracting: (3<=A26)
states: 0
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.457sec

checking: EF [[[[2<=A24 | A22<=A17] | [1<=B18 & 1<=A1]] & [[2<=A3 & A2<=A21] & [A5<=A12 & 2<=A14]]]]
normalized: E [true U [[[1<=B18 & 1<=A1] | [2<=A24 | A22<=A17]] & [[A5<=A12 & 2<=A14] & [2<=A3 & A2<=A21]]]]

abstracting: (A2<=A21)
states: 1,530,960,290 (9)
abstracting: (2<=A3)
states: 49,106,513 (7)
abstracting: (2<=A14)
states: 72,005,340 (7)
abstracting: (A5<=A12)
states: 1,544,102,207 (9)
abstracting: (A22<=A17)
states: 592,134,798 (8)
abstracting: (2<=A24)
states: 73,673,326 (7)
abstracting: (1<=A1)
states: 729
abstracting: (1<=B18)
states: 600,278,025 (8)
-> the formula is FALSE

FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

totally nodes used: 27070109 (2.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 96211106 106007551 202218657
used/not used/entry size/cache size: 57731336 9377528 16 1024MB
basic ops cache: hits/miss/sum: 22556825 19723225 42280050
used/not used/entry size/cache size: 14798798 1978418 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 178512 161516 340028
used/not used/entry size/cache size: 160188 8228420 32 256MB
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 46143329
1 16228678
2 3755226
3 748562
4 159917
5 41220
6 16216
7 6516
8 3776
9 1747
>= 10 3677

Total processing time: 2m50.953sec


BK_STOP 1494448808452

--------------------
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 64848.........20 43692...............10 18250................10 26772..............10 7406..........10 30114................10 24450...

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-12ringLLLarge"
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-12ringLLLarge.tgz
mv DNAwalker-PT-12ringLLLarge 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-12ringLLLarge, 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-149440254800106"
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 ;