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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r201-smll-149581161300003
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495812769853

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


RS generation: 0m 0.021sec


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


RS generation: 0m 0.004sec


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



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

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

abstracting: (3<=p_0_1)
states: 3,003 (3)
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

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

abstracting: (3<=p_0_2)
states: 3,003 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [3<=p_1_2]
normalized: E [true U 3<=p_1_2]

abstracting: (3<=p_1_2)
states: 3,003 (3)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: ~ [2<=p_1_0]
normalized: ~ [2<=p_1_0]

abstracting: (2<=p_1_0)
states: 6,435 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (p_0_0<=p_0_0)
states: 24,310 (4)
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: p_0_1<=p_0_0
normalized: p_0_1<=p_0_0

abstracting: (p_0_1<=p_0_0)
states: 15,792 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [p_0_0<=p_2_0 U EG [3<=p_2_2]]
normalized: E [p_0_0<=p_2_0 U EG [3<=p_2_2]]

abstracting: (3<=p_2_2)
states: 3,003 (3)
.
EG iterations: 1
abstracting: (p_0_0<=p_2_0)
states: 15,792 (4)
-> the formula is TRUE

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

MC time: 0m 0.007sec

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

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

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p_2_0<=p_1_2 | EF [p_1_1<=p_2_1]]]
normalized: ~ [E [true U ~ [[E [true U p_1_1<=p_2_1] | p_2_0<=p_1_2]]]]

abstracting: (p_2_0<=p_1_2)
states: 15,792 (4)
abstracting: (p_1_1<=p_2_1)
states: 15,792 (4)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: A [~ [[2<=p_1_1 & 3<=p_1_2]] U EX [p_1_2<=p_1_1]]
normalized: [~ [EG [~ [EX [p_1_2<=p_1_1]]]] & ~ [E [~ [EX [p_1_2<=p_1_1]] U [[2<=p_1_1 & 3<=p_1_2] & ~ [EX [p_1_2<=p_1_1]]]]]]

abstracting: (p_1_2<=p_1_1)
states: 15,792 (4)
.abstracting: (3<=p_1_2)
states: 3,003 (3)
abstracting: (2<=p_1_1)
states: 6,435 (3)
abstracting: (p_1_2<=p_1_1)
states: 15,792 (4)
.abstracting: (p_1_2<=p_1_1)
states: 15,792 (4)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.009sec

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

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

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AG [EG [p_0_0<=p_0_0]] | A [~ [p_0_2<=p_2_2] U 2<=p_1_0]]
normalized: [[~ [EG [~ [2<=p_1_0]]] & ~ [E [~ [2<=p_1_0] U [p_0_2<=p_2_2 & ~ [2<=p_1_0]]]]] | ~ [E [true U ~ [EG [p_0_0<=p_0_0]]]]]

abstracting: (p_0_0<=p_0_0)
states: 24,310 (4)

EG iterations: 0
abstracting: (2<=p_1_0)
states: 6,435 (3)
abstracting: (p_0_2<=p_2_2)
states: 15,792 (4)
abstracting: (2<=p_1_0)
states: 6,435 (3)
abstracting: (2<=p_1_0)
states: 6,435 (3)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: AG [[AF [p_1_0<=p_1_0] | [~ [3<=p_0_0] & p_1_2<=p_0_0]]]
normalized: ~ [E [true U ~ [[[p_1_2<=p_0_0 & ~ [3<=p_0_0]] | ~ [EG [~ [p_1_0<=p_1_0]]]]]]]

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

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

MC time: 0m 0.000sec

checking: [[~ [2<=p_1_2] & AF [p_0_2<=p_1_2]] | p_0_2<=p_0_1]
normalized: [p_0_2<=p_0_1 | [~ [EG [~ [p_0_2<=p_1_2]]] & ~ [2<=p_1_2]]]

abstracting: (2<=p_1_2)
states: 6,435 (3)
abstracting: (p_0_2<=p_1_2)
states: 15,792 (4)
.
EG iterations: 1
abstracting: (p_0_2<=p_0_1)
states: 15,792 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [[AG [[p_0_2<=p_1_1 | 2<=p_0_1]] | [p_2_0<=p_2_1 & EF [2<=p_2_1]]] & EF [EG [3<=p_0_2]]]
normalized: [E [true U EG [3<=p_0_2]] & [[p_2_0<=p_2_1 & E [true U 2<=p_2_1]] | ~ [E [true U ~ [[p_0_2<=p_1_1 | 2<=p_0_1]]]]]]

abstracting: (2<=p_0_1)
states: 6,435 (3)
abstracting: (p_0_2<=p_1_1)
states: 15,792 (4)
abstracting: (2<=p_2_1)
states: 6,435 (3)
abstracting: (p_2_0<=p_2_1)
states: 15,792 (4)
abstracting: (3<=p_0_2)
states: 3,003 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1c12-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

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

abstracting: (1<=p_0_0)
states: 12,870 (4)
.abstracting: (1<=p_1_0)
states: 12,870 (4)
abstracting: (p_2_0<=p_0_1)
states: 15,792 (4)
abstracting: (2<=p_1_2)
states: 6,435 (3)
abstracting: (1<=p_2_0)
states: 12,870 (4)
abstracting: (p_2_1<=p_0_0)
states: 15,792 (4)
abstracting: (1<=p_2_1)
states: 12,870 (4)
-> the formula is TRUE

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

MC time: 0m 0.002sec

totally nodes used: 8975 (9.0e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 198167 60218 258385
used/not used/entry size/cache size: 66246 67042618 16 1024MB
basic ops cache: hits/miss/sum: 31037 10591 41628
used/not used/entry size/cache size: 19982 16757234 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: 5262 1354 6616
used/not used/entry size/cache size: 1354 8387254 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 67100442
1 8144
2 216
3 27
4 1
5 5
6 3
7 4
8 3
9 4
>= 10 15

Total processing time: 0m 7.552sec


BK_STOP 1495812777511

--------------------
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:500 (12), effective:32 (0)

iterations count:388 (9), effective:24 (0)

iterations count:388 (9), effective:24 (0)

iterations count:433 (10), effective:30 (0)

iterations count:103 (2), effective:9 (0)

iterations count:737 (18), effective:51 (1)

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

iterations count:219 (5), effective:23 (0)

iterations count:272 (6), effective:16 (0)

iterations count:388 (9), effective:24 (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="NeighborGrid-PT-d2n3m1c12"
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/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 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 r201-smll-149581161300003"
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 ;