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-3254
Executing tool marcie
Input is Raft-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r061-csrt-149440955100034
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494705787044

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: Raft_PT_10
(NrP: 508 NrTr: 868 NrArc: 3359)

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

net check time: 0m 0.000sec

init dd package: 0m 1.209sec


after gc: zbdd nodes used:509, unused:18749491
after gc: zbdd nodes used:885, unused:37499115
after gc: zbdd nodes used:743, unused:74999257
after gc: zbdd nodes used:2113, unused:149997887
after gc: zbdd nodes used:2507, unused:299997493
RS generation: 15m52.370sec


-> reachability set: #nodes 900 (9.0e+02) #states 157,772,181,012,063,600,197,165,907,545,718,004,087,818,034,971,360,541,078,399,929,426,784,981 (71)



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

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

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

FORMULA Raft-PT-10-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

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

FORMULA Raft-PT-10-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [3<=p8] & 3<=p80]]
normalized: E [true U [3<=p80 & ~ [3<=p8]]]

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

FORMULA Raft-PT-10-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [2<=p437] & 2<=p62]]
normalized: E [true U [2<=p62 & ~ [2<=p437]]]

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

FORMULA Raft-PT-10-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[~ [p15<=p156] & ~ [p13<=p380]]]]
normalized: ~ [E [true U [~ [p13<=p380] & ~ [p15<=p156]]]]

abstracting: (p15<=p156)
states: 132,528,632,044,991,222,423,990,593,456,668,844,738,275,429,047,871,804,925,751,003,645,534,981 (71)
abstracting: (p13<=p380)
states: 132,528,632,053,025,912,645,285,544,834,378,655,199,981,242,060,482,819,894,664,967,822,041,861 (71)
-> the formula is TRUE

FORMULA Raft-PT-10-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[~ [[p331<=p370 & 2<=p179]] & 3<=p45]]
normalized: E [true U [3<=p45 & ~ [[p331<=p370 & 2<=p179]]]]

abstracting: (2<=p179)
states: 0
abstracting: (p331<=p370)
states: 132,528,632,053,025,912,645,285,544,834,378,655,199,981,242,060,482,819,894,664,967,822,041,861 (71)
abstracting: (3<=p45)
states: 0
-> the formula is FALSE

FORMULA Raft-PT-10-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[2<=p173 & [p234<=p373 & 3<=p97]]]
normalized: E [true U [2<=p173 & [p234<=p373 & 3<=p97]]]

abstracting: (3<=p97)
states: 0
abstracting: (p234<=p373)
states: 132,528,632,051,017,240,089,961,806,989,951,202,584,554,788,807,330,066,152,436,476,777,915,141 (71)
abstracting: (2<=p173)
states: 0
-> the formula is FALSE

FORMULA Raft-PT-10-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[~ [2<=p440] & [p453<=p67 | 2<=p255]] & 3<=p187]]
normalized: E [true U [3<=p187 & [[p453<=p67 | 2<=p255] & ~ [2<=p440]]]]

abstracting: (2<=p440)
states: 0
abstracting: (2<=p255)
states: 0
abstracting: (p453<=p67)
states: 132,528,632,051,017,240,089,961,806,989,951,202,584,554,788,807,330,066,152,436,476,777,915,141 (71)
abstracting: (3<=p187)
states: 0
-> the formula is FALSE

FORMULA Raft-PT-10-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[p100<=p188 & ~ [p32<=p215]] | 2<=p93]]
normalized: E [true U [2<=p93 | [p100<=p188 & ~ [p32<=p215]]]]

abstracting: (p32<=p215)
states: 132,528,632,053,025,912,645,285,544,834,378,655,199,981,242,060,482,819,894,664,967,822,041,861 (71)
abstracting: (p100<=p188)
states: 132,528,632,044,991,222,423,990,593,456,668,844,738,275,429,047,871,804,925,751,003,645,534,981 (71)
abstracting: (2<=p93)
states: 0
-> the formula is TRUE

FORMULA Raft-PT-10-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.686sec

checking: AG [~ [[[3<=p144 & p185<=p146] | [3<=p300 & 3<=p315]]]]
normalized: ~ [E [true U [[3<=p144 & p185<=p146] | [3<=p300 & 3<=p315]]]]

