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 NeighborGrid-PT-d2n3m1c12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r201-smll-149581161300007
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495812813521

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: NeighborGrid_PT_d2n3m1c12
(NrP: 9 NrTr: 40 NrArc: 80)

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

net check time: 0m 0.000sec

init dd package: 0m 1.450sec


RS generation: 0m 0.024sec


-> last computed set: #nodes 9 (9.0e+00) #states 1


parse successfull
net created successfully

Net: NeighborGrid_PT_d2n3m1c12
(NrP: 9 NrTr: 40 NrArc: 80)

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

net check time: 0m 0.000sec

init dd package: 0m 3.998sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 81 (8.1e+01) #states 24,310 (4)



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

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

abstracting: (p_0_1<=p_0_1)
states: 24,310 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[1<=p_0_0 | 1<=p_0_0]] & ~ [2<=p_0_2]]]
normalized: E [true U [~ [2<=p_0_2] & ~ [[1<=p_0_0 | 1<=p_0_0]]]]

abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (1<=p_0_0)
states: 12,870 (4)
abstracting: (2<=p_0_2)
states: 6,435 (3)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[3<=p_1_0 & [3<=p_2_0 & p_0_0<=p_2_0]]]
normalized: E [true U [[3<=p_2_0 & p_0_0<=p_2_0] & 3<=p_1_0]]

abstracting: (3<=p_1_0)
states: 3,003 (3)
abstracting: (p_0_0<=p_2_0)
states: 15,792 (4)
abstracting: (3<=p_2_0)
states: 3,003 (3)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[~ [~ [3<=p_2_1]] & ~ [[2<=p_2_2 | p_0_2<=p_0_2]]]]
normalized: E [true U [~ [[2<=p_2_2 | p_0_2<=p_0_2]] & 3<=p_2_1]]

abstracting: (3<=p_2_1)
states: 3,003 (3)
abstracting: (p_0_2<=p_0_2)
states: 24,310 (4)
abstracting: (2<=p_2_2)
states: 6,435 (3)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p_0_2<=p_0_2 | [~ [3<=p_0_0] | ~ [p_1_0<=p_0_1]]]]
normalized: ~ [E [true U ~ [[[~ [p_1_0<=p_0_1] | ~ [3<=p_0_0]] | p_0_2<=p_0_2]]]]

abstracting: (p_0_2<=p_0_2)
states: 24,310 (4)
abstracting: (3<=p_0_0)
states: 3,003 (3)
abstracting: (p_1_0<=p_0_1)
states: 15,792 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=p_0_1 & [[3<=p_1_2 | p_0_2<=p_1_0] & [3<=p_2_1 & 3<=p_1_1]]]]
normalized: E [true U [[[3<=p_1_2 | p_0_2<=p_1_0] & [3<=p_2_1 & 3<=p_1_1]] & 3<=p_0_1]]

abstracting: (3<=p_0_1)
states: 3,003 (3)
abstracting: (3<=p_1_1)
states: 3,003 (3)
abstracting: (3<=p_2_1)
states: 3,003 (3)
abstracting: (p_0_2<=p_1_0)
states: 15,792 (4)
abstracting: (3<=p_1_2)
states: 3,003 (3)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[[3<=p_0_0 & 3<=p_0_0] & [3<=p_0_2 | 2<=p_2_0]] & ~ [[2<=p_2_1 & 2<=p_2_2]]]]
normalized: E [true U [~ [[2<=p_2_1 & 2<=p_2_2]] & [[3<=p_0_2 | 2<=p_2_0] & [3<=p_0_0 & 3<=p_0_0]]]]

abstracting: (3<=p_0_0)
states: 3,003 (3)
abstracting: (3<=p_0_0)
states: 3,003 (3)
abstracting: (2<=p_2_0)
states: 6,435 (3)
abstracting: (3<=p_0_2)
states: 3,003 (3)
abstracting: (2<=p_2_2)
states: 6,435 (3)
abstracting: (2<=p_2_1)
states: 6,435 (3)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[[p_2_2<=p_2_1 & p_1_1<=p_1_2] | [1<=p_1_1 | p_1_1<=p_0_2]]]
normalized: ~ [E [true U ~ [[[1<=p_1_1 | p_1_1<=p_0_2] | [p_2_2<=p_2_1 & p_1_1<=p_1_2]]]]]

