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 HexagonalGrid-PT-126, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581024000192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495823888604

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: HexagonalGrid_PT_126
(NrP: 31 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 1.245sec

parse successfull
net created successfully

Net: HexagonalGrid_PT_126
(NrP: 31 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 3.923sec


RS generation: 0m 0.222sec


-> reachability set: #nodes 1925 (1.9e+03) #states 2,664,192 (6)



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

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

abstracting: (2<=pb5_1_1)
states: 887,040 (5)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.123sec

checking: EF [[EF [2<=pi1_1_1] & EF [2<=pol2_1_1]]]
normalized: E [true U [E [true U 2<=pol2_1_1] & E [true U 2<=pi1_1_1]]]

abstracting: (2<=pi1_1_1)
states: 0
abstracting: (2<=pol2_1_1)
states: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [EG [EG [po3_1_1<=pol6_1_1]]]
normalized: ~ [EG [EG [po3_1_1<=pol6_1_1]]]

abstracting: (po3_1_1<=pol6_1_1)
states: 2,293,504 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [pol2_1_1<=pol5_1_1]
normalized: EG [pol2_1_1<=pol5_1_1]

abstracting: (pol2_1_1<=pol5_1_1)
states: 2,031,744 (6)
..
EG iterations: 2
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: [EX [AG [1<=pb3_1_1]] | AF [1<=pi4_1_1]]
normalized: [~ [EG [~ [1<=pi4_1_1]]] | EX [~ [E [true U ~ [1<=pb3_1_1]]]]]

abstracting: (1<=pb3_1_1)
states: 1,579,008 (6)
.abstracting: (1<=pi4_1_1)
states: 1,003,136 (6)
...
EG iterations: 3
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.259sec

checking: ~ [EG [pi4_1_1<=po1_1_1]]
normalized: ~ [EG [pi4_1_1<=po1_1_1]]

abstracting: (pi4_1_1<=po1_1_1)
states: 2,031,744 (6)
...
EG iterations: 3
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: [EG [EF [2<=pb5_1_1]] | EG [EX [pb2_1_1<=pil2_1_1]]]
normalized: [EG [EX [pb2_1_1<=pil2_1_1]] | EG [E [true U 2<=pb5_1_1]]]

abstracting: (2<=pb5_1_1)
states: 887,040 (5)

EG iterations: 0
abstracting: (pb2_1_1<=pil2_1_1)
states: 1,512,448 (6)
..
EG iterations: 1
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.295sec

checking: E [AG [pol6_1_1<=pil1_1_1] U EF [3<=pol2_1_1]]
normalized: E [~ [E [true U ~ [pol6_1_1<=pil1_1_1]]] U E [true U 3<=pol2_1_1]]

abstracting: (3<=pol2_1_1)
states: 0
abstracting: (pol6_1_1<=pil1_1_1)
states: 2,031,744 (6)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: [EF [3<=pil3_1_1] & ~ [AF [[3<=pol6_1_1 | pb3_1_1<=pil4_1_1]]]]
normalized: [EG [~ [[3<=pol6_1_1 | pb3_1_1<=pil4_1_1]]] & E [true U 3<=pil3_1_1]]

abstracting: (3<=pil3_1_1)
states: 0
abstracting: (pb3_1_1<=pil4_1_1)
states: 1,512,448 (6)
abstracting: (3<=pol6_1_1)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: EG [E [pil5_1_1<=pbl_1_1 U pil1_1_1<=pb3_1_1]]
normalized: EG [E [pil5_1_1<=pbl_1_1 U pil1_1_1<=pb3_1_1]]

abstracting: (pil1_1_1<=pb3_1_1)
states: 2,006,272 (6)
abstracting: (pil5_1_1<=pbl_1_1)
states: 2,664,192 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: EF [AF [[pbl_1_1<=po2_1_1 & pb3_1_1<=pol4_1_1]]]
normalized: E [true U ~ [EG [~ [[pbl_1_1<=po2_1_1 & pb3_1_1<=pol4_1_1]]]]]

abstracting: (pb3_1_1<=pol4_1_1)
states: 1,512,448 (6)
abstracting: (pbl_1_1<=po2_1_1)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [~ [[3<=pi1_1_1 | AF [pil6_1_1<=po4_1_1]]] | AG [~ [[1<=pi6_1_1 & 2<=pol6_1_1]]]]
normalized: [~ [E [true U [1<=pi6_1_1 & 2<=pol6_1_1]]] | ~ [[3<=pi1_1_1 | ~ [EG [~ [pil6_1_1<=po4_1_1]]]]]]

abstracting: (pil6_1_1<=po4_1_1)
states: 1,635,584 (6)
...
EG iterations: 3
abstracting: (3<=pi1_1_1)
states: 0
abstracting: (2<=pol6_1_1)
states: 0
abstracting: (1<=pi6_1_1)
states: 1,003,136 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: [[2<=pb5_1_1 | [~ [1<=po2_1_1] | EX [pb5_1_1<=pol1_1_1]]] & AF [EX [2<=pil6_1_1]]]
normalized: [~ [EG [~ [EX [2<=pil6_1_1]]]] & [2<=pb5_1_1 | [EX [pb5_1_1<=pol1_1_1] | ~ [1<=po2_1_1]]]]

abstracting: (1<=po2_1_1)
states: 1,003,136 (6)
abstracting: (pb5_1_1<=pol1_1_1)
states: 1,512,448 (6)
.abstracting: (2<=pb5_1_1)
states: 887,040 (5)
abstracting: (2<=pil6_1_1)
states: 0
.
EG iterations: 0
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: [EF [~ [pol1_1_1<=pil4_1_1]] & [EG [po3_1_1<=pil2_1_1] & pi6_1_1<=pb2_1_1]]
normalized: [[pi6_1_1<=pb2_1_1 & EG [po3_1_1<=pil2_1_1]] & E [true U ~ [pol1_1_1<=pil4_1_1]]]

abstracting: (pol1_1_1<=pil4_1_1)
states: 2,031,744 (6)
abstracting: (po3_1_1<=pil2_1_1)
states: 2,293,504 (6)
.
EG iterations: 1
abstracting: (pi6_1_1<=pb2_1_1)
states: 2,236,928 (6)
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: [[[~ [[1<=po2_1_1 & pol2_1_1<=pi6_1_1]] & ~ [~ [pil6_1_1<=pi3_1_1]]] | A [2<=pi2_1_1 U pb3_1_1<=pb5_1_1]] & EG [1<=pol2_1_1]]
normalized: [EG [1<=pol2_1_1] & [[~ [EG [~ [pb3_1_1<=pb5_1_1]]] & ~ [E [~ [pb3_1_1<=pb5_1_1] U [~ [2<=pi2_1_1] & ~ [pb3_1_1<=pb5_1_1]]]]] | [pil6_1_1<=pi3_1_1 & ~ [[1<=po2_1_1 & pol2_1_1<=pi6_1_1]]]]]

abstracting: (pol2_1_1<=pi6_1_1)
states: 1,635,584 (6)
abstracting: (1<=po2_1_1)
states: 1,003,136 (6)
abstracting: (pil6_1_1<=pi3_1_1)
states: 1,635,584 (6)
abstracting: (pb3_1_1<=pb5_1_1)
states: 1,661,056 (6)
abstracting: (2<=pi2_1_1)
states: 0
abstracting: (pb3_1_1<=pb5_1_1)
states: 1,661,056 (6)
abstracting: (pb3_1_1<=pb5_1_1)
states: 1,661,056 (6)
.
EG iterations: 1
abstracting: (1<=pol2_1_1)
states: 1,661,056 (6)
..
EG iterations: 2
-> the formula is TRUE

FORMULA HexagonalGrid-PT-126-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.153sec

checking: [~ [[~ [[1<=po2_1_1 & 1<=po6_1_1]] & [3<=po6_1_1 & [1<=pol6_1_1 | pb6_1_1<=pb6_1_1]]]] & EF [[[2<=pi2_1_1 & pb3_1_1<=po3_1_1] & [pol1_1_1<=pb4_1_1 & 1<=pol5_1_1]]]]
normalized: [E [true U [[pol1_1_1<=pb4_1_1 & 1<=pol5_1_1] & [2<=pi2_1_1 & pb3_1_1<=po3_1_1]]] & ~ [[[3<=po6_1_1 & [1<=pol6_1_1 | pb6_1_1<=pb6_1_1]] & ~ [[1<=po2_1_1 & 1<=po6_1_1]]]]]

abstracting: (1<=po6_1_1)
states: 1,003,136 (6)
abstracting: (1<=po2_1_1)
states: 1,003,136 (6)
abstracting: (pb6_1_1<=pb6_1_1)
states: 2,664,192 (6)
abstracting: (1<=pol6_1_1)
states: 1,661,056 (6)
abstracting: (3<=po6_1_1)
states: 0
abstracting: (pb3_1_1<=po3_1_1)
states: 1,349,888 (6)
abstracting: (2<=pi2_1_1)
states: 0
abstracting: (1<=pol5_1_1)
states: 1,661,056 (6)
abstracting: (pol1_1_1<=pb4_1_1)
states: 2,006,272 (6)
-> the formula is FALSE

FORMULA HexagonalGrid-PT-126-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 135605 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1245233 1182788 2428021
used/not used/entry size/cache size: 1275436 65833428 16 1024MB
basic ops cache: hits/miss/sum: 123466 142389 265855
used/not used/entry size/cache size: 240206 16537010 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: 21145 18090 39235
used/not used/entry size/cache size: 18085 8370523 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 66976837
1 129112
2 2650
3 212
4 14
5 3
6 1
7 0
8 3
9 2
>= 10 30

Total processing time: 0m 8.789sec


BK_STOP 1495823897497

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

ptnet_zbdd.cc:255: 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.001sec


iterations count:1242 (29), effective:124 (2)

initing FirstDep: 0m 0.000sec


iterations count:663 (15), effective:33 (0)

iterations count:543 (12), effective:33 (0)

iterations count:357 (8), effective:18 (0)

iterations count:294 (7), effective:16 (0)

iterations count:340 (8), effective:19 (0)

iterations count:42 (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="HexagonalGrid-PT-126"
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/HexagonalGrid-PT-126.tgz
mv HexagonalGrid-PT-126 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 HexagonalGrid-PT-126, 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 r181-blw3-149581024000192"
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 ;