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

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

=== Now, execution of the tool begins

BK_START 1465165669212


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_3011
(NrP: 108 NrTr: 90 NrArc: 360)

net check time: 0m 0.000sec

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

init dd package: 0m 4.022sec


RS generation: 0m 8.874sec


-> reachability set: #nodes 6882 (6.9e+03) #states 284,675,587,524,871,889,466 (20)



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

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

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

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

MC time: 0m 0.003sec

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

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

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

MC time: 0m 0.005sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (3<=pb1_2_2) states: 11,587,090,899,405,125,886 (19)
-> the formula is TRUE

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

MC time: 0m51.412sec

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

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

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

MC time: 0m 0.006sec

checking: EF [[3<=pil2_2_1 | 3<=pb1_1_1]]
normalized: E [true U [3<=pil2_2_1 | 3<=pb1_1_1]]

abstracting: (3<=pb1_1_1) states: 11,587,382,158,720,343,212 (19)
abstracting: (3<=pil2_2_1) states: 0
-> the formula is TRUE

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

MC time: 0m49.545sec

checking: AG [~ [[[2<=pi2_2_3 & 2<=pil1_2_1] | [3<=pi1_2_1 & 1<=pol2_2_1]]]]
normalized: ~ [E [true U [[3<=pi1_2_1 & 1<=pol2_2_1] | [2<=pi2_2_3 & 2<=pil1_2_1]]]]

abstracting: (2<=pil1_2_1) states: 0
abstracting: (2<=pi2_2_3) states: 0
abstracting: (1<=pol2_2_1) states: 196,480,815,452,233,920,142 (20)
abstracting: (3<=pi1_2_1) states: 0
-> the formula is TRUE

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

MC time: 0m 0.024sec

checking: EF [[~ [[po2_1_1<=po1_2_3 | pi2_2_1<=pb2_2_3]] & ~ [2<=pi2_2_1]]]
normalized: E [true U [~ [2<=pi2_2_1] & ~ [[po2_1_1<=po1_2_3 | pi2_2_1<=pb2_2_3]]]]

abstracting: (pi2_2_1<=pb2_2_3) states: 230,822,284,120,684,257,776 (20)
abstracting: (po2_1_1<=po1_2_3) states: 223,241,825,556,538,630,415 (20)
abstracting: (2<=pi2_2_1) states: 0
-> the formula is TRUE

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

MC time: 0m20.661sec

checking: AG [~ [[[pbl_1_1<=pi2_3_5 & pb1_3_3<=pi1_1_1] & ~ [3<=pi2_3_5]]]]
normalized: ~ [E [true U [~ [3<=pi2_3_5] & [pbl_1_1<=pi2_3_5 & pb1_3_3<=pi1_1_1]]]]

abstracting: (pb1_3_3<=pi1_1_1) states: 193,828,327,057,301,910,347 (20)
abstracting: (pbl_1_1<=pi2_3_5) states: 47,500,207,840,462,982,778 (19)
abstracting: (3<=pi2_3_5) states: 0
-> the formula is FALSE

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

MC time: 4m41.435sec

checking: AG [[pol2_3_3<=pol1_3_1 | [~ [3<=pi2_3_5] | [1<=pi2_3_5 & 2<=pil1_2_3]]]]
normalized: ~ [E [true U ~ [[pol2_3_3<=pol1_3_1 | [[1<=pi2_3_5 & 2<=pil1_2_3] | ~ [3<=pi2_3_5]]]]]]

abstracting: (3<=pi2_3_5) states: 0
abstracting: (2<=pil1_2_3) states: 0
abstracting: (1<=pi2_3_5) states: 88,185,476,819,799,195,286 (19)
abstracting: (pol2_3_3<=pol1_3_1) states: 223,241,825,556,611,474,065 (20)
-> the formula is TRUE

FORMULA TriangularGrid-PT-3011-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[po2_1_1<=pi3_3_1 & [[1<=pi3_3_3 | 3<=pil3_2_1] & ~ [1<=pol3_3_5]]]]
normalized: E [true U [po2_1_1<=pi3_3_1 & [~ [1<=pol3_3_5] & [1<=pi3_3_3 | 3<=pil3_2_1]]]]

