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

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

=== Now, execution of the tool begins

BK_START 1495812972121

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_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.269sec


RS generation: 0m 0.015sec


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


RS generation: 0m 0.813sec


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



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

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

abstracting: (3<=p_2_1_2)
states: 121,548,660,036,300 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.728sec

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

abstracting: (3<=p_2_2_2)
states: 121,548,660,036,300 (14)
-> the formula is TRUE

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

MC time: 0m 0.218sec

checking: EF [[2<=p_2_2_2 & 3<=p_2_1_2]]
normalized: E [true U [2<=p_2_2_2 & 3<=p_2_1_2]]

abstracting: (3<=p_2_1_2)
states: 121,548,660,036,300 (14)
abstracting: (2<=p_2_2_2)
states: 247,959,266,474,052 (14)
-> the formula is TRUE

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

MC time: 0m 0.032sec

checking: EF [[3<=p_0_0_2 | 3<=p_2_2_0]]
normalized: E [true U [3<=p_0_0_2 | 3<=p_2_2_0]]

abstracting: (3<=p_2_2_0)
states: 121,548,660,036,300 (14)
abstracting: (3<=p_0_0_2)
states: 121,548,660,036,300 (14)
-> the formula is TRUE

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

MC time: 0m 0.870sec

checking: EF [~ [~ [[3<=p_1_2_2 & 1<=p_0_2_0]]]]
normalized: E [true U [3<=p_1_2_2 & 1<=p_0_2_0]]

abstracting: (1<=p_0_2_0)
states: 495,918,532,948,104 (14)
abstracting: (3<=p_1_2_2)
states: 121,548,660,036,300 (14)
-> the formula is TRUE

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

MC time: 0m 0.688sec

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

abstracting: (p_1_0_1<=p_1_0_1)
states: 973,469,712,824,056 (14)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[3<=p_0_1_1 & ~ [~ [p_2_2_2<=p_2_0_0]]]]
normalized: E [true U [3<=p_0_1_1 & p_2_2_2<=p_2_0_0]]

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

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

MC time: 0m 4.860sec

checking: EF [[3<=p_1_1_1 & [[1<=p_1_2_0 & 2<=p_2_2_2] & [3<=p_2_1_2 & 3<=p_2_1_0]]]]
normalized: E [true U [3<=p_1_1_1 & [[3<=p_2_1_2 & 3<=p_2_1_0] & [1<=p_1_2_0 & 2<=p_2_2_2]]]]

abstracting: (2<=p_2_2_2)
states: 247,959,266,474,052 (14)
abstracting: (1<=p_1_2_0)
states: 495,918,532,948,104 (14)
abstracting: (3<=p_2_1_0)
states: 121,548,660,036,300 (14)
abstracting: (3<=p_2_1_2)
states: 121,548,660,036,300 (14)
abstracting: (3<=p_1_1_1)
states: 121,548,660,036,300 (14)
-> the formula is TRUE

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

MC time: 0m 0.927sec

checking: AG [[~ [[p_0_1_2<=p_1_1_1 & 3<=p_0_1_2]] | p_2_1_1<=p_1_2_0]]
normalized: ~ [E [true U ~ [[p_2_1_1<=p_1_2_0 | ~ [[p_0_1_2<=p_1_1_1 & 3<=p_0_1_2]]]]]]

abstracting: (3<=p_0_1_2)
states: 121,548,660,036,300 (14)
abstracting: (p_0_1_2<=p_1_1_1)
states: 643,572,802,900,536 (14)
abstracting: (p_2_1_1<=p_1_2_0)
states: 643,572,802,900,536 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.370sec

checking: EF [[~ [1<=p_1_1_1] & [[1<=p_2_1_1 | p_2_1_2<=p_0_2_0] & ~ [1<=p_1_0_2]]]]
normalized: E [true U [[~ [1<=p_1_0_2] & [1<=p_2_1_1 | p_2_1_2<=p_0_2_0]] & ~ [1<=p_1_1_1]]]

abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
abstracting: (p_2_1_2<=p_0_2_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_2_1_1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p_1_0_2)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

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

MC time: 0m 7.961sec

checking: EF [~ [[[p_1_0_2<=p_0_1_0 | p_2_1_2<=p_1_2_1] | ~ [p_1_2_2<=p_2_1_2]]]]
normalized: E [true U ~ [[~ [p_1_2_2<=p_2_1_2] | [p_1_0_2<=p_0_1_0 | p_2_1_2<=p_1_2_1]]]]

abstracting: (p_2_1_2<=p_1_2_1)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_2<=p_0_1_0)
states: 643,572,802,900,536 (14)
abstracting: (p_1_2_2<=p_2_1_2)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

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

MC time: 0m 1.951sec

checking: EF [[[3<=p_0_2_0 & 3<=p_0_1_1] & [~ [3<=p_0_2_2] | [p_1_2_2<=p_1_0_2 & 2<=p_0_0_1]]]]
normalized: E [true U [[[p_1_2_2<=p_1_0_2 & 2<=p_0_0_1] | ~ [3<=p_0_2_2]] & [3<=p_0_2_0 & 3<=p_0_1_1]]]

abstracting: (3<=p_0_1_1)
states: 121,548,660,036,300 (14)
abstracting: (3<=p_0_2_0)
states: 121,548,660,036,300 (14)
abstracting: (3<=p_0_2_2)
states: 121,548,660,036,300 (14)
abstracting: (2<=p_0_0_1)
states: 247,959,266,474,052 (14)
abstracting: (p_1_2_2<=p_1_0_2)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

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

