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

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

=== Now, execution of the tool begins

BK_START 1495812919449

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_d3n3m1t11
(NrP: 27 NrTr: 162 NrArc: 324)

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

net check time: 0m 0.000sec

init dd package: 0m 1.290sec


RS generation: 0m 0.017sec


-> last computed set: #nodes 27 (2.7e+01) #states 1


parse successfull
net created successfully

Net: NeighborGrid_PT_d3n3m1t11
(NrP: 27 NrTr: 162 NrArc: 324)

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

net check time: 0m 0.000sec

init dd package: 0m 4.396sec


RS generation: 0m 0.975sec


-> reachability set: #nodes 729 (7.3e+02) #states 973,469,712,824,056 (14)



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

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

abstracting: (2<=p_1_2_1)
states: 247,959,266,474,052 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.799sec

checking: AX [AF [~ [2<=p_1_0_0]]]
normalized: ~ [EX [EG [2<=p_1_0_0]]]

abstracting: (2<=p_1_0_0)
states: 247,959,266,474,052 (14)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.096sec

checking: EF [AX [~ [1<=p_2_2_0]]]
normalized: E [true U ~ [EX [1<=p_2_2_0]]]

abstracting: (1<=p_2_2_0)
states: 495,918,532,948,104 (14)
.-> the formula is TRUE

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

MC time: 0m 0.605sec

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

abstracting: (1<=p_0_1_2)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

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

MC time: 0m 0.287sec

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

abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.300sec

checking: E [EF [2<=p_1_1_0] U AG [1<=p_0_0_1]]
normalized: E [E [true U 2<=p_1_1_0] U ~ [E [true U ~ [1<=p_0_0_1]]]]

abstracting: (1<=p_0_0_1)
states: 495,918,532,948,104 (14)
abstracting: (2<=p_1_1_0)
states: 247,959,266,474,052 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.375sec

checking: [EF [AX [p_1_2_2<=p_2_1_2]] | 3<=p_0_2_0]
normalized: [3<=p_0_2_0 | E [true U ~ [EX [~ [p_1_2_2<=p_2_1_2]]]]]

abstracting: (p_1_2_2<=p_2_1_2)
states: 643,572,802,900,536 (14)
.abstracting: (3<=p_0_2_0)
states: 121,548,660,036,300 (14)
-> the formula is TRUE

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

MC time: 0m 2.051sec

checking: EF [AX [[3<=p_1_0_1 | p_2_0_0<=p_0_1_1]]]
normalized: E [true U ~ [EX [~ [[3<=p_1_0_1 | p_2_0_0<=p_0_1_1]]]]]

abstracting: (p_2_0_0<=p_0_1_1)
states: 643,572,802,900,536 (14)
abstracting: (3<=p_1_0_1)
states: 121,548,660,036,300 (14)
.-> the formula is TRUE

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

MC time: 0m 4.455sec

checking: EF [A [p_2_1_2<=p_0_2_0 U 3<=p_0_0_1]]
normalized: E [true U [~ [EG [~ [3<=p_0_0_1]]] & ~ [E [~ [3<=p_0_0_1] U [~ [p_2_1_2<=p_0_2_0] & ~ [3<=p_0_0_1]]]]]]

abstracting: (3<=p_0_0_1)
states: 121,548,660,036,300 (14)
abstracting: (p_2_1_2<=p_0_2_0)
states: 643,572,802,900,536 (14)
abstracting: (3<=p_0_0_1)
states: 121,548,660,036,300 (14)
abstracting: (3<=p_0_0_1)
states: 121,548,660,036,300 (14)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.532sec

checking: AG [EF [[p_2_2_1<=p_2_0_0 | 2<=p_2_0_2]]]
normalized: ~ [E [true U ~ [E [true U [p_2_2_1<=p_2_0_0 | 2<=p_2_0_2]]]]]

abstracting: (2<=p_2_0_2)
states: 247,959,266,474,052 (14)
abstracting: (p_2_2_1<=p_2_0_0)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

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

MC time: 0m 5.131sec

checking: AX [EF [[p_2_1_0<=p_0_0_0 & 1<=p_1_2_0]]]
normalized: ~ [EX [~ [E [true U [p_2_1_0<=p_0_0_0 & 1<=p_1_2_0]]]]]

abstracting: (1<=p_1_2_0)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_0<=p_0_0_0)
states: 643,572,802,900,536 (14)
.-> the formula is TRUE

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

MC time: 0m 4.978sec

checking: [~ [EX [~ [p_0_2_1<=p_2_2_2]]] | AX [EF [1<=p_2_2_1]]]
normalized: [~ [EX [~ [E [true U 1<=p_2_2_1]]]] | ~ [EX [~ [p_0_2_1<=p_2_2_2]]]]