abstracting: (3<=pil3_2_1) states: 0
abstracting: (1<=pi3_3_3) states: 88,194,772,072,414,471,496 (19)
abstracting: (1<=pol3_3_5) states: 196,490,110,705,072,694,180 (20)
abstracting: (po2_1_1<=pi3_3_1) states: 223,239,406,029,422,496,626 (20)
-> the formula is TRUE

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

MC time: 1m 3.472sec

checking: EF [[~ [~ [po3_2_3<=pb1_2_2]] & [~ [pi1_1_1<=pil2_3_1] & [3<=pi3_3_3 | 2<=pbl_3_3]]]]
normalized: E [true U [po3_2_3<=pb1_2_2 & [[3<=pi3_3_3 | 2<=pbl_3_3] & ~ [pi1_1_1<=pil2_3_1]]]]

abstracting: (pi1_1_1<=pil2_3_1) states: 257,923,872,673,344,300,911 (20)
abstracting: (2<=pbl_3_3) states: 201,015,658,615,440,241,312 (20)
abstracting: (3<=pi3_3_3) states: 0
abstracting: (po3_2_3<=pb1_2_2) states: 230,822,284,120,648,132,958 (20)
-> the formula is TRUE

FORMULA TriangularGrid-PT-3011-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.780sec

checking: AG [[~ [[2<=pi3_3_3 & 3<=pi1_3_5]] | ~ [[pb2_3_4<=pil1_3_5 & pb2_2_1<=pi1_3_1]]]]
normalized: ~ [E [true U ~ [[~ [[pb2_3_4<=pil1_3_5 & pb2_2_1<=pi1_3_1]] | ~ [[2<=pi3_3_3 & 3<=pi1_3_5]]]]]]

abstracting: (3<=pi1_3_5) states: 0
abstracting: (2<=pi3_3_3) states: 0
abstracting: (pb2_2_1<=pi1_3_1) states: 193,828,327,057,312,934,369 (20)
abstracting: (pb2_3_4<=pil1_3_5) states: 222,164,797,073,436,871,888 (20)
-> the formula is TRUE

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

MC time: 0m 0.064sec

checking: EF [[[3<=pbl_2_2 & [1<=pbl_2_1 | 3<=pil1_2_3]] & [~ [po3_3_3<=po2_3_3] & [pi1_3_1<=pb1_3_5 & 3<=pol2_3_3]]]]
normalized: E [true U [[[pi1_3_1<=pb1_3_5 & 3<=pol2_3_3] & ~ [po3_3_3<=po2_3_3]] & [3<=pbl_2_2 & [1<=pbl_2_1 | 3<=pil1_2_3]]]]

abstracting: (3<=pil1_2_3) states: 0
abstracting: (1<=pbl_2_1) states: 252,464,607,439,508,842,062 (20)
abstracting: (3<=pbl_2_2) states: 130,462,882,118,010,590,580 (20)
abstracting: (po3_3_3<=po2_3_3) states: 223,234,949,892,688,938,033 (20)
abstracting: (3<=pol2_3_3) states: 0
abstracting: (pi1_3_1<=pb1_3_5) states: 230,826,303,069,691,653,593 (20)
-> the formula is FALSE

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

MC time: 0m 0.053sec

checking: AG [[[[1<=pb1_2_2 | po1_3_5<=pi1_2_1] | [1<=pil1_3_5 | 3<=pil2_3_3]] | [pi3_2_3<=pil3_3_1 | ~ [2<=pb1_2_3]]]]
normalized: ~ [E [true U ~ [[[pi3_2_3<=pil3_3_1 | ~ [2<=pb1_2_3]] | [[1<=pil1_3_5 | 3<=pil2_3_3] | [1<=pb1_2_2 | po1_3_5<=pi1_2_1]]]]]]

