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 PolyORBNT-COL-S10J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926100075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494694062785


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-COL-S10J60 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 14274/65536 symbol table entries, 4496 collisions
lola: preprocessing...
lola: finding significant places
lola: 1294 places, 12980 transitions, 1142 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3558 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J60-CTLCardinality.task
lola: A (G (((p86 <= p781) OR (2 <= p1214 + p1215 + p1216 + 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) OR ((3 <= p83) AND (2 <= p966 + p965 + p964 + p963 + p962 + p961 + p960 + p959 + p958 + p957 + p956 + p955 + p954 + p953 + p952 + p951 + p950 + p949 + p948 + p947 + p946 + p945 + p944 + p943 + p942 + p941 + p940 + p939 + p938 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937)) OR (p782 + 1 <= p1) OR ((2 <= 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) AND (1 <= p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771))))) : A (G ((A (F ((3 <= p17))) AND E (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p1276)))))) : E ((((1 <= p160) AND ((1 <= p160) OR (1 <= p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p998 + p997 + p996 + p995 + p989 + p988 + p987 + p986 + p985 + p979 + p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p969 + p968 + p967 + p980 + p981 + p982 + p983 + p984 + p990 + p991 + p992 + p993 + p994 + p999))) U A (G ((p1287 <= p149))))) : NOT(E (G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p17)))) : A (G ((p782 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) : A (G ((((3 <= p85) AND (1 <= p1152)) OR (p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p998 + p997 + p996 + p995 + p989 + p988 + p987 + p986 + p985 + p979 + p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p969 + p968 + p967 + p980 + p981 + p982 + p983 + p984 + p990 + p991 + p992 + p993 + p994 + p999 <= 1) OR (p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771 <= p149)))) : NOT(E (G (A (F ((p21 <= p15)))))) : E ((E (F ((p3 <= p1293))) U (p19 + 1 <= p4))) : E (F (E (X (((2 <= p781) AND (1 <= p0)))))) : A ((((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 <= p1277 + p1278 + p1279 + p1280 + p1281 + p1282 + p1283 + p1284 + p1285 + p1286) OR (2 <= p1275) OR (2 <= p1028) OR (1 <= p84)) U (((2 <= p2) AND (2 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)) OR (p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p862 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p900 + p901 + p902 + p903 + p904 + 1 <= p21)))) : E ((((p1288 + 1 <= p16) OR (p1291 + 1 <= p86)) U A (G ((p905 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : NOT((NOT(E (F ((1 <= p85)))) OR (p905 + 1 <= 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))) : A (G (E (X ((p85 <= 1))))) : A (G ((3 <= p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771))) : (E (G (A (F ((p3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))) AND A (F ((p1288 + 1 <= p18)))) : (((A (G ((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 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p1276)) AND (p19 <= p86)) AND E (X (((2 <= p4) OR (p1152 <= p83) OR (1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p86 <= p781) OR (2 <= p1214 + p1215 + p1216 + 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 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((3 <= p17))) AND E (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p87 + p88 + p89 + p90 + p91... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= p17)))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p160) AND ((1 <= p160) OR (1 <= p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p998 + p997 + p996 + p995 + p989 + p988 + p987 + p986 + p985 + p979 + p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= p160) AND ((1 <= p160) OR (1 <= p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p998 + p997 + p996 + p995 + p989 + p988 + p987 + p986 + p985 + p979 + p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p... (shortened)
lola: processed formula length: 535
lola: 3 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 274019 markings, 491725 edges, 2980369753354272768 markings/sec, 0 secs
lola: 486174 markings, 904298 edges, 42431 markings/sec, 5 secs
lola: 704453 markings, 1348463 edges, 43656 markings/sec, 10 secs
lola: 936258 markings, 1756998 edges, 46361 markings/sec, 15 secs
lola: 1140620 markings, 2202172 edges, 40872 markings/sec, 20 secs
lola: 1374485 markings, 2640702 edges, 46773 markings/sec, 25 secs
lola: 1582575 markings, 3035839 edges, 41618 markings/sec, 30 secs
lola: 1795942 markings, 3469167 edges, 42673 markings/sec, 35 secs
lola: 2022406 markings, 3870482 edges, 45293 markings/sec, 40 secs
lola: 2219633 markings, 4305299 edges, 39445 markings/sec, 45 secs
lola: 2464390 markings, 4712535 edges, 48951 markings/sec, 50 secs
lola: 2651972 markings, 5123669 edges, 37516 markings/sec, 55 secs
lola: 2868187 markings, 5548563 edges, 43243 markings/sec, 60 secs
lola: 3080628 markings, 5937082 edges, 42488 markings/sec, 65 secs
lola: 3281904 markings, 6364784 edges, 40255 markings/sec, 70 secs
lola: 3511033 markings, 6757811 edges, 45826 markings/sec, 75 secs
lola: 3697372 markings, 7172483 edges, 37268 markings/sec, 80 secs
lola: 3926431 markings, 7598009 edges, 45812 markings/sec, 85 secs
lola: 4118506 markings, 7972648 edges, 38415 markings/sec, 90 secs
lola: 4329003 markings, 8388395 edges, 42099 markings/sec, 95 secs
lola: 4534943 markings, 8765980 edges, 41188 markings/sec, 100 secs
lola: 4731997 markings, 9180843 edges, 39411 markings/sec, 105 secs
lola: 4950330 markings, 9561398 edges, 43667 markings/sec, 110 secs
lola: 5135067 markings, 9974914 edges, 36947 markings/sec, 115 secs
lola: 5366342 markings, 10357612 edges, 46255 markings/sec, 120 secs
lola: 5541162 markings, 10750840 edges, 34964 markings/sec, 125 secs
lola: 5759223 markings, 11164784 edges, 43612 markings/sec, 130 secs
lola: 5947910 markings, 11527983 edges, 37737 markings/sec, 135 secs
lola: 6153173 markings, 11934419 edges, 41053 markings/sec, 140 secs
lola: 6354204 markings, 12304278 edges, 40206 markings/sec, 145 secs
lola: 6548620 markings, 12709697 edges, 38883 markings/sec, 150 secs
lola: 6759967 markings, 13083074 edges, 42269 markings/sec, 155 secs
lola: 6943009 markings, 13495557 edges, 36608 markings/sec, 160 secs
lola: 7166364 markings, 13863493 edges, 44671 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p17 + 1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))
lola: processed formula length: 75
lola: 4 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p782 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p85) AND (1 <= p1152)) OR (p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p998 + p997 + p996 + p995 + p989 + p988 + p987 + p986 + p985 + p979 + p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-5.sara.
lola: sara is running 0 secs || 2071 markings, 7479 edges, 414 markings/sec, 0 secs
lola: sara is running 5 secs || 3903 markings, 12131 edges, 366 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((p21 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p21 <= p15))))
lola: processed formula length: 37
lola: 8 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p3 <= p1293))) U (p19 + 1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (p3 <= p1293)) U (p19 + 1 <= p4))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 173571 markings, 595893 edges, 2980369753354272768 markings/sec, 0 secs
lola: 338263 markings, 1165514 edges, 32938 markings/sec, 5 secs
lola: 516568 markings, 1779918 edges, 35661 markings/sec, 10 secs
lola: 648561 markings, 2444272 edges, 26399 markings/sec, 15 secs
lola: 801889 markings, 3074084 edges, 30666 markings/sec, 20 secs
lola: 947803 markings, 3574870 edges, 29183 markings/sec, 25 secs
lola: 1095124 markings, 4084403 edges, 29464 markings/sec, 30 secs
lola: 1261516 markings, 4658278 edges, 33278 markings/sec, 35 secs
lola: 1388517 markings, 5301501 edges, 25400 markings/sec, 40 secs
lola: 1538210 markings, 5922588 edges, 29939 markings/sec, 45 secs
lola: 1683684 markings, 6422164 edges, 29095 markings/sec, 50 secs
lola: 1829079 markings, 6925397 edges, 29079 markings/sec, 55 secs
lola: 1993788 markings, 7492437 edges, 32942 markings/sec, 60 secs
lola: 2114877 markings, 8103590 edges, 24218 markings/sec, 65 secs
lola: 2256286 markings, 8708328 edges, 28282 markings/sec, 70 secs
lola: 2389310 markings, 9166242 edges, 26605 markings/sec, 75 secs
lola: 2531664 markings, 9655726 edges, 28471 markings/sec, 80 secs
lola: 2686309 markings, 10190371 edges, 30929 markings/sec, 85 secs
lola: 2817325 markings, 10808710 edges, 26203 markings/sec, 90 secs
lola: 2963654 markings, 11404228 edges, 29266 markings/sec, 95 secs
lola: 3099822 markings, 11924883 edges, 27234 markings/sec, 100 secs
lola: 3241320 markings, 12411799 edges, 28300 markings/sec, 105 secs
lola: 3390430 markings, 12926695 edges, 29822 markings/sec, 110 secs
lola: 3535481 markings, 13528986 edges, 29010 markings/sec, 115 secs
lola: 3670916 markings, 14128415 edges, 27087 markings/sec, 120 secs
lola: 3813007 markings, 14695178 edges, 28418 markings/sec, 125 secs
lola: 3956229 markings, 15187907 edges, 28644 markings/sec, 130 secs
lola: 4103420 markings, 15695945 edges, 29438 markings/sec, 135 secs
lola: 4266444 markings, 16256849 edges, 32605 markings/sec, 140 secs
lola: 4380343 markings, 16861861 edges, 22780 markings/sec, 145 secs
lola: 4522433 markings, 17451238 edges, 28418 markings/sec, 150 secs
lola: 4664820 markings, 17940815 edges, 28477 markings/sec, 155 secs
lola: 4807884 markings, 18433333 edges, 28613 markings/sec, 160 secs
lola: 4968329 markings, 18987677 edges, 32089 markings/sec, 165 secs
lola: 5088963 markings, 19591169 edges, 24127 markings/sec, 170 secs
lola: 5232756 markings, 20209303 edges, 28759 markings/sec, 175 secs
lola: 5368273 markings, 20676580 edges, 27103 markings/sec, 180 secs
lola: 5509519 markings, 21163834 edges, 28249 markings/sec, 185 secs
lola: 5662127 markings, 21689897 edges, 30522 markings/sec, 190 secs
lola: 5790063 markings, 22291243 edges, 25587 markings/sec, 195 secs
lola: 5931535 markings, 22866702 edges, 28294 markings/sec, 200 secs
lola: 6064475 markings, 23385714 edges, 26588 markings/sec, 205 secs
lola: 6205680 markings, 23871752 edges, 28241 markings/sec, 210 secs
lola: 6351538 markings, 24376940 edges, 29172 markings/sec, 215 secs
lola: 6512428 markings, 24930371 edges, 32178 markings/sec, 220 secs
lola: 6620524 markings, 25516996 edges, 21619 markings/sec, 225 secs
lola: 6759968 markings, 26095246 edges, 27889 markings/sec, 230 secs
lola: 6896835 markings, 26566320 edges, 27373 markings/sec, 235 secs
lola: 7036936 markings, 27049272 edges, 28020 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 387 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X (((2 <= p781) AND (1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(((2 <= p781) AND (1 <= p0))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 116050 markings, 282899 edges, 3225752436249460736 markings/sec, 0 secs
lola: 237568 markings, 580086 edges, 24304 markings/sec, 5 secs
lola: 357938 markings, 875862 edges, 24074 markings/sec, 10 secs
lola: 484317 markings, 1184887 edges, 25276 markings/sec, 15 secs
lola: 581358 markings, 1589636 edges, 19408 markings/sec, 20 secs
lola: 683112 markings, 1902281 edges, 20351 markings/sec, 25 secs
lola: 790753 markings, 2244982 edges, 21528 markings/sec, 30 secs
lola: 901279 markings, 2513777 edges, 22105 markings/sec, 35 secs
lola: 1011043 markings, 2783310 edges, 21953 markings/sec, 40 secs
lola: 1124852 markings, 3061784 edges, 22762 markings/sec, 45 secs
lola: 1245816 markings, 3357868 edges, 24193 markings/sec, 50 secs
lola: 1335996 markings, 3752490 edges, 18036 markings/sec, 55 secs
lola: 1437490 markings, 4064066 edges, 20299 markings/sec, 60 secs
lola: 1542989 markings, 4395219 edges, 21100 markings/sec, 65 secs
lola: 1652717 markings, 4664692 edges, 21946 markings/sec, 70 secs
lola: 1762324 markings, 4933403 edges, 21921 markings/sec, 75 secs
lola: 1876181 markings, 5212029 edges, 22771 markings/sec, 80 secs
lola: 1996814 markings, 5507304 edges, 24127 markings/sec, 85 secs
lola: 2084800 markings, 5897212 edges, 17597 markings/sec, 90 secs
lola: 2186307 markings, 6208800 edges, 20301 markings/sec, 95 secs
lola: 2290668 markings, 6534312 edges, 20872 markings/sec, 100 secs
lola: 2400034 markings, 6803086 edges, 21873 markings/sec, 105 secs
lola: 2511036 markings, 7075108 edges, 22200 markings/sec, 110 secs
lola: 2627056 markings, 7359121 edges, 23204 markings/sec, 115 secs
lola: 2749440 markings, 7658909 edges, 24477 markings/sec, 120 secs
lola: 2837670 markings, 8054155 edges, 17646 markings/sec, 125 secs
lola: 2941797 markings, 8373703 edges, 20825 markings/sec, 130 secs
lola: 3046675 markings, 8696525 edges, 20976 markings/sec, 135 secs
lola: 3158173 markings, 8967278 edges, 22300 markings/sec, 140 secs
lola: 3268979 markings, 9238864 edges, 22161 markings/sec, 145 secs
lola: 3385237 markings, 9525525 edges, 23252 markings/sec, 150 secs
lola: 3507766 markings, 9825322 edges, 24506 markings/sec, 155 secs
lola: 3592308 markings, 10217000 edges, 16908 markings/sec, 160 secs
lola: 3697014 markings, 10538160 edges, 20941 markings/sec, 165 secs
lola: 3800355 markings, 10849640 edges, 20668 markings/sec, 170 secs
lola: 3910468 markings, 11119892 edges, 22023 markings/sec, 175 secs
lola: 4020400 markings, 11389803 edges, 21986 markings/sec, 180 secs
lola: 4136824 markings, 11673415 edges, 23285 markings/sec, 185 secs
lola: 4258663 markings, 11972561 edges, 24368 markings/sec, 190 secs
lola: 4340959 markings, 12361308 edges, 16459 markings/sec, 195 secs
lola: 4445556 markings, 12682193 edges, 20919 markings/sec, 200 secs
lola: 4547644 markings, 12990304 edges, 20418 markings/sec, 205 secs
lola: 4657962 markings, 13258624 edges, 22064 markings/sec, 210 secs
lola: 4767644 markings, 13528023 edges, 21936 markings/sec, 215 secs
lola: 4883773 markings, 13812854 edges, 23226 markings/sec, 220 secs
lola: 5005547 markings, 14110957 edges, 24355 markings/sec, 225 secs
lola: 5086732 markings, 14496656 edges, 16237 markings/sec, 230 secs
lola: 5190899 markings, 14816397 edges, 20833 markings/sec, 235 secs
lola: 5292110 markings, 15120755 edges, 20242 markings/sec, 240 secs
lola: 5401756 markings, 15390059 edges, 21929 markings/sec, 245 secs
lola: 5511160 markings, 15658935 edges, 21881 markings/sec, 250 secs
lola: 5626882 markings, 15941149 edges, 23144 markings/sec, 255 secs
lola: 5748075 markings, 16237685 edges, 24239 markings/sec, 260 secs
lola: 5828866 markings, 16620706 edges, 16158 markings/sec, 265 secs
lola: 5932072 markings, 16937290 edges, 20641 markings/sec, 270 secs
lola: 6032527 markings, 17245517 edges, 20091 markings/sec, 275 secs
lola: 6141687 markings, 17511757 edges, 21832 markings/sec, 280 secs
lola: 6251192 markings, 17778539 edges, 21901 markings/sec, 285 secs
lola: 6365777 markings, 18060138 edges, 22917 markings/sec, 290 secs
lola: 6486410 markings, 18355110 edges, 24127 markings/sec, 295 secs
lola: 6567649 markings, 18734438 edges, 16248 markings/sec, 300 secs
lola: 6669546 markings, 19047440 edges, 20379 markings/sec, 305 secs
lola: 6770564 markings, 19361180 edges, 20204 markings/sec, 310 secs
lola: 6878305 markings, 19624755 edges, 21548 markings/sec, 315 secs
lola: 6987805 markings, 19891383 edges, 21900 markings/sec, 320 secs
lola: 7048488 markings, 20041962 edges, 12137 markings/sec, 325 secs
lola: 7049358 markings, 20044026 edges, 174 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((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 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((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 + p114... (shortened)
lola: processed formula length: 1571
lola: 1 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 10 will run for 460 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p1288 + 1 <= p16) OR (p1291 + 1 <= p86)) U A (G ((p905 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p1288 + 1 <= p16) OR (p1291 + 1 <= p86)) U NOT(E(TRUE U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p8... (shortened)
lola: processed formula length: 489
lola: 3 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (F ((1 <= p85)))) OR (p905 + 1 <= 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 + p11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p85)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-11.sara.
lola: sara is running 0 secs || 5168 markings, 16334 edges, 1034 markings/sec, 0 secs
lola: sara is running 5 secs || 9108 markings, 25566 edges, 788 markings/sec, 5 secs
lola: sara is running 10 secs || 12119 markings, 29124 edges, 602 markings/sec, 10 secs
lola: sara is running 15 secs || 15004 markings, 32577 edges, 577 markings/sec, 15 secs
lola: sara is running 20 secs || 17893 markings, 36052 edges, 578 markings/sec, 20 secs
lola: sara is running 25 secs || 20788 markings, 39774 edges, 579 markings/sec, 25 secs
lola: sara is running 30 secs || 23685 markings, 43259 edges, 579 markings/sec, 30 secs
lola: sara is running 35 secs || 26581 markings, 46741 edges, 579 markings/sec, 35 secs
lola: sara is running 40 secs || 29470 markings, 50217 edges, 578 markings/sec, 40 secs
lola: sara is running 45 secs || 32357 markings, 53937 edges, 577 markings/sec, 45 secs
lola: sara is running 50 secs || 35256 markings, 57426 edges, 580 markings/sec, 50 secs
lola: sara is running 55 secs || 38149 markings, 60906 edges, 579 markings/sec, 55 secs
lola: sara is running 60 secs || 41035 markings, 64382 edges, 577 markings/sec, 60 secs
lola: sara is running 65 secs || 43924 markings, 68108 edges, 578 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 46817 markings, 71592 edges, 579 markings/sec, 70 secs
lola: sara is running 75 secs || 49704 markings, 75071 edges, 577 markings/sec, 75 secs
lola: sara is running 80 secs || 52592 markings, 78799 edges, 578 markings/sec, 80 secs
lola: sara is running 85 secs || 55482 markings, 82283 edges, 578 markings/sec, 85 secs

lola: sara is running 90 secs || 58366 markings, 85761 edges, 577 markings/sec, 90 secs
lola: sara is running 95 secs || 61254 markings, 89493 edges, 578 markings/sec, 95 secs
lola: sara is running 100 secs || 64139 markings, 92973 edges, 577 markings/sec, 100 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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 +... (shortened)
lola: processed formula length: 495
lola: 8 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p85 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p85 <= 1)))))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p780 + p779 + p778 + p777 + p776 + p775 + p774 + p773 + p772 + p771)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 14 will run for 1326 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ...considering subproblem: (E (G (A (F ((p3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))))) AND A (F ((p1288 + 1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159)))))
lola: processed formula length: 105
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p1288 + 1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p1288 + 1 <= p18))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (G ((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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p19 <= p86)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p19 <= p86)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= p4) OR (p1152 <= p83) OR (1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((2 <= p4) OR (p1152 <= p83) OR (1 <= p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)))
lola: processed formula length: 98
lola: 2 rewrites
lola: formula mentions 0 of 1294 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4568 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no no no unknown unknown no no yes no no no unknown
lola: ========================================
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494694950714

--------------------
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="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="CTLCardinality"
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/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 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 PolyORBNT-COL-S10J60, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-149440926100075"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;