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 S_Raft-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128100165
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464560935559


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: Raft_PT_05
(NrP: 133 NrTr: 238 NrArc: 864)

net check time: 0m 0.000sec

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

init dd package: 0m 3.830sec


RS generation: 0m11.727sec


-> reachability set: #nodes 556 (5.6e+02) #states 5,937,946,479,402,210,021 (18)



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

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

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

FORMULA Raft-PT-05-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=p100) states: 0
-> the formula is TRUE

FORMULA Raft-PT-05-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [AF [3<=p39]]
normalized: E [true U ~ [EG [~ [3<=p39]]]]

abstracting: (3<=p39) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Raft-PT-05-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [AF [1<=p115] U 2<=p49]
normalized: E [~ [EG [~ [1<=p115]]] U 2<=p49]

abstracting: (2<=p49) states: 0
abstracting: (1<=p115) states: 1,192,092,895,507,812,500 (18)
..
EG iterations: 2
-> the formula is FALSE

FORMULA Raft-PT-05-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: EF [~ [AF [p99<=p86]]]
normalized: E [true U EG [~ [p99<=p86]]]

abstracting: (p99<=p86) states: 4,988,494,287,646,619,861 (18)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-05-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.198sec

checking: AG [p77<=p100]
normalized: ~ [E [true U ~ [p77<=p100]]]

abstracting: (p77<=p100) states: 4,989,901,662,530,173,141 (18)
-> the formula is FALSE

FORMULA Raft-PT-05-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.105sec

checking: EF [~ [~ [[p29<=p47 & 2<=p116]]]]
normalized: E [true U [p29<=p47 & 2<=p116]]

abstracting: (2<=p116) states: 0
abstracting: (p29<=p47) states: 4,988,494,287,646,619,861 (18)
-> the formula is FALSE

FORMULA Raft-PT-05-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [EF [[p94<=p7 & 3<=p30]]]
normalized: EG [E [true U [p94<=p7 & 3<=p30]]]

abstracting: (3<=p30) states: 0
abstracting: (p94<=p7) states: 4,988,494,287,646,619,861 (18)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-05-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [AG [[p127<=p14 | p24<=p132]]]
normalized: EG [~ [E [true U ~ [[p127<=p14 | p24<=p132]]]]]

abstracting: (p24<=p132) states: 5,048,098,932,422,010,486 (18)
abstracting: (p127<=p14) states: 4,987,649,862,716,487,893 (18)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-05-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.628sec

checking: E [~ [~ [p41<=p72]] U AG [p55<=p58]]
normalized: E [p41<=p72 U ~ [E [true U ~ [p55<=p58]]]]

abstracting: (p55<=p58) states: 4,984,272,162,995,960,021 (18)
abstracting: (p41<=p72) states: 4,988,494,287,646,619,861 (18)
-> the formula is FALSE

FORMULA Raft-PT-05-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: E [[~ [1<=p7] | [p109<=p114 | p60<=p31]] U 1<=p117]
normalized: E [[[p109<=p114 | p60<=p31] | ~ [1<=p7]] U 1<=p117]

abstracting: (1<=p117) states: 1,186,463,395,973,599,380 (18)
abstracting: (1<=p7) states: 1,186,463,395,973,599,380 (18)
abstracting: (p60<=p31) states: 4,984,272,162,995,960,021 (18)
abstracting: (p109<=p114) states: 4,988,494,287,646,619,861 (18)
-> the formula is TRUE

FORMULA Raft-PT-05-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.186sec

checking: ~ [[[[2<=p71 | [3<=p17 & 2<=p120]] | EF [3<=p86]] | [EX [2<=p37] & [2<=p29 & [p82<=p45 | 1<=p58]]]]]
normalized: ~ [[[[2<=p29 & [p82<=p45 | 1<=p58]] & EX [2<=p37]] | [E [true U 3<=p86] | [2<=p71 | [3<=p17 & 2<=p120]]]]]

abstracting: (2<=p120) states: 0
abstracting: (3<=p17) states: 0
abstracting: (2<=p71) states: 0
abstracting: (3<=p86) states: 0
abstracting: (2<=p37) states: 0
.abstracting: (1<=p58) states: 1,186,463,395,973,599,380 (18)
abstracting: (p82<=p45) states: 4,989,901,662,530,173,141 (18)
abstracting: (2<=p29) states: 0
-> the formula is TRUE

FORMULA Raft-PT-05-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[[1<=p94 | p104<=p37] & [p4<=p78 & p99<=p42]] & AG [p30<=p71]]]
normalized: E [true U [[[1<=p94 | p104<=p37] & [p4<=p78 & p99<=p42]] & ~ [E [true U ~ [p30<=p71]]]]]