abstracting: (p_1_1<=p_1_2)
states: 15,792 (4)
abstracting: (p_2_2<=p_2_1)
states: 15,792 (4)
abstracting: (p_1_1<=p_0_2)
states: 15,792 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[p_0_0<=p_1_0 | p_1_0<=p_1_2]] | [p_1_1<=p_1_1 | ~ [3<=p_2_1]]]]
normalized: ~ [E [true U ~ [[[~ [3<=p_2_1] | p_1_1<=p_1_1] | ~ [[p_0_0<=p_1_0 | p_1_0<=p_1_2]]]]]]

abstracting: (p_1_0<=p_1_2)
states: 15,792 (4)
abstracting: (p_0_0<=p_1_0)
states: 15,792 (4)
abstracting: (p_1_1<=p_1_1)
states: 24,310 (4)
abstracting: (3<=p_2_1)
states: 3,003 (3)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[3<=p_2_2 | [p_1_2<=p_2_1 | p_1_1<=p_0_0]] | ~ [[3<=p_2_1 | 2<=p_2_1]]]]
normalized: ~ [E [true U ~ [[~ [[3<=p_2_1 | 2<=p_2_1]] | [[p_1_2<=p_2_1 | p_1_1<=p_0_0] | 3<=p_2_2]]]]]

abstracting: (3<=p_2_2)
states: 3,003 (3)
abstracting: (p_1_1<=p_0_0)
states: 15,792 (4)
abstracting: (p_1_2<=p_2_1)
states: 15,792 (4)
abstracting: (2<=p_2_1)
states: 6,435 (3)
abstracting: (3<=p_2_1)
states: 3,003 (3)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[~ [[3<=p_0_1 & 2<=p_1_0]] | [[p_1_2<=p_0_0 & 3<=p_1_2] | [p_1_2<=p_2_0 | 2<=p_1_1]]]]
normalized: ~ [E [true U ~ [[[[p_1_2<=p_2_0 | 2<=p_1_1] | [p_1_2<=p_0_0 & 3<=p_1_2]] | ~ [[3<=p_0_1 & 2<=p_1_0]]]]]]

abstracting: (2<=p_1_0)
states: 6,435 (3)
abstracting: (3<=p_0_1)
states: 3,003 (3)
abstracting: (3<=p_1_2)
states: 3,003 (3)
abstracting: (p_1_2<=p_0_0)
states: 15,792 (4)
abstracting: (2<=p_1_1)
states: 6,435 (3)
abstracting: (p_1_2<=p_2_0)
states: 15,792 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[[[3<=p_0_0 & 2<=p_1_0] | [p_1_2<=p_2_1 | 1<=p_2_2]] | ~ [[p_2_2<=p_1_0 & 3<=p_2_1]]]]
normalized: ~ [E [true U ~ [[[[3<=p_0_0 & 2<=p_1_0] | [p_1_2<=p_2_1 | 1<=p_2_2]] | ~ [[p_2_2<=p_1_0 & 3<=p_2_1]]]]]]

abstracting: (3<=p_2_1)
states: 3,003 (3)
abstracting: (p_2_2<=p_1_0)
states: 15,792 (4)
abstracting: (1<=p_2_2)
states: 12,870 (4)
abstracting: (p_1_2<=p_2_1)
states: 15,792 (4)
abstracting: (2<=p_1_0)
states: 6,435 (3)
abstracting: (3<=p_0_0)
states: 3,003 (3)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[p_2_1<=p_2_1 | [[p_0_2<=p_1_0 | 3<=p_1_1] | [p_0_1<=p_0_2 & p_1_0<=p_1_1]]]]
normalized: ~ [E [true U ~ [[p_2_1<=p_2_1 | [[p_0_1<=p_0_2 & p_1_0<=p_1_1] | [p_0_2<=p_1_0 | 3<=p_1_1]]]]]]

