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

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

=== Now, execution of the tool begins

BK_START 1465162078773


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

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

net check time: 0m 0.000sec

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

init dd package: 0m 3.686sec


RS generation: 0m 0.143sec


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



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

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

abstracting: (3<=pb3_1_1) states: 98,608 (4)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.184sec

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

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

FORMULA TriangularGrid-PT-1200-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.168sec

checking: EG [EF [~ [pbl_1_1<=pb3_1_1]]]
normalized: EG [E [true U ~ [pbl_1_1<=pb3_1_1]]]

abstracting: (pbl_1_1<=pb3_1_1) states: 98,752 (4)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.036sec

checking: A [~ [~ [3<=po1_1_1]] U EF [2<=pol2_1_1]]
normalized: [~ [EG [~ [E [true U 2<=pol2_1_1]]]] & ~ [E [~ [E [true U 2<=pol2_1_1]] U [~ [3<=po1_1_1] & ~ [E [true U 2<=pol2_1_1]]]]]]

abstracting: (2<=pol2_1_1) states: 0
abstracting: (3<=po1_1_1) states: 0
abstracting: (2<=pol2_1_1) states: 0
abstracting: (2<=pol2_1_1) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [E [3<=pil2_1_1 U pb3_1_1<=po1_1_1]]
normalized: E [true U E [3<=pil2_1_1 U pb3_1_1<=po1_1_1]]

abstracting: (pb3_1_1<=po1_1_1) states: 5,520 (3)
abstracting: (3<=pil2_1_1) states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: E [pil3_1_1<=pb2_1_1 U EX [3<=po3_1_1]]
normalized: E [pil3_1_1<=pb2_1_1 U EX [3<=po3_1_1]]

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

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

MC time: 0m 0.004sec

checking: AG [A [po2_1_1<=pil2_1_1 U 2<=pb3_1_1]]
normalized: ~ [E [true U ~ [[~ [EG [~ [2<=pb3_1_1]]] & ~ [E [~ [2<=pb3_1_1] U [~ [po2_1_1<=pil2_1_1] & ~ [2<=pb3_1_1]]]]]]]]

abstracting: (2<=pb3_1_1) states: 102,192 (5)
abstracting: (po2_1_1<=pil2_1_1) states: 83,096 (4)
abstracting: (2<=pb3_1_1) states: 102,192 (5)
abstracting: (2<=pb3_1_1) states: 102,192 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TriangularGrid-PT-1200-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EX [E [pi1_1_1<=pi3_1_1 U 3<=pol1_1_1]]
normalized: EX [E [pi1_1_1<=pi3_1_1 U 3<=pol1_1_1]]

abstracting: (3<=pol1_1_1) states: 0
abstracting: (pi1_1_1<=pi3_1_1) states: 82,168 (4)
.-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: E [~ [2<=pi3_1_1] U ~ [[pb3_1_1<=pol1_1_1 | 1<=pb3_1_1]]]
normalized: E [~ [2<=pi3_1_1] U ~ [[pb3_1_1<=pol1_1_1 | 1<=pb3_1_1]]]

abstracting: (1<=pb3_1_1) states: 105,840 (5)
abstracting: (pb3_1_1<=pol1_1_1) states: 5,552 (3)
abstracting: (2<=pi3_1_1) states: 0
-> the formula is FALSE

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

MC time: 0m 0.013sec

checking: ~ [[[AX [1<=pol1_1_1] | EF [3<=po2_1_1]] | AX [[1<=pi2_1_1 & 2<=po1_1_1]]]]
normalized: ~ [[~ [EX [~ [[1<=pi2_1_1 & 2<=po1_1_1]]]] | [E [true U 3<=po2_1_1] | ~ [EX [~ [1<=pol1_1_1]]]]]]

abstracting: (1<=pol1_1_1) states: 55,712 (4)
.abstracting: (3<=po2_1_1) states: 0
abstracting: (2<=po1_1_1) states: 0
abstracting: (1<=pi2_1_1) states: 53,840 (4)
.-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: [AG [pol1_1_1<=pb3_1_1] | [AG [~ [1<=pil2_1_1]] | 3<=pi1_1_1]]
normalized: [~ [E [true U ~ [pol1_1_1<=pb3_1_1]]] | [3<=pi1_1_1 | ~ [E [true U 1<=pil2_1_1]]]]

abstracting: (1<=pil2_1_1) states: 55,712 (4)
abstracting: (3<=pi1_1_1) states: 0
abstracting: (pol1_1_1<=pb3_1_1) states: 107,680 (5)
-> the formula is FALSE

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

MC time: 0m 0.020sec

checking: [[pil1_1_1<=pil2_1_1 & ~ [EF [3<=pi1_1_1]]] & EX [~ [pil1_1_1<=pol2_1_1]]]
normalized: [EX [~ [pil1_1_1<=pol2_1_1]] & [pil1_1_1<=pil2_1_1 & ~ [E [true U 3<=pi1_1_1]]]]