abstracting: (p30<=p71) states: 4,984,272,162,995,960,021 (18)
abstracting: (p99<=p42) states: 4,988,494,287,646,619,861 (18)
abstracting: (p4<=p78) states: 4,988,494,287,646,619,861 (18)
abstracting: (p104<=p37) states: 4,988,494,287,646,619,861 (18)
abstracting: (1<=p94) states: 1,186,463,395,973,599,380 (18)
-> the formula is FALSE

FORMULA Raft-PT-05-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: EF [[~ [[1<=p15 | p31<=p23]] & [[p95<=p73 | p107<=p47] & ~ [p74<=p66]]]]
normalized: E [true U [[[p95<=p73 | p107<=p47] & ~ [p74<=p66]] & ~ [[1<=p15 | p31<=p23]]]]

abstracting: (p31<=p23) states: 4,988,494,287,646,619,861 (18)
abstracting: (1<=p15) states: 1,192,092,895,507,812,500 (18)
abstracting: (p74<=p66) states: 4,988,494,287,646,619,861 (18)
abstracting: (p107<=p47) states: 4,988,494,287,646,619,861 (18)
abstracting: (p95<=p73) states: 4,984,272,162,995,960,021 (18)
-> the formula is TRUE

FORMULA Raft-PT-05-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.162sec

checking: [~ [[AG [p124<=p55] & ~ [[1<=p24 & 1<=p25]]]] & [[~ [[p65<=p41 & p71<=p77]] | [~ [1<=p81] & [p69<=p111 | 1<=p77]]] | AG [[2<=p83 & 2<=p76]]]]
normalized: [[~ [E [true U ~ [[2<=p83 & 2<=p76]]]] | [[[p69<=p111 | 1<=p77] & ~ [1<=p81]] | ~ [[p65<=p41 & p71<=p77]]]] & ~ [[~ [[1<=p24 & 1<=p25]] & ~ [E [true U ~ [p124<=p55]]]]]]

abstracting: (p124<=p55) states: 4,989,901,662,530,173,141 (18)
abstracting: (1<=p25) states: 1,192,092,895,507,812,500 (18)
abstracting: (1<=p24) states: 1,186,463,395,973,599,380 (18)
abstracting: (p71<=p77) states: 4,988,494,287,646,619,861 (18)
abstracting: (p65<=p41) states: 4,984,272,162,995,960,021 (18)
abstracting: (1<=p81) states: 1,186,463,395,973,599,380 (18)
abstracting: (1<=p77) states: 1,186,463,395,973,599,380 (18)
abstracting: (p69<=p111) states: 4,988,494,287,646,619,861 (18)
abstracting: (2<=p76) states: 0
abstracting: (2<=p83) states: 0
-> the formula is TRUE

FORMULA Raft-PT-05-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.174sec

checking: [[EF [[p45<=p74 & p95<=p60]] | [~ [[p88<=p39 | 3<=p72]] | [~ [p42<=p114] & [1<=p110 & 1<=p100]]]] & EF [[[p102<=p5 & 1<=p62] & p95<=p57]]]
normalized: [E [true U [p95<=p57 & [p102<=p5 & 1<=p62]]] & [[~ [[p88<=p39 | 3<=p72]] | [[1<=p110 & 1<=p100] & ~ [p42<=p114]]] | E [true U [p45<=p74 & p95<=p60]]]]

abstracting: (p95<=p60) states: 4,984,272,162,995,960,021 (18)
abstracting: (p45<=p74) states: 4,984,272,162,995,960,021 (18)
abstracting: (p42<=p114) states: 4,988,494,287,646,619,861 (18)
abstracting: (1<=p100) states: 1,192,092,895,507,812,500 (18)
abstracting: (1<=p110) states: 1,192,092,895,507,812,500 (18)
abstracting: (3<=p72) states: 0
abstracting: (p88<=p39) states: 4,988,494,287,646,619,861 (18)
abstracting: (1<=p62) states: 1,186,463,395,973,599,380 (18)
abstracting: (p102<=p5) states: 4,989,901,662,530,173,141 (18)
abstracting: (p95<=p57) states: 4,984,272,162,995,960,021 (18)
-> the formula is TRUE

FORMULA Raft-PT-05-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.226sec


Total processing time: 0m18.995sec


BK_STOP 1464560954589

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

