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-2979
Executing tool marcie
Input is TriangularGrid-PT-2011, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468028400754
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465162441955


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: TriangularGrid_PT_2011
(NrP: 52 NrTr: 42 NrArc: 168)

net check time: 0m 0.000sec

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

init dd package: 0m 3.755sec


RS generation: 0m 0.117sec


-> reachability set: #nodes 968 (9.7e+02) #states 940,096,149 (8)



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

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

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

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

MC time: 0m 0.002sec

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

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

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (3<=pb1_2_3) states: 32,513,628 (7)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.162sec

checking: EF [~ [[~ [3<=pb2_2_3] & ~ [3<=pil2_2_1]]]]
normalized: E [true U ~ [[~ [3<=pb2_2_3] & ~ [3<=pil2_2_1]]]]

abstracting: (3<=pil2_2_1) states: 0
abstracting: (3<=pb2_2_3) states: 32,524,805 (7)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.076sec

checking: AG [~ [[~ [2<=pil1_1_1] & [3<=pi2_2_1 | 3<=po2_1_1]]]]
normalized: ~ [E [true U [[3<=pi2_2_1 | 3<=po2_1_1] & ~ [2<=pil1_1_1]]]]

abstracting: (2<=pil1_1_1) states: 0
abstracting: (3<=po2_1_1) states: 0
abstracting: (3<=pi2_2_1) states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [[3<=pb2_2_3 & [1<=pbl_1_1 | ~ [pb2_2_2<=pb1_2_2]]]]
normalized: E [true U [3<=pb2_2_3 & [1<=pbl_1_1 | ~ [pb2_2_2<=pb1_2_2]]]]

abstracting: (pb2_2_2<=pb1_2_2) states: 672,523,170 (8)
abstracting: (1<=pbl_1_1) states: 856,567,466 (8)
abstracting: (3<=pb2_2_3) states: 32,524,805 (7)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.175sec

checking: AG [~ [[2<=pil1_1_1 & [3<=pil3_2_3 & pb2_2_2<=pol1_1_1]]]]
normalized: ~ [E [true U [2<=pil1_1_1 & [3<=pil3_2_3 & pb2_2_2<=pol1_1_1]]]]

abstracting: (pb2_2_2<=pol1_1_1) states: 749,521,251 (8)
abstracting: (3<=pil3_2_3) states: 0
abstracting: (2<=pil1_1_1) states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[[2<=pb3_1_1 & pol3_2_3<=po2_2_1] & pbl_1_1<=pb3_2_3]]]
normalized: ~ [E [true U [pbl_1_1<=pb3_2_3 & [2<=pb3_1_1 & pol3_2_3<=po2_2_1]]]]

abstracting: (pol3_2_3<=po2_2_1) states: 480,151,719 (8)
abstracting: (2<=pb3_1_1) states: 120,879,989 (8)
abstracting: (pbl_1_1<=pb3_2_3) states: 178,930,553 (8)
-> the formula is FALSE

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

MC time: 0m 0.823sec

checking: AG [~ [[~ [pbl_2_1<=pol3_2_1] & [pb2_2_2<=pi3_1_1 & 2<=pil3_2_1]]]]
normalized: ~ [E [true U [[pb2_2_2<=pi3_1_1 & 2<=pil3_2_1] & ~ [pbl_2_1<=pol3_2_1]]]]

abstracting: (pbl_2_1<=pol3_2_1) states: 199,531,303 (8)
abstracting: (2<=pil3_2_1) states: 0
abstracting: (pb2_2_2<=pi3_1_1) states: 648,273,217 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[~ [~ [pil3_2_1<=pbl_2_3]] & [~ [pb3_1_1<=po3_2_1] & ~ [po1_1_1<=po1_1_1]]]]
normalized: E [true U [pil3_2_1<=pbl_2_3 & [~ [pb3_1_1<=po3_2_1] & ~ [po1_1_1<=po1_1_1]]]]

