About the Execution of M4M.full for QuasiCertifProtocol-COL-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8232.240 | 875881.00 | 1740416.00 | 2597.60 | FFF?TTTFTF?TTFTF | normal |
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)
.......................................................................................
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-COL-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583600033
=====================================================================
--------------------
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 QuasiCertifProtocol-COL-18-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-18-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527945844929
BK_STOP 1527946720810
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-COL-18 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 249276, 'Memory': 8099.35, 'Tool': 'lola'}, {'Time': 249384, 'Memory': 3867.16, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-COL-18...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-18: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-18: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ QuasiCertifProtocol-COL-18 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-18-ReachabilityCardinality.task
lola: A (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p38))) : A (G (((p481 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + 1 <= p78) OR (p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 + 1 <= p899)))) : A (G ((p80 <= p976 + p957 + p938 + p919 + p900 + p1242 + p1223 + p1204 + p1185 + p1166 + p1147 + p1128 + p1109 + p1090 + p1071 + p1052 + p1033 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1000 + p1001 + p1002 + p1003 + p1004 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1205 + p1206 + p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1224 + p1225 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + p1240 + p1241 + p1243 + p1244 + p1245 + p1246 + p1247 + p1248 + p1249 + p1250 + p1251 + p1252 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 + p1259 + p1260 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999))) : E (F (((p39 <= 0) AND (p79 + 1 <= p460 + p459 + p458 + p457 + p456 + p455 + p454 + p453 + p452 + p451 + p450 + p449 + p448 + p447 + p446 + p445 + p444 + p443 + p442) AND (2 <= p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300) AND (2 <= p841 + p822 + p803 + p784 + p765 + p746 + p727 + p708 + p689 + p670 + p651 + p632 + p613 + p594 + p575 + p556 + p537 + p518 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859) AND ((p481 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 <= p39) OR (p976 + p957 + p938 + p919 + p900 + p1242 + p1223 + p1204 + p1185 + p1166 + p1147 + p1128 + p1109 + p1090 + p1071 + p1052 + p1033 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1000 + p1001 + p1002 + p1003 + p1004 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1205 + p1206 + p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1224 + p1225 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + p1240 + p1241 + p1243 + p1244 + p1245 + p1246 + p1247 + p1248 + p1249 + p1250 + p1251 + p1252 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 + p1259 + p1260 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999 <= p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261))))) : E (F ((1 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p77))) : E (F ((3 <= p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461))) : E (F (((2 <= p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341 + p1340 + p1339 + p1338) AND (p1397 <= 0) AND ((3 <= p1376) OR (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p1376) OR (p1376 <= 1))))) : E (F (((p460 + p459 + p458 + p457 + p456 + p455 + p454 + p453 + p452 + p451 + p450 + p449 + p448 + p447 + p446 + p445 + p444 + p443 + p442 <= 0) AND (p78 + 1 <= p1377) AND ((p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + 1 <= p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300) OR (p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 + 1 <= p841 + p822 + p803 + p784 + p765 + p746 + p727 + p708 + p689 + p670 + p651 + p632 + p613 + p594 + p575 + p556 + p537 + p518 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p671 + p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 + p707 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859))))) : A (G (((2 <= p899) OR (p879 <= 0) OR (p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 <= p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860)))) : E (F ((((p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + 1 <= p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 + p1330 + p1331 + p1332 + p1333 + p1334 + p1335 + p1336 + p1337) OR (p1280 <= p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898)) AND (3 <= p78)))) : A (G (((3 <= p78) OR (p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 <= p976 + p957 + p938 + p919 + p900 + p1242 + p1223 + p1204 + p1185 + p1166 + p1147 + p1128 + p1109 + p1090 + p1071 + p1052 + p1033 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1000 + p1001 + p1002 + p1003 + p1004 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1205 + p1206 + p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1224 + p1225 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + p1240 + p1241 + p1243 + p1244 + p1245 + p1246 + p1247 + p1248 + p1249 + p1250 + p1251 + p1252 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 + p1259 + p1260 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p939 + p9
40 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999) OR ((p80 <= p1397) AND (1 <= p78)) OR (((2 <= p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p37) OR (p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 <= p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261)) AND ((p1376 <= p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375) OR (p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 <= p1377)))))) : E (F ((3 <= p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860))) : A (G (((p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341 + p1340 + p1339 + p1338 + 1 <= p38) OR (p1397 <= 2)))) : A (G (((p481 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 <= p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860) OR (p899 <= p481 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498)))) : E (F ((p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 <= p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281))) : E (F (((p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p37 + 1 <= p38) AND (2 <= p78) AND (p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 <= p39))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p481 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + 1 <= p78) OR (p1279 + p1278 + p1277 + p1276 + p1275 + p1274 + p1273 + p1272 + p1271 + p1270 + p1269 + p1268 + p1267 + p1266 + p1265 + p1264 + p1263 + p1262 + p1261 + 1 <= p899))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p80 <= p976 + p957 + p938 + p919 + p900 + p1242 + p1223 + p1204 + p1185 + p1166 + p1147 + p1128 + p1109 + p1090 + p1071 + p1052 + p1033 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1000 + p1001 + p1002 + p1003 + p1004 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p39 <= 0) AND (p79 + 1 <= p460 + p459 + p458 + p457 + p456 + p455 + p454 + p453 + p452 + p451 + p450 + p449 + p448 + p447 + p446 + p445 + p444 + p443 + p442) AND (2 <= p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300) AND (2 <= p841 + p822 + p803 + p784 + p765 + p746 + p727 + p708 + p689 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 200512 markings, 462769 edges, 40102 markings/sec, 0 secs
lola: sara is running 5 secs || 400830 markings, 963258 edges, 40064 markings/sec, 5 secs
lola: sara is running 10 secs || 593482 markings, 1685500 edges, 38530 markings/sec, 10 secs
lola: sara is running 15 secs || 774460 markings, 2576198 edges, 36196 markings/sec, 15 secs
lola: sara is running 20 secs || 948964 markings, 3441454 edges, 34901 markings/sec, 20 secs
lola: sara is running 25 secs || 1123641 markings, 4299936 edges, 34935 markings/sec, 25 secs
lola: sara is running 30 secs || 1292881 markings, 5207170 edges, 33848 markings/sec, 30 secs
lola: sara is running 35 secs || 1496899 markings, 5746881 edges, 40804 markings/sec, 35 secs
lola: sara is running 40 secs || 1694861 markings, 6583597 edges, 39592 markings/sec, 40 secs
lola: sara is running 45 secs || 1883144 markings, 7485812 edges, 37657 markings/sec, 45 secs
lola: sara is running 50 secs || 2070715 markings, 8061554 edges, 37514 markings/sec, 50 secs
lola: sara is running 55 secs || 2256559 markings, 8630284 edges, 37169 markings/sec, 55 secs
lola: sara is running 60 secs || 2422077 markings, 9368714 edges, 33104 markings/sec, 60 secs
lola: sara is running 65 secs || 2538092 markings, 10336893 edges, 23203 markings/sec, 65 secs
lola: sara is running 70 secs || 2659077 markings, 11252613 edges, 24197 markings/sec, 70 secs
lola: sara is running 75 secs || 2795515 markings, 12220796 edges, 27288 markings/sec, 75 secs
lola: sara is running 80 secs || 2951445 markings, 13228110 edges, 31186 markings/sec, 80 secs
lola: sara is running 85 secs || 3070403 markings, 14314216 edges, 23792 markings/sec, 85 secs
lola: sara is running 90 secs || 3220187 markings, 15378176 edges, 29957 markings/sec, 90 secs
lola: sara is running 95 secs || 3398734 markings, 16310611 edges, 35709 markings/sec, 95 secs
lola: sara is running 100 secs || 3572267 markings, 17216436 edges, 34707 markings/sec, 100 secs
lola: sara is running 105 secs || 3740300 markings, 18123039 edges, 33607 markings/sec, 105 secs
lola: sara is running 110 secs || 3891525 markings, 19022278 edges, 30245 markings/sec, 110 secs
lola: sara is running 115 secs || 4053150 markings, 19887250 edges, 32325 markings/sec, 115 secs
lola: sara is running 120 secs || 4221995 markings, 20940107 edges, 33769 markings/sec, 120 secs
lola: sara is running 125 secs || 4395347 markings, 21920547 edges, 34670 markings/sec, 125 secs
lola: sara is running 130 secs || 4527014 markings, 22922050 edges, 26333 markings/sec, 130 secs
lola: sara is running 135 secs || 4641501 markings, 23990868 edges, 22897 markings/sec, 135 secs
lola: sara is running 140 secs || 4836497 markings, 25032113 edges, 38999 markings/sec, 140 secs
lola: sara is running 145 secs || 4985867 markings, 26131719 edges, 29874 markings/sec, 145 secs
lola: sara is running 150 secs || 5100478 markings, 27302653 edges, 22922 markings/sec, 150 secs
lola: sara is running 155 secs || 5203698 markings, 28457794 edges, 20644 markings/sec, 155 secs
lola: sara is running 160 secs || 5293368 markings, 29592859 edges, 17934 markings/sec, 160 secs
lola: sara is running 165 secs || 5494262 markings, 30143904 edges, 40179 markings/sec, 165 secs
lola: sara is running 170 secs || 5695498 markings, 30811315 edges, 40247 markings/sec, 170 secs
lola: sara is running 175 secs || 5891504 markings, 31517338 edges, 39201 markings/sec, 175 secs
lola: sara is running 180 secs || 6082981 markings, 32312447 edges, 38295 markings/sec, 180 secs
lola: sara is running 185 secs || 6269058 markings, 33293004 edges, 37215 markings/sec, 185 secs
lola: sara is running 190 secs || 6464363 markings, 34265725 edges, 39061 markings/sec, 190 secs
lola: sara is running 195 secs || 6649657 markings, 35281741 edges, 37059 markings/sec, 195 secs
lola: sara is running 200 secs || 6839091 markings, 36228811 edges, 37887 markings/sec, 200 secs
lola: sara is running 205 secs || 7025961 markings, 37219206 edges, 37374 markings/sec, 205 secs
lola: sara is running 210 secs || 7224383 markings, 38280193 edges, 39684 markings/sec, 210 secs
lola: sara is running 215 secs || 7390345 markings, 39458910 edges, 33192 markings/sec, 215 secs
lola: sara is running 220 secs || 7557057 markings, 40697586 edges, 33342 markings/sec, 220 secs
lola: sara is running 225 secs || 7695760 markings, 41760285 edges, 27741 markings/sec, 225 secs
lola: sara is running 230 secs || 7883626 markings, 42420980 edges, 37573 markings/sec, 230 secs
lola: sara is running 235 secs || 8057952 markings, 43161513 edges, 34865 markings/sec, 235 secs
lola: sara is running 240 secs || 8189558 markings, 44106154 edges, 26321 markings/sec, 240 secs
lola: sara is running 245 secs || 8320723 markings, 45058199 edges, 26233 markings/sec, 245 secs
lola: sara is running 250 secs || 8448627 markings, 46049870 edges, 25581 markings/sec, 250 secs
lola: sara is running 255 secs || 8612971 markings, 47034479 edges, 32869 markings/sec, 255 secs
lola: sara is running 260 secs || 8733974 markings, 48067183 edges, 24201 markings/sec, 260 secs
lola: sara is running 265 secs || 8847650 markings, 49103944 edges, 22735 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p77)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p479 + p478 + p477 + p476 + p475 + p474 + p473 + p472 + p471 + p470 + p469 + p468 + p467 + p466 + p465 + p464 + p463 + p462 + p461)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341 + p1340 + p1339 + p1338) AND (p1397 <= 0) AND ((3 <= p1376) OR (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p1376) OR (p1376 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p460 + p459 + p458 + p457 + p456 + p455 + p454 + p453 + p452 + p451 + p450 + p449 + p448 + p447 + p446 + p445 + p444 + p443 + p442 <= 0) AND (p78 + 1 <= p1377) AND ((p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + 1 <= p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state equation: calling and running sara
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-6.sara.
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p899) OR (p879 <= 0) OR (p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 <= p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281 + 1 <= p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 + p1330 + p1331 + p1332 + p1333 + p1334 + p1335 + p1336 + p1337) OR (p1280 <= p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p78) OR (p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 <= p976 + p957 + p938 + p919 + p900 + p1242 + p1223 + p1204 + p1185 + p1166 + p1147 + p1128 + p1109 + p1090 + p1071 + p1052 + p1033 + p1014 + p1013 + p1012 + p1011 + p1010 + p1009 + p1008 + p1007 + p1006 + p1005 + p1000 + p1001... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 122309 markings, 1020626 edges, 24462 markings/sec, 0 secs
lola: sara is running 5 secs || 249684 markings, 2217040 edges, 25475 markings/sec, 5 secs
lola: sara is running 10 secs || 375762 markings, 3410425 edges, 25216 markings/sec, 10 secs
lola: sara is running 15 secs || 496389 markings, 4651501 edges, 24125 markings/sec, 15 secs
lola: sara is running 20 secs || 653185 markings, 6068762 edges, 31359 markings/sec, 20 secs
lola: sara is running 25 secs || 815144 markings, 7577110 edges, 32392 markings/sec, 25 secs
lola: sara is running 30 secs || 971597 markings, 9108710 edges, 31291 markings/sec, 30 secs
lola: sara is running 35 secs || 1135646 markings, 10657278 edges, 32810 markings/sec, 35 secs
lola: sara is running 40 secs || 1309491 markings, 12303726 edges, 34769 markings/sec, 40 secs
lola: sara is running 45 secs || 1486288 markings, 13988661 edges, 35359 markings/sec, 45 secs
lola: sara is running 50 secs || 1659956 markings, 15638196 edges, 34734 markings/sec, 50 secs
lola: sara is running 55 secs || 1832544 markings, 17269656 edges, 34518 markings/sec, 55 secs
lola: sara is running 60 secs || 2006423 markings, 18927793 edges, 34776 markings/sec, 60 secs
lola: sara is running 65 secs || 2183450 markings, 20612402 edges, 35405 markings/sec, 65 secs
lola: sara is running 70 secs || 2362064 markings, 22299682 edges, 35723 markings/sec, 70 secs
lola: sara is running 75 secs || 2538287 markings, 23986733 edges, 35245 markings/sec, 75 secs
lola: sara is running 80 secs || 2713253 markings, 25641867 edges, 34993 markings/sec, 80 secs
lola: sara is running 85 secs || 2889340 markings, 27302925 edges, 35217 markings/sec, 85 secs
lola: sara is running 90 secs || 3064452 markings, 28988029 edges, 35022 markings/sec, 90 secs
lola: sara is running 95 secs || 3240773 markings, 30652727 edges, 35264 markings/sec, 95 secs
lola: sara is running 100 secs || 3416236 markings, 32305616 edges, 35093 markings/sec, 100 secs
lola: sara is running 105 secs || 3588907 markings, 33970240 edges, 34534 markings/sec, 105 secs
lola: sara is running 110 secs || 3766153 markings, 35644115 edges, 35449 markings/sec, 110 secs
lola: sara is running 115 secs || 3945602 markings, 37327142 edges, 35890 markings/sec, 115 secs
lola: sara is running 120 secs || 4120604 markings, 39029910 edges, 35000 markings/sec, 120 secs
lola: sara is running 125 secs || 4296650 markings, 40679942 edges, 35209 markings/sec, 125 secs
lola: sara is running 130 secs || 4473278 markings, 42338423 edges, 35326 markings/sec, 130 secs
lola: sara is running 135 secs || 4646057 markings, 44022493 edges, 34556 markings/sec, 135 secs
lola: sara is running 140 secs || 4822992 markings, 45678127 edges, 35387 markings/sec, 140 secs
lola: sara is running 145 secs || 5001173 markings, 47348317 edges, 35636 markings/sec, 145 secs
lola: sara is running 150 secs || 5160601 markings, 48900505 edges, 31886 markings/sec, 150 secs
lola: sara is running 155 secs || 5318326 markings, 50404727 edges, 31545 markings/sec, 155 secs
lola: sara is running 160 secs || 5479622 markings, 51890117 edges, 32259 markings/sec, 160 secs
lola: sara is running 165 secs || 5619875 markings, 53232124 edges, 28051 markings/sec, 165 secs
lola: sara is running 170 secs || 5774700 markings, 54835048 edges, 30965 markings/sec, 170 secs
lola: sara is running 175 secs || 5942274 markings, 56275974 edges, 33515 markings/sec, 175 secs
lola: sara is running 180 secs || 6103077 markings, 57806137 edges, 32161 markings/sec, 180 secs
lola: sara is running 185 secs || 6258436 markings, 59387153 edges, 31072 markings/sec, 185 secs
lola: sara is running 190 secs || 6422613 markings, 60882750 edges, 32835 markings/sec, 190 secs
lola: sara is running 195 secs || 6584386 markings, 62384761 edges, 32355 markings/sec, 195 secs
lola: sara is running 200 secs || 6741851 markings, 63931057 edges, 31493 markings/sec, 200 secs
lola: sara is running 205 secs || 6901753 markings, 65436580 edges, 31980 markings/sec, 205 secs
lola: sara is running 210 secs || 7061093 markings, 66922282 edges, 31868 markings/sec, 210 secs
lola: sara is running 215 secs || 7219422 markings, 68442034 edges, 31666 markings/sec, 215 secs
lola: sara is running 220 secs || 7375725 markings, 69994591 edges, 31261 markings/sec, 220 secs
lola: sara is running 225 secs || 7539823 markings, 71457918 edges, 32820 markings/sec, 225 secs
lola: sara is running 230 secs || 7700811 markings, 72992328 edges, 32198 markings/sec, 230 secs
lola: sara is running 235 secs || 7853645 markings, 74576360 edges, 30567 markings/sec, 235 secs
lola: sara is running 240 secs || 8018547 markings, 76010910 edges, 32980 markings/sec, 240 secs
lola: sara is running 245 secs || 8176514 markings, 77502467 edges, 31593 markings/sec, 245 secs
lola: sara is running 250 secs || 8330127 markings, 79035058 edges, 30723 markings/sec, 250 secs
lola: sara is running 255 secs || 8491012 markings, 80526324 edges, 32177 markings/sec, 255 secs
lola: sara is running 260 secs || 8648869 markings, 82026136 edges, 31571 markings/sec, 260 secs
lola: sara is running 265 secs || 8808249 markings, 83537696 edges, 31876 markings/sec, 265 secs
lola: sara is running 270 secs || 8965447 markings, 85074669 edges, 31440 markings/sec, 270 secs
lola: sara is running 275 secs || 9128515 markings, 86545315 edges, 32614 markings/sec, 275 secs
lola: sara is running 280 secs || 9284310 markings, 88036139 edges, 31159 markings/sec, 280 secs
lola: sara is running 285 secs || 9434822 markings, 89619885 edges, 30102 markings/sec, 285 secs
lola: sara is running 290 secs || 9600454 markings, 91038170 edges, 33126 markings/sec, 290 secs
lola: sara is running 295 secs || 9759585 markings, 92543165 edges, 31826 markings/sec, 295 secs
lola: sara is running 300 secs || 9914083 markings, 94092204 edges, 30900 markings/sec, 300 secs
lola: sara is running 305 secs || 10061426 markings, 95447919 edges, 29469 markings/sec, 305 secs
lola: sara is running 310 secs || 10194781 markings, 96683147 edges, 26671 markings/sec, 310 secs
lola: sara is running 315 secs || 10325719 markings, 97926952 edges, 26188 markings/sec, 315 secs
lola: sara is running 320 secs || 10449307 markings, 99191834 edges, 24718 markings/sec, 320 secs
lola: sara is running 325 secs || 10584850 markings, 100422003 edges, 27109 markings/sec, 325 secs
lola: sara is running 330 secs || 10719099 markings, 101664202 edges, 26850 markings/sec, 330 secs
lola: sara is running 335 secs || 10850975 markings, 102916810 edges, 26375 markings/sec, 335 secs
lola: sara is running 340 secs || 10975050 markings, 104189289 edges, 24815 markings/sec, 340 secs
lola: sara is running 345 secs || 11112638 markings, 105431607 edges, 27518 markings/sec, 345 secs
lola: sara is running 350 secs || 11246830 markings, 106678525 edges, 26838 markings/sec, 350 secs
lola: sara is running 355 secs || 11379371 markings, 107938600 edges, 26508 markings/sec, 355 secs
lola: sara is running 360 secs || 11504171 markings, 109223005 edges, 24960 markings/sec, 360 secs
lola: sara is running 365 secs || 11643288 markings, 110468483 edges, 27823 markings/sec, 365 secs
lola: sara is running 370 secs || 11779782 markings, 111749895 edges, 27299 markings/sec, 370 secs
lola: sara is running 375 secs || 11916033 markings, 113047733 edges, 27250 markings/sec, 375 secs
lola: sara is running 380 secs || 12042925 markings, 114365813 edges, 25378 markings/sec, 380 secs
lola: sara is running 385 secs || 12187020 markings, 115639117 edges, 28819 markings/sec, 385 secs
lola: sara is running 390 secs || 12324465 markings, 116940595 edges, 27489 markings/sec, 390 secs
lola: sara is running 395 secs || 12461812 markings, 118244776 edges, 27469 markings/sec, 395 secs
lola: sara is running 400 secs || 12590260 markings, 119583189 edges, 25690 markings/sec, 400 secs
lola: sara is running 405 secs || 12738939 markings, 120854424 edges, 29736 markings/sec, 405 secs
lola: sara is running 410 secs || 12877446 markings, 122169869 edges, 27701 markings/sec, 410 secs
lola: sara is running 415 secs || 13014336 markings, 123501400 edges, 27378 markings/sec, 415 secs
lola: sara is running 420 secs || 13150487 markings, 124842107 edges, 27230 markings/sec, 420 secs
lola: sara is running 425 secs || 13298366 markings, 126161405 edges, 29576 markings/sec, 425 secs
lola: sara is running 430 secs || 13441617 markings, 127521760 edges, 28650 markings/sec, 430 secs
lola: sara is running 435 secs || 13582524 markings, 128942690 edges, 28181 markings/sec, 435 secs
lola: sara is running 440 secs || 13735399 markings, 130345997 edges, 30575 markings/sec, 440 secs
lola: sara is running 445 secs || 13885412 markings, 131762352 edges, 30003 markings/sec, 445 secs
lola: sara is running 450 secs || 14035759 markings, 133196700 edges, 30069 markings/sec, 450 secs
lola: sara is running 455 secs || 14182687 markings, 134672553 edges, 29386 markings/sec, 455 secs
lola: sara is running 460 secs || 14342447 markings, 136077970 edges, 31952 markings/sec, 460 secs
lola: sara is running 465 secs || 14495911 markings, 137535924 edges, 30693 markings/sec, 465 secs
lola: sara is running 470 secs || 14643448 markings, 139035958 edges, 29507 markings/sec, 470 secs
lola: sara is running 475 secs || 14788456 markings, 140347830 edges, 29002 markings/sec, 475 secs
lola: sara is running 480 secs || 14919329 markings, 141568216 edges, 26175 markings/sec, 480 secs
lola: sara is running 485 secs || 15050516 markings, 142814520 edges, 26237 markings/sec, 485 secs
lola: sara is running 490 secs || 15174493 markings, 144091189 edges, 24795 markings/sec, 490 secs
lola: sara is running 495 secs || 15315056 markings, 145350630 edges, 28113 markings/sec, 495 secs
lola: sara is running 500 secs || 15447967 markings, 146594297 edges, 26582 markings/sec, 500 secs
lola: sara is running 505 secs || 15582956 markings, 147880857 edges, 26998 markings/sec, 505 secs
lola: sara is running 510 secs || 15711858 markings, 149218573 edges, 25780 markings/sec, 510 secs
lola: sara is running 515 secs || 15858305 markings, 150518199 edges, 29289 markings/sec, 515 secs
lola: sara is running 520 secs || 15999947 markings, 151848610 edges, 28328 markings/sec, 520 secs
lola: sara is running 525 secs || 16140003 markings, 153187528 edges, 28011 markings/sec, 525 secs
lola: sara is running 530 secs || 16268866 markings, 154512164 edges, 25773 markings/sec, 530 secs
lola: sara is running 535 secs || 16418166 markings, 155804469 edges, 29860 markings/sec, 535 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 12 will run for 679 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341 + p1340 + p1339 + p1338 + 1 <= p38) OR (p1397 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 906 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p481 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 <= p878 + p877 + p876 + p875 + p874 + p873 + p872 + p871 + p870 + p869 + p868 + p867 + p866 + p865 + p864 + p863 + p862 + p861 + p860) OR (p899 <= p481 + p480 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 <= p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290 + p1289 + p1288 + p1287 + p1286 + p1285 + p1284 + p1283 + p1282 + p1281)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 15 will run for 2716 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p36 + p35 + p34 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p37 + 1 <= p38) AND (2 <= p78) AND (p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 <= p39))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-14.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-18-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-18-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no unknown yes yes yes no yes no unknown yes yes no yes no
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-18-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----
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="QuasiCertifProtocol-COL-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-full"
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/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is QuasiCertifProtocol-COL-18, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-qhx2-152673583600033"
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 '
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 ;