About the Execution of LoLA for PolyORBLF-PT-S02J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15952.640 | 1512128.00 | 2297330.00 | 5224.10 | ?F??FFF??TTTFT?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is PolyORBLF-PT-S02J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440870000426
=====================================================================
--------------------
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 PolyORBLF-COL-S02J04T06-CTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494681406773
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PolyORBLF-PT-S02J04T06 @ 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: 1396/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: A (X (E (F ((2 <= MarkerWrite))))) : A (G ((NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6))) : A (G (((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + 1 <= PlaceSources_1 + PlaceSources_2) OR (P_1716 <= cSources) OR (cIdleTasks <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) OR (FetchJobB_5 + FetchJobB_4 + FetchJobB_3 + FetchJobB_2 + FetchJobB_1 + FetchJobB_6 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) OR (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6)))) : E (G (NOT(E (G ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= cIsMonitoring)))))) : NOT(A (((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4) U ((NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4) AND (1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4))))) : NOT(NOT(E (G (((ModifiedSrc_1 + ModifiedSrc_2 <= cBlockedTasks) OR (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6)))))) : E (G ((((3 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6) AND (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)) OR (JobCnt <= 0) OR ((2 <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0) AND (1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4))))) : (E ((((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4) AND (FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6)) U (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6))) AND E (((MarkerWrite <= 2) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6)))) : A (G (E (((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_2_2 + DisablePollingB_2_1 + DisablePollingB_4_2 <= MarkerRead))))) : (NOT((((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6) AND (2 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6) AND (Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + 1 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6)) OR A (G ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4))))) AND A (G (((DataOnSrc_1 + DataOnSrc_2 <= 1) OR (RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 <= 2))))) : E (F (NOT(E (G ((P_1097 <= PollingAbort)))))) : E (F ((3 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6))) : ((A (G ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= P_1726))) AND ((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 <= 1) AND (TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= 0) AND (QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 <= 1))) AND A ((((2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4) OR (1 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6)) U (P_1727 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))) : (A (G (A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6))))) AND (Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= NoSigAbort)) : (NOT(A (G (((1 <= cJobCnt) OR (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6))))) OR (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2)) : A (X (E (F ((3 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6)))))
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 (X (E (F ((2 <= MarkerWrite)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (2 <= MarkerWrite)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 958257 markings, 1322301 edges, 2865133787937767424 markings/sec, 0 secs
lola: 1765884 markings, 2581808 edges, 161525 markings/sec, 5 secs
lola: 2511192 markings, 3834461 edges, 149062 markings/sec, 10 secs
lola: 3230596 markings, 5085319 edges, 143881 markings/sec, 15 secs
lola: 3946073 markings, 6327254 edges, 143095 markings/sec, 20 secs
lola: 4628824 markings, 7567722 edges, 136550 markings/sec, 25 secs
lola: 5306915 markings, 8825961 edges, 135618 markings/sec, 30 secs
lola: 5972058 markings, 10108170 edges, 133029 markings/sec, 35 secs
lola: 6623724 markings, 11355450 edges, 130333 markings/sec, 40 secs
lola: 7256335 markings, 12619607 edges, 126522 markings/sec, 45 secs
lola: 7842770 markings, 13790426 edges, 117287 markings/sec, 50 secs
lola: 8460491 markings, 15056786 edges, 123544 markings/sec, 55 secs
lola: 9067572 markings, 16313152 edges, 121416 markings/sec, 60 secs
lola: 9672963 markings, 17509422 edges, 121078 markings/sec, 65 secs
lola: 10272284 markings, 18793646 edges, 119864 markings/sec, 70 secs
lola: 10870501 markings, 19993780 edges, 119643 markings/sec, 75 secs
lola: 11455765 markings, 21297730 edges, 117053 markings/sec, 80 secs
lola: 12067353 markings, 22571716 edges, 122318 markings/sec, 85 secs
lola: 12668599 markings, 23787045 edges, 120249 markings/sec, 90 secs
lola: 13297232 markings, 25144237 edges, 125727 markings/sec, 95 secs
lola: 13911543 markings, 26537048 edges, 122862 markings/sec, 100 secs
lola: 14506695 markings, 27904900 edges, 119030 markings/sec, 105 secs
lola: 15126342 markings, 29231799 edges, 123929 markings/sec, 110 secs
lola: 15721870 markings, 30602355 edges, 119106 markings/sec, 115 secs
lola: 16324335 markings, 31896151 edges, 120493 markings/sec, 120 secs
lola: 16940669 markings, 33275898 edges, 123267 markings/sec, 125 secs
lola: 17583158 markings, 34602064 edges, 128498 markings/sec, 130 secs
lola: 18176954 markings, 35954268 edges, 118759 markings/sec, 135 secs
lola: 18751729 markings, 37287847 edges, 114955 markings/sec, 140 secs
lola: 19347989 markings, 38731472 edges, 119252 markings/sec, 145 secs
lola: 19960863 markings, 40195106 edges, 122575 markings/sec, 150 secs
lola: 20560077 markings, 41639924 edges, 119843 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6)))
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 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + 1 <= PlaceSources_1 + PlaceSources_2) OR (P_1716 <= cSources) OR (cIdleTasks <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) OR (FetchJobB_5 + FetchJobB_4 + FetchJobB_3 + FetchJobB_2 + FetchJobB_1 + FetchJobB_6 <=... (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 1720 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 164842 markings, 188519 edges, 32968 markings/sec, 0 secs
lola: sara is running 5 secs || 325915 markings, 374848 edges, 32215 markings/sec, 5 secs
lola: sara is running 10 secs || 486488 markings, 560943 edges, 32115 markings/sec, 10 secs
lola: sara is running 15 secs || 645560 markings, 745841 edges, 31814 markings/sec, 15 secs
lola: sara is running 20 secs || 804198 markings, 931961 edges, 31728 markings/sec, 20 secs
lola: sara is running 25 secs || 962448 markings, 1119122 edges, 31650 markings/sec, 25 secs
lola: sara is running 30 secs || 1120260 markings, 1306305 edges, 31562 markings/sec, 30 secs
lola: sara is running 35 secs || 1277144 markings, 1491986 edges, 31377 markings/sec, 35 secs
lola: sara is running 40 secs || 1433686 markings, 1678461 edges, 31308 markings/sec, 40 secs
lola: sara is running 45 secs || 1589680 markings, 1865077 edges, 31199 markings/sec, 45 secs
lola: sara is running 50 secs || 1746217 markings, 2052366 edges, 31307 markings/sec, 50 secs
lola: sara is running 55 secs || 1902325 markings, 2239941 edges, 31222 markings/sec, 55 secs
lola: sara is running 60 secs || 2058326 markings, 2426093 edges, 31200 markings/sec, 60 secs
lola: sara is running 65 secs || 2213381 markings, 2614312 edges, 31011 markings/sec, 65 secs
lola: sara is running 70 secs || 2368245 markings, 2802909 edges, 30973 markings/sec, 70 secs
lola: sara is running 75 secs || 2523144 markings, 2990430 edges, 30980 markings/sec, 75 secs
lola: sara is running 80 secs || 2676957 markings, 3176122 edges, 30763 markings/sec, 80 secs
lola: sara is running 85 secs || 2831126 markings, 3362895 edges, 30834 markings/sec, 85 secs
lola: sara is running 90 secs || 2982056 markings, 3545548 edges, 30186 markings/sec, 90 secs
lola: sara is running 95 secs || 3133729 markings, 3729228 edges, 30335 markings/sec, 95 secs
lola: sara is running 100 secs || 3284279 markings, 3912107 edges, 30110 markings/sec, 100 secs
lola: sara is running 105 secs || 3435429 markings, 4095903 edges, 30230 markings/sec, 105 secs
lola: sara is running 110 secs || 3589724 markings, 4283862 edges, 30859 markings/sec, 110 secs
lola: sara is running 115 secs || 3743224 markings, 4471501 edges, 30700 markings/sec, 115 secs
lola: sara is running 120 secs || 3892779 markings, 4652509 edges, 29911 markings/sec, 120 secs
lola: sara is running 125 secs || 4046809 markings, 4839791 edges, 30806 markings/sec, 125 secs
lola: sara is running 130 secs || 4200999 markings, 5027441 edges, 30838 markings/sec, 130 secs
lola: sara is running 135 secs || 4354395 markings, 5216020 edges, 30679 markings/sec, 135 secs
lola: sara is running 140 secs || 4507384 markings, 5402575 edges, 30598 markings/sec, 140 secs
lola: sara is running 145 secs || 4659553 markings, 5588806 edges, 30434 markings/sec, 145 secs
lola: sara is running 150 secs || 4811762 markings, 5776651 edges, 30442 markings/sec, 150 secs
lola: sara is running 155 secs || 4963426 markings, 5963344 edges, 30333 markings/sec, 155 secs
lola: sara is running 160 secs || 5114686 markings, 6150034 edges, 30252 markings/sec, 160 secs
lola: sara is running 165 secs || 5266567 markings, 6338833 edges, 30376 markings/sec, 165 secs
lola: sara is running 170 secs || 5419213 markings, 6526065 edges, 30529 markings/sec, 170 secs
lola: sara is running 175 secs || 5569570 markings, 6713063 edges, 30071 markings/sec, 175 secs
lola: sara is running 180 secs || 5719822 markings, 6899091 edges, 30050 markings/sec, 180 secs
lola: sara is running 185 secs || 5871348 markings, 7086326 edges, 30305 markings/sec, 185 secs
lola: sara is running 190 secs || 6023530 markings, 7276762 edges, 30436 markings/sec, 190 secs
lola: sara is running 195 secs || 6174087 markings, 7466660 edges, 30111 markings/sec, 195 secs
lola: sara is running 200 secs || 6324902 markings, 7655432 edges, 30163 markings/sec, 200 secs
lola: sara is running 205 secs || 6469169 markings, 7837508 edges, 28853 markings/sec, 205 secs
lola: sara is running 210 secs || 6613308 markings, 8019603 edges, 28828 markings/sec, 210 secs
lola: sara is running 215 secs || 6757132 markings, 8202844 edges, 28765 markings/sec, 215 secs
lola: sara is running 220 secs || 6901221 markings, 8383903 edges, 28818 markings/sec, 220 secs
lola: sara is running 225 secs || 7045842 markings, 8568390 edges, 28924 markings/sec, 225 secs
lola: sara is running 230 secs || 7189219 markings, 8750519 edges, 28675 markings/sec, 230 secs
lola: sara is running 235 secs || 7332318 markings, 8934235 edges, 28620 markings/sec, 235 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= cIsMonitoring))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (cIsMonitoring + 1 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6)))))
lola: processed formula length: 194
lola: 5 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 900627 markings, 1664511 edges, 178478 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueu... (shortened)
lola: processed formula length: 1637
lola: 7 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((ModifiedSrc_1 + ModifiedSrc_2 <= cBlockedTasks) OR (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((cBlockedTasks + 1 <= ModifiedSrc_1 + ModifiedSrc_2) AND (NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 <= 0))))
lola: processed formula length: 252
lola: 8 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((3 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6) AND (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)) OR (JobCnt <= 0) OR ((2 <= AvailableJobId_4 + Ava... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= 2) OR (P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6 + 1 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6)) AND (1 <= JobCnt) AND ((AvailableJobId_4... (shortened)
lola: processed formula length: 975
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_... (shortened)
lola: processed formula length: 2143
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((MarkerWrite <= 2) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((MarkerWrite <= 2) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6))
lola: processed formula length: 234
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePoll... (shortened)
lola: processed formula length: 537
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 786856 markings, 1677670 edges, 2977824658813878272 markings/sec, 0 secs
lola: 1493470 markings, 3221005 edges, 141323 markings/sec, 5 secs
lola: 2175683 markings, 4724916 edges, 136443 markings/sec, 10 secs
lola: 2840327 markings, 6205576 edges, 132929 markings/sec, 15 secs
lola: 3506961 markings, 7698078 edges, 133327 markings/sec, 20 secs
lola: 4176230 markings, 9206718 edges, 133854 markings/sec, 25 secs
lola: 4857955 markings, 10758040 edges, 136345 markings/sec, 30 secs
lola: 5533968 markings, 12297804 edges, 135203 markings/sec, 35 secs
lola: 6185252 markings, 13807451 edges, 130257 markings/sec, 40 secs
lola: 6869186 markings, 15419748 edges, 136787 markings/sec, 45 secs
lola: 7544560 markings, 17009835 edges, 135075 markings/sec, 50 secs
lola: 8204090 markings, 18587541 edges, 131906 markings/sec, 55 secs
lola: 8881656 markings, 20243135 edges, 135513 markings/sec, 60 secs
lola: 9545698 markings, 21854761 edges, 132808 markings/sec, 65 secs
lola: 10176953 markings, 23420816 edges, 126251 markings/sec, 70 secs
lola: 10790082 markings, 24949372 edges, 122626 markings/sec, 75 secs
lola: 11420744 markings, 26596293 edges, 126132 markings/sec, 80 secs
lola: 12033378 markings, 28187733 edges, 122527 markings/sec, 85 secs
lola: 12632882 markings, 29700829 edges, 119901 markings/sec, 90 secs
lola: 13240531 markings, 31252166 edges, 121530 markings/sec, 95 secs
lola: 13838250 markings, 32883993 edges, 119544 markings/sec, 100 secs
lola: 14419129 markings, 34360905 edges, 116176 markings/sec, 105 secs
lola: 15021609 markings, 35972234 edges, 120496 markings/sec, 110 secs
lola: 15593274 markings, 37565557 edges, 114333 markings/sec, 115 secs
lola: 16158546 markings, 39192705 edges, 113054 markings/sec, 120 secs
lola: 16725788 markings, 40708232 edges, 113448 markings/sec, 125 secs
lola: 17275003 markings, 42124480 edges, 109843 markings/sec, 130 secs
lola: 17813454 markings, 43529840 edges, 107690 markings/sec, 135 secs
lola: 18355267 markings, 44920672 edges, 108363 markings/sec, 140 secs
lola: 18883865 markings, 46229726 edges, 105720 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6) AND (2 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePolling... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + 1 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + E... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + 1 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + E... (shortened)
lola: processed formula length: 620
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: processed formula with 3 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 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((DataOnSrc_1 + DataOnSrc_2 <= 1) OR (RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (G ((P_1097 <= PollingAbort))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (PollingAbort + 1 <= P_1097)))
lola: processed formula length: 48
lola: 5 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 522879 markings, 1618008 edges, 2865133787937767424 markings/sec, 0 secs
lola: 1000685 markings, 3118499 edges, 95561 markings/sec, 5 secs
lola: 1461287 markings, 4574921 edges, 92120 markings/sec, 10 secs
lola: 1912109 markings, 6006699 edges, 90164 markings/sec, 15 secs
lola: 2357009 markings, 7425500 edges, 88980 markings/sec, 20 secs
lola: 2798534 markings, 8833523 edges, 88305 markings/sec, 25 secs
lola: 3245664 markings, 10261632 edges, 89426 markings/sec, 30 secs
lola: 3689550 markings, 11684902 edges, 88777 markings/sec, 35 secs
lola: 4127675 markings, 13092302 edges, 87625 markings/sec, 40 secs
lola: 4567510 markings, 14505764 edges, 87967 markings/sec, 45 secs
lola: 5017244 markings, 15967582 edges, 89947 markings/sec, 50 secs
lola: 5460438 markings, 17414906 edges, 88639 markings/sec, 55 secs
lola: 5906142 markings, 18884029 edges, 89141 markings/sec, 60 secs
lola: 6349913 markings, 20342500 edges, 88754 markings/sec, 65 secs
lola: 6790637 markings, 21821894 edges, 88145 markings/sec, 70 secs
lola: 7231825 markings, 23293670 edges, 88238 markings/sec, 75 secs
lola: 7661783 markings, 24723412 edges, 85992 markings/sec, 80 secs
lola: 8099546 markings, 26192106 edges, 87553 markings/sec, 85 secs
lola: 8536981 markings, 27656346 edges, 87487 markings/sec, 90 secs
lola: 8970781 markings, 29114357 edges, 86760 markings/sec, 95 secs
lola: 9404507 markings, 30570602 edges, 86745 markings/sec, 100 secs
lola: 9840426 markings, 32039926 edges, 87184 markings/sec, 105 secs
lola: 10275022 markings, 33527911 edges, 86919 markings/sec, 110 secs
lola: 10718732 markings, 35066610 edges, 88742 markings/sec, 115 secs
lola: 11152667 markings, 36559551 edges, 86787 markings/sec, 120 secs
lola: 11577544 markings, 38051231 edges, 84975 markings/sec, 125 secs
lola: 12007168 markings, 39510188 edges, 85925 markings/sec, 130 secs
lola: 12433431 markings, 40970440 edges, 85253 markings/sec, 135 secs
lola: 12863360 markings, 42466782 edges, 85986 markings/sec, 140 secs
lola: 13284405 markings, 43936493 edges, 84209 markings/sec, 145 secs
lola: 13702131 markings, 45411573 edges, 83545 markings/sec, 150 secs
lola: 14126489 markings, 46955291 edges, 84872 markings/sec, 155 secs
lola: 14534205 markings, 48413317 edges, 81543 markings/sec, 160 secs
lola: 14942125 markings, 49901018 edges, 81584 markings/sec, 165 secs
lola: 15354526 markings, 51372958 edges, 82480 markings/sec, 170 secs
lola: 15770774 markings, 52859841 edges, 83250 markings/sec, 175 secs
lola: 16169345 markings, 54261909 edges, 79714 markings/sec, 180 secs
lola: 16567705 markings, 55712845 edges, 79672 markings/sec, 185 secs
lola: 16977629 markings, 57146429 edges, 81985 markings/sec, 190 secs
lola: 17385775 markings, 58556761 edges, 81629 markings/sec, 195 secs
lola: 17782553 markings, 59929090 edges, 79356 markings/sec, 200 secs
lola: 18168425 markings, 61269683 edges, 77174 markings/sec, 205 secs
lola: 18538096 markings, 62533915 edges, 73934 markings/sec, 210 secs
lola: 18750773 markings, 63267490 edges, 42535 markings/sec, 215 secs
lola: 18766736 markings, 63322491 edges, 3193 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6)))
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 1720 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 PolyORBLF-COL-S02J04T06-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 152717 markings, 181422 edges, 30543 markings/sec, 0 secs
lola: sara is running 5 secs || 302606 markings, 361486 edges, 29978 markings/sec, 5 secs
lola: sara is running 10 secs || 451635 markings, 540768 edges, 29806 markings/sec, 10 secs
lola: sara is running 15 secs || 599551 markings, 719392 edges, 29583 markings/sec, 15 secs
lola: sara is running 20 secs || 746457 markings, 897774 edges, 29381 markings/sec, 20 secs
lola: sara is running 25 secs || 892697 markings, 1074610 edges, 29248 markings/sec, 25 secs
lola: sara is running 30 secs || 1038673 markings, 1251292 edges, 29195 markings/sec, 30 secs
lola: sara is running 35 secs || 1184642 markings, 1427614 edges, 29194 markings/sec, 35 secs
lola: sara is running 40 secs || 1330362 markings, 1603897 edges, 29144 markings/sec, 40 secs
lola: sara is running 45 secs || 1475533 markings, 1779760 edges, 29034 markings/sec, 45 secs
lola: sara is running 50 secs || 1620492 markings, 1955842 edges, 28992 markings/sec, 50 secs
lola: sara is running 55 secs || 1765175 markings, 2131576 edges, 28937 markings/sec, 55 secs
lola: sara is running 60 secs || 1909650 markings, 2306744 edges, 28895 markings/sec, 60 secs
lola: sara is running 65 secs || 2053834 markings, 2481968 edges, 28837 markings/sec, 65 secs
lola: sara is running 70 secs || 2198150 markings, 2657238 edges, 28863 markings/sec, 70 secs
lola: sara is running 75 secs || 2342503 markings, 2831360 edges, 28871 markings/sec, 75 secs
lola: sara is running 80 secs || 2486367 markings, 3005441 edges, 28773 markings/sec, 80 secs
lola: sara is running 85 secs || 2630539 markings, 3179971 edges, 28834 markings/sec, 85 secs
lola: sara is running 90 secs || 2774628 markings, 3353706 edges, 28818 markings/sec, 90 secs
lola: sara is running 95 secs || 2919293 markings, 3527092 edges, 28933 markings/sec, 95 secs
lola: sara is running 100 secs || 3062606 markings, 3697892 edges, 28663 markings/sec, 100 secs
lola: sara is running 105 secs || 3206851 markings, 3870161 edges, 28849 markings/sec, 105 secs
lola: sara is running 110 secs || 3350882 markings, 4041937 edges, 28806 markings/sec, 110 secs
lola: sara is running 115 secs || 3495223 markings, 4213192 edges, 28868 markings/sec, 115 secs
lola: sara is running 120 secs || 3639775 markings, 4385231 edges, 28910 markings/sec, 120 secs
lola: sara is running 125 secs || 3783859 markings, 4555178 edges, 28817 markings/sec, 125 secs
lola: sara is running 130 secs || 3927254 markings, 4724362 edges, 28679 markings/sec, 130 secs
lola: sara is running 135 secs || 4071413 markings, 4895222 edges, 28832 markings/sec, 135 secs
lola: sara is running 140 secs || 4215827 markings, 5066896 edges, 28883 markings/sec, 140 secs
lola: sara is running 145 secs || 4358782 markings, 5236248 edges, 28591 markings/sec, 145 secs
lola: sara is running 150 secs || 4502014 markings, 5404889 edges, 28646 markings/sec, 150 secs
lola: sara is running 155 secs || 4644237 markings, 5572666 edges, 28445 markings/sec, 155 secs
lola: sara is running 160 secs || 4785629 markings, 5740724 edges, 28278 markings/sec, 160 secs
lola: sara is running 165 secs || 4927831 markings, 5909514 edges, 28440 markings/sec, 165 secs
lola: sara is running 170 secs || 5068583 markings, 6077108 edges, 28150 markings/sec, 170 secs
lola: sara is running 175 secs || 5210243 markings, 6245896 edges, 28332 markings/sec, 175 secs
lola: sara is running 180 secs || 5351039 markings, 6413251 edges, 28159 markings/sec, 180 secs
lola: sara is running 185 secs || 5490660 markings, 6582208 edges, 27924 markings/sec, 185 secs
lola: sara is running 190 secs || 5631528 markings, 6751778 edges, 28174 markings/sec, 190 secs
lola: sara is running 195 secs || 5771032 markings, 6921604 edges, 27901 markings/sec, 195 secs
lola: sara is running 200 secs || 5912359 markings, 7091453 edges, 28265 markings/sec, 200 secs
lola: sara is running 205 secs || 6052602 markings, 7259343 edges, 28049 markings/sec, 205 secs
lola: sara is running 210 secs || 6193463 markings, 7432781 edges, 28172 markings/sec, 210 secs
lola: sara is running 215 secs || 6334460 markings, 7604911 edges, 28199 markings/sec, 215 secs
lola: sara is running 220 secs || 6474220 markings, 7771138 edges, 27952 markings/sec, 220 secs
lola: sara is running 225 secs || 6613555 markings, 7942781 edges, 27867 markings/sec, 225 secs
lola: sara is running 230 secs || 6751443 markings, 8109645 edges, 27578 markings/sec, 230 secs
lola: sara is running 235 secs || 6890478 markings, 8279703 edges, 27807 markings/sec, 235 secs
lola: sara is running 240 secs || 7030596 markings, 8453515 edges, 28024 markings/sec, 240 secs
lola: sara is running 245 secs || 7170600 markings, 8623164 edges, 28001 markings/sec, 245 secs
lola: sara is running 250 secs || 7308138 markings, 8791852 edges, 27508 markings/sec, 250 secs
lola: sara is running 255 secs || 7449583 markings, 8970255 edges, 28289 markings/sec, 255 secs
lola: sara is running 260 secs || 7591906 markings, 9147440 edges, 28465 markings/sec, 260 secs
lola: sara is running 265 secs || 7726535 markings, 9310189 edges, 26926 markings/sec, 265 secs
lola: sara is running 270 secs || 7866451 markings, 9482801 edges, 27983 markings/sec, 270 secs
lola: sara is running 275 secs || 8005934 markings, 9654486 edges, 27897 markings/sec, 275 secs
lola: sara is running 280 secs || 8143275 markings, 9821790 edges, 27468 markings/sec, 280 secs
lola: sara is running 285 secs || 8283050 markings, 9991922 edges, 27955 markings/sec, 285 secs
lola: sara is running 290 secs || 8422374 markings, 10164081 edges, 27865 markings/sec, 290 secs
lola: sara is running 295 secs || 8560595 markings, 10333506 edges, 27644 markings/sec, 295 secs
lola: sara is running 300 secs || 8700231 markings, 10504455 edges, 27927 markings/sec, 300 secs
lola: sara is running 305 secs || 8838003 markings, 10675166 edges, 27554 markings/sec, 305 secs
lola: sara is running 310 secs || 8978705 markings, 10849818 edges, 28140 markings/sec, 310 secs
lola: sara is running 315 secs || 9117678 markings, 11024075 edges, 27795 markings/sec, 315 secs
lola: sara is running 320 secs || 9254801 markings, 11193173 edges, 27425 markings/sec, 320 secs
lola: sara is running 325 secs || 9391441 markings, 11359004 edges, 27328 markings/sec, 325 secs
lola: sara is running 330 secs || 9527783 markings, 11524216 edges, 27268 markings/sec, 330 secs
lola: sara is running 335 secs || 9664669 markings, 11693368 edges, 27377 markings/sec, 335 secs
lola: sara is running 340 secs || 9804632 markings, 11866763 edges, 27993 markings/sec, 340 secs
lola: sara is running 345 secs || 9940493 markings, 12034290 edges, 27172 markings/sec, 345 secs
lola: sara is running 350 secs || 10077120 markings, 12201804 edges, 27325 markings/sec, 350 secs
lola: sara is running 355 secs || 10215720 markings, 12375002 edges, 27720 markings/sec, 355 secs
lola: sara is running 360 secs || 10349704 markings, 12540840 edges, 26797 markings/sec, 360 secs
lola: sara is running 365 secs || 10487108 markings, 12713433 edges, 27481 markings/sec, 365 secs
lola: sara is running 370 secs || 10623898 markings, 12885224 edges, 27358 markings/sec, 370 secs
lola: sara is running 375 secs || 10760238 markings, 13054424 edges, 27268 markings/sec, 375 secs
lola: sara is running 380 secs || 10894903 markings, 13220689 edges, 26933 markings/sec, 380 secs
lola: sara is running 385 secs || 11033098 markings, 13397992 edges, 27639 markings/sec, 385 secs
lola: sara is running 390 secs || 11171623 markings, 13577385 edges, 27705 markings/sec, 390 secs
lola: sara is running 395 secs || 11306201 markings, 13748169 edges, 26916 markings/sec, 395 secs
lola: sara is running 400 secs || 11440381 markings, 13915469 edges, 26836 markings/sec, 400 secs
lola: sara is running 405 secs || 11576344 markings, 14086948 edges, 27193 markings/sec, 405 secs
lola: sara is running 410 secs || 11713471 markings, 14262515 edges, 27425 markings/sec, 410 secs
lola: sara is running 415 secs || 11850274 markings, 14432908 edges, 27361 markings/sec, 415 secs
lola: sara is running 420 secs || 11986749 markings, 14610190 edges, 27295 markings/sec, 420 secs
lola: sara is running 425 secs || 12120314 markings, 14774981 edges, 26713 markings/sec, 425 secs
lola: sara is running 430 secs || 12256884 markings, 14948235 edges, 27314 markings/sec, 430 secs
lola: sara is running 435 secs || 12391997 markings, 15120318 edges, 27023 markings/sec, 435 secs
lola: sara is running 440 secs || 12527657 markings, 15292081 edges, 27132 markings/sec, 440 secs
lola: sara is running 445 secs || 12664220 markings, 15463515 edges, 27313 markings/sec, 445 secs
lola: sara is running 450 secs || 12799923 markings, 15635908 edges, 27141 markings/sec, 450 secs
lola: sara is running 455 secs || 12934962 markings, 15807466 edges, 27008 markings/sec, 455 secs
lola: sara is running 460 secs || 13068232 markings, 15976947 edges, 26654 markings/sec, 460 secs
lola: sara is running 465 secs || 13203985 markings, 16148398 edges, 27151 markings/sec, 465 secs
lola: sara is running 470 secs || 13338803 markings, 16319780 edges, 26964 markings/sec, 470 secs
lola: sara is running 475 secs || 13476255 markings, 16496198 edges, 27490 markings/sec, 475 secs
lola: sara is running 480 secs || 13612210 markings, 16665596 edges, 27191 markings/sec, 480 secs
lola: sara is running 485 secs || 13747989 markings, 16837479 edges, 27156 markings/sec, 485 secs
lola: sara is running 490 secs || 13885935 markings, 17013048 edges, 27589 markings/sec, 490 secs
lola: sara is running 495 secs || 14023289 markings, 17191631 edges, 27471 markings/sec, 495 secs
lola: sara is running 500 secs || 14161637 markings, 17374834 edges, 27670 markings/sec, 500 secs
lola: sara is running 505 secs || 14295985 markings, 17541620 edges, 26870 markings/sec, 505 secs
lola: sara is running 510 secs || 14430677 markings, 17712507 edges, 26938 markings/sec, 510 secs
lola: sara is running 515 secs || 14576177 markings, 17899327 edges, 29100 markings/sec, 515 secs
lola: sara is running 520 secs || 14717387 markings, 18077756 edges, 28242 markings/sec, 520 secs
lola: sara is running 525 secs || 14863736 markings, 18263496 edges, 29270 markings/sec, 525 secs
lola: sara is running 530 secs || 15002798 markings, 18436565 edges, 27812 markings/sec, 530 secs
lola: sara is running 535 secs || 15144941 markings, 18616063 edges, 28429 markings/sec, 535 secs
lola: sara is running 540 secs || 15284924 markings, 18796585 edges, 27997 markings/sec, 540 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= P_1726))) AND ((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 <= 1) AND (TryAl... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= P_1726)))
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 1720 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 PolyORBLF-COL-S02J04T06-CTLCardinality-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 731 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6))))) AND (Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= NoSigAbort))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 731 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6)))))
lola: processed formula length: 264
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: subprocess 14 will run for 1097 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((1 <= cJobCnt) OR (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6))))) OR (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1097 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cJobCnt <= 0) AND (Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + 1 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6))))
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 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: lola: ========================================
subprocess 15 will run for 2193 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2)
lola: processed formula length: 160
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2193 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6)))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 944737 markings, 1300272 edges, 2316539058328698880 markings/sec, 0 secs
lola: 1745361 markings, 2546798 edges, 160125 markings/sec, 5 secs
lola: 2462560 markings, 3748979 edges, 143440 markings/sec, 10 secs
lola: 3172534 markings, 4979465 edges, 141995 markings/sec, 15 secs
lola: 3850900 markings, 6165636 edges, 135673 markings/sec, 20 secs
lola: 4529756 markings, 7388535 edges, 135771 markings/sec, 25 secs
lola: 5215633 markings, 8654500 edges, 137175 markings/sec, 30 secs
lola: 5859089 markings, 9889126 edges, 128691 markings/sec, 35 secs
lola: 6504318 markings, 11125052 edges, 129046 markings/sec, 40 secs
lola: 7125004 markings, 12366844 edges, 124137 markings/sec, 45 secs
lola: 7741821 markings, 13584704 edges, 123363 markings/sec, 50 secs
lola: 8372156 markings, 14862726 edges, 126067 markings/sec, 55 secs
lola: 8971497 markings, 16106506 edges, 119868 markings/sec, 60 secs
lola: 9585409 markings, 17340721 edges, 122782 markings/sec, 65 secs
lola: 10185492 markings, 18588748 edges, 120017 markings/sec, 70 secs
lola: 10793447 markings, 19837043 edges, 121591 markings/sec, 75 secs
lola: 11385985 markings, 21149475 edges, 118508 markings/sec, 80 secs
lola: 11967420 markings, 22328806 edges, 116287 markings/sec, 85 secs
lola: 12590815 markings, 23638458 edges, 124679 markings/sec, 90 secs
lola: 13214645 markings, 24976205 edges, 124766 markings/sec, 95 secs
lola: 13834021 markings, 26376581 edges, 123875 markings/sec, 100 secs
lola: 14440495 markings, 27758535 edges, 121295 markings/sec, 105 secs
lola: 15053023 markings, 29076579 edges, 122506 markings/sec, 110 secs
lola: 15657471 markings, 30473376 edges, 120890 markings/sec, 115 secs
lola: 16267450 markings, 31764723 edges, 121996 markings/sec, 120 secs
lola: 16891520 markings, 33138925 edges, 124814 markings/sec, 125 secs
lola: 17524567 markings, 34485334 edges, 126609 markings/sec, 130 secs
lola: 18119049 markings, 35826795 edges, 118896 markings/sec, 135 secs
lola: 18695196 markings, 37173589 edges, 115229 markings/sec, 140 secs
lola: 19278459 markings, 38589152 edges, 116653 markings/sec, 145 secs
lola: 19910454 markings, 40099655 edges, 126399 markings/sec, 150 secs
lola: 20490712 markings, 41479975 edges, 116052 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no unknown yes yes yes no yes unknown no unknown unknown no no no unknown
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494682918901
--------------------
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="PolyORBLF-PT-S02J04T06"
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/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 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 PolyORBLF-PT-S02J04T06, 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 r048-smll-149440870000426"
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 '
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 ;