abstracting: (3<=pi1_1_1) states: 0
abstracting: (pil1_1_1<=pil2_1_1) states: 82,168 (4)
abstracting: (pil1_1_1<=pol2_1_1) states: 82,168 (4)
.-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: ~ [EF [[[pol2_1_1<=pil1_1_1 & 1<=pil1_1_1] & [2<=pil3_1_1 & pol2_1_1<=pbl_1_1]]]]
normalized: ~ [E [true U [[2<=pil3_1_1 & pol2_1_1<=pbl_1_1] & [pol2_1_1<=pil1_1_1 & 1<=pil1_1_1]]]]

abstracting: (1<=pil1_1_1) states: 55,712 (4)
abstracting: (pol2_1_1<=pil1_1_1) states: 82,168 (4)
abstracting: (pol2_1_1<=pbl_1_1) states: 107,661 (5)
abstracting: (2<=pil3_1_1) states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [AG [pi2_1_1<=pb1_1_1] | EF [[[2<=pb3_1_1 & pb1_1_1<=pil1_1_1] | pb2_1_1<=pbl_1_1]]]
normalized: [E [true U [pb2_1_1<=pbl_1_1 | [2<=pb3_1_1 & pb1_1_1<=pil1_1_1]]] | ~ [E [true U ~ [pi2_1_1<=pb1_1_1]]]]

abstracting: (pi2_1_1<=pb1_1_1) states: 107,712 (5)
abstracting: (pb1_1_1<=pil1_1_1) states: 5,552 (3)
abstracting: (2<=pb3_1_1) states: 102,192 (5)
abstracting: (pb2_1_1<=pbl_1_1) states: 14,320 (4)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.100sec

checking: [[~ [~ [[1<=po3_1_1 | 2<=pol2_1_1]]] | [~ [[pb1_1_1<=pi3_1_1 & 2<=pil2_1_1]] | pol2_1_1<=pol2_1_1]] & EF [[3<=po2_1_1 & [3<=po3_1_1 | 3<=pi2_1_1]]]]
normalized: [E [true U [3<=po2_1_1 & [3<=po3_1_1 | 3<=pi2_1_1]]] & [[pol2_1_1<=pol2_1_1 | ~ [[pb1_1_1<=pi3_1_1 & 2<=pil2_1_1]]] | [1<=po3_1_1 | 2<=pol2_1_1]]]

abstracting: (2<=pol2_1_1) states: 0
abstracting: (1<=po3_1_1) states: 53,840 (4)
abstracting: (2<=pil2_1_1) states: 0
abstracting: (pb1_1_1<=pi3_1_1) states: 5,520 (3)
abstracting: (pol2_1_1<=pol2_1_1) states: 109,552 (5)
abstracting: (3<=pi2_1_1) states: 0
abstracting: (3<=po3_1_1) states: 0
abstracting: (3<=po2_1_1) states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: [[~ [AX [1<=pi1_1_1]] & EF [[pb3_1_1<=pil2_1_1 & pbl_1_1<=pbl_1_1]]] | ~ [[[~ [2<=pi2_1_1] | [2<=pi3_1_1 & pbl_1_1<=pil3_1_1]] | AF [po1_1_1<=pil2_1_1]]]]
normalized: [~ [[[~ [2<=pi2_1_1] | [2<=pi3_1_1 & pbl_1_1<=pil3_1_1]] | ~ [EG [~ [po1_1_1<=pil2_1_1]]]]] | [EX [~ [1<=pi1_1_1]] & E [true U [pb3_1_1<=pil2_1_1 & pbl_1_1<=pbl_1_1]]]]

abstracting: (pbl_1_1<=pbl_1_1) states: 109,552 (5)
abstracting: (pb3_1_1<=pil2_1_1) states: 5,552 (3)
abstracting: (1<=pi1_1_1) states: 53,840 (4)
.abstracting: (po1_1_1<=pil2_1_1) states: 83,096 (4)
..................................................................................................................................................................................
EG iterations: 178
abstracting: (pbl_1_1<=pil3_1_1) states: 11,041 (4)
abstracting: (2<=pi3_1_1) states: 0
abstracting: (2<=pi2_1_1) states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1200-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.894sec


Total processing time: 0m 6.766sec


BK_STOP 1465162085575

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

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

initing FirstDep: 0m 0.000sec

651
iterations count:1268 (105), effective:171 (14)

iterations count:840 (70), effective:177 (14)
651
iterations count:1269 (105), effective:180 (15)

iterations count:12 (1), effective:0 (0)

iterations count:12 (1), effective:0 (0)
702
iterations count:1308 (109), effective:178 (14)

iterations count:42 (3), effective:9 (0)
651
iterations count:1290 (107), effective:174 (14)

iterations count:16 (1), effective:1 (0)
651
iterations count:1315 (109), effective:179 (14)

iterations count:459 (38), effective:182 (15)

iterations count:436 (36), effective:175 (14)
651
iterations count:1294 (107), effective:175 (14)

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-1200"
export BK_EXAMINATION="CTLCardinality"
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-1200.tgz
mv TriangularGrid-PT-1200 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-1200, 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 r221su-smll-146468028300732"
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 ;