About the Execution of LoLA for PolyORBLF-PT-S04J06T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15936.340 | 921650.00 | 1552629.00 | 2515.90 | T?FFTTFFTT?F?FFT | 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-S04J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440870000489
=====================================================================
--------------------
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-S04J06T08-CTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S04J06T08-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494712119818
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PolyORBLF-PT-S04J06T08 @ 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: 5060/65536 symbol table entries, 1254 collisions
lola: preprocessing...
lola: finding significant places
lola: 792 places, 4268 transitions, 734 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2899 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: A (F ((1 <= JobCnt))) : E (F ((2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_4_3 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_3_4 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_4_4))) : E (G ((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8 <= 2))) : (A (((2 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8) U (1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8))) OR (A (((CanInjectEvent <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8) U (2 <= P_1099))) OR A (((NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + NotifyEventSourceAddedE_7 + NotifyEventSourceAddedE_8 <= cSources) U (NoSigAbort <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6))))) : E (((SigAbort <= PollingAbort) U ((1 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8) AND (2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8) AND (3 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8)))) : A (G ((E (G ((2 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8))) OR ((IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + 1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) OR (Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8 + 1 <= BlockedTasks))))) : A (G (((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 <= 2) OR (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + 1 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)))) : E (F ((IsMonitoring + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8))) : (NOT(A (F (((2 <= P_1097) OR (3 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8))))) AND (A (((Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8) U (PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_7_1 + P_2579_7_2 + P_2579_7_3 + P_2579_7_4 + P_2579_8_1 + P_2579_8_2 + P_2579_8_3 + P_2579_8_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4))) AND (MarkerRead <= CanInjectEvent))) : (A (X (E (G ((RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 <= P_1716))))) OR (A (X ((DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 + 1 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8))) OR (A (G ((2 <= DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1))) AND E (G ((P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6)))))) : A (F (((ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_7_5 + ScheduleTaskE_Work_7_6 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4 + ScheduleTaskE_Work_8_5 + ScheduleTaskE_Work_8_6 <= cBlockedTasks) AND (2 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8) AND (3 <= BlockedTasks) AND (Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + 1 <= DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) AND ((1 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8) OR (2 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_7_5 + ScheduleTaskE_Work_7_6 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4 + ScheduleTaskE_Work_8_5 + ScheduleTaskE_Work_8_6))))) : E (G (A (((3 <= ORB_Lock) U (1 <= MarkerWrite))))) : A ((E (X ((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_1 + P_1160_2 + P_1160_8 <= P_1095))) U (1 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8))) : ((P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8) AND ((3 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8) OR (E (F ((3 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8))) OR ((RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + 1 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_8_1 + P_1119_8_2 + P_1119_8_3 + P_1119_8_4) AND (BlockedTasks + 1 <= P_1095))))) : A (G ((E (X ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8))) AND ((ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_7_5 + ScheduleTaskE_Work_7_6 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4 + ScheduleTaskE_Work_8_5 + ScheduleTaskE_Work_8_6 <= 2) OR (FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6 + FetchJobE_7_0 + FetchJobE_7_1 + FetchJobE_7_2 + FetchJobE_7_3 + FetchJobE_7_4 + FetchJobE_7_5 + FetchJobE_7_6 + FetchJobE_8_0 + FetchJobE_8_1 + FetchJobE_8_2 + FetchJobE_8_3 + FetchJobE_8_4 + FetchJobE_8_5 + FetchJobE_8_6 <= 0))))) : (A (F (((3 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_8_1 + P_1119_8_2 + P_1119_8_3 + P_1119_8_4) AND (2 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + NotifyEventSourceAddedE_7 + NotifyEventSourceAddedE_8) AND (1 <= ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8)))) AND (cIsMonitoring <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0))
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 (F ((1 <= JobCnt)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= JobCnt))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_4_3 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePolling... (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 2936 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-S04J06T08-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 25913 markings, 28149 edges, 5183 markings/sec, 0 secs
lola: sara is running 5 secs || 50954 markings, 56517 edges, 5008 markings/sec, 5 secs
lola: sara is running 10 secs || 75887 markings, 85372 edges, 4987 markings/sec, 10 secs
lola: sara is running 15 secs || 100619 markings, 114223 edges, 4946 markings/sec, 15 secs
lola: sara is running 20 secs || 125394 markings, 143567 edges, 4955 markings/sec, 20 secs
lola: sara is running 25 secs || 149639 markings, 172555 edges, 4849 markings/sec, 25 secs
lola: sara is running 30 secs || 174021 markings, 201553 edges, 4876 markings/sec, 30 secs
lola: sara is running 35 secs || 198062 markings, 230629 edges, 4808 markings/sec, 35 secs
lola: sara is running 40 secs || 222417 markings, 260468 edges, 4871 markings/sec, 40 secs
lola: sara is running 45 secs || 246384 markings, 289259 edges, 4793 markings/sec, 45 secs
lola: sara is running 50 secs || 270570 markings, 318290 edges, 4837 markings/sec, 50 secs
lola: sara is running 55 secs || 294592 markings, 348119 edges, 4804 markings/sec, 55 secs
lola: sara is running 60 secs || 318455 markings, 378052 edges, 4773 markings/sec, 60 secs
lola: sara is running 65 secs || 342402 markings, 408017 edges, 4789 markings/sec, 65 secs
lola: sara is running 70 secs || 366101 markings, 437139 edges, 4740 markings/sec, 70 secs
lola: sara is running 75 secs || 389939 markings, 467122 edges, 4768 markings/sec, 75 secs
lola: sara is running 80 secs || 413903 markings, 496659 edges, 4793 markings/sec, 80 secs
lola: sara is running 85 secs || 437767 markings, 526957 edges, 4773 markings/sec, 85 secs
lola: sara is running 90 secs || 461892 markings, 556847 edges, 4825 markings/sec, 90 secs
lola: sara is running 95 secs || 485600 markings, 587042 edges, 4742 markings/sec, 95 secs
lola: sara is running 100 secs || 509552 markings, 617809 edges, 4790 markings/sec, 100 secs
lola: sara is running 105 secs || 533530 markings, 647221 edges, 4796 markings/sec, 105 secs
lola: sara is running 110 secs || 557195 markings, 677174 edges, 4733 markings/sec, 110 secs
lola: sara is running 115 secs || 580884 markings, 706387 edges, 4738 markings/sec, 115 secs
lola: sara is running 120 secs || 604436 markings, 736299 edges, 4710 markings/sec, 120 secs
lola: sara is running 125 secs || 628139 markings, 765903 edges, 4741 markings/sec, 125 secs
lola: sara is running 130 secs || 651636 markings, 795951 edges, 4699 markings/sec, 130 secs
lola: sara is running 135 secs || 675129 markings, 825139 edges, 4699 markings/sec, 135 secs
lola: sara is running 140 secs || 698844 markings, 855408 edges, 4743 markings/sec, 140 secs
lola: sara is running 145 secs || 722429 markings, 885432 edges, 4717 markings/sec, 145 secs
lola: sara is running 150 secs || 746010 markings, 915803 edges, 4716 markings/sec, 150 secs
lola: sara is running 155 secs || 769600 markings, 945336 edges, 4718 markings/sec, 155 secs
lola: sara is running 160 secs || 793209 markings, 975543 edges, 4722 markings/sec, 160 secs
lola: sara is running 165 secs || 816566 markings, 1005266 edges, 4671 markings/sec, 165 secs
lola: sara is running 170 secs || 840334 markings, 1035614 edges, 4754 markings/sec, 170 secs
lola: sara is running 175 secs || 863985 markings, 1065914 edges, 4730 markings/sec, 175 secs
lola: sara is running 180 secs || 887546 markings, 1095845 edges, 4712 markings/sec, 180 secs
lola: sara is running 185 secs || 911385 markings, 1125869 edges, 4768 markings/sec, 185 secs
lola: sara is running 190 secs || 934929 markings, 1156811 edges, 4709 markings/sec, 190 secs
lola: sara is running 195 secs || 958458 markings, 1187148 edges, 4706 markings/sec, 195 secs
lola: sara is running 200 secs || 981835 markings, 1216839 edges, 4675 markings/sec, 200 secs
lola: sara is running 205 secs || 1005327 markings, 1246706 edges, 4698 markings/sec, 205 secs
lola: sara is running 210 secs || 1028706 markings, 1277127 edges, 4676 markings/sec, 210 secs
lola: sara is running 215 secs || 1052079 markings, 1306998 edges, 4675 markings/sec, 215 secs
lola: sara is running 220 secs || 1075348 markings, 1336943 edges, 4654 markings/sec, 220 secs
lola: sara is running 225 secs || 1098736 markings, 1366553 edges, 4678 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8)))
lola: processed formula length: 163
lola: 2 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((2 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8) U (1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8))) OR (A (((CanInjectEvent <= P_1159_1 + P_1159_2 + P_1159_3 + P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8) U (1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((2 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8) U (1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8))
lola: processed formula length: 334
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((CanInjectEvent <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8) U (2 <= P_1099)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((CanInjectEvent <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8) U (2 <= P_1099))
lola: processed formula length: 124
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + NotifyEventSourceAddedE_7 + NotifyEventSourceAddedE_8 <= cSources) U (NoSigAbort <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + NotifyEventSourceAddedE_7 + NotifyEventSourceAddedE_8 <= cSources) U (NoSigAbort <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6))
lola: processed formula length: 331
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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: 612274 markings, 1076910 edges, 2965665984356024320 markings/sec, 0 secs
lola: 1205987 markings, 2230435 edges, 118743 markings/sec, 5 secs
lola: 1788212 markings, 3356911 edges, 116445 markings/sec, 10 secs
lola: 2335212 markings, 4463638 edges, 109400 markings/sec, 15 secs
lola: 2840555 markings, 5585839 edges, 101069 markings/sec, 20 secs
lola: 3376712 markings, 6520833 edges, 107231 markings/sec, 25 secs
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 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((SigAbort <= PollingAbort) U ((1 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8) AND (2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8) AND (3 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEven... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((SigAbort <= PollingAbort) U ((1 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8) AND (2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8) AND (3 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventS... (shortened)
lola: processed formula length: 528
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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: 402670 markings, 971391 edges, 3228173285975916544 markings/sec, 0 secs
lola: 772795 markings, 1906985 edges, 74025 markings/sec, 5 secs
lola: 1125226 markings, 2800386 edges, 70486 markings/sec, 10 secs
lola: 1462735 markings, 3672561 edges, 67502 markings/sec, 15 secs
lola: 1852126 markings, 4525286 edges, 77878 markings/sec, 20 secs
lola: 2242720 markings, 5477204 edges, 78119 markings/sec, 25 secs
lola: 2595164 markings, 6384820 edges, 70489 markings/sec, 30 secs
lola: 2944586 markings, 7269514 edges, 69884 markings/sec, 35 secs
lola: 3269755 markings, 8081238 edges, 65034 markings/sec, 40 secs
lola: 3632995 markings, 8933232 edges, 72648 markings/sec, 45 secs
lola: 3980602 markings, 9742304 edges, 69521 markings/sec, 50 secs
lola: 4285242 markings, 10502222 edges, 60928 markings/sec, 55 secs
lola: 4605528 markings, 11303723 edges, 64057 markings/sec, 60 secs
lola: 4907244 markings, 12075999 edges, 60343 markings/sec, 65 secs
lola: 5203205 markings, 12838261 edges, 59192 markings/sec, 70 secs
lola: 5543427 markings, 13608122 edges, 68044 markings/sec, 75 secs
lola: 5906355 markings, 14455030 edges, 72586 markings/sec, 80 secs
lola: 6211686 markings, 15231584 edges, 61066 markings/sec, 85 secs
lola: 6530854 markings, 16033335 edges, 63834 markings/sec, 90 secs
lola: 6853380 markings, 16865523 edges, 64505 markings/sec, 95 secs
lola: 7175915 markings, 17614156 edges, 64507 markings/sec, 100 secs
lola: 7533518 markings, 18406313 edges, 71521 markings/sec, 105 secs
lola: 7830967 markings, 19187786 edges, 59490 markings/sec, 110 secs
lola: 8130949 markings, 19961002 edges, 59996 markings/sec, 115 secs
lola: 8438793 markings, 20737360 edges, 61569 markings/sec, 120 secs
lola: 8727182 markings, 21451949 edges, 57678 markings/sec, 125 secs
lola: 9049789 markings, 22197041 edges, 64521 markings/sec, 130 secs
lola: 9381953 markings, 22979062 edges, 66433 markings/sec, 135 secs
lola: 9671397 markings, 23718276 edges, 57889 markings/sec, 140 secs
lola: 9981544 markings, 24491726 edges, 62029 markings/sec, 145 secs
lola: 10282197 markings, 25261304 edges, 60131 markings/sec, 150 secs
lola: 10583062 markings, 25996450 edges, 60173 markings/sec, 155 secs
lola: 10924274 markings, 26725164 edges, 68242 markings/sec, 160 secs
lola: 11203804 markings, 27445847 edges, 55906 markings/sec, 165 secs
lola: 11476541 markings, 28150460 edges, 54547 markings/sec, 170 secs
lola: 11763263 markings, 28867666 edges, 57344 markings/sec, 175 secs
lola: 12044477 markings, 29585354 edges, 56243 markings/sec, 180 secs
lola: 12327831 markings, 30270764 edges, 56671 markings/sec, 185 secs
lola: 12653204 markings, 30973827 edges, 65075 markings/sec, 190 secs
lola: 12987012 markings, 31832234 edges, 66762 markings/sec, 195 secs
lola: 13300893 markings, 32648469 edges, 62776 markings/sec, 200 secs
lola: 13622060 markings, 33462388 edges, 64233 markings/sec, 205 secs
lola: 13923892 markings, 34203230 edges, 60366 markings/sec, 210 secs
lola: 14259547 markings, 34977962 edges, 67131 markings/sec, 215 secs
lola: 14558156 markings, 35669325 edges, 59722 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8))) OR ((IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + 1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) OR (Try_Check_Sources... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 <= 1)) AND ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1) AND (BlockedTask... (shortened)
lola: processed formula length: 599
lola: 6 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 <= 2) OR (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + 1 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0))))
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 2936 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-S04J06T08-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 21283 markings, 23720 edges, 4257 markings/sec, 0 secs
lola: sara is running 5 secs || 42596 markings, 47374 edges, 4263 markings/sec, 5 secs
lola: sara is running 10 secs || 63975 markings, 71597 edges, 4276 markings/sec, 10 secs
lola: sara is running 15 secs || 85349 markings, 95125 edges, 4275 markings/sec, 15 secs
lola: sara is running 20 secs || 106641 markings, 119045 edges, 4258 markings/sec, 20 secs
lola: sara is running 25 secs || 127837 markings, 143877 edges, 4239 markings/sec, 25 secs
lola: sara is running 30 secs || 143104 markings, 161725 edges, 3053 markings/sec, 30 secs
lola: sara is running 35 secs || 156172 markings, 176379 edges, 2614 markings/sec, 35 secs
lola: sara is running 40 secs || 169344 markings, 190919 edges, 2634 markings/sec, 40 secs
lola: sara is running 45 secs || 182470 markings, 205734 edges, 2625 markings/sec, 45 secs
lola: sara is running 50 secs || 195651 markings, 220665 edges, 2636 markings/sec, 50 secs
lola: sara is running 55 secs || 208905 markings, 235369 edges, 2651 markings/sec, 55 secs
lola: sara is running 60 secs || 222119 markings, 250021 edges, 2643 markings/sec, 60 secs
lola: sara is running 65 secs || 235491 markings, 264784 edges, 2674 markings/sec, 65 secs
lola: sara is running 70 secs || 248708 markings, 279440 edges, 2643 markings/sec, 70 secs
lola: sara is running 75 secs || 261838 markings, 294222 edges, 2626 markings/sec, 75 secs
lola: sara is running 80 secs || 275010 markings, 308747 edges, 2634 markings/sec, 80 secs
lola: sara is running 85 secs || 288143 markings, 323896 edges, 2627 markings/sec, 85 secs
lola: sara is running 90 secs || 301396 markings, 338641 edges, 2651 markings/sec, 90 secs
lola: sara is running 95 secs || 320863 markings, 361493 edges, 3893 markings/sec, 95 secs
lola: sara is running 100 secs || 342012 markings, 385660 edges, 4230 markings/sec, 100 secs
lola: sara is running 105 secs || 363228 markings, 409953 edges, 4243 markings/sec, 105 secs
lola: sara is running 110 secs || 384298 markings, 434375 edges, 4214 markings/sec, 110 secs
lola: sara is running 115 secs || 405441 markings, 458619 edges, 4229 markings/sec, 115 secs
lola: sara is running 120 secs || 426253 markings, 482812 edges, 4162 markings/sec, 120 secs
lola: sara is running 125 secs || 447549 markings, 506915 edges, 4259 markings/sec, 125 secs
lola: sara is running 130 secs || 468625 markings, 531131 edges, 4215 markings/sec, 130 secs
lola: sara is running 135 secs || 489569 markings, 555567 edges, 4189 markings/sec, 135 secs
lola: sara is running 140 secs || 510399 markings, 580742 edges, 4166 markings/sec, 140 secs
lola: sara is running 145 secs || 531554 markings, 605494 edges, 4231 markings/sec, 145 secs
lola: sara is running 150 secs || 552903 markings, 629765 edges, 4270 markings/sec, 150 secs
lola: sara is running 155 secs || 574137 markings, 653737 edges, 4247 markings/sec, 155 secs
lola: sara is running 160 secs || 595310 markings, 678439 edges, 4235 markings/sec, 160 secs
lola: sara is running 165 secs || 616344 markings, 701912 edges, 4207 markings/sec, 165 secs
lola: sara is running 170 secs || 637527 markings, 725936 edges, 4237 markings/sec, 170 secs
lola: sara is running 175 secs || 658597 markings, 750437 edges, 4214 markings/sec, 175 secs
lola: sara is running 180 secs || 679595 markings, 775424 edges, 4200 markings/sec, 180 secs
lola: sara is running 185 secs || 700762 markings, 799984 edges, 4233 markings/sec, 185 secs
lola: sara is running 190 secs || 721640 markings, 825310 edges, 4176 markings/sec, 190 secs
lola: sara is running 195 secs || 742702 markings, 850369 edges, 4212 markings/sec, 195 secs
lola: sara is running 200 secs || 763679 markings, 874857 edges, 4195 markings/sec, 200 secs
lola: sara is running 205 secs || 784655 markings, 898708 edges, 4195 markings/sec, 205 secs
lola: sara is running 210 secs || 805561 markings, 922932 edges, 4181 markings/sec, 210 secs
lola: sara is running 215 secs || 826454 markings, 947894 edges, 4179 markings/sec, 215 secs
lola: sara is running 220 secs || 847388 markings, 973166 edges, 4187 markings/sec, 220 secs
lola: sara is running 225 secs || 868640 markings, 997131 edges, 4250 markings/sec, 225 secs
lola: sara is running 230 secs || 889654 markings, 1021714 edges, 4203 markings/sec, 230 secs
lola: sara is running 235 secs || 910727 markings, 1046822 edges, 4215 markings/sec, 235 secs
lola: sara is running 240 secs || 931643 markings, 1071567 edges, 4183 markings/sec, 240 secs
lola: sara is running 245 secs || 952813 markings, 1096125 edges, 4234 markings/sec, 245 secs
lola: sara is running 250 secs || 974257 markings, 1121546 edges, 4289 markings/sec, 250 secs
lola: sara is running 255 secs || 995804 markings, 1146851 edges, 4309 markings/sec, 255 secs
lola: sara is running 260 secs || 1017286 markings, 1171582 edges, 4296 markings/sec, 260 secs
lola: sara is running 265 secs || 1038677 markings, 1196709 edges, 4278 markings/sec, 265 secs
lola: sara is running 270 secs || 1060135 markings, 1222056 edges, 4292 markings/sec, 270 secs
lola: sara is running 275 secs || 1081403 markings, 1247525 edges, 4254 markings/sec, 275 secs
lola: sara is running 280 secs || 1102888 markings, 1272374 edges, 4297 markings/sec, 280 secs
lola: sara is running 285 secs || 1124174 markings, 1297493 edges, 4257 markings/sec, 285 secs
lola: sara is running 290 secs || 1145663 markings, 1323159 edges, 4298 markings/sec, 290 secs
lola: sara is running 295 secs || 1167143 markings, 1349127 edges, 4296 markings/sec, 295 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((IsMonitoring + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8)))
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 2936 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-S04J06T08-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 24727 markings, 25527 edges, 4945 markings/sec, 0 secs
lola: sara is running 5 secs || 49334 markings, 51314 edges, 4921 markings/sec, 5 secs
lola: sara is running 10 secs || 73782 markings, 77095 edges, 4890 markings/sec, 10 secs
lola: sara is running 15 secs || 98141 markings, 103336 edges, 4872 markings/sec, 15 secs
lola: sara is running 20 secs || 122607 markings, 129412 edges, 4893 markings/sec, 20 secs
lola: sara is running 25 secs || 146939 markings, 155975 edges, 4866 markings/sec, 25 secs
lola: sara is running 30 secs || 171167 markings, 182558 edges, 4846 markings/sec, 30 secs
lola: sara is running 35 secs || 195355 markings, 209234 edges, 4838 markings/sec, 35 secs
lola: sara is running 40 secs || 219270 markings, 235727 edges, 4783 markings/sec, 40 secs
lola: sara is running 45 secs || 243363 markings, 262427 edges, 4819 markings/sec, 45 secs
lola: sara is running 50 secs || 267404 markings, 289592 edges, 4808 markings/sec, 50 secs
lola: sara is running 55 secs || 291227 markings, 316175 edges, 4765 markings/sec, 55 secs
lola: sara is running 60 secs || 315238 markings, 342620 edges, 4802 markings/sec, 60 secs
lola: sara is running 65 secs || 339237 markings, 369352 edges, 4800 markings/sec, 65 secs
lola: sara is running 70 secs || 363243 markings, 395595 edges, 4801 markings/sec, 70 secs
lola: sara is running 75 secs || 387022 markings, 422190 edges, 4756 markings/sec, 75 secs
lola: sara is running 80 secs || 410402 markings, 448704 edges, 4676 markings/sec, 80 secs
lola: sara is running 85 secs || 434785 markings, 476273 edges, 4877 markings/sec, 85 secs
lola: sara is running 90 secs || 458876 markings, 503455 edges, 4818 markings/sec, 90 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (((2 <= P_1097) OR (3 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8))))) AND (A (((Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sour... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((P_1097 <= 1) AND (P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= P_1097) OR (3 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8))))
lola: processed formula length: 127
lola: 5 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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 9 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8) U (PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 <= P_2579_4_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8) U (PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 <= P_2579_4_1 + ... (shortened)
lola: processed formula length: 802
lola: 4 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 <= P_1716))))) OR (A (X ((DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 + 1 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8))) OR (A (G ((2 <= DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1))) AND E (G ((P_1113_7 + P_1113_6 + P_1113_5 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 9 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 <= P_1716)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (P_1716 + 1 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8))))
lola: processed formula length: 104
lola: 3 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Wor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_... (shortened)
lola: processed formula length: 3522
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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 11 will run for 528 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((3 <= ORB_Lock) U (1 <= MarkerWrite)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((3 <= ORB_Lock) U (1 <= MarkerWrite)))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_1 + P_1160_2 + P_1160_8 <= P_1095))) U (1 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_1 + P_1160_2 + P_1160_8 <= P_1095)) U (1 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8))
lola: processed formula length: 231
lola: 2 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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: 773821 markings, 1001001 edges, 3225232092371615744 markings/sec, 0 secs
lola: 1506068 markings, 1962073 edges, 146449 markings/sec, 5 secs
lola: 2228413 markings, 2923622 edges, 144469 markings/sec, 10 secs
lola: 2885031 markings, 3835522 edges, 131324 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 872 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8) AND ((3 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8) OR (E (F ((3 <= TryA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 872 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)
lola: processed formula length: 280
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8)
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-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: ========================================
lola: subprocess 15 will run for 2618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8)))
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 2936 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-S04J06T08-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSou... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOf... (shortened)
lola: processed formula length: 488
lola: 3 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 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 15 will run for 2618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((3 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_8_1 + P_1119_8_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_8_1 + P_1119_8_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_8_1 + P_1119_... (shortened)
lola: processed formula length: 858
lola: 1 rewrites
lola: formula mentions 0 of 792 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2936 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: yes unknown yes yes unknown no unknown no no yes no no yes yes no no
lola: ========================================
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T08-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494713041468
--------------------
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-S04J06T08"
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-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 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-S04J06T08, 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-149440870000489"
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 ;