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-3253
Executing tool marcie
Input is S_TriangularGrid-PT-1200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r151-ebro-149443454500340
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496688703895

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: TriangularGrid_PT_1200
(NrP: 16 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.000sec

init dd package: 0m 2.236sec

parse successfull
net created successfully

Net: TriangularGrid_PT_1200
(NrP: 16 NrTr: 12 NrArc: 48)

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

net check time: 0m 0.002sec

init dd package: 0m 8.256sec


RS generation: 0m 0.263sec


-> reachability set: #nodes 651 (6.5e+02) #states 109,552 (5)



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

checking: EF [~ [~ [2<=po2_1_1]]]
normalized: E [true U 2<=po2_1_1]

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

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (3<=pi3_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=pb1_1_1)
states: 105,840 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

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

abstracting: (2<=pb3_1_1)
states: 102,192 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.389sec

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

abstracting: (pi2_1_1<=pb2_1_1)
states: 107,712 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.352sec

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

abstracting: (pil3_1_1<=pb2_1_1)
states: 107,680 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [~ [[~ [2<=po1_1_1] & pil2_1_1<=pb3_1_1]]]
normalized: E [true U ~ [[pil2_1_1<=pb3_1_1 & ~ [2<=po1_1_1]]]]

abstracting: (2<=po1_1_1)
states: 0
abstracting: (pil2_1_1<=pb3_1_1)
states: 107,680 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: EF [~ [[~ [2<=pil2_1_1] & [pi1_1_1<=pil1_1_1 | 3<=pb1_1_1]]]]
normalized: E [true U ~ [[~ [2<=pil2_1_1] & [pi1_1_1<=pil1_1_1 | 3<=pb1_1_1]]]]

abstracting: (3<=pb1_1_1)
states: 98,608 (4)
abstracting: (pi1_1_1<=pil1_1_1)
states: 55,712 (4)
abstracting: (2<=pil2_1_1)
states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: AG [[~ [~ [po3_1_1<=pb2_1_1]] | pb3_1_1<=pil2_1_1]]
normalized: ~ [E [true U ~ [[po3_1_1<=pb2_1_1 | pb3_1_1<=pil2_1_1]]]]

abstracting: (pb3_1_1<=pil2_1_1)
states: 5,552 (3)
abstracting: (po3_1_1<=pb2_1_1)
states: 107,712 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EF [[2<=po1_1_1 & ~ [[pol1_1_1<=pol3_1_1 & pol1_1_1<=pi1_1_1]]]]
normalized: E [true U [2<=po1_1_1 & ~ [[pol1_1_1<=pol3_1_1 & pol1_1_1<=pi1_1_1]]]]

abstracting: (pol1_1_1<=pi1_1_1)
states: 81,224 (4)
abstracting: (pol1_1_1<=pol3_1_1)
states: 82,168 (4)
abstracting: (2<=po1_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [[po3_1_1<=pil2_1_1 | [1<=pb3_1_1 | ~ [pb1_1_1<=pi3_1_1]]]]
normalized: ~ [E [true U ~ [[po3_1_1<=pil2_1_1 | [1<=pb3_1_1 | ~ [pb1_1_1<=pi3_1_1]]]]]]

abstracting: (pb1_1_1<=pi3_1_1)
states: 5,520 (3)
abstracting: (1<=pb3_1_1)
states: 105,840 (5)
abstracting: (po3_1_1<=pil2_1_1)
states: 83,096 (4)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AG [[[[3<=po1_1_1 | 2<=pb3_1_1] | pb1_1_1<=pi2_1_1] & pol3_1_1<=pol3_1_1]]
normalized: ~ [E [true U ~ [[pol3_1_1<=pol3_1_1 & [pb1_1_1<=pi2_1_1 | [3<=po1_1_1 | 2<=pb3_1_1]]]]]]

abstracting: (2<=pb3_1_1)
states: 102,192 (5)
abstracting: (3<=po1_1_1)
states: 0
abstracting: (pb1_1_1<=pi2_1_1)
states: 5,520 (3)
abstracting: (pol3_1_1<=pol3_1_1)
states: 109,552 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[~ [~ [2<=pi3_1_1]] | [[pil2_1_1<=pol2_1_1 | 2<=pb3_1_1] & [1<=pil1_1_1 | 1<=pbl_1_1]]]]
normalized: ~ [E [true U ~ [[2<=pi3_1_1 | [[pil2_1_1<=pol2_1_1 | 2<=pb3_1_1] & [1<=pil1_1_1 | 1<=pbl_1_1]]]]]]

abstracting: (1<=pbl_1_1)
states: 107,661 (5)
abstracting: (1<=pil1_1_1)
states: 55,712 (4)
abstracting: (2<=pb3_1_1)
states: 102,192 (5)
abstracting: (pil2_1_1<=pol2_1_1)
states: 82,168 (4)
abstracting: (2<=pi3_1_1)
states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[[pi2_1_1<=po2_1_1 | 3<=pil3_1_1] & [3<=pil2_1_1 | 2<=pi2_1_1]] & pi2_1_1<=pbl_1_1]]
normalized: E [true U [pi2_1_1<=pbl_1_1 & [[3<=pil2_1_1 | 2<=pi2_1_1] & [pi2_1_1<=po2_1_1 | 3<=pil3_1_1]]]]

