About the Execution of LoLA for S_PolyORBLF-PT-S04J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15951.910 | 1102398.00 | 1531218.00 | 3462.80 | ?F?TFFFTFFFFT??T | 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-S04J06T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681600498
=====================================================================
--------------------
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-S04J06T10-CTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S04J06T10-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496479874744
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-PT-S04J06T10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-PT-S04J06T10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBLF-PT-S04J06T10 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 6320/65536 symbol table entries, 1503 collisions
lola: preprocessing...
lola: finding significant places
lola: 966 places, 5354 transitions, 904 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3657 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: NOT(A (F (((1 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9) OR (1 <= FetchJobB_10 + FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8 + FetchJobB_9) OR (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4))))) : E (F (((1 <= MarkerWrite) AND (cJobCnt <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10)))) : ((2 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_10_1 + P_1119_10_2 + P_1119_10_3 + P_1119_10_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 + P_1119_9_1 + P_1119_9_2 + P_1119_9_3 + P_1119_9_4) OR A (G ((((1 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 + Abort_Check_Sources_B_9 + Abort_Check_Sources_B_10) AND (P_1095 <= IsMonitoring)) OR (nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9 <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + P_2318_9 + P_2318_10))))) : A ((((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= 2) AND (ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 + ScheduleTaskE_Check_9 + ScheduleTaskE_Check_10 <= 1)) U ((2 <= P_1716) AND (1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6 + QueueJobB_10_0 + QueueJobB_10_1 + QueueJobB_10_2 + QueueJobB_10_3 + QueueJobB_10_4 + QueueJobB_10_5 + QueueJobB_10_6 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_7_5 + QueueJobB_7_6 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_8_5 + QueueJobB_8_6 + QueueJobB_9_0 + QueueJobB_9_1 + QueueJobB_9_2 + QueueJobB_9_3 + QueueJobB_9_4 + QueueJobB_9_5 + QueueJobB_9_6) AND (IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10 <= 0)))) : NOT(E (G (A (X ((2 <= IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10)))))) : (E (G (A (G ((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= EnablePollingB_10 + EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + EnablePollingB_9))))) AND (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 + Try_Check_Sources_E_9 + Try_Check_Sources_E_10 + 1 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)) : ((3 <= 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_10_1 + P_2579_10_2 + P_2579_10_3 + P_2579_10_4 + P_2579_9_1 + P_2579_9_2 + P_2579_9_3 + P_2579_9_4 + P_2579_3_3 + P_2579_3_2 + P_2579_3_1 + 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_4) OR ((1 <= 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_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_9_1 + DisablePollingB_9_2 + DisablePollingB_9_3 + DisablePollingB_9_4 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_10_1 + DisablePollingB_10_2 + DisablePollingB_10_3 + DisablePollingB_10_4) OR E (G ((P_1160_10 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8 + P_1160_9 <= 1))))) : NOT(A (G (((P_1093 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10) OR (MarkerRead <= BlockedTasks) OR ((3 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8 + NotifyEventEndOfCheckSourcesB_9 + NotifyEventEndOfCheckSourcesB_10) 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 + ScheduleTaskE_Idle_9 + ScheduleTaskE_Idle_10)))))) : A (F (NOT(A (F ((1 <= NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9)))))) : NOT((A (G ((ScheduleTaskE_Work_10_0 + ScheduleTaskE_Work_10_1 + ScheduleTaskE_Work_10_2 + ScheduleTaskE_Work_10_3 + ScheduleTaskE_Work_10_4 + ScheduleTaskE_Work_10_5 + ScheduleTaskE_Work_10_6 + 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 + ScheduleTaskE_Work_9_0 + ScheduleTaskE_Work_9_1 + ScheduleTaskE_Work_9_2 + ScheduleTaskE_Work_9_3 + ScheduleTaskE_Work_9_4 + ScheduleTaskE_Work_9_5 + ScheduleTaskE_Work_9_6 <= 0))) AND ((((2 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9) AND (NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8 + NotifyEventEndOfCheckSourcesB_9 + NotifyEventEndOfCheckSourcesB_10 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)) OR (3 <= cBlockedTasks)) AND ((P_1727 <= DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) OR (IsMonitoring + 1 <= PollingAbort))))) : NOT((E (F (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= MarkerWrite) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10)))) AND NOT(E (G ((1 <= cPollingAbort)))))) : (E (F (E (G ((P_1159_10 + P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + P_1159_9 <= NotifyEventJobCompletedE_10 + NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + NotifyEventJobCompletedE_9))))) AND E ((((3 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6 + QueueJobB_10_0 + QueueJobB_10_1 + QueueJobB_10_2 + QueueJobB_10_3 + QueueJobB_10_4 + QueueJobB_10_5 + QueueJobB_10_6 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_7_5 + QueueJobB_7_6 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_8_5 + QueueJobB_8_6 + QueueJobB_9_0 + QueueJobB_9_1 + QueueJobB_9_2 + QueueJobB_9_3 + QueueJobB_9_4 + QueueJobB_9_5 + QueueJobB_9_6) 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 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10)) U (ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 <= 1)))) : A (F (((2 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9) OR A (G ((P_1717 <= SigAbort)))))) : A (F (((3 <= ScheduleTaskE_Work_10_0 + ScheduleTaskE_Work_10_1 + ScheduleTaskE_Work_10_2 + ScheduleTaskE_Work_10_3 + ScheduleTaskE_Work_10_4 + ScheduleTaskE_Work_10_5 + ScheduleTaskE_Work_10_6 + 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 + ScheduleTaskE_Work_9_0 + ScheduleTaskE_Work_9_1 + ScheduleTaskE_Work_9_2 + ScheduleTaskE_Work_9_3 + ScheduleTaskE_Work_9_4 + ScheduleTaskE_Work_9_5 + ScheduleTaskE_Work_9_6) AND ((1 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_10_1 + P_1119_10_2 + P_1119_10_3 + P_1119_10_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 + P_1119_9_1 + P_1119_9_2 + P_1119_9_3 + P_1119_9_4) OR (NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)) AND (TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 + TryAllocateOneTaskB_9 + TryAllocateOneTaskB_10 <= P_1726)))) : A (F ((1 <= P_1093))) : E (F (A (G ((P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_10_1 + P_1119_10_2 + P_1119_10_3 + P_1119_10_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 + P_1119_9_1 + P_1119_9_2 + P_1119_9_3 + P_1119_9_4 + 1 <= cPollingAbort)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((1 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9) OR (1 <= FetchJobB_10 + FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8 + FetchJobB_9) OR (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9) OR (1 <= FetchJobB_10 + FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8 + FetchJobB_9) OR (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4))))
lola: processed formula length: 349
lola: 5 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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: 390738 markings, 609400 edges, 3687537974066544640 markings/sec, 0 secs
lola: 752715 markings, 1167905 edges, 72395 markings/sec, 5 secs
lola: 1105086 markings, 1720523 edges, 70474 markings/sec, 10 secs
lola: 1459770 markings, 2277424 edges, 70937 markings/sec, 15 secs
lola: 1812597 markings, 2833706 edges, 70565 markings/sec, 20 secs
lola: 2164288 markings, 3397083 edges, 70338 markings/sec, 25 secs
lola: 2519680 markings, 3959797 edges, 71078 markings/sec, 30 secs
lola: 2876503 markings, 4528336 edges, 71365 markings/sec, 35 secs
lola: 3227695 markings, 5094391 edges, 70238 markings/sec, 40 secs
lola: 3574922 markings, 5637682 edges, 69445 markings/sec, 45 secs
lola: 3928097 markings, 6181987 edges, 70635 markings/sec, 50 secs
lola: 4281566 markings, 6735689 edges, 70694 markings/sec, 55 secs
lola: 4628359 markings, 7289500 edges, 69359 markings/sec, 60 secs
lola: 4984812 markings, 7849326 edges, 71291 markings/sec, 65 secs
lola: 5343001 markings, 8424020 edges, 71638 markings/sec, 70 secs
lola: 5695385 markings, 8979601 edges, 70477 markings/sec, 75 secs
lola: 6040495 markings, 9536002 edges, 69022 markings/sec, 80 secs
lola: 6388324 markings, 10098981 edges, 69566 markings/sec, 85 secs
lola: 6737752 markings, 10629793 edges, 69886 markings/sec, 90 secs
lola: 7087429 markings, 11178910 edges, 69935 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= MarkerWrite) AND (cJobCnt <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10))))
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 3616 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-S04J06T10-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-CTLCardinality.sara.
lola: sara is running 0 secs || 15017 markings, 15995 edges, 3003 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 29933 markings, 32217 edges, 2983 markings/sec, 5 secs
lola: sara is running 10 secs || 44844 markings, 48850 edges, 2982 markings/sec, 10 secs
lola: sara is running 15 secs || 59749 markings, 65364 edges, 2981 markings/sec, 15 secs
lola: sara is running 20 secs || 74648 markings, 82157 edges, 2980 markings/sec, 20 secs
lola: sara is running 25 secs || 89566 markings, 98856 edges, 2984 markings/sec, 25 secs
lola: sara is running 30 secs || 104468 markings, 115703 edges, 2980 markings/sec, 30 secs
lola: sara is running 35 secs || 119345 markings, 132593 edges, 2975 markings/sec, 35 secs
lola: sara is running 40 secs || 134236 markings, 149729 edges, 2978 markings/sec, 40 secs
lola: sara is running 45 secs || 149101 markings, 166855 edges, 2973 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_10_1 + P_1119_10_2 + P_1119_10_3 + P_1119_10_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 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_10_1 + P_1119_10_2 + P_1119_10_3 + P_1119_10_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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_10_1 + P_1119_10_2 + P_1119_10_3 + P_1119_10_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 + ... (shortened)
lola: processed formula length: 528
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-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 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 + Abort_Check_Sources_B_9 + Abort_Check_Sources_B_10) AND (P_1095 <= IsMonitoring)) OR (nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9 <= P_2318_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S04J06T10-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= 2) AND (ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 + ScheduleTaskE_Check_9 + ScheduleTaskE_Check_10 <= 1)) U ((2 <= P_1716) AND (1 <= QueueJobB_1_0 + QueueJobB_1_1 + Que... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= 2) AND (ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 + ScheduleTaskE_Check_9 + ScheduleTaskE_Check_10 <= 1)) U ((2 <= P_1716) AND (1 <= QueueJobB_1_0 + QueueJobB_1_1 + Queue... (shortened)
lola: processed formula length: 1640
lola: 1 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (X ((2 <= IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10 <= 1)))
lola: processed formula length: 159
lola: 7 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (G ((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= EnablePollingB_10 + EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePol... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= EnablePollingB_10 + EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePoll... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (EnablePollingB_10 + EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + EnablePollingB_9 + 1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 +... (shortened)
lola: processed formula length: 481
lola: 4 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((3 <= 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_10_1 + P_2579_10_2 + P_2579_10_3 + P_2579_10_4 + P_2579_9_1 + P_2579_9_2 + P_2579_9_3 + P_2579_9_4 + P_2579_3_3 + P_2579_3_2 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= 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_10_1 + P_2579_10_2 + P_2579_10_3 + P_2579_10_4 + P_2579_9_1 + P_2579_9_2 + P_2579_9_3 + P_2579_9_4 + P_2579_3_3 + P_2579_3_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= 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_10_1 + P_2579_10_2 + P_2579_10_3 + P_2579_10_4 + P_2579_9_1 + P_2579_9_2 + P_2579_9_3 + P_2579_9_4 + P_2579_3_3 + P_2579_3_2 + ... (shortened)
lola: processed formula length: 528
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-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 7 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= 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_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_9_1 + DisablePollingB_9_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= 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_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_9_1 + DisablePollingB_9_2 ... (shortened)
lola: processed formula length: 888
lola: 0 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-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 8 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((P_1160_10 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8 + P_1160_9 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= P_1160_10 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8 + P_1160_9)))
lola: processed formula length: 130
lola: 2 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((P_1093 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10) OR (MarkerRead <= BlockedTasks) OR ((3 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfChec... (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 3616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S04J06T10-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-CTLCardinality-7.sara.
lola: sara is running 0 secs || 15280 markings, 15749 edges, 3056 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 30519 markings, 31848 edges, 3048 markings/sec, 5 secs
lola: sara is running 10 secs || 46117 markings, 48614 edges, 3120 markings/sec, 10 secs
lola: sara is running 15 secs || 62013 markings, 65947 edges, 3179 markings/sec, 15 secs
lola: sara is running 20 secs || 77868 markings, 83013 edges, 3171 markings/sec, 20 secs
lola: sara is running 25 secs || 93688 markings, 100306 edges, 3164 markings/sec, 25 secs
lola: sara is running 30 secs || 109552 markings, 117569 edges, 3173 markings/sec, 30 secs
lola: sara is running 35 secs || 125475 markings, 134853 edges, 3185 markings/sec, 35 secs
lola: sara is running 40 secs || 141259 markings, 152750 edges, 3157 markings/sec, 40 secs
lola: sara is running 45 secs || 156982 markings, 170336 edges, 3145 markings/sec, 45 secs
lola: sara is running 50 secs || 172780 markings, 188194 edges, 3160 markings/sec, 50 secs
lola: sara is running 55 secs || 188594 markings, 205961 edges, 3163 markings/sec, 55 secs
lola: sara is running 60 secs || 204369 markings, 223363 edges, 3155 markings/sec, 60 secs
lola: sara is running 65 secs || 220205 markings, 240959 edges, 3167 markings/sec, 65 secs
lola: sara is running 70 secs || 236025 markings, 258556 edges, 3164 markings/sec, 70 secs
lola: sara is running 75 secs || 251812 markings, 276387 edges, 3157 markings/sec, 75 secs
lola: sara is running 80 secs || 267545 markings, 294280 edges, 3147 markings/sec, 80 secs
lola: sara is running 85 secs || 283347 markings, 311958 edges, 3160 markings/sec, 85 secs
lola: sara is running 90 secs || 299100 markings, 330318 edges, 3151 markings/sec, 90 secs
lola: sara is running 95 secs || 314872 markings, 348633 edges, 3154 markings/sec, 95 secs
lola: sara is running 100 secs || 330553 markings, 367224 edges, 3136 markings/sec, 100 secs
lola: sara is running 105 secs || 346284 markings, 385407 edges, 3146 markings/sec, 105 secs
lola: sara is running 110 secs || 362024 markings, 403659 edges, 3148 markings/sec, 110 secs
lola: sara is running 115 secs || 377755 markings, 421464 edges, 3146 markings/sec, 115 secs
lola: sara is running 120 secs || 393510 markings, 439162 edges, 3151 markings/sec, 120 secs
lola: sara is running 125 secs || 409286 markings, 456996 edges, 3155 markings/sec, 125 secs
lola: sara is running 130 secs || 425018 markings, 475059 edges, 3146 markings/sec, 130 secs
lola: sara is running 135 secs || 440525 markings, 494661 edges, 3101 markings/sec, 135 secs
lola: sara is running 140 secs || 456266 markings, 512718 edges, 3148 markings/sec, 140 secs
lola: sara is running 145 secs || 471986 markings, 531193 edges, 3144 markings/sec, 145 secs
lola: sara is running 150 secs || 487739 markings, 549076 edges, 3151 markings/sec, 150 secs
lola: sara is running 155 secs || 503432 markings, 566756 edges, 3139 markings/sec, 155 secs
lola: sara is running 160 secs || 519225 markings, 584927 edges, 3159 markings/sec, 160 secs
lola: sara is running 165 secs || 534921 markings, 603119 edges, 3139 markings/sec, 165 secs
lola: sara is running 170 secs || 550626 markings, 621665 edges, 3141 markings/sec, 170 secs
lola: sara is running 175 secs || 566340 markings, 640100 edges, 3143 markings/sec, 175 secs
lola: sara is running 180 secs || 582106 markings, 658437 edges, 3153 markings/sec, 180 secs
lola: sara is running 185 secs || 597794 markings, 677256 edges, 3138 markings/sec, 185 secs
lola: sara is running 190 secs || 613526 markings, 695726 edges, 3146 markings/sec, 190 secs
lola: sara is running 195 secs || 629136 markings, 714228 edges, 3122 markings/sec, 195 secs
lola: sara is running 200 secs || 644889 markings, 732417 edges, 3151 markings/sec, 200 secs
lola: sara is running 205 secs || 660609 markings, 750603 edges, 3144 markings/sec, 205 secs
lola: sara is running 210 secs || 676274 markings, 769119 edges, 3133 markings/sec, 210 secs
lola: sara is running 215 secs || 691956 markings, 787631 edges, 3136 markings/sec, 215 secs
lola: sara is running 220 secs || 707603 markings, 806016 edges, 3129 markings/sec, 220 secs
lola: sara is running 225 secs || 723296 markings, 824337 edges, 3139 markings/sec, 225 secs
lola: sara is running 230 secs || 738934 markings, 842951 edges, 3128 markings/sec, 230 secs
lola: sara is running 235 secs || 754537 markings, 861186 edges, 3121 markings/sec, 235 secs
lola: sara is running 240 secs || 770136 markings, 879172 edges, 3120 markings/sec, 240 secs
lola: sara is running 245 secs || 785707 markings, 897845 edges, 3114 markings/sec, 245 secs
lola: sara is running 250 secs || 801261 markings, 916137 edges, 3111 markings/sec, 250 secs
lola: sara is running 255 secs || 816793 markings, 934553 edges, 3106 markings/sec, 255 secs
lola: sara is running 260 secs || 832372 markings, 953175 edges, 3116 markings/sec, 260 secs
lola: sara is running 265 secs || 847943 markings, 971906 edges, 3114 markings/sec, 265 secs
lola: sara is running 270 secs || 863535 markings, 991295 edges, 3118 markings/sec, 270 secs
lola: sara is running 275 secs || 879132 markings, 1009547 edges, 3119 markings/sec, 275 secs
lola: sara is running 280 secs || 894700 markings, 1028093 edges, 3114 markings/sec, 280 secs
lola: sara is running 285 secs || 910164 markings, 1046620 edges, 3093 markings/sec, 285 secs
lola: sara is running 290 secs || 925747 markings, 1065439 edges, 3117 markings/sec, 290 secs
lola: sara is running 295 secs || 941230 markings, 1084352 edges, 3097 markings/sec, 295 secs
lola: sara is running 300 secs || 956843 markings, 1102597 edges, 3123 markings/sec, 300 secs
lola: sara is running 305 secs || 972412 markings, 1121307 edges, 3114 markings/sec, 305 secs
lola: sara is running 310 secs || 987965 markings, 1139984 edges, 3111 markings/sec, 310 secs
lola: sara is running 315 secs || 1003445 markings, 1158553 edges, 3096 markings/sec, 315 secs
lola: sara is running 320 secs || 1019021 markings, 1177131 edges, 3115 markings/sec, 320 secs
lola: sara is running 325 secs || 1034600 markings, 1195904 edges, 3116 markings/sec, 325 secs
lola: sara is running 330 secs || 1050204 markings, 1214269 edges, 3121 markings/sec, 330 secs
lola: sara is running 335 secs || 1065723 markings, 1232953 edges, 3104 markings/sec, 335 secs
lola: sara is running 340 secs || 1081279 markings, 1252051 edges, 3111 markings/sec, 340 secs
lola: sara is running 345 secs || 1096814 markings, 1271014 edges, 3107 markings/sec, 345 secs
lola: sara is running 350 secs || 1112400 markings, 1289699 edges, 3117 markings/sec, 350 secs
lola: sara is running 355 secs || 1127970 markings, 1308653 edges, 3114 markings/sec, 355 secs
lola: sara is running 360 secs || 1143578 markings, 1327396 edges, 3122 markings/sec, 360 secs
lola: sara is running 365 secs || 1159146 markings, 1345950 edges, 3114 markings/sec, 365 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((1 <= NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9))))
lola: processed formula length: 320
lola: 6 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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: 377398 markings, 924287 edges, 3067841400901992448 markings/sec, 0 secs
lola: 729094 markings, 1843456 edges, 70339 markings/sec, 5 secs
lola: 1114403 markings, 2796665 edges, 77062 markings/sec, 10 secs
lola: 1477715 markings, 3739323 edges, 72662 markings/sec, 15 secs
lola: 1844864 markings, 4659313 edges, 73430 markings/sec, 20 secs
lola: 2209468 markings, 5599292 edges, 72921 markings/sec, 25 secs
lola: 2567142 markings, 6527108 edges, 71535 markings/sec, 30 secs
lola: 2938303 markings, 7462703 edges, 74232 markings/sec, 35 secs
lola: 3310388 markings, 8442945 edges, 74417 markings/sec, 40 secs
lola: 3693748 markings, 9413167 edges, 76672 markings/sec, 45 secs
lola: 4055866 markings, 10381497 edges, 72424 markings/sec, 50 secs
lola: 4407625 markings, 11320720 edges, 70352 markings/sec, 55 secs
lola: 4753007 markings, 12259308 edges, 69076 markings/sec, 60 secs
lola: 5093434 markings, 13210548 edges, 68085 markings/sec, 65 secs
lola: 5464257 markings, 14054268 edges, 74165 markings/sec, 70 secs
lola: 5845602 markings, 14748138 edges, 76269 markings/sec, 75 secs
lola: 6075014 markings, 15226321 edges, 45882 markings/sec, 80 secs
lola: 6263153 markings, 15832768 edges, 37628 markings/sec, 85 secs
lola: 6446581 markings, 16429681 edges, 36686 markings/sec, 90 secs
lola: 6629387 markings, 17030094 edges, 36561 markings/sec, 95 secs
lola: 6812399 markings, 17649332 edges, 36602 markings/sec, 100 secs
lola: 7005192 markings, 18271586 edges, 38559 markings/sec, 105 secs
lola: 7189254 markings, 18881113 edges, 36812 markings/sec, 110 secs
lola: 7368593 markings, 19500413 edges, 35868 markings/sec, 115 secs
lola: 7559110 markings, 20114982 edges, 38103 markings/sec, 120 secs
lola: 7746062 markings, 20724242 edges, 37390 markings/sec, 125 secs
lola: 7925950 markings, 21348663 edges, 35978 markings/sec, 130 secs
lola: 8118834 markings, 21969380 edges, 38577 markings/sec, 135 secs
lola: 8301266 markings, 22571151 edges, 36486 markings/sec, 140 secs
lola: 8481993 markings, 23189251 edges, 36145 markings/sec, 145 secs
lola: 8670522 markings, 23799329 edges, 37706 markings/sec, 150 secs
lola: 8859603 markings, 24414230 edges, 37816 markings/sec, 155 secs
lola: 9039493 markings, 25038516 edges, 35978 markings/sec, 160 secs
lola: 9223691 markings, 25645801 edges, 36840 markings/sec, 165 secs
lola: 9400404 markings, 26249846 edges, 35343 markings/sec, 170 secs
lola: 9589165 markings, 26859104 edges, 37752 markings/sec, 175 secs
lola: 9775369 markings, 27481224 edges, 37241 markings/sec, 180 secs
lola: 9951172 markings, 28089825 edges, 35161 markings/sec, 185 secs
lola: 10122320 markings, 28682289 edges, 34230 markings/sec, 190 secs
lola: 10293122 markings, 29279638 edges, 34160 markings/sec, 195 secs
lola: 10468082 markings, 29871011 edges, 34992 markings/sec, 200 secs
lola: 10638623 markings, 30471938 edges, 34108 markings/sec, 205 secs
lola: 10810342 markings, 31062753 edges, 34344 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G ((ScheduleTaskE_Work_10_0 + ScheduleTaskE_Work_10_1 + ScheduleTaskE_Work_10_2 + ScheduleTaskE_Work_10_3 + ScheduleTaskE_Work_10_4 + ScheduleTaskE_Work_10_5 + ScheduleTaskE_Work_10_6 + 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 + Schedu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= ScheduleTaskE_Work_10_0 + ScheduleTaskE_Work_10_1 + ScheduleTaskE_Work_10_2 + ScheduleTaskE_Work_10_3 + ScheduleTaskE_Work_10_4 + ScheduleTaskE_Work_10_5 + ScheduleTaskE_Work_10_6 + 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 + Schedu... (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 3616 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-S04J06T10-CTLCardinality-9.sara
lola: state equation: calling and running 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 10 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= MarkerWrite) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((MarkerWrite + 1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10) OR (AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + Awa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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-S04J06T10-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-CTLCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= cPollingAbort)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (cPollingAbort <= 0)))
lola: processed formula length: 35
lola: 12 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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: 428636 markings, 717198 edges, 3225232092371615744 markings/sec, 0 secs
lola: 843902 markings, 1427880 edges, 83053 markings/sec, 5 secs
lola: 1253085 markings, 2125235 edges, 81837 markings/sec, 10 secs
lola: 1655526 markings, 2811005 edges, 80488 markings/sec, 15 secs
lola: 2053162 markings, 3507841 edges, 79527 markings/sec, 20 secs
lola: 2457156 markings, 4209521 edges, 80799 markings/sec, 25 secs
lola: 2856115 markings, 4899006 edges, 79792 markings/sec, 30 secs
lola: 3244087 markings, 5582631 edges, 77594 markings/sec, 35 secs
lola: 3635323 markings, 6272422 edges, 78247 markings/sec, 40 secs
lola: 4022049 markings, 6961146 edges, 77345 markings/sec, 45 secs
lola: 4404272 markings, 7640658 edges, 76445 markings/sec, 50 secs
lola: 4793979 markings, 8340244 edges, 77941 markings/sec, 55 secs
lola: 5188188 markings, 9044630 edges, 78842 markings/sec, 60 secs
lola: 5567144 markings, 9746052 edges, 75791 markings/sec, 65 secs
lola: 5936619 markings, 10389777 edges, 73895 markings/sec, 70 secs
lola: 6299421 markings, 10916002 edges, 72560 markings/sec, 75 secs
lola: 6686232 markings, 11581921 edges, 77362 markings/sec, 80 secs
lola: 7071524 markings, 12242509 edges, 77058 markings/sec, 85 secs
lola: 7460708 markings, 12917904 edges, 77837 markings/sec, 90 secs
lola: 7865010 markings, 13707883 edges, 80860 markings/sec, 95 secs
lola: 8274473 markings, 14466816 edges, 81893 markings/sec, 100 secs
lola: 8674510 markings, 15185138 edges, 80007 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 11 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((P_1159_10 + P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + P_1159_9 <= NotifyEventJobCompletedE_10 + NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + NotifyEventJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((P_1159_10 + P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + P_1159_9 <= NotifyEventJobCompletedE_10 + NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + NotifyEventJo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (NotifyEventJobCompletedE_10 + NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + NotifyEventJobCompletedE_9 + 1 <= P_1159_10 + P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1... (shortened)
lola: processed formula length: 431
lola: 3 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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: 493887 markings, 1019363 edges, 2317034113439105024 markings/sec, 0 secs
lola: 991740 markings, 2057747 edges, 99571 markings/sec, 5 secs
lola: 1481145 markings, 3076879 edges, 97881 markings/sec, 10 secs
lola: 1966521 markings, 4095416 edges, 97075 markings/sec, 15 secs
lola: 2457519 markings, 5139870 edges, 98200 markings/sec, 20 secs
lola: 2952761 markings, 6168624 edges, 99048 markings/sec, 25 secs
lola: 3441206 markings, 7183933 edges, 97689 markings/sec, 30 secs
lola: 3923455 markings, 8186660 edges, 96450 markings/sec, 35 secs
lola: 4411057 markings, 9201742 edges, 97520 markings/sec, 40 secs
lola: 4884740 markings, 10198230 edges, 94737 markings/sec, 45 secs
lola: 5344465 markings, 11165457 edges, 91945 markings/sec, 50 secs
lola: 5802325 markings, 12138334 edges, 91572 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + Queue... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJo... (shortened)
lola: processed formula length: 1564
lola: 1 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9) OR A (G ((P_1717 <= SigAbort))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9) OR NOT(E(TRUE U (SigAbort + 1 <= P_1717)))))
lola: processed formula length: 140
lola: 3 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 13 will run for 871 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= ScheduleTaskE_Work_10_0 + ScheduleTaskE_Work_10_1 + ScheduleTaskE_Work_10_2 + ScheduleTaskE_Work_10_3 + ScheduleTaskE_Work_10_4 + ScheduleTaskE_Work_10_5 + ScheduleTaskE_Work_10_6 + 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 + Sched... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= ScheduleTaskE_Work_10_0 + ScheduleTaskE_Work_10_1 + ScheduleTaskE_Work_10_2 + ScheduleTaskE_Work_10_3 + ScheduleTaskE_Work_10_4 + ScheduleTaskE_Work_10_5 + ScheduleTaskE_Work_10_6 + 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 + Sc... (shortened)
lola: processed formula length: 2962
lola: 1 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 14 will run for 1307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= P_1093)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= P_1093))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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 15 will run for 2614 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_10_1 + P_1119_10_2 + P_1119_10_3 + P_1119_10_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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (cPollingAbort <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_10_1 + P_1119_10_2 + P_1119_10_3 + P_1119_10_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_111... (shortened)
lola: processed formula length: 565
lola: 3 rewrites
lola: formula mentions 0 of 966 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3616 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: 222906 markings, 604533 edges, 2977825758325506048 markings/sec, 0 secs
lola: 446059 markings, 1200261 edges, 44631 markings/sec, 5 secs
lola: 669965 markings, 1796335 edges, 44781 markings/sec, 10 secs
lola: 893221 markings, 2388499 edges, 44651 markings/sec, 15 secs
lola: 1115185 markings, 2977203 edges, 44393 markings/sec, 20 secs
lola: 1337335 markings, 3566131 edges, 44430 markings/sec, 25 secs
lola: 1558664 markings, 4151387 edges, 44266 markings/sec, 30 secs
lola: 1778914 markings, 4734883 edges, 44050 markings/sec, 35 secs
lola: 1998973 markings, 5317701 edges, 44012 markings/sec, 40 secs
lola: 2218695 markings, 5898808 edges, 43944 markings/sec, 45 secs
lola: 2436309 markings, 6477076 edges, 43523 markings/sec, 50 secs
lola: 2653497 markings, 7053044 edges, 43438 markings/sec, 55 secs
lola: 2870807 markings, 7628725 edges, 43462 markings/sec, 60 secs
lola: 3088051 markings, 8202579 edges, 43449 markings/sec, 65 secs
lola: 3304711 markings, 8776513 edges, 43332 markings/sec, 70 secs
lola: 3519933 markings, 9346331 edges, 43044 markings/sec, 75 secs
lola: 3734687 markings, 9915592 edges, 42951 markings/sec, 80 secs
lola: 3948340 markings, 10480477 edges, 42731 markings/sec, 85 secs
lola: 4160318 markings, 11041513 edges, 42396 markings/sec, 90 secs
lola: 4373500 markings, 11605767 edges, 42636 markings/sec, 95 secs
lola: 4586284 markings, 12169010 edges, 42557 markings/sec, 100 secs
lola: 4800863 markings, 12735309 edges, 42916 markings/sec, 105 secs
lola: 5015201 markings, 13301498 edges, 42868 markings/sec, 110 secs
lola: 5228135 markings, 13864549 edges, 42587 markings/sec, 115 secs
lola: 5439719 markings, 14423749 edges, 42317 markings/sec, 120 secs
lola: 5648814 markings, 14977288 edges, 41819 markings/sec, 125 secs
lola: 5851990 markings, 15515206 edges, 40635 markings/sec, 130 secs
lola: 6054967 markings, 16051549 edges, 40595 markings/sec, 135 secs
lola: 6257600 markings, 16587628 edges, 40527 markings/sec, 140 secs
lola: 6458642 markings, 17120339 edges, 40208 markings/sec, 145 secs
lola: 6660455 markings, 17654575 edges, 40363 markings/sec, 150 secs
lola: 6862343 markings, 18191638 edges, 40378 markings/sec, 155 secs
lola: 6939545 markings, 18396374 edges, 15440 markings/sec, 160 secs
lola: 6939545 markings, 18396374 edges, 0 markings/sec, 165 secs
lola: 6939545 markings, 18396374 edges, 0 markings/sec, 170 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: unknown no no no no no yes unknown unknown yes unknown yes no no no yes
lola: ========================================
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T10-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496480977142
--------------------
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-S04J06T10"
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-S04J06T10.tgz
mv S_PolyORBLF-PT-S04J06T10 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-S04J06T10, 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-149441681600498"
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 ;