abstracting: (3<=p315)
states: 0
abstracting: (3<=p300)
states: 0
abstracting: (p185<=p146)
states: 132,528,632,044,991,222,423,990,593,456,668,844,738,275,429,047,871,804,925,751,003,645,534,981 (71)
abstracting: (3<=p144)
states: 0
-> the formula is TRUE

FORMULA Raft-PT-10-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [[2<=p22 & 1<=p41]] | [[2<=p390 & 1<=p358] | ~ [2<=p25]]]]
normalized: ~ [E [true U ~ [[[~ [2<=p25] | [2<=p390 & 1<=p358]] | ~ [[2<=p22 & 1<=p41]]]]]]

abstracting: (1<=p41)
states: 31,554,436,200,805,781,995,174,191,233,601,638,725,222,444,391,749,905,221,897,193,050,055,620 (70)
abstracting: (2<=p22)
states: 0
abstracting: (1<=p358)
states: 31,554,436,200,805,781,995,174,191,233,601,638,725,222,444,391,749,905,221,897,193,050,055,620 (70)
abstracting: (2<=p390)
states: 0
abstracting: (2<=p25)
states: 0
-> the formula is TRUE

FORMULA Raft-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [[[[p268<=p35 & 2<=p388] & ~ [1<=p123]] | 3<=p353]]
normalized: E [true U [3<=p353 | [[p268<=p35 & 2<=p388] & ~ [1<=p123]]]]

abstracting: (1<=p123)
states: 31,554,436,200,805,781,995,174,191,233,601,638,725,222,444,391,749,905,221,897,193,050,055,620 (70)
abstracting: (2<=p388)
states: 0
abstracting: (p268<=p35)
states: 132,528,632,053,025,912,645,285,544,834,378,655,199,981,242,060,482,819,894,664,967,822,041,861 (71)
abstracting: (3<=p353)
states: 0
-> the formula is FALSE

FORMULA Raft-PT-10-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[[2<=p379 | p204<=p82] | [p269<=p428 | 1<=p306]] | [p13<=p205 & 3<=p159]]]
normalized: ~ [E [true U ~ [[[p13<=p205 & 3<=p159] | [[p269<=p428 | 1<=p306] | [2<=p379 | p204<=p82]]]]]]

abstracting: (p204<=p82)
states: 132,528,632,051,017,240,089,961,806,989,951,202,584,554,788,807,330,066,152,436,476,777,915,141 (71)
abstracting: (2<=p379)
states: 0
abstracting: (1<=p306)
states: 31,554,436,200,805,781,995,174,191,233,601,638,725,222,444,391,749,905,221,897,193,050,055,620 (70)
abstracting: (p269<=p428)
states: 132,528,632,051,017,240,089,961,806,989,951,202,584,554,788,807,330,066,152,436,476,777,915,141 (71)
abstracting: (3<=p159)
states: 0
abstracting: (p13<=p205)
states: 132,528,632,053,025,912,645,285,544,834,378,655,199,981,242,060,482,819,894,664,967,822,041,861 (71)
-> the formula is FALSE

FORMULA Raft-PT-10-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.320sec

checking: EF [[[[p154<=p145 & p262<=p60] & 3<=p422] & [2<=p275 | [p457<=p112 & 2<=p209]]]]
normalized: E [true U [[[p457<=p112 & 2<=p209] | 2<=p275] & [[p154<=p145 & p262<=p60] & 3<=p422]]]

abstracting: (3<=p422)
states: 0
abstracting: (p262<=p60)
states: 132,528,632,053,025,912,645,285,544,834,378,655,199,981,242,060,482,819,894,664,967,822,041,861 (71)
abstracting: (p154<=p145)
states: 132,528,632,053,025,912,645,285,544,834,378,655,199,981,242,060,482,819,894,664,967,822,041,861 (71)
abstracting: (2<=p275)
states: 0
abstracting: (2<=p209)
states: 0
abstracting: (p457<=p112)
states: 132,528,632,051,017,240,089,961,806,989,951,202,584,554,788,807,330,066,152,436,476,777,915,141 (71)
-> the formula is FALSE

