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

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

=== Now, execution of the tool begins

BK_START 1495812843746

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_d2n3m1t12
(NrP: 9 NrTr: 72 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 1.294sec


RS generation: 0m 0.019sec


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


parse successfull
net created successfully

Net: NeighborGrid_PT_d2n3m1t12
(NrP: 9 NrTr: 72 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 4.348sec


RS generation: 0m 0.007sec


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



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

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

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

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

MC time: 0m 0.008sec

checking: AG [EX [[1<=p_1_2 | 2<=p_2_1]]]
normalized: ~ [E [true U ~ [EX [[1<=p_1_2 | 2<=p_2_1]]]]]

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

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [~ [AX [p_0_0<=p_2_0]]]
normalized: ~ [EG [~ [EX [~ [p_0_0<=p_2_0]]]]]

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

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

MC time: 0m 0.012sec

checking: AG [~ [AF [p_1_1<=p_0_0]]]
normalized: ~ [E [true U ~ [EG [~ [p_1_1<=p_0_0]]]]]

abstracting: (p_1_1<=p_0_0)
states: 15,792 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: p_2_2<=p_1_2
normalized: p_2_2<=p_1_2

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

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

MC time: 0m 0.000sec

checking: AX [[EF [p_0_1<=p_2_2] | 2<=p_0_1]]
normalized: ~ [EX [~ [[E [true U p_0_1<=p_2_2] | 2<=p_0_1]]]]

abstracting: (2<=p_0_1)
states: 6,435 (3)
abstracting: (p_0_1<=p_2_2)
states: 15,792 (4)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (2<=p_0_2)
states: 6,435 (3)
.abstracting: (p_0_2<=p_0_0)
states: 15,792 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [p_1_0<=p_1_0 U AX [3<=p_1_1]]
normalized: E [p_1_0<=p_1_0 U ~ [EX [~ [3<=p_1_1]]]]

abstracting: (3<=p_1_1)
states: 3,003 (3)
.abstracting: (p_1_0<=p_1_0)
states: 24,310 (4)
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: EG [AG [[p_2_1<=p_1_1 | 1<=p_2_1]]]
normalized: EG [~ [E [true U ~ [[p_2_1<=p_1_1 | 1<=p_2_1]]]]]

abstracting: (1<=p_2_1)
states: 12,870 (4)
abstracting: (p_2_1<=p_1_1)
states: 15,792 (4)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [p_1_2<=p_2_1 & AX [2<=p_1_1]]
normalized: [p_1_2<=p_2_1 & ~ [EX [~ [2<=p_1_1]]]]

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

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [EX [[p_0_1<=p_1_1 & p_1_2<=p_1_0]]]
normalized: ~ [E [true U ~ [EX [[p_0_1<=p_1_1 & p_1_2<=p_1_0]]]]]

abstracting: (p_1_2<=p_1_0)
states: 15,792 (4)
abstracting: (p_0_1<=p_1_1)
states: 15,792 (4)
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EG [EF [[p_1_0<=p_2_0 & p_2_2<=p_1_2]]]
normalized: EG [E [true U [p_1_0<=p_2_0 & p_2_2<=p_1_2]]]

abstracting: (p_2_2<=p_1_2)
states: 15,792 (4)
abstracting: (p_1_0<=p_2_0)
states: 15,792 (4)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: EF [[~ [~ [2<=p_2_1]] & [[2<=p_1_0 | p_2_1<=p_2_0] & 1<=p_1_2]]]
normalized: E [true U [2<=p_2_1 & [1<=p_1_2 & [2<=p_1_0 | p_2_1<=p_2_0]]]]

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

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

MC time: 0m 0.004sec

checking: [AX [EF [3<=p_2_2]] & AF [[[1<=p_0_2 & 1<=p_1_2] & [2<=p_2_2 | p_2_0<=p_0_0]]]]
normalized: [~ [EG [~ [[[1<=p_0_2 & 1<=p_1_2] & [2<=p_2_2 | p_2_0<=p_0_0]]]]] & ~ [EX [~ [E [true U 3<=p_2_2]]]]]

abstracting: (3<=p_2_2)
states: 3,003 (3)
.abstracting: (p_2_0<=p_0_0)
states: 15,792 (4)
abstracting: (2<=p_2_2)
states: 6,435 (3)
abstracting: (1<=p_1_2)
states: 12,870 (4)
abstracting: (1<=p_0_2)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.009sec

checking: ~ [[[EG [3<=p_1_0] | p_2_0<=p_0_0] & E [p_0_0<=p_0_1 U 1<=p_1_1]]]
normalized: ~ [[[p_2_0<=p_0_0 | EG [3<=p_1_0]] & E [p_0_0<=p_0_1 U 1<=p_1_1]]]

abstracting: (1<=p_1_1)
states: 12,870 (4)
abstracting: (p_0_0<=p_0_1)
states: 15,792 (4)
abstracting: (3<=p_1_0)
states: 3,003 (3)
.
EG iterations: 1
abstracting: (p_2_0<=p_0_0)
states: 15,792 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

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

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

FORMULA NeighborGrid-PT-d2n3m1t12-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

totally nodes used: 14378 (1.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 350790 111719 462509
used/not used/entry size/cache size: 117250 66991614 16 1024MB
basic ops cache: hits/miss/sum: 58169 15464 73633
used/not used/entry size/cache size: 29615 16747601 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: 6267 1534 7801
used/not used/entry size/cache size: 1534 8387074 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 67095657
1 12604
2 418
3 97
4 30
5 16
6 12
7 3
8 0
9 5
>= 10 22

Total processing time: 0m 7.701sec


BK_STOP 1495812851557

--------------------
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:1720 (23), effective:72 (1)

initing FirstDep: 0m 0.000sec


iterations count:603 (8), effective:24 (0)

iterations count:181 (2), effective:17 (0)

iterations count:81 (1), effective:9 (0)

iterations count:426 (5), effective:16 (0)

iterations count:91 (1), effective:9 (0)

iterations count:72 (1), effective:0 (0)

iterations count:780 (10), effective:32 (0)

iterations count:615 (8), effective:33 (0)

iterations count:900 (12), effective:42 (0)

iterations count:957 (13), effective:40 (0)

iterations count:603 (8), effective:24 (0)

iterations count:306 (4), effective:14 (0)

iterations count:609 (8), effective:30 (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-d2n3m1t12"
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-d2n3m1t12.tgz
mv NeighborGrid-PT-d2n3m1t12 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-d2n3m1t12, 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-149581161300012"
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 ;