About the Execution of ITS-LoLa for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.760 | 3600000.00 | 488958.00 | 176.10 | FFFFFTFTFFFFTTFT | 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/mcc2020-input.r176-tajo-158987872100617.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBNT-COL-S10J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872100617
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 06:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 07:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 9 19:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 94K Mar 24 05:37 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 PolyORBNT-COL-S10J60-00
FORMULA_NAME PolyORBNT-COL-S10J60-01
FORMULA_NAME PolyORBNT-COL-S10J60-02
FORMULA_NAME PolyORBNT-COL-S10J60-03
FORMULA_NAME PolyORBNT-COL-S10J60-04
FORMULA_NAME PolyORBNT-COL-S10J60-05
FORMULA_NAME PolyORBNT-COL-S10J60-06
FORMULA_NAME PolyORBNT-COL-S10J60-07
FORMULA_NAME PolyORBNT-COL-S10J60-08
FORMULA_NAME PolyORBNT-COL-S10J60-09
FORMULA_NAME PolyORBNT-COL-S10J60-10
FORMULA_NAME PolyORBNT-COL-S10J60-11
FORMULA_NAME PolyORBNT-COL-S10J60-12
FORMULA_NAME PolyORBNT-COL-S10J60-13
FORMULA_NAME PolyORBNT-COL-S10J60-14
FORMULA_NAME PolyORBNT-COL-S10J60-15
=== Now, execution of the tool begins
BK_START 1591169137888
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:25:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 07:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:25:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 07:25:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 577 ms
[2020-06-03 07:25:40] [INFO ] sort/places :
D4->place_482,
Threads->FetchJobB,QueueJobE,NotifyEventJobQueuedE,NotifyEventEndOfCheckSourcesE,NotifyEventEndOfCheckSourcesB,place_523,place_522,place_521,place_520,place_518,place_500,Check_Sources_E,Check_Sources_B,place_782,place_787,Perform_Work_E,Schedule_Task_B,Try_Check_Sources_E,Try_Check_Sources_B,
D5->Schedule_Task_E,
D6->CreatedJobs,
Jobs->f3,f2,f1,AvailableJobId,
Dot->block,mo3,mo2,mo1,mi3,mi2,mi1,cSources,place_462,place_460,place_458,place_456,CanInjectEvent,JobCnt,cJobCnt,
Sources->ModifiedSrc,DataOnSrc,TheSour,
D1->FetchJobE,QueueJobB,NotifyEventJobQueuedB,Perform_Work_B,
[2020-06-03 07:25:40] [INFO ] ms1 symmetric to ms3 in transition trans_489
[2020-06-03 07:25:40] [INFO ] ms3 symmetric to ms4 in transition trans_489
[2020-06-03 07:25:40] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2020-06-03 07:25:40] [INFO ] ms1 symmetric to ms3 in transition trans_488
[2020-06-03 07:25:40] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2020-06-03 07:25:40] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2020-06-03 07:25:40] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 25 ms.
[2020-06-03 07:25:40] [INFO ] Computed order based on color domains.
[2020-06-03 07:25:40] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 2870 transitions in 44 ms.
[2020-06-03 07:25:40] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 13 ms
Reduce places removed 60 places and 60 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 98 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5604 resets, run finished after 1911 ms. (steps per millisecond=52 ) properties seen :[0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1]
[2020-06-03 07:25:42] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2020-06-03 07:25:42] [INFO ] Computed 152 place invariants in 297 ms
[2020-06-03 07:25:43] [INFO ] [Real]Absence check using 145 positive place invariants in 171 ms returned sat
[2020-06-03 07:25:43] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 38 ms returned sat
[2020-06-03 07:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:25:49] [INFO ] [Real]Absence check using state equation in 6856 ms returned sat
[2020-06-03 07:25:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:25:50] [INFO ] [Nat]Absence check using 145 positive place invariants in 152 ms returned sat
[2020-06-03 07:25:50] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 44 ms returned sat
[2020-06-03 07:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:25:56] [INFO ] [Nat]Absence check using state equation in 6315 ms returned sat
[2020-06-03 07:25:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 07:25:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 110 ms returned sat
[2020-06-03 07:25:57] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 650 ms.
[2020-06-03 07:25:58] [INFO ] Added : 14 causal constraints over 3 iterations in 1514 ms. Result :sat
[2020-06-03 07:25:58] [INFO ] [Real]Absence check using 145 positive place invariants in 8 ms returned unsat
[2020-06-03 07:25:59] [INFO ] [Real]Absence check using 145 positive place invariants in 107 ms returned sat
[2020-06-03 07:25:59] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 17 ms returned unsat
[2020-06-03 07:25:59] [INFO ] [Real]Absence check using 145 positive place invariants in 16 ms returned unsat
[2020-06-03 07:25:59] [INFO ] [Real]Absence check using 145 positive place invariants in 72 ms returned unsat
[2020-06-03 07:25:59] [INFO ] [Real]Absence check using 145 positive place invariants in 102 ms returned sat
[2020-06-03 07:25:59] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 47 ms returned sat
[2020-06-03 07:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:26:06] [INFO ] [Real]Absence check using state equation in 6874 ms returned sat
[2020-06-03 07:26:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:26:06] [INFO ] [Nat]Absence check using 145 positive place invariants in 142 ms returned sat
[2020-06-03 07:26:06] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 51 ms returned sat
[2020-06-03 07:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:26:15] [INFO ] [Nat]Absence check using state equation in 8820 ms returned sat
[2020-06-03 07:26:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 112 ms returned sat
[2020-06-03 07:26:16] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 301 ms.
[2020-06-03 07:26:26] [INFO ] Added : 29 causal constraints over 6 iterations in 10330 ms. Result :sat
[2020-06-03 07:26:27] [INFO ] Deduced a trap composed of 602 places in 1206 ms
[2020-06-03 07:26:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s65 s66 s67 s68 s69 s70 s75 s76 s77 s78 s79 s81 s82 s83 s84 s85 s90 s91 s92 s93 s94 s95 s97 s98 s99 s101 s102 s103 s104 s105 s106 s107 s108 s110 s111 s113 s115 s116 s117 s119 s120 s121 s122 s123 s126 s127 s128 s129 s130 s131 s136 s137 s138 s139 s140 s142 s143 s144 s145 s146 s151 s152 s153 s154 s155 s156 s158 s159 s160 s162 s163 s164 s165 s166 s167 s168 s169 s171 s172 s174 s176 s177 s178 s180 s181 s182 s183 s184 s190 s191 s192 s193 s194 s195 s200 s201 s202 s203 s204 s206 s207 s208 s209 s210 s215 s216 s217 s218 s219 s220 s222 s223 s224 s226 s227 s228 s229 s230 s231 s232 s233 s235 s236 s238 s240 s241 s242 s244 s245 s246 s247 s248 s251 s252 s253 s254 s255 s256 s261 s262 s263 s264 s265 s267 s268 s269 s270 s271 s276 s277 s278 s279 s280 s281 s283 s284 s285 s287 s288 s289 s290 s291 s292 s293 s294 s296 s297 s299 s301 s302 s303 s305 s306 s307 s308 s309 s316 s317 s318 s319 s320 s321 s326 s327 s328 s329 s330 s332 s333 s334 s335 s336 s341 s342 s343 s344 s345 s346 s348 s349 s350 s352 s353 s354 s355 s356 s357 s358 s359 s361 s362 s364 s366 s367 s368 s370 s371 s372 s373 s374 s384 s385 s386 s387 s388 s389 s390 s391 s392 s393 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s487 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497 s498 s499 s500 s501 s502 s503 s504 s555 s556 s557 s558 s559 s560 s561 s562 s563 s564 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s633 s634 s635 s636 s637 s638 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s755 s756 s757 s758 s759 s760 s761 s762 s763 s764 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s875 s876 s877 s878 s879 s880 s881 s882 s883 s884 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s935 s936 s937 s938 s939 s940 s941 s942 s943 s944 s995 s996 s997 s998 s999 s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1101 s1102 s1103 s1104 s1105 s1106 s1107 s1108 s1109 s1110 s1111 s1112 s1113 s1114 s1115 s1116 s1117 s1118 s1119 s1120 s1121 s1122 s1123 s1124 s1125 s1126 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1134 s1135 s1136 s1137 s1138 s1139 s1140 s1141 s1142 s1143 s1144 s1145 s1146 s1147 s1148 s1149 s1150 s1151 s1152 s1153 s1154 s1155 s1156 s1157 s1158 s1159 s1160 s1161 s1162 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1170 s1171 s1172 s1173 s1174 s1175 s1176 s1177 s1178 s1179 s1180 s1181 s1182 s1183 s1184 s1185 s1186 s1187 s1188 s1189 s1190 s1191 s1192 s1193 s1194 s1195 s1196 s1197 s1198 s1199 s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1209 s1210 s1211 s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1222 s1223 s1224 s1225 s1226 s1227 s1228 s1229 s1233) 0)") while checking expression at index 5
[2020-06-03 07:26:27] [INFO ] [Real]Absence check using 145 positive place invariants in 94 ms returned sat
[2020-06-03 07:26:27] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2020-06-03 07:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:26:34] [INFO ] [Real]Absence check using state equation in 6856 ms returned sat
[2020-06-03 07:26:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:26:34] [INFO ] [Nat]Absence check using 145 positive place invariants in 138 ms returned sat
[2020-06-03 07:26:34] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 48 ms returned sat
[2020-06-03 07:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:26:41] [INFO ] [Nat]Absence check using state equation in 6240 ms returned sat
[2020-06-03 07:26:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 22 ms returned sat
[2020-06-03 07:26:41] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 269 ms.
[2020-06-03 07:26:52] [INFO ] Added : 58 causal constraints over 12 iterations in 10794 ms. Result :sat
[2020-06-03 07:26:52] [INFO ] Deduced a trap composed of 19 places in 483 ms
[2020-06-03 07:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1546 ms
[2020-06-03 07:26:53] [INFO ] [Real]Absence check using 145 positive place invariants in 85 ms returned unsat
[2020-06-03 07:26:54] [INFO ] [Real]Absence check using 145 positive place invariants in 77 ms returned unsat
[2020-06-03 07:26:54] [INFO ] [Real]Absence check using 145 positive place invariants in 143 ms returned sat
[2020-06-03 07:26:54] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 42 ms returned unsat
[2020-06-03 07:26:54] [INFO ] [Real]Absence check using 145 positive place invariants in 141 ms returned sat
[2020-06-03 07:26:54] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 52 ms returned sat
[2020-06-03 07:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:27:01] [INFO ] [Real]Absence check using state equation in 6652 ms returned sat
[2020-06-03 07:27:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:27:01] [INFO ] [Nat]Absence check using 145 positive place invariants in 140 ms returned sat
[2020-06-03 07:27:01] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 42 ms returned sat
[2020-06-03 07:27:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:27:09] [INFO ] [Nat]Absence check using state equation in 7977 ms returned sat
[2020-06-03 07:27:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 349 ms returned sat
[2020-06-03 07:27:10] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 254 ms.
[2020-06-03 07:27:19] [INFO ] Added : 41 causal constraints over 9 iterations in 9620 ms. Result :unknown
[2020-06-03 07:27:19] [INFO ] [Real]Absence check using 145 positive place invariants in 17 ms returned unsat
[2020-06-03 07:27:20] [INFO ] [Real]Absence check using 145 positive place invariants in 84 ms returned unsat
[2020-06-03 07:27:20] [INFO ] [Real]Absence check using 145 positive place invariants in 136 ms returned sat
[2020-06-03 07:27:20] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 38 ms returned sat
[2020-06-03 07:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:27:27] [INFO ] [Real]Absence check using state equation in 6819 ms returned sat
[2020-06-03 07:27:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:27:27] [INFO ] [Nat]Absence check using 145 positive place invariants in 146 ms returned sat
[2020-06-03 07:27:27] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 51 ms returned sat
[2020-06-03 07:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:27:35] [INFO ] [Nat]Absence check using state equation in 7858 ms returned sat
[2020-06-03 07:27:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 923 ms returned sat
[2020-06-03 07:27:36] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 247 ms.
[2020-06-03 07:27:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t2090 0) (or (and (> t89 0) (< o89 o2090)) (and (> t150 0) (< o150 o2090)) (and (> t211 0) (< o211 o2090))))") while checking expression at index 13
[2020-06-03 07:27:47] [INFO ] [Real]Absence check using 145 positive place invariants in 140 ms returned sat
[2020-06-03 07:27:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 42 ms returned sat
[2020-06-03 07:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:27:54] [INFO ] [Real]Absence check using state equation in 7110 ms returned sat
[2020-06-03 07:27:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:27:54] [INFO ] [Nat]Absence check using 145 positive place invariants in 142 ms returned sat
[2020-06-03 07:27:55] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
[2020-06-03 07:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:28:02] [INFO ] [Nat]Absence check using state equation in 7510 ms returned sat
[2020-06-03 07:28:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 43 ms returned sat
[2020-06-03 07:28:03] [INFO ] Deduced a trap composed of 617 places in 1095 ms
[2020-06-03 07:28:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1136 ms
[2020-06-03 07:28:03] [INFO ] [Real]Absence check using 145 positive place invariants in 128 ms returned sat
[2020-06-03 07:28:03] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 47 ms returned sat
[2020-06-03 07:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:28:10] [INFO ] [Real]Absence check using state equation in 6390 ms returned sat
[2020-06-03 07:28:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:28:10] [INFO ] [Nat]Absence check using 145 positive place invariants in 102 ms returned sat
[2020-06-03 07:28:10] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2020-06-03 07:28:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:28:17] [INFO ] [Nat]Absence check using state equation in 6874 ms returned sat
[2020-06-03 07:28:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 86 ms returned sat
[2020-06-03 07:28:18] [INFO ] Deduced a trap composed of 617 places in 1150 ms
[2020-06-03 07:28:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1256 ms
[2020-06-03 07:28:19] [INFO ] [Real]Absence check using 145 positive place invariants in 107 ms returned sat
[2020-06-03 07:28:19] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2020-06-03 07:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:28:25] [INFO ] [Real]Absence check using state equation in 6508 ms returned sat
[2020-06-03 07:28:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:28:25] [INFO ] [Nat]Absence check using 145 positive place invariants in 135 ms returned sat
[2020-06-03 07:28:26] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 44 ms returned sat
[2020-06-03 07:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:28:33] [INFO ] [Nat]Absence check using state equation in 7384 ms returned sat
[2020-06-03 07:28:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2020-06-03 07:28:34] [INFO ] Deduced a trap composed of 24 places in 967 ms
[2020-06-03 07:28:35] [INFO ] Deduced a trap composed of 12 places in 922 ms
[2020-06-03 07:28:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2166 ms
[2020-06-03 07:28:35] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 247 ms.
[2020-06-03 07:28:45] [INFO ] Added : 70 causal constraints over 14 iterations in 10127 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 07:28:45] [INFO ] [Real]Absence check using 145 positive place invariants in 143 ms returned sat
[2020-06-03 07:28:46] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 43 ms returned sat
[2020-06-03 07:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:28:52] [INFO ] [Real]Absence check using state equation in 6877 ms returned sat
[2020-06-03 07:28:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:28:53] [INFO ] [Nat]Absence check using 145 positive place invariants in 140 ms returned sat
[2020-06-03 07:28:53] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 53 ms returned sat
[2020-06-03 07:28:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:28:59] [INFO ] [Nat]Absence check using state equation in 6583 ms returned sat
[2020-06-03 07:29:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1094 ms returned sat
[2020-06-03 07:29:02] [INFO ] Deduced a trap composed of 19 places in 1081 ms
[2020-06-03 07:29:03] [INFO ] Deduced a trap composed of 301 places in 1007 ms
[2020-06-03 07:29:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2606 ms
[2020-06-03 07:29:03] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 400 ms.
[2020-06-03 07:29:12] [INFO ] Added : 55 causal constraints over 11 iterations in 9418 ms. Result :unknown
[2020-06-03 07:29:13] [INFO ] [Real]Absence check using 145 positive place invariants in 9 ms returned unsat
[2020-06-03 07:29:13] [INFO ] [Real]Absence check using 145 positive place invariants in 141 ms returned sat
[2020-06-03 07:29:13] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 28 ms returned unsat
[2020-06-03 07:29:13] [INFO ] [Real]Absence check using 145 positive place invariants in 126 ms returned sat
[2020-06-03 07:29:13] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2020-06-03 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:29:19] [INFO ] [Real]Absence check using state equation in 6195 ms returned sat
[2020-06-03 07:29:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:29:20] [INFO ] [Nat]Absence check using 145 positive place invariants in 144 ms returned sat
[2020-06-03 07:29:20] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 48 ms returned sat
[2020-06-03 07:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:29:28] [INFO ] [Nat]Absence check using state equation in 8290 ms returned sat
[2020-06-03 07:29:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 448 ms returned sat
[2020-06-03 07:29:29] [INFO ] Deduced a trap composed of 12 places in 987 ms
[2020-06-03 07:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1118 ms
[2020-06-03 07:29:30] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 308 ms.
[2020-06-03 07:29:39] [INFO ] Added : 45 causal constraints over 9 iterations in 9854 ms. Result :unknown
[2020-06-03 07:29:40] [INFO ] [Real]Absence check using 145 positive place invariants in 140 ms returned sat
[2020-06-03 07:29:40] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 44 ms returned sat
[2020-06-03 07:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:29:46] [INFO ] [Real]Absence check using state equation in 6564 ms returned sat
[2020-06-03 07:29:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:29:47] [INFO ] [Nat]Absence check using 145 positive place invariants in 101 ms returned sat
[2020-06-03 07:29:47] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned sat
[2020-06-03 07:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:29:55] [INFO ] [Nat]Absence check using state equation in 8290 ms returned sat
[2020-06-03 07:29:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 461 ms returned sat
[2020-06-03 07:29:56] [INFO ] Deduced a trap composed of 12 places in 1003 ms
[2020-06-03 07:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1121 ms
[2020-06-03 07:29:57] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 258 ms.
[2020-06-03 07:30:06] [INFO ] Added : 45 causal constraints over 9 iterations in 9897 ms. Result :unknown
[2020-06-03 07:30:07] [INFO ] [Real]Absence check using 145 positive place invariants in 145 ms returned sat
[2020-06-03 07:30:07] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 45 ms returned sat
[2020-06-03 07:30:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:30:13] [INFO ] [Real]Absence check using state equation in 6025 ms returned sat
[2020-06-03 07:30:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:30:13] [INFO ] [Nat]Absence check using 145 positive place invariants in 163 ms returned sat
[2020-06-03 07:30:13] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 89 ms returned sat
[2020-06-03 07:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:30:20] [INFO ] [Nat]Absence check using state equation in 6956 ms returned sat
[2020-06-03 07:30:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 171 ms returned sat
[2020-06-03 07:30:21] [INFO ] Deduced a trap composed of 13 places in 1102 ms
[2020-06-03 07:30:23] [INFO ] Deduced a trap composed of 13 places in 1136 ms
[2020-06-03 07:30:24] [INFO ] Deduced a trap composed of 13 places in 1264 ms
[2020-06-03 07:30:26] [INFO ] Deduced a trap composed of 13 places in 1019 ms
[2020-06-03 07:30:27] [INFO ] Deduced a trap composed of 13 places in 1109 ms
[2020-06-03 07:30:28] [INFO ] Deduced a trap composed of 13 places in 1048 ms
[2020-06-03 07:30:29] [INFO ] Deduced a trap composed of 13 places in 1094 ms
[2020-06-03 07:30:30] [INFO ] Deduced a trap composed of 149 places in 983 ms
[2020-06-03 07:30:31] [INFO ] Deduced a trap composed of 12 places in 1062 ms
[2020-06-03 07:30:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 11307 ms
[2020-06-03 07:30:32] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 391 ms.
[2020-06-03 07:30:33] [INFO ] Added : 5 causal constraints over 1 iterations in 1184 ms. Result :unknown
[2020-06-03 07:30:33] [INFO ] [Real]Absence check using 145 positive place invariants in 10 ms returned unsat
[2020-06-03 07:30:33] [INFO ] [Real]Absence check using 145 positive place invariants in 111 ms returned sat
[2020-06-03 07:30:33] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 27 ms returned sat
[2020-06-03 07:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:30:39] [INFO ] [Real]Absence check using state equation in 5939 ms returned sat
[2020-06-03 07:30:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:30:39] [INFO ] [Nat]Absence check using 145 positive place invariants in 123 ms returned sat
[2020-06-03 07:30:40] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 64 ms returned sat
[2020-06-03 07:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:30:49] [INFO ] [Nat]Absence check using state equation in 9264 ms returned sat
[2020-06-03 07:30:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 195 ms returned sat
[2020-06-03 07:30:49] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 245 ms.
[2020-06-03 07:30:53] [INFO ] Added : 18 causal constraints over 7 iterations in 3762 ms. Result :sat
[2020-06-03 07:30:53] [INFO ] [Real]Absence check using 145 positive place invariants in 149 ms returned sat
[2020-06-03 07:30:53] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 45 ms returned sat
[2020-06-03 07:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:31:00] [INFO ] [Real]Absence check using state equation in 6544 ms returned sat
[2020-06-03 07:31:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:31:00] [INFO ] [Nat]Absence check using 145 positive place invariants in 144 ms returned sat
[2020-06-03 07:31:00] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 44 ms returned sat
[2020-06-03 07:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 07:31:09] [INFO ] [Nat]Absence check using state equation in 8554 ms returned sat
[2020-06-03 07:31:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 106 ms returned sat
[2020-06-03 07:31:10] [INFO ] Deduced a trap composed of 602 places in 1126 ms
[2020-06-03 07:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1249 ms
[2020-06-03 07:31:10] [INFO ] Computed and/alt/rep : 2799/197722/2790 causal constraints in 332 ms.
[2020-06-03 07:31:17] [INFO ] Added : 30 causal constraints over 7 iterations in 6517 ms. Result :sat
[2020-06-03 07:31:17] [INFO ] [Real]Absence check using 145 positive place invariants in 23 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
[2020-06-03 07:31:17] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 07:31:17] [INFO ] Flatten gal took : 445 ms
FORMULA PolyORBNT-COL-S10J60-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 07:31:17] [INFO ] Applying decomposition
[2020-06-03 07:31:18] [INFO ] Flatten gal took : 288 ms
[2020-06-03 07:31:18] [INFO ] Decomposing Gal with order
[2020-06-03 07:31:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 07:31:19] [INFO ] Removed a total of 14501 redundant transitions.
[2020-06-03 07:31:19] [INFO ] Flatten gal took : 538 ms
[2020-06-03 07:31:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 68 ms.
[2020-06-03 07:31:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 07:31:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 47 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBNT-COL-S10J60 @ 3570 seconds
FORMULA PolyORBNT-COL-S10J60-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-COL-S10J60-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-COL-S10J60-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-COL-S10J60-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-COL-S10J60-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-COL-S10J60-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-COL-S10J60-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3459
rslt: Output for LTLCardinality @ PolyORBNT-COL-S10J60
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 07:31:23 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 494
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((3 <= p0)))",
"processed_size": 17,
"rewrites": 23
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 576
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 576
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G ((p1232 <= p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393))",
"processed_size": 82,
"rewrites": 23
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 691
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 1,
"X": 7,
"aconj": 0,
"adisj": 0,
"aneg": 8,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 137,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 65,
"visible_transitions": 0
},
"processed": "((X (((p378 <= 0) R (X ((p1101 + 1 <= p383)) AND (F ((p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + 1 <= p380)) OR X (G ((p1101 + 1 <= p383))))))) OR (G ((p383 <= p1101)) AND X (F (((p378 <= 0) R (X ((p1101 + 1 <= p383)) AND (F ((p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + 1 <= p380)) OR X (G ((p1101 + 1 <= p383)))))))))) U X ((1 <= p378)))",
"processed_size": 1106,
"rewrites": 23
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 45
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 864
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p186 <= 0)",
"processed_size": 11,
"rewrites": 25
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 122
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1153
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 62,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 62,
"visible_transitions": 0
},
"processed": "(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 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p99 <= p1018)",
"processed_size": 399,
"rewrites": 25
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 255
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1729
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249)) AND ((3 <= p314) AND (p62 <= p1100)))))",
"processed_size": 482,
"rewrites": 23
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3459
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3459
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 61,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 61,
"visible_transitions": 0
},
"processed": "(p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 <= 1)",
"processed_size": 431,
"rewrites": 25
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 671
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 83264,
"runtime": 111.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : X(G(**)) : (F(**) OR (F(**) AND F(G(*)))) : F(G((F(**) AND (** AND **)))) : F(**) : (G(**) AND (X(G(**)) U G(**))) : ((X((* R (X(*) AND (F(*) OR X(G(*)))))) OR (G(**) AND X(F((* R (X(*) AND (F(*) OR X(G(*))))))))) U X(**))"
},
"net":
{
"arcs": 17669,
"conflict_clusters": 204,
"places": 1234,
"places_significant": 1082,
"singleton_clusters": 0,
"transitions": 2810
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 4044/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 39488
lola: finding significant places
lola: 1234 places, 2810 transitions, 1082 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: F ((p1018 + 1 <= 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 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p99)) : X (G ((3 <= p0))) : (F (NOT(F ((2 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375)))) U F ((2 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375))) : F (G (((F ((1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249)) AND (3 <= p314)) AND (p62 <= p1100)))) : F (((1 <= 0) U (1 <= p186))) : (G ((p1232 <= p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393)) AND (G (X ((p1230 <= p1017))) U G ((p1228 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1204 + p1205 + p1206 + p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1223 + p1224 + p1225 + p1226 + p1227 <= p380)))) : ((G ((p383 <= p1101)) U X (NOT(((1 <= p378) U (G ((p380 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185)) U X ((p383 <= p1101))))))) U X ((1 <= p378)))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((3 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((3 <= p0)))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 35 markings, 35 edges
lola: ========================================
lola: subprocess 1 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p1232 <= p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393)) AND (X (G ((p1230 <= p1017))) U G ((p1228 + 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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p1232 <= p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1232 <= p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393))
lola: processed formula length: 82
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 39 markings, 39 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((p378 <= 0) R (X ((p1101 + 1 <= p383)) AND (F ((p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((p378 <= 0) R (X ((p1101 + 1 <= p383)) AND (F ((p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p17... (shortened)
lola: processed formula length: 1106
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 45 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 35 markings, 35 edges
lola: ========================================
lola: subprocess 3 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p186))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p186 <= 0)
lola: processed formula length: 11
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 4 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p1018 + 1 <= 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 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (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 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p99 <= p1018)
lola: processed formula length: 399
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 5 will run for 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 +... (shortened)
lola: processed formula length: 482
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 3459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((2 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + ... (shortened)
lola: processed formula length: 431
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: memory consumption: 83264 KB
lola: time consumption: 111 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from 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="LTLCardinality"
export BK_TOOL="itslola"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is PolyORBNT-COL-S10J60, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872100617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;