abstracting: (p_0_2_1<=p_2_2_2)
states: 643,572,802,900,536 (14)
.abstracting: (1<=p_2_2_1)
states: 495,918,532,948,104 (14)
.-> the formula is TRUE

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

MC time: 0m 0.776sec

checking: AX [EF [[1<=p_2_2_0 & p_0_1_0<=p_0_0_2]]]
normalized: ~ [EX [~ [E [true U [1<=p_2_2_0 & p_0_1_0<=p_0_0_2]]]]]

abstracting: (p_0_1_0<=p_0_0_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_2_0)
states: 495,918,532,948,104 (14)
.-> the formula is TRUE

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

MC time: 0m 0.194sec

checking: [~ [AF [[2<=p_1_2_0 | 2<=p_2_2_0]]] & AX [EF [p_0_0_1<=p_0_0_2]]]
normalized: [~ [EX [~ [E [true U p_0_0_1<=p_0_0_2]]]] & EG [~ [[2<=p_1_2_0 | 2<=p_2_2_0]]]]

abstracting: (2<=p_2_2_0)
states: 247,959,266,474,052 (14)
abstracting: (2<=p_1_2_0)
states: 247,959,266,474,052 (14)
.
EG iterations: 1
abstracting: (p_0_0_1<=p_0_0_2)
states: 643,572,802,900,536 (14)
.-> the formula is TRUE

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

MC time: 0m 0.132sec

checking: EF [[p_0_2_1<=p_0_0_1 & [[p_0_2_2<=p_0_0_1 & 3<=p_1_2_0] & ~ [p_2_1_0<=p_0_0_2]]]]
normalized: E [true U [p_0_2_1<=p_0_0_1 & [[p_0_2_2<=p_0_0_1 & 3<=p_1_2_0] & ~ [p_2_1_0<=p_0_0_2]]]]

abstracting: (p_2_1_0<=p_0_0_2)
states: 643,572,802,900,536 (14)
abstracting: (3<=p_1_2_0)
states: 121,548,660,036,300 (14)
abstracting: (p_0_2_2<=p_0_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_2_1<=p_0_0_1)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

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

MC time: 0m 1.375sec

checking: [~ [[[[3<=p_1_2_0 & p_1_2_2<=p_0_2_1] | [1<=p_0_0_0 & p_1_0_1<=p_1_0_2]] & p_1_1_0<=p_1_1_1]] | AG [EF [p_2_2_0<=p_2_2_0]]]
normalized: [~ [E [true U ~ [E [true U p_2_2_0<=p_2_2_0]]]] | ~ [[p_1_1_0<=p_1_1_1 & [[1<=p_0_0_0 & p_1_0_1<=p_1_0_2] | [3<=p_1_2_0 & p_1_2_2<=p_0_2_1]]]]]

abstracting: (p_1_2_2<=p_0_2_1)
states: 643,572,802,900,536 (14)
abstracting: (3<=p_1_2_0)
states: 121,548,660,036,300 (14)
abstracting: (p_1_0_1<=p_1_0_2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_0_0)
states: 495,918,532,948,104 (14)
abstracting: (p_1_1_0<=p_1_1_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_2_0<=p_2_2_0)
states: 973,469,712,824,056 (14)
-> the formula is TRUE

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

MC time: 0m 0.052sec

totally nodes used: 988968 (9.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 227766729 20804979 248571708
used/not used/entry size/cache size: 18470974 48637890 16 1024MB
basic ops cache: hits/miss/sum: 9451710 951211 10402921
used/not used/entry size/cache size: 1428939 15348277 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: 334435 31738 366173
used/not used/entry size/cache size: 31688 8356920 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 66165386
1 927378
2 12603
3 1062
4 532
5 406
6 305
7 241
8 185
9 171
>= 10 595

Total processing time: 0m32.144sec


BK_STOP 1495812951712

--------------------
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:40446 (249), effective:702 (4)

initing FirstDep: 0m 0.000sec


iterations count:3104 (19), effective:52 (0)

iterations count:16875 (104), effective:189 (1)

iterations count:1632 (10), effective:26 (0)

iterations count:1377 (8), effective:27 (0)

iterations count:189 (1), effective:27 (0)

iterations count:3102 (19), effective:52 (0)

iterations count:8869 (54), effective:188 (1)

iterations count:5301 (32), effective:234 (1)

iterations count:2127 (13), effective:52 (0)

iterations count:4569 (28), effective:78 (0)

iterations count:11951 (73), effective:298 (1)

iterations count:13241 (81), effective:299 (1)

iterations count:1633 (10), effective:26 (0)

iterations count:1788 (11), effective:65 (0)

iterations count:189 (1), effective:27 (0)

iterations count:7239 (44), effective:206 (1)

iterations count:162 (1), effective:0 (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-d3n3m1t11"
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-d3n3m1t11.tgz
mv NeighborGrid-PT-d3n3m1t11 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-d3n3m1t11, 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-149581161300021"
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 ;