abstracting: (3<=pil3_1_1)
states: 0
abstracting: (pi2_1_1<=po2_1_1)
states: 82,168 (4)
abstracting: (2<=pi2_1_1)
states: 0
abstracting: (3<=pil2_1_1)
states: 0
abstracting: (pi2_1_1<=pbl_1_1)
states: 109,552 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[po3_1_1<=pb3_1_1 | ~ [pil2_1_1<=pil1_1_1]] & ~ [[pb2_1_1<=po3_1_1 | 3<=pil2_1_1]]]]
normalized: ~ [E [true U ~ [[~ [[pb2_1_1<=po3_1_1 | 3<=pil2_1_1]] & [po3_1_1<=pb3_1_1 | ~ [pil2_1_1<=pil1_1_1]]]]]]

abstracting: (pil2_1_1<=pil1_1_1)
states: 82,168 (4)
abstracting: (po3_1_1<=pb3_1_1)
states: 107,712 (5)
abstracting: (3<=pil2_1_1)
states: 0
abstracting: (pb2_1_1<=po3_1_1)
states: 5,520 (3)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.260sec

checking: EF [[[~ [pil1_1_1<=po3_1_1] & ~ [3<=pb2_1_1]] & [[pb1_1_1<=pol2_1_1 | pb1_1_1<=pi3_1_1] | 1<=pil3_1_1]]]
normalized: E [true U [[1<=pil3_1_1 | [pb1_1_1<=pol2_1_1 | pb1_1_1<=pi3_1_1]] & [~ [3<=pb2_1_1] & ~ [pil1_1_1<=po3_1_1]]]]

abstracting: (pil1_1_1<=po3_1_1)
states: 81,224 (4)
abstracting: (3<=pb2_1_1)
states: 98,608 (4)
abstracting: (pb1_1_1<=pi3_1_1)
states: 5,520 (3)
abstracting: (pb1_1_1<=pol2_1_1)
states: 5,552 (3)
abstracting: (1<=pil3_1_1)
states: 55,712 (4)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

totally nodes used: 80965 (8.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5315592 403394 5718986
used/not used/entry size/cache size: 441805 66667059 16 1024MB
basic ops cache: hits/miss/sum: 347714 106116 453830
used/not used/entry size/cache size: 205854 16571362 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: 78016 5474 83490
used/not used/entry size/cache size: 5474 8383134 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 67037410
1 67921
2 2026
3 874
4 503
5 5
6 3
7 3
8 3
9 1
>= 10 115

Total processing time: 0m18.493sec


BK_STOP 1496688722615

--------------------
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.000sec


iterations count:1232 (102), effective:320 (26)

initing FirstDep: 0m 0.000sec


iterations count:427 (35), effective:177 (14)

iterations count:1290 (107), effective:174 (14)

iterations count:869 (72), effective:183 (15)

iterations count:848 (70), effective:178 (14)

iterations count:1316 (109), effective:178 (14)

iterations count:450 (37), effective:178 (14)

iterations count:874 (72), effective:187 (15)

iterations count:1752 (146), effective:359 (29)

iterations count:1304 (108), effective:177 (14)

iterations count:1307 (108), effective:179 (14)

iterations count:842 (70), effective:178 (14)

iterations count:1392 (116), effective:400 (33)

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="S_TriangularGrid-PT-1200"
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/S_TriangularGrid-PT-1200.tgz
mv S_TriangularGrid-PT-1200 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is S_TriangularGrid-PT-1200, 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 r151-ebro-149443454500340"
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 ;