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

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

=== Now, execution of the tool begins

BK_START 1465162390188


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_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 4.143sec


RS generation: 0m 0.104sec


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



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

checking: AF [AG [[2<=pi1_2_1 & 1<=pb1_1_1]]]
normalized: ~ [EG [E [true U ~ [[2<=pi1_2_1 & 1<=pb1_1_1]]]]]

abstracting: (1<=pb1_1_1) states: 361,510,402 (8)
abstracting: (2<=pi1_2_1) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: A [EF [1<=po1_2_1] U ~ [~ [2<=po3_1_1]]]
normalized: [~ [EG [~ [2<=po3_1_1]]] & ~ [E [~ [2<=po3_1_1] U [~ [E [true U 1<=po1_2_1]] & ~ [2<=po3_1_1]]]]]

abstracting: (2<=po3_1_1) states: 0
abstracting: (1<=po1_2_1) states: 279,738,317 (8)
abstracting: (2<=po3_1_1) states: 0
abstracting: (2<=po3_1_1) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.776sec

checking: EG [[~ [pb1_2_3<=pb3_2_1] | 1<=pil2_1_1]]
normalized: EG [[1<=pil2_1_1 | ~ [pb1_2_3<=pb3_2_1]]]

abstracting: (pb1_2_3<=pb3_2_1) states: 678,377,017 (8)
abstracting: (1<=pil2_1_1) states: 660,357,832 (8)
........
EG iterations: 8
-> the formula is TRUE

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

MC time: 0m 0.076sec

checking: EX [EG [[pbl_2_1<=pbl_2_1 | 1<=pil1_1_1]]]
normalized: EX [EG [[pbl_2_1<=pbl_2_1 | 1<=pil1_1_1]]]

abstracting: (1<=pil1_1_1) states: 660,357,832 (8)
abstracting: (pbl_2_1<=pbl_2_1) states: 940,096,149 (8)

EG iterations: 0
.-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AF [AX [[pil3_2_3<=pil2_1_1 & pbl_2_1<=pil1_2_3]]]
normalized: ~ [EG [EX [~ [[pil3_2_3<=pil2_1_1 & pbl_2_1<=pil1_2_3]]]]]

abstracting: (pbl_2_1<=pil1_2_3) states: 199,531,303 (8)
abstracting: (pil3_2_3<=pil2_1_1) states: 739,690,667 (8)
........
EG iterations: 7
-> the formula is FALSE

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

MC time: 0m 0.192sec

checking: EG [E [pb2_2_3<=pil1_2_1 U pi1_2_1<=pi2_1_1]]
normalized: EG [E [pb2_2_3<=pil1_2_1 U pi1_2_1<=pi2_1_1]]

abstracting: (pi1_2_1<=pi2_1_1) states: 739,690,667 (8)
abstracting: (pb2_2_3<=pil1_2_1) states: 749,520,771 (8)
.....
EG iterations: 5
-> the formula is TRUE

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

MC time: 0m 0.092sec

checking: AG [[pb1_1_1<=pb2_1_1 | EF [pi3_2_3<=pbl_2_2]]]
normalized: ~ [E [true U ~ [[pb1_1_1<=pb2_1_1 | E [true U pi3_2_3<=pbl_2_2]]]]]

abstracting: (pi3_2_3<=pbl_2_2) states: 919,804,869 (8)
abstracting: (pb1_1_1<=pb2_1_1) states: 672,521,432 (8)
-> the formula is FALSE

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

MC time: 0m 0.193sec

checking: ~ [EG [[~ [pol1_1_1<=pi2_2_1] | ~ [po1_2_3<=pol2_2_3]]]]
normalized: ~ [EG [[~ [po1_2_3<=pol2_2_3] | ~ [pol1_1_1<=pi2_2_1]]]]

abstracting: (pol1_1_1<=pi2_2_1) states: 480,151,719 (8)
abstracting: (po1_2_3<=pol2_2_3) states: 860,761,795 (8)
...............................................
EG iterations: 47
-> the formula is FALSE

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

MC time: 0m 0.756sec

checking: [EG [~ [[pbl_2_1<=pbl_1_1 | 3<=pi2_1_1]]] | EF [EG [2<=po3_2_3]]]
normalized: [E [true U EG [2<=po3_2_3]] | EG [~ [[pbl_2_1<=pbl_1_1 | 3<=pi2_1_1]]]]

abstracting: (3<=pi2_1_1) states: 0
abstracting: (pbl_2_1<=pbl_1_1) states: 562,020,056 (8)
..........
EG iterations: 10
abstracting: (2<=po3_2_3) states: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.117sec

checking: AF [[AF [2<=pi1_2_1] | [[2<=pb2_1_1 | 3<=pol1_1_1] | [1<=pi2_2_1 | 3<=pbl_2_3]]]]
normalized: ~ [EG [~ [[[[1<=pi2_2_1 | 3<=pbl_2_3] | [2<=pb2_1_1 | 3<=pol1_1_1]] | ~ [EG [~ [2<=pi1_2_1]]]]]]]

abstracting: (2<=pi1_2_1) states: 0

EG iterations: 0
abstracting: (3<=pol1_1_1) states: 0
abstracting: (2<=pb2_1_1) states: 120,891,166 (8)
abstracting: (3<=pbl_2_3) states: 458,250,798 (8)
abstracting: (1<=pi2_2_1) states: 279,747,756 (8)
............
EG iterations: 12
-> the formula is FALSE

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

MC time: 0m 0.090sec