FORMULA Raft-PT-10-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 369364941(3.7e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 853904462 1670592002 2524496464
used/not used/entry size/cache size: 67071747 37117 16 1024MB
basic ops cache: hits/miss/sum: 1289934514 2082031694 3371966208
used/not used/entry size/cache size: 16777216 0 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 8079 9199 17278
used/not used/entry size/cache size: 9188 2087964 32 64MB
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 20488117
1 24586731
2 14463484
3 5565089
4 1577605
5 352514
6 64208
7 9623
8 1322
9 156
>= 10 15

Total processing time: 16m 0.455sec


BK_STOP 1494706747532

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


initing FirstDep: 0m 0.001sec

297 705 647 537 559 862 607 786 630 852 1114 788 850 763 1344 1046 874 717 832 1127 1053 1134 1069 946 953 781 866 758 771 778 582 785 984 1902 1014 1018 1102 1519 1063 1193 592 1560 1466 1278 1451 1082 1054 1243 1677 1372 1504 667 947 1274 1671 1040 1924 1439 890 1180 1161 1390 898 1703 1795 1150 2307 2709 1220 1765 1123 1604 1766 990 2022 1448 2053 1209 1885 1691 1411 1438 1913 1414 1297 1256 1389 1307 1699 1317 1815 1527 1562 1232 1924 1784 1366 713 2150 1998 1482 826 1231 1008 1249 1842 1397 1505 987 1692 1598 1794 1257 2385 2053 2428 2643 2140 1800 1327 1676 1316 1122 1809 1322 1841 1976 1058 2463 1638 1759 2118 2311 2192 2309 1450 1529 1260 1028 1939 1079 2040 1064 2311 1054 1956 1045 2053 1499 1834 1471 2079 1380 1729 1600 2452 1511 2450 1381 1958 1382 1959 1567 2269 1524 2463 1187 2013 1407 1755 1500 2108 1153 1993 1237 1791 1078 1794 1084 1808 1090 1851 1096 2699 2228 1891 2195 2906 1939 3427 2663 2439 3016 1947 1321 2369 1657 1331 1247 1737 2322 2018 1902 1979 2275 1558 1877 1114 2321 1700 1940 1542 2328 1672 2493 2008 1361 1656 1135 1856 1984 1658 1489 2317 1990 2500 1760 1292 1668 808 2065 1978 2002 1721 2299 1688 2749 1927 1913 2390 1145 1868 1428 1826 2593 2895 1878 2036 2591 1770 1973 1161 1953 1852 845 2218 1777 1845 2385 2910 1649 1439 1772 1391 2602 1629 2161 2511 1225 1761 1623 1516 2473 1922 1528 2295 2597 1386 1218 2046 1979 1981 2070 2294 2393 1538 1515 2204 1526 3739 2041 2541 2721 3415 2044 3157 3003 3093 1523 2333 1974 2983 1599 1470 1803 2401 2662 2360 1564 1564 2289 1579 2482 1668 1469 2357 2413 1275 2262 2049 980 1817 1849 2417 1746 2299 2438 2561 2036 1929 2514 2421 2004 1757 1524 894 2213 1607 2510 1893 2584 3187 2511 1791 2037 2582 1844 1894 2356 1536 902 2227 1889 2308 2041 2649 3093 2493 2064 1918 2504 2197 1776 2052 1342 1262 1860 2155 2421 1612 2750 2391 3400 1809 1758 2226 1877 1817 1951 2644 1728 2260 2426 1901 1634 1873 2168 2434 1625 2531 1981 2990 1537 2388 2875 2199 2040 1911 2503 2842 1782 3075 2482 1628 1945 2407 1587 953 1531 1563 2131 919 2184 1934 3229 1825 2160 2258 2890
iterations count:41984218 (48368), effective:200660 (231)

initing FirstDep: 0m 0.001sec


iterations count:7412 (8), effective:46 (0)

iterations count:6944 (8), effective:56 (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="Raft-PT-10"
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/Raft-PT-10.tgz
mv Raft-PT-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is Raft-PT-10, 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 r061-csrt-149440955100034"
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 ;