abstracting: (po1_3_5<=pi1_2_1) states: 223,234,949,892,731,270,069 (20)
abstracting: (1<=pb1_2_2) states: 113,278,020,413,216,045,499 (20)
abstracting: (3<=pil2_3_3) states: 0
abstracting: (1<=pil1_3_5) states: 196,480,815,452,317,955,122 (20)
abstracting: (2<=pb1_2_3) states: 40,077,872,764,207,070,439 (19)
abstracting: (pi3_2_3<=pil3_3_1) states: 257,923,872,673,333,109,581 (20)

before gc: list nodes free: 1257684

after gc: idd nodes used:188715, unused:63811285; list nodes free:347093765
-> the formula is FALSE

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

MC time: 4m52.902sec

checking: EF [[[[2<=pol3_3_3 & po2_3_5<=pb3_3_2] | [1<=pol3_2_3 & 2<=pb1_3_5]] & [[pi1_3_5<=po3_1_1 | 3<=po2_3_1] & 3<=pb1_2_3]]]
normalized: E [true U [[3<=pb1_2_3 & [pi1_3_5<=po3_1_1 | 3<=po2_3_1]] & [[1<=pol3_2_3 & 2<=pb1_3_5] | [2<=pol3_3_3 & po2_3_5<=pb3_3_2]]]]

abstracting: (po2_3_5<=pb3_3_2) states: 230,828,513,552,333,021,513 (20)
abstracting: (2<=pol3_3_3) states: 0
abstracting: (2<=pb1_3_5) states: 40,066,548,235,746,656,592 (19)
abstracting: (1<=pol3_2_3) states: 196,480,815,452,233,920,142 (20)
abstracting: (3<=po2_3_1) states: 0
abstracting: (pi1_3_5<=po3_1_1) states: 223,234,949,892,750,590,353 (20)
abstracting: (3<=pb1_2_3) states: 11,587,090,899,324,578,555 (19)
-> the formula is TRUE

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

MC time: 5m39.349sec


Total processing time: 19m19.468sec


BK_STOP 1465166828899

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

1196 1057 2104 2827 3809 4377 3534 3004 3203 3438 4753 4454 6291 5194 5432 4838 4592 5585 6612 6070 4936 5308 3453 5694 5271 5918 9238 9579 8332 8825 6769 5940 5543 6881 5557 6687 8039 7537 7905 6461 6047 7209 7626 6169 6200 6312 6306 9009 7201 8785 7095 6617 6743 8000 7296 6949 9089 8041 9231 7768 7646 8189 6932 6737 6702 6859 6888 6675 7653 10027 9751 9711 9630 8421 8087 8932 8460 8520 7008
iterations count:79085 (878), effective:12928 (143)

initing FirstDep: 0m 0.000sec

9804 40424 56844 118830 142935 160177 152867 146995 146277
iterations count:9891 (109), effective:1075 (11)
10657 21875 46852 57517 115530 154763 155152 141212 149618 143374
iterations count:10893 (121), effective:1163 (12)
18111 18175 30060 63829 84312 80956 66898
iterations count:7103 (78), effective:918 (10)
22014 45692 93357 149305 141126 132137 129432 112390 142709 245189 398495 396522 478474 519049 461885 379463 329279 318790 277768 370896 301454 276779
iterations count:22450 (249), effective:2395 (26)
16245 35209 44931 64245 80316 83875 100512 116867 141851 149570 147447 137941 133447
iterations count:13269 (147), effective:1831 (20)
33277 44757 52685 69658 75544 73960 58532 75163 86306 90637 98967 95888 67589
iterations count:13054 (145), effective:1668 (18)
18712 24204 23591 32714 37167 48033 62040 130711 120862 147186 159731 144295 142878 197913 228671 214192 246928 206724 196596 315245 334569 320166 330903 286403 304665 275884
iterations count:26795 (297), effective:3467 (38)
20837 41941 50570 61813 58596 161377 207234 260569 205599 249189 308226 278137 246988 223466 216611 208266 219033 206834 280944 286659 308371 299184 257906 355245 388599 370371 394008 372231 226741 177168
iterations count:30610 (340), effective:3365 (37)

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-3011"
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-3011.tgz
mv TriangularGrid-PT-3011 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-3011, 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-146468028400763"
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 ;