abstracting: (po1_1_1<=po1_1_1) states: 940,096,149 (8)
abstracting: (pb3_1_1<=po3_2_1) states: 648,281,136 (8)
abstracting: (pil3_2_1<=pbl_2_3) states: 876,857,008 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[~ [2<=po1_1_1] | ~ [2<=pb3_2_2]] | [[pi1_2_1<=po1_2_1 | po3_1_1<=pil3_2_3] & ~ [pol1_2_3<=pi2_2_1]]]]
normalized: ~ [E [true U ~ [[[~ [pol1_2_3<=pi2_2_1] & [pi1_2_1<=po1_2_1 | po3_1_1<=pil3_2_3]] | [~ [2<=pb3_2_2] | ~ [2<=po1_1_1]]]]]]

abstracting: (2<=po1_1_1) states: 0
abstracting: (2<=pb3_2_2) states: 120,890,904 (8)
abstracting: (po3_1_1<=pil3_2_3) states: 860,761,795 (8)
abstracting: (pi1_2_1<=po1_2_1) states: 739,682,747 (8)
abstracting: (pol1_2_3<=pi2_2_1) states: 480,159,639 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[[~ [pol1_1_1<=pol3_2_1] & [3<=pi2_2_3 | 1<=pb1_2_1]] | [[pi3_2_1<=pil3_1_1 | 1<=pol2_2_1] | [1<=pil2_2_3 | pb2_2_3<=pol3_2_1]]]]
normalized: ~ [E [true U ~ [[[[pi3_2_1<=pil3_1_1 | 1<=pol2_2_1] | [1<=pil2_2_3 | pb2_2_3<=pol3_2_1]] | [~ [pol1_1_1<=pol3_2_1] & [3<=pi2_2_3 | 1<=pb1_2_1]]]]]]

abstracting: (1<=pb1_2_1) states: 361,510,402 (8)
abstracting: (3<=pi2_2_3) states: 0
abstracting: (pol1_1_1<=pol3_2_1) states: 739,690,667 (8)
abstracting: (pb2_2_3<=pol3_2_1) states: 749,520,771 (8)
abstracting: (1<=pil2_2_3) states: 660,357,832 (8)
abstracting: (1<=pol2_2_1) states: 660,348,393 (8)
abstracting: (pi3_2_1<=pil3_1_1) states: 860,761,795 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.441sec

checking: AG [[[~ [1<=pb1_2_2] | [pil1_2_3<=pil1_1_1 & pol2_2_1<=pi2_2_1]] | [~ [3<=pol3_2_3] | [po1_2_1<=pbl_2_1 | pi1_2_3<=pb3_2_1]]]]
normalized: ~ [E [true U ~ [[[[po1_2_1<=pbl_2_1 | pi1_2_3<=pb3_2_1] | ~ [3<=pol3_2_3]] | [[pil1_2_3<=pil1_1_1 & pol2_2_1<=pi2_2_1] | ~ [1<=pb1_2_2]]]]]]

abstracting: (1<=pb1_2_2) states: 361,508,424 (8)
abstracting: (pol2_2_1<=pi2_2_1) states: 480,159,639 (8)
abstracting: (pil1_2_3<=pil1_1_1) states: 739,692,186 (8)
abstracting: (3<=pol3_2_3) states: 0
abstracting: (pi1_2_3<=pb3_2_1) states: 762,400,596 (8)
abstracting: (po1_2_1<=pbl_2_1) states: 919,816,031 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec


Total processing time: 0m 7.037sec


BK_STOP 1465162449026

--------------------
content from stderr:

check for maximal unmarked siphon
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

610 1345
iterations count:2962 (70), effective:503 (11)

initing FirstDep: 0m 0.000sec

1788
iterations count:1093 (26), effective:179 (4)
1969
iterations count:1207 (28), effective:191 (4)
2883
iterations count:1444 (34), effective:221 (5)
3563 2137
iterations count:2011 (47), effective:293 (6)
3033 3066
iterations count:2316 (55), effective:357 (8)

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="TriangularGrid-PT-2011"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/TriangularGrid-PT-2011.tgz
mv TriangularGrid-PT-2011 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is TriangularGrid-PT-2011, 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 r221su-smll-146468028400754"
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 ;