abstracting: (3<=p_1_1)
states: 3,003 (3)
abstracting: (p_0_2<=p_1_0)
states: 15,792 (4)
abstracting: (p_1_0<=p_1_1)
states: 15,792 (4)
abstracting: (p_0_1<=p_0_2)
states: 15,792 (4)
abstracting: (p_2_1<=p_2_1)
states: 24,310 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[2<=p_2_2 & p_0_0<=p_1_1] & [1<=p_1_0 | 3<=p_1_2]] & [[1<=p_1_0 & 3<=p_2_0] & [3<=p_1_0 & p_1_0<=p_1_2]]]]
normalized: E [true U [[[3<=p_1_0 & p_1_0<=p_1_2] & [1<=p_1_0 & 3<=p_2_0]] & [[1<=p_1_0 | 3<=p_1_2] & [2<=p_2_2 & p_0_0<=p_1_1]]]]

abstracting: (p_0_0<=p_1_1)
states: 15,792 (4)
abstracting: (2<=p_2_2)
states: 6,435 (3)
abstracting: (3<=p_1_2)
states: 3,003 (3)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (3<=p_2_0)
states: 3,003 (3)
abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_1_0<=p_1_2)
states: 15,792 (4)
abstracting: (3<=p_1_0)
states: 3,003 (3)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[p_0_2<=p_1_2 | 2<=p_1_0] | p_0_2<=p_0_2] & [[3<=p_1_2 | p_1_0<=p_1_0] | [2<=p_1_1 | p_1_0<=p_0_2]]]]
normalized: ~ [E [true U ~ [[[[2<=p_1_1 | p_1_0<=p_0_2] | [3<=p_1_2 | p_1_0<=p_1_0]] & [p_0_2<=p_0_2 | [p_0_2<=p_1_2 | 2<=p_1_0]]]]]]

abstracting: (2<=p_1_0)
states: 6,435 (3)
abstracting: (p_0_2<=p_1_2)
states: 15,792 (4)
abstracting: (p_0_2<=p_0_2)
states: 24,310 (4)
abstracting: (p_1_0<=p_1_0)
states: 24,310 (4)
abstracting: (3<=p_1_2)
states: 3,003 (3)
abstracting: (p_1_0<=p_0_2)
states: 15,792 (4)
abstracting: (2<=p_1_1)
states: 6,435 (3)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [p_2_2<=p_1_0] | [2<=p_1_0 | p_2_2<=p_1_0]] | [[p_2_1<=p_2_0 & p_1_1<=p_1_0] | [1<=p_1_1 | p_2_2<=p_0_2]]]]
normalized: ~ [E [true U ~ [[[[1<=p_1_1 | p_2_2<=p_0_2] | [p_2_1<=p_2_0 & p_1_1<=p_1_0]] | [[2<=p_1_0 | p_2_2<=p_1_0] | ~ [p_2_2<=p_1_0]]]]]]

abstracting: (p_2_2<=p_1_0)
states: 15,792 (4)
abstracting: (p_2_2<=p_1_0)
states: 15,792 (4)
abstracting: (2<=p_1_0)
states: 6,435 (3)
abstracting: (p_1_1<=p_1_0)
states: 15,792 (4)
abstracting: (p_2_1<=p_2_0)
states: 15,792 (4)
abstracting: (p_2_2<=p_0_2)
states: 15,792 (4)
abstracting: (1<=p_1_1)
states: 12,870 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 6924 (6.9e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 100981 35813 136794
used/not used/entry size/cache size: 38817 67070047 16 1024MB
basic ops cache: hits/miss/sum: 25959 10566 36525
used/not used/entry size/cache size: 21164 16756052 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: 7026 1715 8741
used/not used/entry size/cache size: 1715 8386893 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 67102450
1 6279
2 73
3 21
4 4
5 1
6 2
7 5
8 0
9 5
>= 10 24

Total processing time: 0m 8.008sec


BK_STOP 1495812821647

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

zbdd.cc:1122: 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


initing FirstDep: 0m 0.000sec


iterations count:1125 (28), effective:72 (1)

initing FirstDep: 0m 0.000sec


iterations count:162 (4), effective:17 (0)

iterations count:733 (18), effective:48 (1)

iterations count:1078 (26), effective:72 (1)

iterations count:717 (17), effective:53 (1)

iterations count:882 (22), effective:60 (1)

iterations count:790 (19), effective:53 (1)

iterations count:997 (24), effective:65 (1)

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="NeighborGrid-PT-d2n3m1c12"
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/NeighborGrid-PT-d2n3m1c12.tgz
mv NeighborGrid-PT-d2n3m1c12 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 NeighborGrid-PT-d2n3m1c12, 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 r201-smll-149581161300007"
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 ;