About the Execution of LoLA for S_PolyORBLF-PT-S04J06T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15925.840 | 915830.00 | 1551080.00 | 2903.40 | 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 S_PolyORBLF-PT-S04J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681600489
=====================================================================
--------------------
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 1496476017705
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-PT-S04J06T08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-PT-S04J06T08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_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 || 26831 markings, 29145 edges, 5366 markings/sec, 0 secs
lola: sara is running 5 secs || 53338 markings, 59232 edges, 5301 markings/sec, 5 secs
lola: sara is running 10 secs || 79629 markings, 89761 edges, 5258 markings/sec, 10 secs
lola: sara is running 15 secs || 105588 markings, 120198 edges, 5192 markings/sec, 15 secs
lola: sara is running 20 secs || 131559 markings, 150693 edges, 5194 markings/sec, 20 secs
lola: sara is running 25 secs || 157152 markings, 181636 edges, 5119 markings/sec, 25 secs
lola: sara is running 30 secs || 182597 markings, 211533 edges, 5089 markings/sec, 30 secs
lola: sara is running 35 secs || 208119 markings, 242824 edges, 5104 markings/sec, 35 secs
lola: sara is running 40 secs || 233495 markings, 273446 edges, 5075 markings/sec, 40 secs
lola: sara is running 45 secs || 258864 markings, 304174 edges, 5074 markings/sec, 45 secs
lola: sara is running 50 secs || 284253 markings, 335007 edges, 5078 markings/sec, 50 secs
lola: sara is running 55 secs || 308299 markings, 365481 edges, 4809 markings/sec, 55 secs
lola: sara is running 60 secs || 332225 markings, 395364 edges, 4785 markings/sec, 60 secs
lola: sara is running 65 secs || 356010 markings, 424433 edges, 4757 markings/sec, 65 secs
lola: sara is running 70 secs || 379704 markings, 454311 edges, 4739 markings/sec, 70 secs
lola: sara is running 75 secs || 403813 markings, 483999 edges, 4822 markings/sec, 75 secs
lola: sara is running 80 secs || 427570 markings, 514181 edges, 4751 markings/sec, 80 secs
lola: sara is running 85 secs || 451273 markings, 543446 edges, 4741 markings/sec, 85 secs
lola: sara is running 90 secs || 475031 markings, 573509 edges, 4752 markings/sec, 90 secs
lola: sara is running 95 secs || 498823 markings, 603802 edges, 4758 markings/sec, 95 secs
lola: sara is running 100 secs || 522817 markings, 634531 edges, 4799 markings/sec, 100 secs
lola: sara is running 105 secs || 546451 markings, 663510 edges, 4727 markings/sec, 105 secs
lola: sara is running 110 secs || 570068 markings, 692770 edges, 4723 markings/sec, 110 secs
lola: sara is running 115 secs || 593692 markings, 722729 edges, 4725 markings/sec, 115 secs
lola: sara is running 120 secs || 617371 markings, 752423 edges, 4736 markings/sec, 120 secs
lola: sara is running 125 secs || 640854 markings, 782342 edges, 4697 markings/sec, 125 secs
lola: sara is running 130 secs || 664473 markings, 811486 edges, 4724 markings/sec, 130 secs
lola: sara is running 135 secs || 688026 markings, 841494 edges, 4711 markings/sec, 135 secs
lola: sara is running 140 secs || 711728 markings, 871633 edges, 4740 markings/sec, 140 secs
lola: sara is running 145 secs || 735348 markings, 902454 edges, 4724 markings/sec, 145 secs
lola: sara is running 150 secs || 759074 markings, 932049 edges, 4745 markings/sec, 150 secs
lola: sara is running 155 secs || 782926 markings, 962108 edges, 4770 markings/sec, 155 secs
lola: sara is running 160 secs || 806186 markings, 991968 edges, 4652 markings/sec, 160 secs
lola: sara is running 165 secs || 829922 markings, 1022189 edges, 4747 markings/sec, 165 secs
lola: sara is running 170 secs || 853693 markings, 1052769 edges, 4754 markings/sec, 170 secs
lola: sara is running 175 secs || 877389 markings, 1082862 edges, 4739 markings/sec, 175 secs
lola: sara is running 180 secs || 901118 markings, 1113313 edges, 4746 markings/sec, 180 secs
lola: sara is running 185 secs || 924796 markings, 1143760 edges, 4736 markings/sec, 185 secs
lola: sara is running 190 secs || 948375 markings, 1173961 edges, 4716 markings/sec, 190 secs
lola: sara is running 195 secs || 971981 markings, 1203979 edges, 4721 markings/sec, 195 secs
lola: sara is running 200 secs || 996233 markings, 1235219 edges, 4850 markings/sec, 200 secs
lola: sara is running 205 secs || 1020721 markings, 1266837 edges, 4898 markings/sec, 205 secs
lola: sara is running 210 secs || 1045069 markings, 1298437 edges, 4870 markings/sec, 210 secs
lola: sara is running 215 secs || 1069378 markings, 1329665 edges, 4862 markings/sec, 215 secs
lola: sara is running 220 secs || 1093636 markings, 1360125 edges, 4852 markings/sec, 220 secs
lola: sara is running 225 secs || 1118131 markings, 1391951 edges, 4899 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: 590981 markings, 1038229 edges, 2965665984356024320 markings/sec, 0 secs
lola: 1191780 markings, 2196746 edges, 120160 markings/sec, 5 secs
lola: 1779619 markings, 3333675 edges, 117568 markings/sec, 10 secs
lola: 2329830 markings, 4450284 edges, 110042 markings/sec, 15 secs
lola: 2837414 markings, 5578122 edges, 101517 markings/sec, 20 secs
lola: 3377221 markings, 6521556 edges, 107961 markings/sec, 25 secs
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: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
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: 404773 markings, 976749 edges, 3228173285975916544 markings/sec, 0 secs
lola: 777282 markings, 1916066 edges, 74502 markings/sec, 5 secs
lola: 1130151 markings, 2813969 edges, 70574 markings/sec, 10 secs
lola: 1471884 markings, 3690107 edges, 68347 markings/sec, 15 secs
lola: 1860486 markings, 4543531 edges, 77720 markings/sec, 20 secs
lola: 2253429 markings, 5499945 edges, 78589 markings/sec, 25 secs
lola: 2608472 markings, 6417702 edges, 71009 markings/sec, 30 secs
lola: 2958569 markings, 7300409 edges, 70019 markings/sec, 35 secs
lola: 3285760 markings, 8126551 edges, 65438 markings/sec, 40 secs
lola: 3654617 markings, 8977375 edges, 73771 markings/sec, 45 secs
lola: 4002682 markings, 9793400 edges, 69613 markings/sec, 50 secs
lola: 4307069 markings, 10564402 edges, 60877 markings/sec, 55 secs
lola: 4629423 markings, 11365723 edges, 64471 markings/sec, 60 secs
lola: 4933405 markings, 12149122 edges, 60796 markings/sec, 65 secs
lola: 5234838 markings, 12919935 edges, 60287 markings/sec, 70 secs
lola: 5583542 markings, 13690086 edges, 69741 markings/sec, 75 secs
lola: 5940324 markings, 14530038 edges, 71356 markings/sec, 80 secs
lola: 6251460 markings, 15339531 edges, 62227 markings/sec, 85 secs
lola: 6574374 markings, 16149820 edges, 64583 markings/sec, 90 secs
lola: 6900199 markings, 16975054 edges, 65165 markings/sec, 95 secs
lola: 7227015 markings, 17748573 edges, 65363 markings/sec, 100 secs
lola: 7586233 markings, 18544294 edges, 71844 markings/sec, 105 secs
lola: 7878799 markings, 19313328 edges, 58513 markings/sec, 110 secs
lola: 8188858 markings, 20102196 edges, 62012 markings/sec, 115 secs
lola: 8494624 markings, 20861626 edges, 61153 markings/sec, 120 secs
lola: 8785291 markings, 21609067 edges, 58133 markings/sec, 125 secs
lola: 9119456 markings, 22341654 edges, 66833 markings/sec, 130 secs
lola: 9446962 markings, 23135287 edges, 65501 markings/sec, 135 secs
lola: 9743468 markings, 23904573 edges, 59301 markings/sec, 140 secs
lola: 10053270 markings, 24683389 edges, 61960 markings/sec, 145 secs
lola: 10355675 markings, 25457822 edges, 60481 markings/sec, 150 secs
lola: 10661230 markings, 26165348 edges, 61111 markings/sec, 155 secs
lola: 10997790 markings, 26902446 edges, 67312 markings/sec, 160 secs
lola: 11269575 markings, 27607168 edges, 54357 markings/sec, 165 secs
lola: 11544106 markings, 28321875 edges, 54906 markings/sec, 170 secs
lola: 11830029 markings, 29045953 edges, 57185 markings/sec, 175 secs
lola: 12108416 markings, 29748634 edges, 55677 markings/sec, 180 secs
lola: 12398073 markings, 30422209 edges, 57931 markings/sec, 185 secs
lola: 12741309 markings, 31186555 edges, 68647 markings/sec, 190 secs
lola: 13055852 markings, 32012551 edges, 62909 markings/sec, 195 secs
lola: 13374566 markings, 32831922 edges, 63743 markings/sec, 200 secs
lola: 13688831 markings, 33605936 edges, 62853 markings/sec, 205 secs
lola: 13988163 markings, 34376428 edges, 59866 markings/sec, 210 secs
lola: 14330355 markings, 35124364 edges, 68438 markings/sec, 215 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: subprocess 6 will run for 304 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: ========================================
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 || 21673 markings, 24151 edges, 4335 markings/sec, 0 secs
lola: sara is running 5 secs || 43916 markings, 48781 edges, 4449 markings/sec, 5 secs
lola: sara is running 10 secs || 66250 markings, 74206 edges, 4467 markings/sec, 10 secs
lola: sara is running 15 secs || 88537 markings, 98598 edges, 4457 markings/sec, 15 secs
lola: sara is running 20 secs || 110822 markings, 123754 edges, 4457 markings/sec, 20 secs
lola: sara is running 25 secs || 132874 markings, 149996 edges, 4410 markings/sec, 25 secs
lola: sara is running 30 secs || 154970 markings, 175015 edges, 4419 markings/sec, 30 secs
lola: sara is running 35 secs || 177103 markings, 199621 edges, 4427 markings/sec, 35 secs
lola: sara is running 40 secs || 199326 markings, 224778 edges, 4445 markings/sec, 40 secs
lola: sara is running 45 secs || 221561 markings, 249371 edges, 4447 markings/sec, 45 secs
lola: sara is running 50 secs || 244053 markings, 274209 edges, 4498 markings/sec, 50 secs
lola: sara is running 55 secs || 266064 markings, 298799 edges, 4402 markings/sec, 55 secs
lola: sara is running 60 secs || 288109 markings, 323861 edges, 4409 markings/sec, 60 secs
lola: sara is running 65 secs || 310288 markings, 349048 edges, 4436 markings/sec, 65 secs
lola: sara is running 70 secs || 332292 markings, 374972 edges, 4401 markings/sec, 70 secs
lola: sara is running 75 secs || 354519 markings, 400191 edges, 4445 markings/sec, 75 secs
lola: sara is running 80 secs || 376772 markings, 425527 edges, 4451 markings/sec, 80 secs
lola: sara is running 85 secs || 398902 markings, 451282 edges, 4426 markings/sec, 85 secs
lola: sara is running 90 secs || 420782 markings, 476488 edges, 4376 markings/sec, 90 secs
lola: sara is running 95 secs || 443068 markings, 501765 edges, 4457 markings/sec, 95 secs
lola: sara is running 100 secs || 465143 markings, 527110 edges, 4415 markings/sec, 100 secs
lola: sara is running 105 secs || 487156 markings, 552658 edges, 4403 markings/sec, 105 secs
lola: sara is running 110 secs || 508998 markings, 579057 edges, 4368 markings/sec, 110 secs
lola: sara is running 115 secs || 531143 markings, 605057 edges, 4429 markings/sec, 115 secs
lola: sara is running 120 secs || 553554 markings, 630516 edges, 4482 markings/sec, 120 secs
lola: sara is running 125 secs || 575812 markings, 655574 edges, 4452 markings/sec, 125 secs
lola: sara is running 130 secs || 598007 markings, 681553 edges, 4439 markings/sec, 130 secs
lola: sara is running 135 secs || 620142 markings, 706188 edges, 4427 markings/sec, 135 secs
lola: sara is running 140 secs || 642228 markings, 731308 edges, 4417 markings/sec, 140 secs
lola: sara is running 145 secs || 664304 markings, 757542 edges, 4415 markings/sec, 145 secs
lola: sara is running 150 secs || 686402 markings, 783343 edges, 4420 markings/sec, 150 secs
lola: sara is running 155 secs || 708562 markings, 809429 edges, 4432 markings/sec, 155 secs
lola: sara is running 160 secs || 730517 markings, 835660 edges, 4391 markings/sec, 160 secs
lola: sara is running 165 secs || 752517 markings, 861991 edges, 4400 markings/sec, 165 secs
lola: sara is running 170 secs || 774576 markings, 887123 edges, 4412 markings/sec, 170 secs
lola: sara is running 175 secs || 796474 markings, 912583 edges, 4380 markings/sec, 175 secs
lola: sara is running 180 secs || 818344 markings, 938299 edges, 4374 markings/sec, 180 secs
lola: sara is running 185 secs || 840353 markings, 964429 edges, 4402 markings/sec, 185 secs
lola: sara is running 190 secs || 862447 markings, 990033 edges, 4419 markings/sec, 190 secs
lola: sara is running 195 secs || 884637 markings, 1015531 edges, 4438 markings/sec, 195 secs
lola: sara is running 200 secs || 906660 markings, 1042156 edges, 4405 markings/sec, 200 secs
lola: sara is running 205 secs || 928589 markings, 1067981 edges, 4386 markings/sec, 205 secs
lola: sara is running 210 secs || 950765 markings, 1093621 edges, 4435 markings/sec, 210 secs
lola: sara is running 215 secs || 972707 markings, 1119708 edges, 4388 markings/sec, 215 secs
lola: sara is running 220 secs || 994796 markings, 1145698 edges, 4418 markings/sec, 220 secs
lola: sara is running 225 secs || 1016863 markings, 1171081 edges, 4413 markings/sec, 225 secs
lola: sara is running 230 secs || 1038825 markings, 1196889 edges, 4392 markings/sec, 230 secs
lola: sara is running 235 secs || 1060876 markings, 1222943 edges, 4410 markings/sec, 235 secs
lola: sara is running 240 secs || 1082792 markings, 1249072 edges, 4383 markings/sec, 240 secs
lola: sara is running 245 secs || 1104854 markings, 1274631 edges, 4412 markings/sec, 245 secs
lola: sara is running 250 secs || 1126756 markings, 1300549 edges, 4380 markings/sec, 250 secs
lola: sara is running 255 secs || 1148718 markings, 1326578 edges, 4392 markings/sec, 255 secs
lola: sara is running 260 secs || 1170644 markings, 1353251 edges, 4385 markings/sec, 260 secs
lola: sara is running 265 secs || 1192283 markings, 1378799 edges, 4328 markings/sec, 265 secs
lola: sara is running 270 secs || 1214033 markings, 1404557 edges, 4350 markings/sec, 270 secs
lola: sara is running 275 secs || 1235754 markings, 1430168 edges, 4344 markings/sec, 275 secs
lola: sara is running 280 secs || 1257559 markings, 1455636 edges, 4361 markings/sec, 280 secs
lola: sara is running 285 secs || 1279446 markings, 1481151 edges, 4377 markings/sec, 285 secs
lola: sara is running 290 secs || 1300891 markings, 1506834 edges, 4289 markings/sec, 290 secs
lola: sara is running 295 secs || 1322764 markings, 1532568 edges, 4375 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 || 24225 markings, 25005 edges, 4845 markings/sec, 0 secs
lola: sara is running 5 secs || 48805 markings, 50765 edges, 4916 markings/sec, 5 secs
lola: sara is running 10 secs || 73237 markings, 76499 edges, 4886 markings/sec, 10 secs
lola: sara is running 15 secs || 97558 markings, 102735 edges, 4864 markings/sec, 15 secs
lola: sara is running 20 secs || 121980 markings, 128758 edges, 4884 markings/sec, 20 secs
lola: sara is running 25 secs || 146279 markings, 155221 edges, 4860 markings/sec, 25 secs
lola: sara is running 30 secs || 170437 markings, 181772 edges, 4832 markings/sec, 30 secs
lola: sara is running 35 secs || 194615 markings, 208401 edges, 4836 markings/sec, 35 secs
lola: sara is running 40 secs || 218844 markings, 235279 edges, 4846 markings/sec, 40 secs
lola: sara is running 45 secs || 242657 markings, 261644 edges, 4763 markings/sec, 45 secs
lola: sara is running 50 secs || 266876 markings, 289016 edges, 4844 markings/sec, 50 secs
lola: sara is running 55 secs || 290963 markings, 315895 edges, 4817 markings/sec, 55 secs
lola: sara is running 60 secs || 315203 markings, 342583 edges, 4848 markings/sec, 60 secs
lola: sara is running 65 secs || 339650 markings, 369806 edges, 4889 markings/sec, 65 secs
lola: sara is running 70 secs || 363400 markings, 395766 edges, 4750 markings/sec, 70 secs
lola: sara is running 75 secs || 386792 markings, 421943 edges, 4678 markings/sec, 75 secs
lola: sara is running 80 secs || 410112 markings, 448340 edges, 4664 markings/sec, 80 secs
lola: sara is running 85 secs || 433514 markings, 474816 edges, 4680 markings/sec, 85 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 378 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: ========================================
lola: subprocess 9 will run for 378 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: subprocess 9 will run for 378 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 441 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 529 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 661 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: 781135 markings, 1011402 edges, 3225232092371615744 markings/sec, 0 secs
lola: 1521608 markings, 1982092 edges, 148095 markings/sec, 5 secs
lola: 2247224 markings, 2948395 edges, 145123 markings/sec, 10 secs
lola: 2912916 markings, 3871661 edges, 133138 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 874 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 874 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 1312 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 2624 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 1312 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 1312 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: subprocess 15 will run for 2624 seconds at most (--localtimelimit=-1)
lola: ========================================
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 2624 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 1496476933535
--------------------
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="S_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/S_PolyORBLF-PT-S04J06T08.tgz
mv S_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 S_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 r128-smll-149441681600489"
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 ;