About the Execution of LoLA for ShieldRVt-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16224.628 | 104414.00 | 98411.00 | 5902.40 | ??????TT?TTT??TT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r422-tajo-167905975800338.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lola
Input is ShieldRVt-PT-100A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r422-tajo-167905975800338
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 02:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 273K Mar 5 18:23 model.pnml
--------------------
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 ShieldRVt-PT-100A-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-100A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679219730565
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lola
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100A
Not applying reductions.
Model is PT
CTLFireability PT
starting LoLA
BK_INPUT ShieldRVt-PT-100A
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../lola/bin/
current directory: /home/mcc/execution
CTLFireability
spx_run: Lost feasibility 10 times - iter 668 and 1 nodes.
spx_run: Lost feasibility 10 times - iter 49627 and 983 nodes.
spx_run: Lost feasibility 10 times - iter 49652 and 985 nodes.
spx_run: Lost feasibility 10 times - iter 49678 and 987 nodes.
spx_run: Lost feasibility 10 times - iter 49821 and 997 nodes.
spx_run: Lost feasibility 10 times - iter 52674 and 1337 nodes.
spx_run: Lost feasibility 10 times - iter 52677 and 1339 nodes.
spx_run: Lost feasibility 10 times - iter 52680 and 1341 nodes.
spx_run: Lost feasibility 10 times - iter 52685 and 1343 nodes.
spx_run: Lost feasibility 10 times - iter 14251 and 298 nodes.
spx_run: Lost feasibility 10 times - iter 14956 and 304 nodes.
spx_run: Lost feasibility 10 times - iter 38408 and 841 nodes.
spx_run: Lost feasibility 10 times - iter 38430 and 843 nodes.
spx_run: Lost feasibility 10 times - iter 38451 and 845 nodes.
spx_run: Lost feasibility 10 times - iter 38476 and 847 nodes.
spx_run: Lost feasibility 10 times - iter 38507 and 849 nodes.
spx_run: Lost feasibility 10 times - iter 38538 and 851 nodes.
spx_run: Lost feasibility 10 times - iter 38571 and 853 nodes.
spx_run: Lost feasibility 10 times - iter 38607 and 855 nodes.
spx_run: Lost feasibility 10 times - iter 38668 and 857 nodes.
spx_run: Lost feasibility 10 times - iter 38722 and 861 nodes.
spx_run: Lost feasibility 10 times - iter 38775 and 863 nodes.
spx_run: Lost feasibility 10 times - iter 38825 and 865 nodes.
spx_run: Lost feasibility 10 times - iter 38985 and 871 nodes.
spx_run: Lost feasibility 10 times - iter 39028 and 873 nodes.
spx_run: Lost feasibility 10 times - iter 39064 and 875 nodes.
spx_run: Lost feasibility 10 times - iter 39101 and 877 nodes.
spx_run: Lost feasibility 10 times - iter 39137 and 879 nodes.
spx_run: Lost feasibility 10 times - iter 39174 and 881 nodes.
spx_run: Lost feasibility 10 times - iter 39211 and 883 nodes.
spx_run: Lost feasibility 10 times - iter 39247 and 885 nodes.
spx_run: Lost feasibility 10 times - iter 39285 and 887 nodes.
spx_run: Lost feasibility 10 times - iter 39332 and 889 nodes.
spx_run: Lost feasibility 10 times - iter 39373 and 891 nodes.
spx_run: Lost feasibility 10 times - iter 39416 and 893 nodes.
spx_run: Lost feasibility 10 times - iter 39457 and 895 nodes.
spx_run: Lost feasibility 10 times - iter 39595 and 899 nodes.
spx_run: Lost feasibility 10 times - iter 39794 and 908 nodes.
spx_run: Lost feasibility 10 times - iter 39831 and 910 nodes.
spx_run: Lost feasibility 10 times - iter 39867 and 912 nodes.
spx_run: Lost feasibility 10 times - iter 39902 and 914 nodes.
spx_run: Lost feasibility 10 times - iter 39938 and 916 nodes.
spx_run: Lost feasibility 10 times - iter 39974 and 918 nodes.
spx_run: Lost feasibility 10 times - iter 40010 and 920 nodes.
spx_run: Lost feasibility 10 times - iter 40046 and 922 nodes.
spx_run: Lost feasibility 10 times - iter 40082 and 924 nodes.
spx_run: Lost feasibility 10 times - iter 40118 and 926 nodes.
spx_run: Lost feasibility 10 times - iter 40153 and 928 nodes.
spx_run: Lost feasibility 10 times - iter 40189 and 930 nodes.
spx_run: Lost feasibility 10 times - iter 40224 and 932 nodes.
spx_run: Lost feasibility 10 times - iter 40260 and 934 nodes.
spx_run: Lost feasibility 10 times - iter 40295 and 936 nodes.
spx_run: Lost feasibility 10 times - iter 40330 and 938 nodes.
spx_run: Lost feasibility 10 times - iter 40365 and 940 nodes.
spx_run: Lost feasibility 10 times - iter 40402 and 942 nodes.
spx_run: Lost feasibility 10 times - iter 40437 and 944 nodes.
spx_run: Lost feasibility 10 times - iter 40473 and 946 nodes.
spx_run: Lost feasibility 10 times - iter 40509 and 948 nodes.
spx_run: Lost feasibility 10 times - iter 40545 and 950 nodes.
spx_run: Lost feasibility 10 times - iter 40580 and 952 nodes.
spx_run: Lost feasibility 10 times - iter 40616 and 954 nodes.
spx_run: Lost feasibility 10 times - iter 40651 and 956 nodes.
spx_run: Lost feasibility 10 times - iter 40687 and 958 nodes.
spx_run: Lost feasibility 10 times - iter 40722 and 960 nodes.
spx_run: Lost feasibility 10 times - iter 40757 and 962 nodes.
spx_run: Lost feasibility 10 times - iter 40792 and 964 nodes.
spx_run: Lost feasibility 10 times - iter 40827 and 966 nodes.
spx_run: Lost feasibility 10 times - iter 40862 and 968 nodes.
spx_run: Lost feasibility 10 times - iter 40934 and 972 nodes.
spx_run: Lost feasibility 10 times - iter 40995 and 975 nodes.
spx_run: Lost feasibility 10 times - iter 41048 and 977 nodes.
spx_run: Lost feasibility 10 times - iter 41107 and 979 nodes.
spx_run: Lost feasibility 10 times - iter 41167 and 981 nodes.
spx_run: Lost feasibility 10 times - iter 41229 and 983 nodes.
spx_run: Lost feasibility 10 times - iter 41295 and 985 nodes.
spx_run: Lost feasibility 10 times - iter 41362 and 987 nodes.
spx_run: Lost feasibility 10 times - iter 41428 and 989 nodes.
spx_run: Lost feasibility 10 times - iter 42878 and 1086 nodes.
spx_run: Lost feasibility 10 times - iter 43166 and 1108 nodes.
spx_run: Lost feasibility 10 times - iter 43213 and 1111 nodes.
spx_run: Lost feasibility 10 times - iter 43285 and 1117 nodes.
spx_run: Lost feasibility 10 times - iter 43348 and 1122 nodes.
spx_run: Lost feasibility 10 times - iter 43398 and 1125 nodes.
spx_run: Lost feasibility 10 times - iter 43471 and 1130 nodes.
spx_run: Lost feasibility 10 times - iter 43526 and 1133 nodes.
spx_run: Lost feasibility 10 times - iter 43594 and 1138 nodes.
spx_run: Lost feasibility 10 times - iter 43646 and 1141 nodes.
spx_run: Lost feasibility 10 times - iter 43719 and 1146 nodes.
spx_run: Lost feasibility 10 times - iter 43773 and 1149 nodes.
spx_run: Lost feasibility 10 times - iter 43822 and 1152 nodes.
spx_run: Lost feasibility 10 times - iter 43865 and 1156 nodes.
spx_run: Lost feasibility 10 times - iter 43909 and 1159 nodes.
spx_run: Lost feasibility 10 times - iter 43978 and 1163 nodes.
spx_run: Lost feasibility 10 times - iter 44055 and 1167 nodes.
spx_run: Lost feasibility 10 times - iter 44131 and 1171 nodes.
spx_run: Lost feasibility 10 times - iter 44211 and 1175 nodes.
spx_run: Lost feasibility 10 times - iter 44268 and 1178 nodes.
spx_run: Lost feasibility 10 times - iter 44319 and 1181 nodes.
spx_run: Lost feasibility 10 times - iter 44360 and 1184 nodes.
spx_run: Lost feasibility 10 times - iter 44458 and 1191 nodes.
spx_run: Lost feasibility 10 times - iter 44530 and 1195 nodes.
spx_run: Lost feasibility 10 times - iter 44605 and 1199 nodes.
spx_run: Lost feasibility 10 times - iter 44682 and 1203 nodes.
spx_run: Lost feasibility 10 times - iter 44763 and 1208 nodes.
spx_run: Lost feasibility 10 times - iter 44815 and 1211 nodes.
spx_run: Lost feasibility 10 times - iter 44872 and 1214 nodes.
spx_run: Lost feasibility 10 times - iter 44921 and 1217 nodes.
spx_run: Lost feasibility 10 times - iter 44971 and 1220 nodes.
spx_run: Lost feasibility 10 times - iter 45083 and 1229 nodes.
spx_run: Lost feasibility 10 times - iter 45128 and 1232 nodes.
spx_run: Lost feasibility 10 times - iter 45170 and 1235 nodes.
spx_run: Lost feasibility 10 times - iter 45247 and 1240 nodes.
spx_run: Lost feasibility 10 times - iter 45298 and 1243 nodes.
spx_run: Lost feasibility 10 times - iter 45376 and 1248 nodes.
spx_run: Lost feasibility 10 times - iter 45422 and 1251 nodes.
spx_run: Lost feasibility 10 times - iter 45504 and 1256 nodes.
spx_run: Lost feasibility 10 times - iter 45557 and 1259 nodes.
spx_run: Lost feasibility 10 times - iter 45616 and 1262 nodes.
spx_run: Lost feasibility 10 times - iter 45674 and 1265 nodes.
spx_run: Lost feasibility 10 times - iter 45727 and 1268 nodes.
spx_run: Lost feasibility 10 times - iter 45848 and 1277 nodes.
spx_run: Lost feasibility 10 times - iter 45892 and 1280 nodes.
spx_run: Lost feasibility 10 times - iter 45933 and 1283 nodes.
spx_run: Lost feasibility 10 times - iter 46010 and 1289 nodes.
spx_run: Lost feasibility 10 times - iter 46060 and 1292 nodes.
spx_run: Lost feasibility 10 times - iter 46107 and 1295 nodes.
spx_run: Lost feasibility 10 times - iter 46193 and 1302 nodes.
spx_run: Lost feasibility 10 times - iter 46249 and 1305 nodes.
spx_run: Lost feasibility 10 times - iter 46303 and 1308 nodes.
spx_run: Lost feasibility 10 times - iter 46353 and 1311 nodes.
spx_run: Lost feasibility 10 times - iter 46411 and 1314 nodes.
spx_run: Lost feasibility 10 times - iter 46473 and 1317 nodes.
spx_run: Lost feasibility 10 times - iter 46531 and 1320 nodes.
spx_run: Lost feasibility 10 times - iter 46666 and 1330 nodes.
spx_run: Lost feasibility 10 times - iter 46717 and 1333 nodes.
spx_run: Lost feasibility 10 times - iter 46763 and 1336 nodes.
spx_run: Lost feasibility 10 times - iter 46807 and 1339 nodes.
spx_run: Lost feasibility 10 times - iter 46891 and 1346 nodes.
spx_run: Lost feasibility 10 times - iter 46947 and 1349 nodes.
spx_run: Lost feasibility 10 times - iter 46999 and 1352 nodes.
spx_run: Lost feasibility 10 times - iter 47048 and 1355 nodes.
spx_run: Lost feasibility 10 times - iter 47104 and 1358 nodes.
spx_run: Lost feasibility 10 times - iter 47162 and 1361 nodes.
spx_run: Lost feasibility 10 times - iter 47217 and 1364 nodes.
spx_run: Lost feasibility 10 times - iter 47365 and 1375 nodes.
spx_run: Lost feasibility 10 times - iter 47420 and 1378 nodes.
spx_run: Lost feasibility 10 times - iter 47472 and 1381 nodes.
spx_run: Lost feasibility 10 times - iter 47520 and 1384 nodes.
spx_run: Lost feasibility 10 times - iter 47565 and 1387 nodes.
spx_run: Lost feasibility 10 times - iter 47612 and 1390 nodes.
spx_run: Lost feasibility 10 times - iter 47672 and 1393 nodes.
spx_run: Lost feasibility 10 times - iter 47729 and 1396 nodes.
spx_run: Lost feasibility 10 times - iter 47788 and 1399 nodes.
spx_run: Lost feasibility 10 times - iter 47840 and 1402 nodes.
spx_run: Lost feasibility 10 times - iter 47970 and 1412 nodes.
spx_run: Lost feasibility 10 times - iter 48034 and 1416 nodes.
spx_run: Lost feasibility 10 times - iter 48097 and 1420 nodes.
spx_run: Lost feasibility 10 times - iter 48167 and 1424 nodes.
spx_run: Lost feasibility 10 times - iter 48239 and 1428 nodes.
spx_run: Lost feasibility 10 times - iter 48298 and 1431 nodes.
spx_run: Lost feasibility 10 times - iter 48347 and 1434 nodes.
spx_run: Lost feasibility 10 times - iter 48393 and 1437 nodes.
spx_run: Lost feasibility 10 times - iter 48435 and 1440 nodes.
spx_run: Lost feasibility 10 times - iter 48536 and 1448 nodes.
spx_run: Lost feasibility 10 times - iter 48604 and 1452 nodes.
spx_run: Lost feasibility 10 times - iter 48675 and 1456 nodes.
spx_run: Lost feasibility 10 times - iter 48752 and 1461 nodes.
spx_run: Lost feasibility 10 times - iter 48804 and 1464 nodes.
spx_run: Lost feasibility 10 times - iter 48864 and 1467 nodes.
spx_run: Lost feasibility 10 times - iter 48922 and 1470 nodes.
spx_run: Lost feasibility 10 times - iter 48977 and 1473 nodes.
spx_run: Lost feasibility 10 times - iter 49029 and 1476 nodes.
spx_run: Lost feasibility 10 times - iter 49144 and 1485 nodes.
spx_run: Lost feasibility 10 times - iter 49185 and 1488 nodes.
spx_run: Lost feasibility 10 times - iter 49256 and 1493 nodes.
spx_run: Lost feasibility 10 times - iter 49303 and 1496 nodes.
spx_run: Lost feasibility 10 times - iter 49381 and 1501 nodes.
spx_run: Lost feasibility 10 times - iter 49432 and 1504 nodes.
spx_run: Lost feasibility 10 times - iter 49491 and 1507 nodes.
spx_run: Lost feasibility 10 times - iter 49553 and 1510 nodes.
spx_run: Lost feasibility 10 times - iter 49611 and 1513 nodes.
spx_run: Lost feasibility 10 times - iter 49666 and 1516 nodes.
spx_run: Lost feasibility 10 times - iter 49797 and 1527 nodes.
spx_run: Lost feasibility 10 times - iter 49847 and 1530 nodes.
spx_run: Lost feasibility 10 times - iter 49895 and 1533 nodes.
spx_run: Lost feasibility 10 times - iter 49938 and 1536 nodes.
spx_run: Lost feasibility 10 times - iter 50016 and 1543 nodes.
spx_run: Lost feasibility 10 times - iter 50071 and 1546 nodes.
spx_run: Lost feasibility 10 times - iter 50123 and 1549 nodes.
spx_run: Lost feasibility 10 times - iter 50172 and 1552 nodes.
spx_run: Lost feasibility 10 times - iter 50229 and 1555 nodes.
spx_run: Lost feasibility 10 times - iter 50288 and 1558 nodes.
spx_run: Lost feasibility 10 times - iter 50343 and 1561 nodes.
spx_run: Lost feasibility 10 times - iter 50395 and 1564 nodes.
spx_run: Lost feasibility 10 times - iter 50533 and 1575 nodes.
spx_run: Lost feasibility 10 times - iter 50586 and 1578 nodes.
spx_run: Lost feasibility 10 times - iter 50635 and 1581 nodes.
spx_run: Lost feasibility 10 times - iter 50681 and 1584 nodes.
spx_run: Lost feasibility 10 times - iter 50729 and 1587 nodes.
spx_run: Lost feasibility 10 times - iter 50789 and 1590 nodes.
spx_run: Lost feasibility 10 times - iter 50849 and 1593 nodes.
spx_run: Lost feasibility 10 times - iter 50907 and 1596 nodes.
spx_run: Lost feasibility 10 times - iter 50968 and 1599 nodes.
spx_run: Lost feasibility 10 times - iter 51017 and 1602 nodes.
spx_run: Lost feasibility 10 times - iter 51151 and 1613 nodes.
spx_run: Lost feasibility 10 times - iter 51213 and 1617 nodes.
spx_run: Lost feasibility 10 times - iter 51277 and 1621 nodes.
spx_run: Lost feasibility 10 times - iter 51346 and 1625 nodes.
spx_run: Lost feasibility 10 times - iter 51405 and 1628 nodes.
spx_run: Lost feasibility 10 times - iter 51456 and 1631 nodes.
spx_run: Lost feasibility 10 times - iter 51506 and 1634 nodes.
spx_run: Lost feasibility 10 times - iter 51551 and 1637 nodes.
spx_run: Lost feasibility 10 times - iter 51595 and 1640 nodes.
spx_run: Lost feasibility 10 times - iter 51703 and 1649 nodes.
spx_run: Lost feasibility 10 times - iter 51766 and 1653 nodes.
spx_run: Lost feasibility 10 times - iter 51837 and 1657 nodes.
spx_run: Lost feasibility 10 times - iter 51897 and 1660 nodes.
spx_run: Lost feasibility 10 times - iter 51959 and 1663 nodes.
spx_run: Lost feasibility 10 times - iter 52018 and 1666 nodes.
spx_run: Lost feasibility 10 times - iter 52074 and 1669 nodes.
spx_run: Lost feasibility 10 times - iter 52127 and 1672 nodes.
spx_run: Lost feasibility 10 times - iter 52251 and 1682 nodes.
spx_run: Lost feasibility 10 times - iter 52295 and 1685 nodes.
spx_run: Lost feasibility 10 times - iter 52364 and 1690 nodes.
spx_run: Lost feasibility 10 times - iter 52413 and 1693 nodes.
spx_run: Lost feasibility 10 times - iter 52471 and 1696 nodes.
spx_run: Lost feasibility 10 times - iter 52531 and 1699 nodes.
spx_run: Lost feasibility 10 times - iter 52588 and 1702 nodes.
spx_run: Lost feasibility 10 times - iter 52642 and 1705 nodes.
spx_run: Lost feasibility 10 times - iter 52692 and 1708 nodes.
spx_run: Lost feasibility 10 times - iter 52829 and 1720 nodes.
spx_run: Lost feasibility 10 times - iter 52881 and 1723 nodes.
spx_run: Lost feasibility 10 times - iter 52930 and 1726 nodes.
spx_run: Lost feasibility 10 times - iter 52976 and 1729 nodes.
spx_run: Lost feasibility 10 times - iter 53025 and 1732 nodes.
spx_run: Lost feasibility 10 times - iter 53088 and 1735 nodes.
spx_run: Lost feasibility 10 times - iter 53149 and 1738 nodes.
spx_run: Lost feasibility 10 times - iter 53205 and 1741 nodes.
spx_run: Lost feasibility 10 times - iter 53259 and 1744 nodes.
spx_run: Lost feasibility 10 times - iter 53319 and 1747 nodes.
spx_run: Lost feasibility 10 times - iter 53376 and 1750 nodes.
spx_run: Lost feasibility 10 times - iter 53526 and 1762 nodes.
spx_run: Lost feasibility 10 times - iter 53584 and 1766 nodes.
spx_run: Lost feasibility 10 times - iter 53650 and 1770 nodes.
spx_run: Lost feasibility 10 times - iter 53699 and 1773 nodes.
spx_run: Lost feasibility 10 times - iter 53755 and 1776 nodes.
spx_run: Lost feasibility 10 times - iter 53808 and 1779 nodes.
spx_run: Lost feasibility 10 times - iter 53858 and 1782 nodes.
spx_run: Lost feasibility 10 times - iter 53903 and 1785 nodes.
spx_run: Lost feasibility 10 times - iter 53944 and 1788 nodes.
spx_run: Lost feasibility 10 times - iter 54061 and 1798 nodes.
spx_run: Lost feasibility 10 times - iter 54124 and 1802 nodes.
spx_run: Lost feasibility 10 times - iter 54174 and 1805 nodes.
spx_run: Lost feasibility 10 times - iter 54235 and 1808 nodes.
spx_run: Lost feasibility 10 times - iter 54294 and 1811 nodes.
spx_run: Lost feasibility 10 times - iter 54350 and 1814 nodes.
spx_run: Lost feasibility 10 times - iter 54402 and 1817 nodes.
spx_run: Lost feasibility 10 times - iter 54449 and 1820 nodes.
spx_run: Lost feasibility 10 times - iter 54576 and 1831 nodes.
spx_run: Lost feasibility 10 times - iter 54622 and 1834 nodes.
spx_run: Lost feasibility 10 times - iter 54671 and 1837 nodes.
spx_run: Lost feasibility 10 times - iter 54735 and 1840 nodes.
spx_run: Lost feasibility 10 times - iter 54797 and 1843 nodes.
spx_run: Lost feasibility 10 times - iter 54856 and 1846 nodes.
spx_run: Lost feasibility 10 times - iter 54911 and 1849 nodes.
spx_run: Lost feasibility 10 times - iter 54961 and 1852 nodes.
spx_run: Lost feasibility 10 times - iter 55008 and 1855 nodes.
spx_run: Lost feasibility 10 times - iter 55067 and 1858 nodes.
spx_run: Lost feasibility 10 times - iter 55230 and 1871 nodes.
spx_run: Lost feasibility 10 times - iter 55287 and 1875 nodes.
spx_run: Lost feasibility 10 times - iter 55336 and 1878 nodes.
spx_run: Lost feasibility 10 times - iter 55399 and 1881 nodes.
spx_run: Lost feasibility 10 times - iter 55458 and 1884 nodes.
spx_run: Lost feasibility 10 times - iter 55514 and 1887 nodes.
spx_run: Lost feasibility 10 times - iter 55566 and 1890 nodes.
spx_run: Lost feasibility 10 times - iter 55614 and 1893 nodes.
spx_run: Lost feasibility 10 times - iter 55657 and 1896 nodes.
spx_run: Lost feasibility 10 times - iter 55775 and 1907 nodes.
spx_run: Lost feasibility 10 times - iter 55825 and 1910 nodes.
spx_run: Lost feasibility 10 times - iter 55891 and 1913 nodes.
spx_run: Lost feasibility 10 times - iter 55955 and 1916 nodes.
spx_run: Lost feasibility 10 times - iter 56015 and 1919 nodes.
spx_run: Lost feasibility 10 times - iter 56072 and 1922 nodes.
spx_run: Lost feasibility 10 times - iter 56123 and 1925 nodes.
spx_run: Lost feasibility 10 times - iter 56171 and 1928 nodes.
spx_run: Lost feasibility 10 times - iter 56228 and 1931 nodes.
spx_run: Lost feasibility 10 times - iter 56283 and 1934 nodes.
spx_run: Lost feasibility 10 times - iter 56454 and 1948 nodes.
spx_run: Lost feasibility 10 times - iter 56502 and 1951 nodes.
spx_run: Lost feasibility 10 times - iter 56569 and 1954 nodes.
spx_run: Lost feasibility 10 times - iter 56633 and 1957 nodes.
spx_run: Lost feasibility 10 times - iter 56694 and 1960 nodes.
spx_run: Lost feasibility 10 times - iter 56750 and 1963 nodes.
spx_run: Lost feasibility 10 times - iter 56804 and 1966 nodes.
spx_run: Lost feasibility 10 times - iter 56854 and 1969 nodes.
spx_run: Lost feasibility 10 times - iter 56901 and 1972 nodes.
spx_run: Lost feasibility 10 times - iter 56949 and 1975 nodes.
spx_run: Lost feasibility 10 times - iter 57006 and 1978 nodes.
spx_run: Lost feasibility 10 times - iter 57069 and 1981 nodes.
spx_run: Lost feasibility 10 times - iter 57113 and 1984 nodes.
spx_run: Lost feasibility 10 times - iter 57217 and 1993 nodes.
spx_run: Lost feasibility 10 times - iter 57279 and 1997 nodes.
spx_run: Lost feasibility 10 times - iter 57348 and 2001 nodes.
spx_run: Lost feasibility 10 times - iter 57425 and 2005 nodes.
spx_run: Lost feasibility 10 times - iter 57501 and 2009 nodes.
spx_run: Lost feasibility 10 times - iter 57581 and 2013 nodes.
spx_run: Lost feasibility 10 times - iter 57638 and 2016 nodes.
spx_run: Lost feasibility 10 times - iter 57689 and 2019 nodes.
spx_run: Lost feasibility 10 times - iter 57730 and 2022 nodes.
spx_run: Lost feasibility 10 times - iter 57828 and 2029 nodes.
spx_run: Lost feasibility 10 times - iter 57900 and 2033 nodes.
spx_run: Lost feasibility 10 times - iter 57975 and 2037 nodes.
spx_run: Lost feasibility 10 times - iter 58052 and 2041 nodes.
spx_run: Lost feasibility 10 times - iter 58133 and 2046 nodes.
spx_run: Lost feasibility 10 times - iter 58185 and 2049 nodes.
spx_run: Lost feasibility 10 times - iter 58242 and 2052 nodes.
spx_run: Lost feasibility 10 times - iter 58291 and 2055 nodes.
spx_run: Lost feasibility 10 times - iter 58341 and 2058 nodes.
spx_run: Lost feasibility 10 times - iter 58453 and 2067 nodes.
spx_run: Lost feasibility 10 times - iter 58498 and 2070 nodes.
spx_run: Lost feasibility 10 times - iter 58540 and 2073 nodes.
spx_run: Lost feasibility 10 times - iter 58617 and 2078 nodes.
spx_run: Lost feasibility 10 times - iter 58668 and 2081 nodes.
spx_run: Lost feasibility 10 times - iter 58746 and 2086 nodes.
spx_run: Lost feasibility 10 times - iter 58792 and 2089 nodes.
spx_run: Lost feasibility 10 times - iter 58874 and 2094 nodes.
spx_run: Lost feasibility 10 times - iter 58927 and 2097 nodes.
spx_run: Lost feasibility 10 times - iter 58986 and 2100 nodes.
spx_run: Lost feasibility 10 times - iter 59044 and 2103 nodes.
spx_run: Lost feasibility 10 times - iter 59097 and 2106 nodes.
spx_run: Lost feasibility 10 times - iter 59218 and 2115 nodes.
spx_run: Lost feasibility 10 times - iter 59262 and 2118 nodes.
spx_run: Lost feasibility 10 times - iter 59303 and 2121 nodes.
spx_run: Lost feasibility 10 times - iter 59380 and 2127 nodes.
spx_run: Lost feasibility 10 times - iter 59430 and 2130 nodes.
spx_run: Lost feasibility 10 times - iter 59477 and 2133 nodes.
spx_run: Lost feasibility 10 times - iter 59563 and 2140 nodes.
spx_run: Lost feasibility 10 times - iter 59619 and 2143 nodes.
spx_run: Lost feasibility 10 times - iter 59673 and 2146 nodes.
spx_run: Lost feasibility 10 times - iter 59723 and 2149 nodes.
spx_run: Lost feasibility 10 times - iter 59781 and 2152 nodes.
spx_run: Lost feasibility 10 times - iter 59843 and 2155 nodes.
spx_run: Lost feasibility 10 times - iter 59901 and 2158 nodes.
spx_run: Lost feasibility 10 times - iter 60036 and 2168 nodes.
spx_run: Lost feasibility 10 times - iter 60087 and 2171 nodes.
spx_run: Lost feasibility 10 times - iter 60133 and 2174 nodes.
spx_run: Lost feasibility 10 times - iter 60177 and 2177 nodes.
spx_run: Lost feasibility 10 times - iter 60261 and 2184 nodes.
spx_run: Lost feasibility 10 times - iter 60317 and 2187 nodes.
spx_run: Lost feasibility 10 times - iter 60369 and 2190 nodes.
spx_run: Lost feasibility 10 times - iter 60418 and 2193 nodes.
spx_run: Lost feasibility 10 times - iter 60474 and 2196 nodes.
spx_run: Lost feasibility 10 times - iter 60532 and 2199 nodes.
spx_run: Lost feasibility 10 times - iter 60587 and 2202 nodes.
spx_run: Lost feasibility 10 times - iter 60735 and 2213 nodes.
spx_run: Lost feasibility 10 times - iter 60790 and 2216 nodes.
spx_run: Lost feasibility 10 times - iter 60842 and 2219 nodes.
spx_run: Lost feasibility 10 times - iter 60890 and 2222 nodes.
spx_run: Lost feasibility 10 times - iter 60935 and 2225 nodes.
spx_run: Lost feasibility 10 times - iter 60982 and 2228 nodes.
spx_run: Lost feasibility 10 times - iter 61042 and 2231 nodes.
spx_run: Lost feasibility 10 times - iter 61099 and 2234 nodes.
spx_run: Lost feasibility 10 times - iter 61158 and 2237 nodes.
spx_run: Lost feasibility 10 times - iter 61210 and 2240 nodes.
spx_run: Lost feasibility 10 times - iter 61340 and 2250 nodes.
spx_run: Lost feasibility 10 times - iter 61404 and 2254 nodes.
spx_run: Lost feasibility 10 times - iter 61467 and 2258 nodes.
spx_run: Lost feasibility 10 times - iter 61537 and 2262 nodes.
spx_run: Lost feasibility 10 times - iter 61609 and 2266 nodes.
spx_run: Lost feasibility 10 times - iter 61668 and 2269 nodes.
spx_run: Lost feasibility 10 times - iter 61717 and 2272 nodes.
spx_run: Lost feasibility 10 times - iter 61763 and 2275 nodes.
spx_run: Lost feasibility 10 times - iter 61805 and 2278 nodes.
spx_run: Lost feasibility 10 times - iter 61906 and 2286 nodes.
spx_run: Lost feasibility 10 times - iter 61974 and 2290 nodes.
spx_run: Lost feasibility 10 times - iter 62045 and 2294 nodes.
spx_run: Lost feasibility 10 times - iter 62122 and 2299 nodes.
spx_run: Lost feasibility 10 times - iter 62174 and 2302 nodes.
spx_run: Lost feasibility 10 times - iter 62234 and 2305 nodes.
spx_run: Lost feasibility 10 times - iter 62292 and 2308 nodes.
spx_run: Lost feasibility 10 times - iter 62347 and 2311 nodes.
spx_run: Lost feasibility 10 times - iter 62399 and 2314 nodes.
spx_run: Lost feasibility 10 times - iter 62514 and 2323 nodes.
spx_run: Lost feasibility 10 times - iter 62555 and 2326 nodes.
spx_run: Lost feasibility 10 times - iter 62626 and 2331 nodes.
spx_run: Lost feasibility 10 times - iter 62673 and 2334 nodes.
spx_run: Lost feasibility 10 times - iter 62751 and 2339 nodes.
spx_run: Lost feasibility 10 times - iter 62802 and 2342 nodes.
spx_run: Lost feasibility 10 times - iter 62861 and 2345 nodes.
spx_run: Lost feasibility 10 times - iter 62923 and 2348 nodes.
spx_run: Lost feasibility 10 times - iter 62981 and 2351 nodes.
spx_run: Lost feasibility 10 times - iter 63036 and 2354 nodes.
spx_run: Lost feasibility 10 times - iter 63167 and 2365 nodes.
spx_run: Lost feasibility 10 times - iter 63217 and 2368 nodes.
spx_run: Lost feasibility 10 times - iter 63265 and 2371 nodes.
spx_run: Lost feasibility 10 times - iter 63308 and 2374 nodes.
spx_run: Lost feasibility 10 times - iter 63386 and 2381 nodes.
spx_run: Lost feasibility 10 times - iter 63441 and 2384 nodes.
spx_run: Lost feasibility 10 times - iter 63493 and 2387 nodes.
spx_run: Lost feasibility 10 times - iter 63542 and 2390 nodes.
spx_run: Lost feasibility 10 times - iter 63599 and 2393 nodes.
spx_run: Lost feasibility 10 times - iter 63658 and 2396 nodes.
spx_run: Lost feasibility 10 times - iter 63713 and 2399 nodes.
spx_run: Lost feasibility 10 times - iter 63765 and 2402 nodes.
spx_run: Lost feasibility 10 times - iter 63903 and 2413 nodes.
spx_run: Lost feasibility 10 times - iter 63956 and 2416 nodes.
spx_run: Lost feasibility 10 times - iter 64005 and 2419 nodes.
spx_run: Lost feasibility 10 times - iter 64051 and 2422 nodes.
spx_run: Lost feasibility 10 times - iter 64099 and 2425 nodes.
spx_run: Lost feasibility 10 times - iter 64159 and 2428 nodes.
spx_run: Lost feasibility 10 times - iter 64219 and 2431 nodes.
spx_run: Lost feasibility 10 times - iter 64277 and 2434 nodes.
spx_run: Lost feasibility 10 times - iter 64338 and 2437 nodes.
spx_run: Lost feasibility 10 times - iter 64387 and 2440 nodes.
spx_run: Lost feasibility 10 times - iter 64521 and 2451 nodes.
spx_run: Lost feasibility 10 times - iter 64583 and 2455 nodes.
spx_run: Lost feasibility 10 times - iter 64647 and 2459 nodes.
spx_run: Lost feasibility 10 times - iter 64716 and 2463 nodes.
spx_run: Lost feasibility 10 times - iter 64775 and 2466 nodes.
spx_run: Lost feasibility 10 times - iter 64826 and 2469 nodes.
spx_run: Lost feasibility 10 times - iter 64876 and 2472 nodes.
spx_run: Lost feasibility 10 times - iter 64921 and 2475 nodes.
spx_run: Lost feasibility 10 times - iter 64965 and 2478 nodes.
spx_run: Lost feasibility 10 times - iter 65073 and 2487 nodes.
spx_run: Lost feasibility 10 times - iter 65136 and 2491 nodes.
spx_run: Lost feasibility 10 times - iter 65207 and 2495 nodes.
spx_run: Lost feasibility 10 times - iter 65267 and 2498 nodes.
spx_run: Lost feasibility 10 times - iter 65329 and 2501 nodes.
spx_run: Lost feasibility 10 times - iter 65388 and 2504 nodes.
spx_run: Lost feasibility 10 times - iter 65444 and 2507 nodes.
spx_run: Lost feasibility 10 times - iter 65497 and 2510 nodes.
spx_run: Lost feasibility 10 times - iter 65621 and 2520 nodes.
spx_run: Lost feasibility 10 times - iter 65665 and 2523 nodes.
spx_run: Lost feasibility 10 times - iter 65734 and 2528 nodes.
spx_run: Lost feasibility 10 times - iter 65783 and 2531 nodes.
spx_run: Lost feasibility 10 times - iter 65841 and 2534 nodes.
spx_run: Lost feasibility 10 times - iter 65901 and 2537 nodes.
spx_run: Lost feasibility 10 times - iter 65958 and 2540 nodes.
spx_run: Lost feasibility 10 times - iter 66012 and 2543 nodes.
spx_run: Lost feasibility 10 times - iter 66062 and 2546 nodes.
spx_run: Lost feasibility 10 times - iter 66199 and 2558 nodes.
spx_run: Lost feasibility 10 times - iter 66251 and 2561 nodes.
spx_run: Lost feasibility 10 times - iter 66300 and 2564 nodes.
spx_run: Lost feasibility 10 times - iter 66346 and 2567 nodes.
spx_run: Lost feasibility 10 times - iter 66395 and 2570 nodes.
spx_run: Lost feasibility 10 times - iter 66458 and 2573 nodes.
spx_run: Lost feasibility 10 times - iter 66519 and 2576 nodes.
spx_run: Lost feasibility 10 times - iter 66575 and 2579 nodes.
spx_run: Lost feasibility 10 times - iter 66629 and 2582 nodes.
spx_run: Lost feasibility 10 times - iter 66689 and 2585 nodes.
spx_run: Lost feasibility 10 times - iter 66746 and 2588 nodes.
spx_run: Lost feasibility 10 times - iter 66896 and 2600 nodes.
spx_run: Lost feasibility 10 times - iter 66954 and 2604 nodes.
spx_run: Lost feasibility 10 times - iter 67020 and 2608 nodes.
spx_run: Lost feasibility 10 times - iter 67069 and 2611 nodes.
spx_run: Lost feasibility 10 times - iter 67125 and 2614 nodes.
spx_run: Lost feasibility 10 times - iter 67178 and 2617 nodes.
spx_run: Lost feasibility 10 times - iter 67228 and 2620 nodes.
spx_run: Lost feasibility 10 times - iter 67273 and 2623 nodes.
spx_run: Lost feasibility 10 times - iter 67314 and 2626 nodes.
spx_run: Lost feasibility 10 times - iter 67431 and 2636 nodes.
spx_run: Lost feasibility 10 times - iter 67494 and 2640 nodes.
spx_run: Lost feasibility 10 times - iter 67544 and 2643 nodes.
spx_run: Lost feasibility 10 times - iter 67605 and 2646 nodes.
spx_run: Lost feasibility 10 times - iter 67664 and 2649 nodes.
spx_run: Lost feasibility 10 times - iter 67720 and 2652 nodes.
spx_run: Lost feasibility 10 times - iter 67772 and 2655 nodes.
spx_run: Lost feasibility 10 times - iter 67819 and 2658 nodes.
spx_run: Lost feasibility 10 times - iter 67946 and 2669 nodes.
spx_run: Lost feasibility 10 times - iter 67992 and 2672 nodes.
spx_run: Lost feasibility 10 times - iter 68041 and 2675 nodes.
spx_run: Lost feasibility 10 times - iter 68105 and 2678 nodes.
spx_run: Lost feasibility 10 times - iter 68167 and 2681 nodes.
spx_run: Lost feasibility 10 times - iter 68226 and 2684 nodes.
spx_run: Lost feasibility 10 times - iter 68281 and 2687 nodes.
spx_run: Lost feasibility 10 times - iter 68331 and 2690 nodes.
spx_run: Lost feasibility 10 times - iter 68378 and 2693 nodes.
spx_run: Lost feasibility 10 times - iter 68437 and 2696 nodes.
spx_run: Lost feasibility 10 times - iter 68600 and 2709 nodes.
spx_run: Lost feasibility 10 times - iter 68657 and 2713 nodes.
spx_run: Lost feasibility 10 times - iter 68706 and 2716 nodes.
spx_run: Lost feasibility 10 times - iter 68769 and 2719 nodes.
spx_run: Lost feasibility 10 times - iter 68828 and 2722 nodes.
spx_run: Lost feasibility 10 times - iter 68884 and 2725 nodes.
spx_run: Lost feasibility 10 times - iter 68936 and 2728 nodes.
spx_run: Lost feasibility 10 times - iter 68984 and 2731 nodes.
spx_run: Lost feasibility 10 times - iter 69027 and 2734 nodes.
spx_run: Lost feasibility 10 times - iter 69145 and 2745 nodes.
spx_run: Lost feasibility 10 times - iter 69195 and 2748 nodes.
spx_run: Lost feasibility 10 times - iter 69261 and 2751 nodes.
spx_run: Lost feasibility 10 times - iter 69325 and 2754 nodes.
spx_run: Lost feasibility 10 times - iter 69385 and 2757 nodes.
spx_run: Lost feasibility 10 times - iter 69442 and 2760 nodes.
spx_run: Lost feasibility 10 times - iter 69493 and 2763 nodes.
spx_run: Lost feasibility 10 times - iter 69541 and 2766 nodes.
spx_run: Lost feasibility 10 times - iter 69598 and 2769 nodes.
spx_run: Lost feasibility 10 times - iter 69653 and 2772 nodes.
spx_run: Lost feasibility 10 times - iter 69824 and 2786 nodes.
spx_run: Lost feasibility 10 times - iter 69872 and 2789 nodes.
spx_run: Lost feasibility 10 times - iter 69939 and 2792 nodes.
spx_run: Lost feasibility 10 times - iter 70003 and 2795 nodes.
spx_run: Lost feasibility 10 times - iter 70064 and 2798 nodes.
spx_run: Lost feasibility 10 times - iter 70120 and 2801 nodes.
spx_run: Lost feasibility 10 times - iter 70174 and 2804 nodes.
spx_run: Lost feasibility 10 times - iter 70224 and 2807 nodes.
spx_run: Lost feasibility 10 times - iter 70271 and 2810 nodes.
spx_run: Lost feasibility 10 times - iter 70319 and 2813 nodes.
spx_run: Lost feasibility 10 times - iter 70376 and 2816 nodes.
spx_run: Lost feasibility 10 times - iter 70439 and 2819 nodes.
spx_run: Lost feasibility 10 times - iter 70483 and 2822 nodes.
spx_run: Lost feasibility 10 times - iter 70587 and 2831 nodes.
spx_run: Lost feasibility 10 times - iter 70649 and 2835 nodes.
spx_run: Lost feasibility 10 times - iter 70718 and 2839 nodes.
spx_run: Lost feasibility 10 times - iter 70795 and 2843 nodes.
spx_run: Lost feasibility 10 times - iter 70871 and 2847 nodes.
spx_run: Lost feasibility 10 times - iter 70951 and 2851 nodes.
spx_run: Lost feasibility 10 times - iter 71008 and 2854 nodes.
spx_run: Lost feasibility 10 times - iter 71059 and 2857 nodes.
spx_run: Lost feasibility 10 times - iter 71100 and 2860 nodes.
spx_run: Lost feasibility 10 times - iter 71198 and 2867 nodes.
spx_run: Lost feasibility 10 times - iter 71270 and 2871 nodes.
spx_run: Lost feasibility 10 times - iter 71345 and 2875 nodes.
spx_run: Lost feasibility 10 times - iter 71422 and 2879 nodes.
spx_run: Lost feasibility 10 times - iter 71503 and 2884 nodes.
spx_run: Lost feasibility 10 times - iter 71555 and 2887 nodes.
spx_run: Lost feasibility 10 times - iter 71612 and 2890 nodes.
spx_run: Lost feasibility 10 times - iter 71661 and 2893 nodes.
spx_run: Lost feasibility 10 times - iter 71711 and 2896 nodes.
spx_run: Lost feasibility 10 times - iter 71823 and 2905 nodes.
spx_run: Lost feasibility 10 times - iter 71868 and 2908 nodes.
spx_run: Lost feasibility 10 times - iter 71910 and 2911 nodes.
spx_run: Lost feasibility 10 times - iter 71987 and 2916 nodes.
spx_run: Lost feasibility 10 times - iter 72038 and 2919 nodes.
spx_run: Lost feasibility 10 times - iter 72116 and 2924 nodes.
spx_run: Lost feasibility 10 times - iter 72162 and 2927 nodes.
spx_run: Lost feasibility 10 times - iter 72244 and 2932 nodes.
spx_run: Lost feasibility 10 times - iter 72297 and 2935 nodes.
spx_run: Lost feasibility 10 times - iter 72356 and 2938 nodes.
spx_run: Lost feasibility 10 times - iter 72414 and 2941 nodes.
spx_run: Lost feasibility 10 times - iter 72467 and 2944 nodes.
spx_run: Lost feasibility 10 times - iter 72588 and 2953 nodes.
spx_run: Lost feasibility 10 times - iter 72632 and 2956 nodes.
spx_run: Lost feasibility 10 times - iter 72673 and 2959 nodes.
spx_run: Lost feasibility 10 times - iter 72750 and 2965 nodes.
spx_run: Lost feasibility 10 times - iter 72800 and 2968 nodes.
spx_run: Lost feasibility 10 times - iter 72847 and 2971 nodes.
spx_run: Lost feasibility 10 times - iter 72933 and 2978 nodes.
spx_run: Lost feasibility 10 times - iter 72989 and 2981 nodes.
spx_run: Lost feasibility 10 times - iter 73043 and 2984 nodes.
spx_run: Lost feasibility 10 times - iter 73093 and 2987 nodes.
spx_run: Lost feasibility 10 times - iter 73151 and 2990 nodes.
spx_run: Lost feasibility 10 times - iter 73213 and 2993 nodes.
spx_run: Lost feasibility 10 times - iter 73271 and 2996 nodes.
spx_run: Lost feasibility 10 times - iter 73406 and 3006 nodes.
spx_run: Lost feasibility 10 times - iter 73457 and 3009 nodes.
spx_run: Lost feasibility 10 times - iter 73503 and 3012 nodes.
spx_run: Lost feasibility 10 times - iter 73547 and 3015 nodes.
spx_run: Lost feasibility 10 times - iter 73631 and 3022 nodes.
spx_run: Lost feasibility 10 times - iter 73687 and 3025 nodes.
spx_run: Lost feasibility 10 times - iter 73739 and 3028 nodes.
spx_run: Lost feasibility 10 times - iter 73788 and 3031 nodes.
spx_run: Lost feasibility 10 times - iter 73844 and 3034 nodes.
spx_run: Lost feasibility 10 times - iter 73902 and 3037 nodes.
spx_run: Lost feasibility 10 times - iter 73957 and 3040 nodes.
spx_run: Lost feasibility 10 times - iter 74105 and 3051 nodes.
spx_run: Lost feasibility 10 times - iter 74160 and 3054 nodes.
spx_run: Lost feasibility 10 times - iter 9180 and 267 nodes.
spx_run: Lost feasibility 10 times - iter 28139 and 1026 nodes.
spx_run: Lost feasibility 10 times - iter 28140 and 1027 nodes.
spx_run: Lost feasibility 10 times - iter 39049 and 1136 nodes.
spx_run: Lost feasibility 10 times - iter 39068 and 1138 nodes.
spx_run: Lost feasibility 10 times - iter 39258 and 1195 nodes.
spx_run: Lost feasibility 10 times - iter 40521 and 1363 nodes.
spx_run: Lost feasibility 10 times - iter 40532 and 1365 nodes.
spx_run: Lost feasibility 10 times - iter 40544 and 1367 nodes.
spx_run: Lost feasibility 10 times - iter 40555 and 1369 nodes.
spx_run: Lost feasibility 10 times - iter 40566 and 1371 nodes.
spx_run: Lost feasibility 10 times - iter 40579 and 1373 nodes.
spx_run: Lost feasibility 10 times - iter 40597 and 1375 nodes.
spx_run: Lost feasibility 10 times - iter 40612 and 1377 nodes.
spx_run: Lost feasibility 10 times - iter 40627 and 1379 nodes.
spx_run: Lost feasibility 10 times - iter 40642 and 1381 nodes.
spx_run: Lost feasibility 10 times - iter 40657 and 1383 nodes.
spx_run: Lost feasibility 10 times - iter 40672 and 1385 nodes.
spx_run: Lost feasibility 10 times - iter 40687 and 1387 nodes.
spx_run: Lost feasibility 10 times - iter 40702 and 1389 nodes.
spx_run: Lost feasibility 10 times - iter 40717 and 1391 nodes.
spx_run: Lost feasibility 10 times - iter 40732 and 1393 nodes.
spx_run: Lost feasibility 10 times - iter 40747 and 1395 nodes.
spx_run: Lost feasibility 10 times - iter 40762 and 1397 nodes.
spx_run: Lost feasibility 10 times - iter 40777 and 1399 nodes.
spx_run: Lost feasibility 10 times - iter 40792 and 1401 nodes.
spx_run: Lost feasibility 10 times - iter 40807 and 1403 nodes.
spx_run: Lost feasibility 10 times - iter 40822 and 1405 nodes.
spx_run: Lost feasibility 10 times - iter 40841 and 1407 nodes.
spx_run: Lost feasibility 10 times - iter 40897 and 1414 nodes.
spx_run: Lost feasibility 10 times - iter 40919 and 1417 nodes.
spx_run: Lost feasibility 10 times - iter 41055 and 1444 nodes.
spx_run: Lost feasibility 10 times - iter 41073 and 1446 nodes.
spx_run: Lost feasibility 10 times - iter 41097 and 1449 nodes.
spx_run: Lost feasibility 10 times - iter 41119 and 1451 nodes.
spx_run: Lost feasibility 10 times - iter 41139 and 1453 nodes.
spx_run: Lost feasibility 10 times - iter 41160 and 1455 nodes.
spx_run: Lost feasibility 10 times - iter 41186 and 1457 nodes.
spx_run: Lost feasibility 10 times - iter 41225 and 1468 nodes.
spx_run: Lost feasibility 10 times - iter 41258 and 1474 nodes.
spx_run: Lost feasibility 10 times - iter 41262 and 1475 nodes.
spx_run: Lost feasibility 10 times - iter 41286 and 1477 nodes.
spx_run: Lost feasibility 10 times - iter 41296 and 1479 nodes.
spx_run: Lost feasibility 10 times - iter 18225 and 349 nodes.
FORMULA ShieldRVt-PT-100A-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-100A-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-100A-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-100A-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-100A-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-100A-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-100A-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679219834979
--------------------
content from stderr:
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:472
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:451
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:469
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:469
lola: rewrite Frontend/Parser/formula_rewrite.k:454
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:394
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:547
lola: rewrite Frontend/Parser/formula_rewrite.k:445
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: LAUNCH task # 29 (type EXCL) for 28 ShieldRVt-PT-100A-CTLFireability-08
lola: time limit : 210 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 58 (type FNDP) for 31 ShieldRVt-PT-100A-CTLFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type EQUN) for 31 ShieldRVt-PT-100A-CTLFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 68 (type SRCH) for 31 ShieldRVt-PT-100A-CTLFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
sara: try reading problem file /home/mcc/execution/CTLFireability-63.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 68 (type SRCH) for ShieldRVt-PT-100A-CTLFireability-09
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 58 (type FNDP) for ShieldRVt-PT-100A-CTLFireability-09
lola: result : true
lola: fired transitions : 2344
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 63 (type EQUN) for ShieldRVt-PT-100A-CTLFireability-09 (obsolete)
lola: LAUNCH task # 52 (type FNDP) for 46 ShieldRVt-PT-100A-CTLFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type FNDP) for 49 ShieldRVt-PT-100A-CTLFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 55 (type FNDP) for 34 ShieldRVt-PT-100A-CTLFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 63 (type EQUN) for ShieldRVt-PT-100A-CTLFireability-09
lola: result : unknown
lola: FINISHED task # 54 (type FNDP) for ShieldRVt-PT-100A-CTLFireability-15
lola: result : true
lola: fired transitions : 82
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 56 (type FNDP) for 25 ShieldRVt-PT-100A-CTLFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 55 (type FNDP) for ShieldRVt-PT-100A-CTLFireability-10
lola: result : true
lola: fired transitions : 41
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 59 (type EQUN) for 46 ShieldRVt-PT-100A-CTLFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/CTLFireability-59.sara.
lola: FINISHED task # 56 (type FNDP) for ShieldRVt-PT-100A-CTLFireability-07
lola: result : true
lola: fired transitions : 1376
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 69 (type SRCH) for 46 ShieldRVt-PT-100A-CTLFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 52 (type FNDP) for ShieldRVt-PT-100A-CTLFireability-14
lola: result : true
lola: fired transitions : 7860
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 59 (type EQUN) for ShieldRVt-PT-100A-CTLFireability-14 (obsolete)
lola: CANCELED task # 69 (type SRCH) for ShieldRVt-PT-100A-CTLFireability-14 (obsolete)
lola: FINISHED task # 59 (type EQUN) for ShieldRVt-PT-100A-CTLFireability-14
lola: result : unknown
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
29 CTL EXCL 4/297 10/32 ShieldRVt-PT-100A-CTLFireability-08 1139537 m, 227907 m/sec, 1140534 t fired, .
Time elapsed: 29 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
29 CTL EXCL 9/297 21/32 ShieldRVt-PT-100A-CTLFireability-08 2544366 m, 280965 m/sec, 2545364 t fired, .
Time elapsed: 34 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
29 CTL EXCL 14/297 32/32 ShieldRVt-PT-100A-CTLFireability-08 3957675 m, 282661 m/sec, 3958672 t fired, .
Time elapsed: 39 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
lola: CANCELED task # 29 (type EXCL) for ShieldRVt-PT-100A-CTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 44 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
lola: LAUNCH task # 38 (type EXCL) for 37 ShieldRVt-PT-100A-CTLFireability-11
lola: time limit : 323 sec
lola: memory limit: 32 pages
lola: FINISHED task # 38 (type EXCL) for ShieldRVt-PT-100A-CTLFireability-11
lola: result : true
lola: markings : 300
lola: fired transitions : 299
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 23 (type EXCL) for 22 ShieldRVt-PT-100A-CTLFireability-06
lola: time limit : 355 sec
lola: memory limit: 32 pages
lola: FINISHED task # 23 (type EXCL) for ShieldRVt-PT-100A-CTLFireability-06
lola: result : true
lola: markings : 328
lola: fired transitions : 423
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 20 (type EXCL) for 19 ShieldRVt-PT-100A-CTLFireability-05
lola: time limit : 395 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 CTL EXCL 5/395 12/32 ShieldRVt-PT-100A-CTLFireability-05 1729570 m, 345914 m/sec, 1739974 t fired, .
Time elapsed: 49 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 CTL EXCL 10/395 24/32 ShieldRVt-PT-100A-CTLFireability-05 3442240 m, 342534 m/sec, 3452644 t fired, .
Time elapsed: 54 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
lola: CANCELED task # 20 (type EXCL) for ShieldRVt-PT-100A-CTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 59 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
lola: LAUNCH task # 17 (type EXCL) for 16 ShieldRVt-PT-100A-CTLFireability-04
lola: time limit : 442 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 CTL EXCL 5/442 11/32 ShieldRVt-PT-100A-CTLFireability-04 1288975 m, 257795 m/sec, 1289572 t fired, .
Time elapsed: 64 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 CTL EXCL 10/442 21/32 ShieldRVt-PT-100A-CTLFireability-04 2561727 m, 254550 m/sec, 2562323 t fired, .
Time elapsed: 69 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 CTL EXCL 15/442 31/32 ShieldRVt-PT-100A-CTLFireability-04 3820446 m, 251743 m/sec, 3821043 t fired, .
Time elapsed: 74 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
lola: CANCELED task # 17 (type EXCL) for ShieldRVt-PT-100A-CTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 79 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
lola: LAUNCH task # 14 (type EXCL) for 13 ShieldRVt-PT-100A-CTLFireability-03
lola: time limit : 503 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 CTL EXCL 5/503 5/32 ShieldRVt-PT-100A-CTLFireability-03 536626 m, 107325 m/sec, 538045 t fired, .
Time elapsed: 84 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 CTL EXCL 11/503 10/32 ShieldRVt-PT-100A-CTLFireability-03 1217744 m, 136223 m/sec, 1219163 t fired, .
Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 CTL EXCL 16/503 14/32 ShieldRVt-PT-100A-CTLFireability-03 1731746 m, 102800 m/sec, 1733166 t fired, .
Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-100A-CTLFireability-06: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-07: EF true findpath
ShieldRVt-PT-100A-CTLFireability-09: EF true findpath
ShieldRVt-PT-100A-CTLFireability-10: EF true findpath
ShieldRVt-PT-100A-CTLFireability-11: CTL true CTL model checker
ShieldRVt-PT-100A-CTLFireability-14: EF true findpath
ShieldRVt-PT-100A-CTLFireability-15: EF true findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-100A-CTLFireability-00: CONJ 0 2 0 0 2 0 0 0
ShieldRVt-PT-100A-CTLFireability-01: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-03: CTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-04: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-05: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-100A-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-100A-CTLFireability-13: EFAG 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 CTL EXCL 22/503 20/32 ShieldRVt-PT-100A-CTLFireability-03 2413103 m, 136271 m/sec, 2414523 t fired, .
Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 16
/home/mcc/BenchKit/bin//../lola/bin//../BenchKit_head.sh: line 63: 377 Killed lola --conf=$BIN_DIR/configfiles/ctlfireabilityconf --formula=$DIR/CTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml
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="ShieldRVt-PT-100A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lola"
echo " Input is ShieldRVt-PT-100A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r422-tajo-167905975800338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100A.tgz
mv ShieldRVt-PT-100A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;