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 lola
Input is S_AirplaneLD-COL-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441073900011
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-0
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-1
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-10
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-11
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-12
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-13
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-14
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-15
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-2
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-3
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-4
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-5
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-6
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-7
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-8
FORMULA_NAME AirplaneLD-COL-0200-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1496331023912


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_AirplaneLD-COL-0200: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_AirplaneLD-COL-0200: translating COL formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
UpperBounds @ S_AirplaneLD-COL-0200 @ 3539 seconds
----- 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: 3027/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1419 places, 1608 transitions, 814 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1215 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-COL-0200-UpperBounds.task
lola: MAX(p8 + p9) : MAX(p4) : MAX(p813) : MAX(p2 + p3) : MAX(p1416 + p1415 + p1414 + p1413 + p1412 + p1411 + p1410 + p1409 + p1408 + p1407 + p1406 + p1405 + p1404 + p1403 + p1402 + p1401 + p1400 + p1399 + p1398 + p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341 + p1340 + p1339 + p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1223 + p1224 + p1225 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + p1240 + p1241 + p1242 + p1243 + p1244 + p1245 + p1246 + p1247 + p1248 + p1249 + p1250 + p1251 + p1252 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 + p1259 + p1260 + p1261 + p1262 + p1263 + p1264 + p1265 + p1266 + p1267 + p1268 + p1269 + p1270 + p1271 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279 + p1280 + p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299) : MAX(p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1147 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1204 + p1205 + p1206 + p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214) : MAX(p0 + p1) : MAX(p4) : MAX(p814) : MAX(p8 + p9) : MAX(p812) : MAX(p1416 + p1415 + p1414 + p1413 + p1412 + p1411 + p1410 + p1409 + p1408 + p1407 + p1406 + p1405 + p1404 + p1403 + p1402 + p1401 + p1400 + p1399 + p1398 + p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356 + p1355 + p1354 + p1353 + p1352 + p1351 + p1350 + p1349 + p1348 + p1347 + p1346 + p1345 + p1344 + p1343 + p1342 + p1341 + p1340 + p1339 + p1338 + p1337 + p1336 + p1335 + p1334 + p1333 + p1332 + p1331 + p1330 + p1329 + p1328 + p1327 + p1326 + p1325 + p1324 + p1323 + p1322 + p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1223 + p1224 + p1225 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + p1240 + p1241 + p1242 + p1243 + p1244 + p1245 + p1246 + p1247 + p1248 + p1249 + p1250 + p1251 + p1252 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 + p1259 + p1260 + p1261 + p1262 + p1263 + p1264 + p1265 + p1266 + p1267 + p1268 + p1269 + p1270 + p1271 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279 + p1280 + p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299) : MAX(p814) : MAX(p4) : MAX(p6 + p5) : MAX(p812)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p813)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p2 + p3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 91825 markings, 142907 edges, 18365 markings/sec, 0 secs
lola: 172438 markings, 301647 edges, 16123 markings/sec, 5 secs
lola: 253618 markings, 423223 edges, 16236 markings/sec, 10 secs
lola: 358831 markings, 594045 edges, 21043 markings/sec, 15 secs
lola: 424620 markings, 726023 edges, 13158 markings/sec, 20 secs
lola: 488591 markings, 854365 edges, 12794 markings/sec, 25 secs
lola: 550740 markings, 978863 edges, 12430 markings/sec, 30 secs
lola: 612897 markings, 1103577 edges, 12431 markings/sec, 35 secs
lola: 677922 markings, 1233827 edges, 13005 markings/sec, 40 secs
lola: 741576 markings, 1361535 edges, 12731 markings/sec, 45 secs
lola: 803610 markings, 1485804 edges, 12407 markings/sec, 50 secs
lola: 867592 markings, 1614168 edges, 12796 markings/sec, 55 secs
lola: 927683 markings, 1734549 edges, 12018 markings/sec, 60 secs
lola: 989574 markings, 1858731 edges, 12378 markings/sec, 65 secs
lola: 1051994 markings, 1983971 edges, 12484 markings/sec, 70 secs
lola: 1115685 markings, 2111553 edges, 12738 markings/sec, 75 secs
lola: 1177589 markings, 2235761 edges, 12381 markings/sec, 80 secs
lola: 1241029 markings, 2362841 edges, 12688 markings/sec, 85 secs
lola: 1307518 markings, 2496219 edges, 13298 markings/sec, 90 secs
lola: 1369155 markings, 2619693 edges, 12327 markings/sec, 95 secs
lola: 1432405 markings, 2746593 edges, 12650 markings/sec, 100 secs
lola: 1495229 markings, 2872642 edges, 12565 markings/sec, 105 secs
lola: 1565295 markings, 3012973 edges, 14013 markings/sec, 110 secs
lola: 1634803 markings, 3152389 edges, 13902 markings/sec, 115 secs
lola: 1706349 markings, 3295881 edges, 14309 markings/sec, 120 secs
lola: 1772801 markings, 3429185 edges, 13290 markings/sec, 125 secs
lola: 1839705 markings, 3563193 edges, 13381 markings/sec, 130 secs
lola: 1904537 markings, 3693257 edges, 12966 markings/sec, 135 secs
lola: 1966774 markings, 3817931 edges, 12447 markings/sec, 140 secs
lola: 2026437 markings, 3937659 edges, 11933 markings/sec, 145 secs
lola: 2085261 markings, 4055505 edges, 11765 markings/sec, 150 secs
lola: 2146399 markings, 4178181 edges, 12228 markings/sec, 155 secs
lola: 2208553 markings, 4302691 edges, 12431 markings/sec, 160 secs
lola: 2269833 markings, 4425649 edges, 12256 markings/sec, 165 secs
lola: 2328195 markings, 4542573 edges, 11672 markings/sec, 170 secs
lola: 2390967 markings, 4668517 edges, 12554 markings/sec, 175 secs
lola: 2450178 markings, 4787139 edges, 11842 markings/sec, 180 secs
lola: 2508075 markings, 4903335 edges, 11579 markings/sec, 185 secs
lola: 2565933 markings, 5019251 edges, 11572 markings/sec, 190 secs
lola: 2624190 markings, 5136164 edges, 11651 markings/sec, 195 secs
lola: 2682465 markings, 5252913 edges, 11655 markings/sec, 200 secs
lola: 2737386 markings, 5363155 edges, 10984 markings/sec, 205 secs
lola: 2795407 markings, 5479399 edges, 11604 markings/sec, 210 secs
lola: 2850970 markings, 5590725 edges, 11113 markings/sec, 215 secs
lola: 2911520 markings, 5712224 edges, 12110 markings/sec, 220 secs
lola: 2972527 markings, 5834437 edges, 12201 markings/sec, 225 secs
lola: 3038616 markings, 5967015 edges, 13218 markings/sec, 230 secs
lola: 3103559 markings, 6097301 edges, 12989 markings/sec, 235 secs
lola: 3165413 markings, 6221209 edges, 12371 markings/sec, 240 secs
lola: 3225790 markings, 6342363 edges, 12075 markings/sec, 245 secs
lola: 3288686 markings, 6468356 edges, 12579 markings/sec, 250 secs
lola: 3350971 markings, 6593325 edges, 12457 markings/sec, 255 secs
lola: 3412874 markings, 6717332 edges, 12381 markings/sec, 260 secs
lola: 3474051 markings, 6840085 edges, 12235 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: MAX(p1416 + p1415 + p1414 + p1413 + p1412 + p1411 + p1410 + p1409 + p1408 + p1407 + p1406 + p1405 + p1404 + p1403 + p1402 + p1401 + p1400 + p1399 + p1398 + p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p136... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p106... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p814)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p8 + p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p812)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p1416 + p1415 + p1414 + p1413 + p1412 + p1411 + p1410 + p1409 + p1408 + p1407 + p1406 + p1405 + p1404 + p1403 + p1402 + p1401 + p1400 + p1399 + p1398 + p1397 + p1396 + p1395 + p1394 + p1393 + p1392 + p1391 + p1390 + p1389 + p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p136... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p814)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 13 will run for 1088 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p6 + p5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: ========================================
lola: subprocess 15 will run for 3266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p812)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3256 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: RESULT
lola:
SUMMARY: 1 1 1 unknown 1 1 1 1 1 1 1 1 1 1 2 1
lola: ========================================
FORMULA AirplaneLD-COL-0200-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AirplaneLD-COL-0200-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496331297967

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_AirplaneLD-COL-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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/S_AirplaneLD-COL-0200.tgz
mv S_AirplaneLD-COL-0200 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_AirplaneLD-COL-0200, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-149441073900011"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;