MC time: 0m 1.780sec

checking: AG [[[[p_2_2_0<=p_2_0_0 & 2<=p_1_1_2] | ~ [2<=p_2_2_2]] | ~ [[3<=p_1_1_1 & 2<=p_2_0_1]]]]
normalized: ~ [E [true U ~ [[~ [[3<=p_1_1_1 & 2<=p_2_0_1]] | [~ [2<=p_2_2_2] | [p_2_2_0<=p_2_0_0 & 2<=p_1_1_2]]]]]]

abstracting: (2<=p_1_1_2)
states: 247,959,266,474,052 (14)
abstracting: (p_2_2_0<=p_2_0_0)
states: 643,572,802,900,536 (14)
abstracting: (2<=p_2_2_2)
states: 247,959,266,474,052 (14)
abstracting: (2<=p_2_0_1)
states: 247,959,266,474,052 (14)
abstracting: (3<=p_1_1_1)
states: 121,548,660,036,300 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.630sec

checking: EF [[~ [[p_1_2_2<=p_2_0_1 | 1<=p_1_2_1]] & [~ [p_0_1_0<=p_2_0_0] | [3<=p_0_1_0 & p_0_1_1<=p_1_2_1]]]]
normalized: E [true U [[[3<=p_0_1_0 & p_0_1_1<=p_1_2_1] | ~ [p_0_1_0<=p_2_0_0]] & ~ [[p_1_2_2<=p_2_0_1 | 1<=p_1_2_1]]]]

abstracting: (1<=p_1_2_1)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_2<=p_2_0_1)
states: 643,572,802,900,536 (14)
abstracting: (p_0_1_0<=p_2_0_0)
states: 643,572,802,900,536 (14)
abstracting: (p_0_1_1<=p_1_2_1)
states: 643,572,802,900,536 (14)
abstracting: (3<=p_0_1_0)
states: 121,548,660,036,300 (14)
-> the formula is TRUE

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

MC time: 0m 3.972sec

checking: EF [[[[3<=p_0_0_0 & 3<=p_2_2_1] & p_2_1_0<=p_2_2_2] & ~ [[p_1_0_1<=p_0_0_1 & p_1_0_2<=p_0_0_0]]]]
normalized: E [true U [~ [[p_1_0_1<=p_0_0_1 & p_1_0_2<=p_0_0_0]] & [p_2_1_0<=p_2_2_2 & [3<=p_0_0_0 & 3<=p_2_2_1]]]]

abstracting: (3<=p_2_2_1)
states: 121,548,660,036,300 (14)
abstracting: (3<=p_0_0_0)
states: 121,548,660,036,300 (14)
abstracting: (p_2_1_0<=p_2_2_2)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_2<=p_0_0_0)
states: 643,572,802,900,536 (14)
abstracting: (p_1_0_1<=p_0_0_1)
states: 643,572,802,900,536 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.318sec

checking: EF [[[[p_2_2_0<=p_1_0_0 & 2<=p_2_2_2] & [p_1_2_2<=p_1_1_1 & 1<=p_0_0_2]] & [[3<=p_0_1_0 & 1<=p_1_1_1] | [1<=p_2_2_2 & 3<=p_2_1_1]]]]
normalized: E [true U [[[1<=p_2_2_2 & 3<=p_2_1_1] | [3<=p_0_1_0 & 1<=p_1_1_1]] & [[p_1_2_2<=p_1_1_1 & 1<=p_0_0_2] & [p_2_2_0<=p_1_0_0 & 2<=p_2_2_2]]]]

abstracting: (2<=p_2_2_2)
states: 247,959,266,474,052 (14)
abstracting: (p_2_2_0<=p_1_0_0)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_0_0_2)
states: 495,918,532,948,104 (14)
abstracting: (p_1_2_2<=p_1_1_1)
states: 643,572,802,900,536 (14)
abstracting: (1<=p_1_1_1)
states: 495,918,532,948,104 (14)
abstracting: (3<=p_0_1_0)
states: 121,548,660,036,300 (14)
abstracting: (3<=p_2_1_1)
states: 121,548,660,036,300 (14)
abstracting: (1<=p_2_2_2)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

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

MC time: 0m15.225sec

totally nodes used: 1644360 (1.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 399571603 46322097 445893700
used/not used/entry size/cache size: 33886559 33222305 16 1024MB
basic ops cache: hits/miss/sum: 14147455 1758468 15905923
used/not used/entry size/cache size: 2293246 14483970 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: 387718 35544 423262
used/not used/entry size/cache size: 35477 8353131 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 65535486
1 1540607
2 28641
3 1180
4 576
5 452
6 384
7 374
8 217
9 144
>= 10 803

Total processing time: 0m54.832sec


BK_STOP 1495813027074

--------------------
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:4575 (28), effective:78 (0)

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

iterations count:7517 (46), effective:130 (0)

iterations count:4454 (27), effective:77 (0)

iterations count:6044 (37), effective:104 (0)

iterations count:22200 (137), effective:390 (2)

iterations count:17810 (109), effective:312 (1)

iterations count:11656 (71), effective:222 (1)

iterations count:14102 (87), effective:324 (2)

iterations count:5825 (35), effective:126 (0)

iterations count:9613 (59), effective:188 (1)

iterations count:11350 (70), effective:201 (1)

iterations count:14011 (86), effective:379 (2)

iterations count:12563 (77), effective:239 (1)

iterations count:27721 (171), effective:598 (3)

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="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-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 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-149581161300025"
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 ;