310 302 284 317 328 400 401 379 509 516 513 519 382 453 522 524 465 492 534 473 470 538 389 472 578 517 416 516 552 493 610 658 658 480 612 720 660 517 595 847 788 766 730 583 761 788 790 829 787 502 690 534 604 742 742 606 431 575 721 710 533 643 683 923 815 572 712 652 894 755 635 624 636 770 728 457 587 565 836 668 549 444 598 840 733 488 556 567 708 745 530 559 638 776 776 641 461 671 716 716 645 576 642 719 786 744 474 642 582 824 685 565 450 737 902 965 760 937 1249 1081 1076 866 575 677 866 867 734 1001 1280 940 1080 869 578 705 696 872 1086 1096 923 1062 1142 1181 1218 1101 700 920 967 816 938 1032 1094 1159 909 1184 1280 1040 1227 756 588 804 711 706 685 624 866 785 675 890 973 890 926 574 594 686 626 896 787 677 892 1035 893 929 610 596 613 794 940 955 813 944 1175 1030 918 847 749 614 792 963 903 822 1007 1177 945 1005 911 751 756 739 783 817 771 856 827 925 920 799 621 638 630 679 920 838 636 828 1058 853 802 731 523 496 846 923 990 1007 772 1050 1127 966 1024 761 753 767 847 956 986 910 995 1046 1064 1087 905 670 778 500 697 843 770 717 908 1078 934 905 751 652 515 501 698 845 772 720 910 1107 936 907 753 654 517 502 700 809 774 722 912 1110 910 909 756 656 519 643 702 811 848 695 914 1112 912 912 758 659 664 646 852 1063 975 894 1108 1348 1047 1235 1151 874 1143 1267 1538 1381 1146 1398 1321 1012 771 505 797 976 977 853 1110 1378 1049 1236 1060 876 1144 1269 1540 1382 1148 1309 1322 1013 646 506 899 708 1081 1025 1304 1230 1075 1338 1497 1323 1513 1103 938 1259 1378 1680 1399 1284 1472 1367 1005 941 799 1179 1217 930 829 1020 1232 1228 1062 1215 1502 1201 1381 1298 940 1312 1376 1711 1527 1415 1536 1459 1158 939 817 939 812 942 1068 805 764 736 976 895 693 943 1115 910 940 870 679 981 1028 1243 1050 1028 1010 904 641 684 657 766 738 978 897 695 945 1117 912 942 872 681 983 1030 1245 1052 1030 1012 906 643 686 659 685 901 1010 1047 894 1113 1311 1111 1169 1040 934 1091 1195 1470 1309 1196 1179 1178 970 720 702 686 934 1043 1073 997 1082 1133 1151 1199 1075 848 981 1197 1440 1252 1198 1272 1271 973 834 842 856 818 893 930 887 818 990 1067 881 1045 787 699 943 1062 1171 1051 1126 1066 918 686 696 710 533 757 866 866 750 970 1168 967 1025 896 805 947 1052 1326 1165 961 1035 1034 826 576 558 540 896 924 1165 1083 881 1073 1303 1098 1128 1059 867 1170 1125 1431 1238 1216 1198 1092 829 872 846 868 954 966 1135 1054 944 1098 1242 1159 1276 956 962 1203 1216 1430 1111 1229 1094 1087 797 872 715 868 839 914 951 967 839 1011 1088 902 1066 747 720 964 1083 1192 1073 1120 1145 939 708 586 731 550 809 821 990 909 799 953 1097 1014 1131 811 817 1058 1071 1285 966 1084 949 942 652 727 570 723 709 943 1052 1089 936 1155 1353 1153 1211 1082 991 1133 1237 1512 1351 1147 1221 1220 1012 762 744 726 879 1007 1081 1118 1076 1007 1179 1195 1070 1234 976 888 1132 1251 1327 1240 1315 1255 1106 785 885 899 718
iterations count:655878 (2755), effective:9490 (39)

initing FirstDep: 0m 0.000sec


iterations count:989 (4), effective:26 (0)
556
iterations count:1162 (4), effective:26 (0)
513 424 561
iterations count:3157 (13), effective:119 (0)
426
iterations count:1345 (5), effective:26 (0)

iterations count:957 (4), effective:22 (0)
426
iterations count:1402 (5), effective:26 (0)
422 426
iterations count:2301 (9), effective:57 (0)
426
iterations count:1325 (5), effective:27 (0)

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

iterations count:883 (3), effective:25 (0)
556
iterations count:1111 (4), effective:27 (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="S_Raft-PT-05"
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/S_Raft-PT-05.tgz
mv S_Raft-PT-05 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 S_Raft-PT-05, 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 r185kn-smll-146444128100165"
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 ;