checking: [~ [AF [[1<=pb2_2_2 & pb1_1_1<=po3_1_1]]] | AF [[pil1_2_1<=pi1_1_1 & 3<=po1_2_3]]]
normalized: [EG [~ [[1<=pb2_2_2 & pb1_1_1<=po3_1_1]]] | ~ [EG [~ [[pil1_2_1<=pi1_1_1 & 3<=po1_2_3]]]]]

abstracting: (3<=po1_2_3) states: 0
abstracting: (pil1_2_1<=pi1_1_1) states: 480,143,799 (8)

EG iterations: 0
abstracting: (pb1_1_1<=po3_1_1) states: 648,271,457 (8)
abstracting: (1<=pb2_2_2) states: 361,508,424 (8)
....
EG iterations: 4
-> the formula is TRUE

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

MC time: 0m 0.036sec

checking: AG [~ [[[2<=pol1_2_1 & 2<=pil1_2_1] & [pil1_2_1<=pi3_2_1 & pil3_2_3<=pi1_2_3]]]]
normalized: ~ [E [true U [[pil1_2_1<=pi3_2_1 & pil3_2_3<=pi1_2_3] & [2<=pol1_2_1 & 2<=pil1_2_1]]]]

abstracting: (2<=pil1_2_1) states: 0
abstracting: (2<=pol1_2_1) states: 0
abstracting: (pil3_2_3<=pi1_2_3) states: 480,151,719 (8)
abstracting: (pil1_2_1<=pi3_2_1) states: 480,151,719 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [~ [[[~ [pb1_2_3<=pol2_1_1] & [2<=pbl_2_1 | 1<=pb1_2_3]] | EG [pol1_2_1<=pil3_1_1]]]]
normalized: [[[2<=pbl_2_1 | 1<=pb1_2_3] & ~ [pb1_2_3<=pol2_1_1]] | EG [pol1_2_1<=pil3_1_1]]

abstracting: (pol1_2_1<=pil3_1_1) states: 739,682,747 (8)
............
EG iterations: 12
abstracting: (pb1_2_3<=pol2_1_1) states: 749,531,948 (8)
abstracting: (1<=pb1_2_3) states: 361,499,225 (8)
abstracting: (2<=pbl_2_1) states: 698,399,136 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: ~ [AG [[[1<=pb1_1_1 | 1<=pb3_2_1] | [pi1_2_3<=pbl_2_1 | pil2_1_1<=po2_2_1]]]]
normalized: E [true U ~ [[[pi1_2_3<=pbl_2_1 | pil2_1_1<=po2_2_1] | [1<=pb1_1_1 | 1<=pb3_2_1]]]]

abstracting: (1<=pb3_2_1) states: 361,510,402 (8)
abstracting: (1<=pb1_1_1) states: 361,510,402 (8)
abstracting: (pil2_1_1<=po2_2_1) states: 480,151,719 (8)
abstracting: (pi1_2_3<=pbl_2_1) states: 919,806,592 (8)
-> the formula is TRUE

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

MC time: 0m 0.200sec

checking: [[[[3<=pb2_2_2 & [pol1_2_3<=po1_2_3 | pbl_2_2<=pol1_1_1]] | EF [1<=pol2_2_1]] & EX [~ [3<=pi3_2_3]]] & ~ [EG [po2_1_1<=pol1_2_3]]]
normalized: [~ [EG [po2_1_1<=pol1_2_3]] & [EX [~ [3<=pi3_2_3]] & [E [true U 1<=pol2_2_1] | [3<=pb2_2_2 & [pol1_2_3<=po1_2_3 | pbl_2_2<=pol1_1_1]]]]]

abstracting: (pbl_2_2<=pol1_1_1) states: 199,542,465 (8)
abstracting: (pol1_2_3<=po1_2_3) states: 279,747,756 (8)
abstracting: (3<=pb2_2_2) states: 32,524,782 (7)
abstracting: (1<=pol2_2_1) states: 660,348,393 (8)
abstracting: (3<=pi3_2_3) states: 0
.abstracting: (po2_1_1<=pol1_2_3) states: 860,761,795 (8)
........
EG iterations: 8
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.081sec

checking: [AG [[~ [2<=pil2_2_1] | [pb2_2_3<=pol3_1_1 & 1<=pol2_2_3]]] & EX [[[pil1_2_1<=pi1_2_3 | pi2_2_3<=pb2_2_3] | 1<=po2_1_1]]]
normalized: [EX [[1<=po2_1_1 | [pil1_2_1<=pi1_2_3 | pi2_2_3<=pb2_2_3]]] & ~ [E [true U ~ [[[pb2_2_3<=pol3_1_1 & 1<=pol2_2_3] | ~ [2<=pil2_2_1]]]]]]

abstracting: (2<=pil2_2_1) states: 0
abstracting: (1<=pol2_2_3) states: 660,357,832 (8)
abstracting: (pb2_2_3<=pol3_1_1) states: 749,519,273 (8)
abstracting: (pi2_2_3<=pb2_2_3) states: 762,410,035 (8)
abstracting: (pil1_2_1<=pi1_2_3) states: 480,151,719 (8)
abstracting: (1<=po2_1_1) states: 279,738,317 (8)
.-> the formula is TRUE

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

MC time: 0m 0.026sec


Total processing time: 0m 8.505sec


BK_STOP 1465162398732

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

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

initing FirstDep: 0m 0.000sec


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

iterations count:461 (10), effective:68 (1)
1414 3712 2937 3461 1141
iterations count:5018 (119), effective:824 (19)

iterations count:280 (6), effective:35 (0)

iterations count:193 (4), effective:21 (0)
1187 1605 1268
iterations count:3369 (80), effective:555 (13)
1909
iterations count:1697 (40), effective:265 (6)

iterations count:188 (4), effective:21 (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="TriangularGrid-PT-2011"
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-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 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-146468028400750"
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 ;