fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r128-smll-149441681700525
Last Updated
June 27, 2017

About the Execution of LoLA for S_PolyORBLF-PT-S06J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15950.560 1660186.00 2685267.00 4622.30 FTTF??T?T??TFFFT 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-S06J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681700525
=====================================================================


--------------------
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-S06J04T08-CTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S06J04T08-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496493427899


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-PT-S06J04T08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_PolyORBLF-PT-S06J04T08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBLF-PT-S06J04T08 @ 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: 14824/65536 symbol table entries, 9110 collisions
lola: preprocessing...
lola: finding significant places
lola: 810 places, 14014 transitions, 752 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3639 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: (A (G ((P_1716 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6))) AND A (G (A (F ((P_1717 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8)))))) : A (F (E (F (((2 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4) AND (1 <= 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)))))) : E (F (((3 <= CanInjectEvent) OR (3 <= ORB_Lock) OR (P_1097 + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_7_3 + DisablePollingE_7_4 + DisablePollingE_7_5 + DisablePollingE_7_6 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_8_3 + DisablePollingE_8_4 + DisablePollingE_8_5 + DisablePollingE_8_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_1 + DisablePollingE_1_2) OR (3 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6)))) : E (((1 <= cPollingAbort) U (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8))) : NOT((NOT(E (F ((3 <= 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)))) AND (A (X ((NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 <= PollingAbort))) OR ((ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + ModifiedSrc_6 <= 0) OR ((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8) AND (ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= cIdleTasks)))))) : (E (G (E (F ((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8))))) OR A (G (E (F ((2 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_7_3 + DisablePollingE_7_4 + DisablePollingE_7_5 + DisablePollingE_7_6 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_8_3 + DisablePollingE_8_4 + DisablePollingE_8_5 + DisablePollingE_8_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_1 + DisablePollingE_1_2)))))) : ((A (F (((3 <= cJobCnt) OR (2 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6)))) OR (((1 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8) AND (1 <= 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)) OR (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 + 1 <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8) OR (QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + 1 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6))) AND ((1 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_7_5 + DisablePollingB_7_6 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_8_5 + DisablePollingB_8_6 + 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_1_5 + DisablePollingB_1_6 + DisablePollingB_3_6 + DisablePollingB_3_5 + 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_2_5 + DisablePollingB_2_6 + DisablePollingB_4_6) OR (A (G ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_7_3 + DisablePollingE_7_4 + DisablePollingE_7_5 + DisablePollingE_7_6 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_8_3 + DisablePollingE_8_4 + DisablePollingE_8_5 + DisablePollingE_8_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_1 + DisablePollingE_1_2 <= MarkerWrite))) OR ((3 <= P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8) AND (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_5_3 + Insert_Source_B_5_4 + Insert_Source_B_5_5 + Insert_Source_B_5_6 + Insert_Source_B_8_6 + Insert_Source_B_8_5 + Insert_Source_B_8_4 + Insert_Source_B_8_3 + Insert_Source_B_8_2 + Insert_Source_B_6_1 + Insert_Source_B_6_2 + Insert_Source_B_6_3 + Insert_Source_B_6_4 + Insert_Source_B_6_5 + Insert_Source_B_6_6 + Insert_Source_B_8_1 + Insert_Source_B_7_1 + Insert_Source_B_7_2 + Insert_Source_B_7_3 + Insert_Source_B_7_4 + Insert_Source_B_7_5 + Insert_Source_B_7_6 <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8))))) : A (F (((Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (1 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + Check_Sources_E_7 + Check_Sources_E_8) AND (DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_7_3 + DisablePollingE_7_4 + DisablePollingE_7_5 + DisablePollingE_7_6 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_8_3 + DisablePollingE_8_4 + DisablePollingE_8_5 + DisablePollingE_8_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_1 + DisablePollingE_1_2 + 1 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8) AND (2 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + ModifiedSrc_6)))) : A (G (A (X ((PollingAbort <= 0))))) : E (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 <= PollingAbort))) : E (G (E (F ((PollingAbort <= 0))))) : (A (G (((nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 <= cSources) AND (SigAbort <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_7_3 + DisablePollingE_7_4 + DisablePollingE_7_5 + DisablePollingE_7_6 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_8_3 + DisablePollingE_8_4 + DisablePollingE_8_5 + DisablePollingE_8_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_1 + DisablePollingE_1_2) AND ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8) OR (P_1093 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6))))) AND (((1 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6) OR (3 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8) OR (1 <= MarkerRead)) AND (QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 <= P_1093) AND ((2 <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0) OR (NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + 1 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8) OR (1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4) OR (1 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 <= 2)))) : NOT((E (F (((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_7_3 + DisablePollingE_7_4 + DisablePollingE_7_5 + DisablePollingE_7_6 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_8_3 + DisablePollingE_8_4 + DisablePollingE_8_5 + DisablePollingE_8_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_1 + DisablePollingE_1_2 <= 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 (3 <= 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 A (F ((MarkerWrite + 1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8))))) : NOT(A (G (A (F ((P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8)))))) : E (F (A (F (((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_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) AND (2 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8)))))) : NOT(((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8) AND A (F ((1 <= P_1717)))))
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 (G ((P_1716 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + Crea... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P_1716 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + Creat... (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 3008 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-S06J04T08-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-CTLCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: lola: ========================================result: no

lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((2 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4) AND (1 <= 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))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((2 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4) AND (1 <= 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))))
lola: processed formula length: 282
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 267095 markings, 657934 edges, 3067840851146178560 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= CanInjectEvent) OR (3 <= ORB_Lock) OR (P_1097 + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + Di... (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 3008 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 4 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T08-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-CTLCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= cPollingAbort) U (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= cPollingAbort) U (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8))
lola: processed formula length: 262
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 272906 markings, 671786 edges, 3225752436249460736 markings/sec, 0 secs
lola: 502037 markings, 1079188 edges, 45826 markings/sec, 5 secs
lola: 723914 markings, 1441940 edges, 44375 markings/sec, 10 secs
lola: 941877 markings, 1799769 edges, 43593 markings/sec, 15 secs
lola: 1151205 markings, 2137221 edges, 41866 markings/sec, 20 secs
lola: 1364554 markings, 2487477 edges, 42670 markings/sec, 25 secs
lola: 1577093 markings, 2848750 edges, 42508 markings/sec, 30 secs
lola: 1798228 markings, 3208024 edges, 44227 markings/sec, 35 secs
lola: 1996715 markings, 3532291 edges, 39697 markings/sec, 40 secs
lola: 2218369 markings, 3917577 edges, 44331 markings/sec, 45 secs
lola: 2468969 markings, 4483918 edges, 50120 markings/sec, 50 secs
lola: 2697902 markings, 4879559 edges, 45787 markings/sec, 55 secs
lola: 2912082 markings, 5242464 edges, 42836 markings/sec, 60 secs
lola: 3131162 markings, 5623081 edges, 43816 markings/sec, 65 secs
lola: 3345793 markings, 6024920 edges, 42926 markings/sec, 70 secs
lola: 3570959 markings, 6510724 edges, 45033 markings/sec, 75 secs
lola: 3779484 markings, 6888030 edges, 41705 markings/sec, 80 secs
lola: 3991041 markings, 7366185 edges, 42311 markings/sec, 85 secs
lola: 4189217 markings, 7816406 edges, 39635 markings/sec, 90 secs
lola: 4408615 markings, 8392946 edges, 43880 markings/sec, 95 secs
lola: 4639224 markings, 8873048 edges, 46122 markings/sec, 100 secs
lola: 4854881 markings, 9240448 edges, 43131 markings/sec, 105 secs
lola: 5060228 markings, 9587151 edges, 41069 markings/sec, 110 secs
lola: 5258580 markings, 9920578 edges, 39670 markings/sec, 115 secs
lola: 5478467 markings, 10306057 edges, 43977 markings/sec, 120 secs
lola: 5677725 markings, 10649211 edges, 39852 markings/sec, 125 secs
lola: 5902926 markings, 11143854 edges, 45040 markings/sec, 130 secs
lola: 6119031 markings, 11548251 edges, 43221 markings/sec, 135 secs
lola: 6323901 markings, 11919349 edges, 40974 markings/sec, 140 secs
lola: 6531307 markings, 12393845 edges, 41481 markings/sec, 145 secs
lola: 6725609 markings, 12846879 edges, 38860 markings/sec, 150 secs
lola: 6948338 markings, 13458433 edges, 44546 markings/sec, 155 secs
lola: 7158298 markings, 13841132 edges, 41992 markings/sec, 160 secs
lola: 7353547 markings, 14182378 edges, 39050 markings/sec, 165 secs
lola: 7557411 markings, 14551181 edges, 40773 markings/sec, 170 secs
lola: 7761650 markings, 14950260 edges, 40848 markings/sec, 175 secs
lola: 7965222 markings, 15401729 edges, 40714 markings/sec, 180 secs
lola: 8153397 markings, 15903623 edges, 37635 markings/sec, 185 secs
lola: 8370385 markings, 16423319 edges, 43398 markings/sec, 190 secs
lola: 8560394 markings, 16783437 edges, 38002 markings/sec, 195 secs
lola: 8752402 markings, 17200574 edges, 38402 markings/sec, 200 secs
lola: 8947581 markings, 17738936 edges, 39036 markings/sec, 205 secs
lola: 9133791 markings, 18123478 edges, 37242 markings/sec, 210 secs
lola: 9324170 markings, 18637844 edges, 38076 markings/sec, 215 secs
lola: 9533745 markings, 19172574 edges, 41915 markings/sec, 220 secs
lola: 9790840 markings, 19786330 edges, 51419 markings/sec, 225 secs
lola: 10008662 markings, 20140349 edges, 43564 markings/sec, 230 secs
lola: 10227026 markings, 20497393 edges, 43673 markings/sec, 235 secs
lola: 10436268 markings, 20840131 edges, 41848 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (F ((3 <= 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)))) AND (A (X ((NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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)))
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 3008 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-S06J04T08-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-CTLCardinality-4.sara.
lola: sara is running 0 secs || 7549 markings, 8089 edges, 1510 markings/sec, 0 secs
lola: sara is running 5 secs || 14389 markings, 17864 edges, 1368 markings/sec, 5 secs
lola: sara is running 10 secs || 19312 markings, 29027 edges, 985 markings/sec, 10 secs
lola: sara is running 15 secs || 26040 markings, 38830 edges, 1346 markings/sec, 15 secs
lola: sara is running 20 secs || 33071 markings, 48355 edges, 1406 markings/sec, 20 secs
lola: sara is running 25 secs || 39202 markings, 58770 edges, 1226 markings/sec, 25 secs
lola: sara is running 30 secs || 46135 markings, 68142 edges, 1387 markings/sec, 30 secs
lola: sara is running 35 secs || 53195 markings, 77540 edges, 1412 markings/sec, 35 secs
lola: sara is running 40 secs || 59528 markings, 87321 edges, 1267 markings/sec, 40 secs
lola: sara is running 45 secs || 64434 markings, 99002 edges, 981 markings/sec, 45 secs
lola: sara is running 50 secs || 69683 markings, 110392 edges, 1050 markings/sec, 50 secs
lola: sara is running 55 secs || 77274 markings, 119059 edges, 1518 markings/sec, 55 secs
lola: sara is running 60 secs || 81002 markings, 131738 edges, 746 markings/sec, 60 secs
lola: sara is running 65 secs || 86130 markings, 143249 edges, 1026 markings/sec, 65 secs
lola: sara is running 70 secs || 92551 markings, 153378 edges, 1284 markings/sec, 70 secs
lola: sara is running 75 secs || 98082 markings, 164798 edges, 1106 markings/sec, 75 secs
lola: sara is running 80 secs || 104350 markings, 175352 edges, 1254 markings/sec, 80 secs
lola: sara is running 85 secs || 111716 markings, 185003 edges, 1473 markings/sec, 85 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 90 secs || 118897 markings, 194747 edges, 1436 markings/sec, 90 secs
lola: sara is running 95 secs || 124988 markings, 205520 edges, 1218 markings/sec, 95 secs
lola: sara is running 100 secs || 132234 markings, 215677 edges, 1449 markings/sec, 100 secs
lola: sara is running 105 secs || 138696 markings, 225965 edges, 1292 markings/sec, 105 secs
lola: sara is running 110 secs || 146014 markings, 235652 edges, 1464 markings/sec, 110 secs
lola: sara is running 115 secs || 152692 markings, 246112 edges, 1336 markings/sec, 115 secs
lola: sara is running 120 secs || 160202 markings, 255366 edges, 1502 markings/sec, 120 secs
lola: sara is running 125 secs || 167396 markings, 264623 edges, 1439 markings/sec, 125 secs
lola: sara is running 130 secs || 174846 markings, 274055 edges, 1490 markings/sec, 130 secs
lola: sara is running 135 secs || 181075 markings, 284691 edges, 1246 markings/sec, 135 secs
lola: sara is running 140 secs || 188161 markings, 294757 edges, 1417 markings/sec, 140 secs
lola: sara is running 145 secs || 194632 markings, 305641 edges, 1294 markings/sec, 145 secs
lola: sara is running 150 secs || 201653 markings, 315836 edges, 1404 markings/sec, 150 secs
lola: sara is running 155 secs || 207162 markings, 327196 edges, 1102 markings/sec, 155 secs
lola: sara is running 160 secs || 210622 markings, 340357 edges, 692 markings/sec, 160 secs
lola: sara is running 165 secs || 214013 markings, 353461 edges, 678 markings/sec, 165 secs
lola: sara is running 170 secs || 217439 markings, 366844 edges, 685 markings/sec, 170 secs
lola: sara is running 175 secs || 220982 markings, 380457 edges, 709 markings/sec, 175 secs
lola: sara is running 180 secs || 226047 markings, 394260 edges, 1013 markings/sec, 180 secs
lola: sara is running 185 secs || 230278 markings, 407992 edges, 846 markings/sec, 185 secs
lola: sara is running 190 secs || 235929 markings, 420652 edges, 1130 markings/sec, 190 secs
lola: sara is running 195 secs || 243869 markings, 429837 edges, 1588 markings/sec, 195 secs
lola: sara is running 200 secs || 250062 markings, 440895 edges, 1239 markings/sec, 200 secs
lola: sara is running 205 secs || 257825 markings, 451382 edges, 1553 markings/sec, 205 secs
lola: sara is running 210 secs || 264838 markings, 462460 edges, 1403 markings/sec, 210 secs
lola: sara is running 215 secs || 272590 markings, 472862 edges, 1550 markings/sec, 215 secs
lola: sara is running 220 secs || 279898 markings, 483633 edges, 1462 markings/sec, 220 secs
lola: sara is running 225 secs || 287802 markings, 493811 edges, 1581 markings/sec, 225 secs
lola: sara is running 230 secs || 292106 markings, 507131 edges, 861 markings/sec, 230 secs
lola: sara is running 235 secs || 295502 markings, 520994 edges, 679 markings/sec, 235 secs
lola: sara is running 240 secs || 300740 markings, 533451 edges, 1048 markings/sec, 240 secs
lola: sara is running 245 secs || 304357 markings, 547196 edges, 723 markings/sec, 245 secs
lola: sara is running 250 secs || 307915 markings, 561000 edges, 712 markings/sec, 250 secs
lola: sara is running 255 secs || 311440 markings, 574794 edges, 705 markings/sec, 255 secs
lola: sara is running 260 secs || 315010 markings, 588526 edges, 714 markings/sec, 260 secs
lola: sara is running 265 secs || 320262 markings, 602472 edges, 1050 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + Qu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + Que... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + Queue... (shortened)
lola: processed formula length: 758
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (F (((3 <= cJobCnt) OR (2 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + Create... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= cJobCnt) OR (2 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= cJobCnt) OR (2 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + Creat... (shortened)
lola: processed formula length: 575
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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 7 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_7_5 ... (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_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_7_5 ... (shortened)
lola: processed formula length: 1060
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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-S06J04T08-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8) AND (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8) AND (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B... (shortened)
lola: processed formula length: 1243
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (1 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Ch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (1 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 +... (shortened)
lola: processed formula length: 1823
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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 8 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((PollingAbort <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((PollingAbort <= 0)))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 121681 markings, 339426 edges, 3067840851146178560 markings/sec, 0 secs
lola: 251000 markings, 707301 edges, 25864 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (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 <= PollingAbort)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (PollingAbort + 1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8)))
lola: processed formula length: 122
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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 10 will run for 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((PollingAbort <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (PollingAbort <= 0)))))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 599 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 <= cSources) AND (SigAbort <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 599 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 <= cSources) AND (SigAbort <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePolling... (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 3008 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 3 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T08-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: lola: ========================================result: no

lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 749 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 749 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8 + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollin... (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 3008 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-S06J04T08-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-CTLCardinality-12.sara.
lola: sara is running 0 secs || 3486 markings, 11808 edges, 697 markings/sec, 0 secs
lola: sara is running 5 secs || 6945 markings, 24163 edges, 692 markings/sec, 5 secs
lola: sara is running 10 secs || 10408 markings, 36591 edges, 693 markings/sec, 10 secs
lola: sara is running 15 secs || 13874 markings, 48974 edges, 693 markings/sec, 15 secs
lola: sara is running 20 secs || 17339 markings, 61373 edges, 693 markings/sec, 20 secs
lola: sara is running 25 secs || 20801 markings, 73827 edges, 692 markings/sec, 25 secs
lola: sara is running 30 secs || 24257 markings, 86270 edges, 691 markings/sec, 30 secs
lola: sara is running 35 secs || 27658 markings, 98628 edges, 680 markings/sec, 35 secs
lola: sara is running 40 secs || 31053 markings, 110980 edges, 679 markings/sec, 40 secs
lola: sara is running 45 secs || 34577 markings, 123843 edges, 705 markings/sec, 45 secs
lola: sara is running 50 secs || 38100 markings, 136572 edges, 705 markings/sec, 50 secs
lola: sara is running 55 secs || 41536 markings, 149152 edges, 687 markings/sec, 55 secs
lola: sara is running 60 secs || 45011 markings, 161969 edges, 695 markings/sec, 60 secs
lola: sara is running 65 secs || 48524 markings, 174642 edges, 703 markings/sec, 65 secs
lola: sara is running 70 secs || 52058 markings, 187288 edges, 707 markings/sec, 70 secs
lola: sara is running 75 secs || 55593 markings, 199946 edges, 707 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 59113 markings, 212524 edges, 704 markings/sec, 80 secs
lola: sara is running 85 secs || 62644 markings, 225192 edges, 706 markings/sec, 85 secs
lola: sara is running 90 secs || 66177 markings, 237922 edges, 707 markings/sec, 90 secs
lola: sara is running 95 secs || 69710 markings, 250669 edges, 707 markings/sec, 95 secs
lola: sara is running 100 secs || 73239 markings, 263517 edges, 706 markings/sec, 100 secs
lola: sara is running 105 secs || 76769 markings, 276431 edges, 706 markings/sec, 105 secs
lola: sara is running 110 secs || 80300 markings, 289183 edges, 706 markings/sec, 110 secs
lola: sara is running 115 secs || 83832 markings, 302032 edges, 706 markings/sec, 115 secs
lola: sara is running 120 secs || 87359 markings, 314991 edges, 705 markings/sec, 120 secs
lola: sara is running 125 secs || 90892 markings, 327933 edges, 707 markings/sec, 125 secs
lola: sara is running 130 secs || 94426 markings, 340554 edges, 707 markings/sec, 130 secs
lola: sara is running 135 secs || 97961 markings, 353242 edges, 707 markings/sec, 135 secs
lola: sara is running 140 secs || 101494 markings, 365863 edges, 707 markings/sec, 140 secs
lola: sara is running 145 secs || 105028 markings, 378519 edges, 707 markings/sec, 145 secs
lola: sara is running 150 secs || 108565 markings, 391234 edges, 707 markings/sec, 150 secs
lola: sara is running 155 secs || 112100 markings, 403964 edges, 707 markings/sec, 155 secs
lola: sara is running 160 secs || 115634 markings, 416826 edges, 707 markings/sec, 160 secs
lola: sara is running 165 secs || 119169 markings, 429699 edges, 707 markings/sec, 165 secs
lola: sara is running 170 secs || 122704 markings, 442565 edges, 707 markings/sec, 170 secs
lola: sara is running 175 secs || 126238 markings, 455362 edges, 707 markings/sec, 175 secs
lola: sara is running 180 secs || 129771 markings, 468345 edges, 707 markings/sec, 180 secs
lola: sara is running 185 secs || 133309 markings, 481405 edges, 708 markings/sec, 185 secs
lola: sara is running 190 secs || 149485 markings, 503031 edges, 3235 markings/sec, 190 secs
lola: sara is running 195 secs || 165754 markings, 525142 edges, 3254 markings/sec, 195 secs
lola: sara is running 200 secs || 182008 markings, 546257 edges, 3251 markings/sec, 200 secs
lola: sara is running 205 secs || 198363 markings, 567911 edges, 3271 markings/sec, 205 secs
lola: sara is running 210 secs || 215349 markings, 592240 edges, 3397 markings/sec, 210 secs
lola: sara is running 215 secs || 231062 markings, 612553 edges, 3143 markings/sec, 215 secs
lola: sara is running 220 secs || 247424 markings, 634636 edges, 3272 markings/sec, 220 secs
lola: sara is running 225 secs || 264294 markings, 658626 edges, 3374 markings/sec, 225 secs
lola: sara is running 230 secs || 280721 markings, 681112 edges, 3285 markings/sec, 230 secs
lola: sara is running 235 secs || 297157 markings, 703711 edges, 3287 markings/sec, 235 secs
lola: sara is running 240 secs || 313789 markings, 727142 edges, 3326 markings/sec, 240 secs
lola: sara is running 245 secs || 330245 markings, 750267 edges, 3291 markings/sec, 245 secs
lola: sara is running 250 secs || 346306 markings, 771327 edges, 3212 markings/sec, 250 secs
lola: sara is running 255 secs || 362618 markings, 794044 edges, 3262 markings/sec, 255 secs
lola: sara is running 260 secs || 378064 markings, 815155 edges, 3089 markings/sec, 260 secs
lola: sara is running 265 secs || 393793 markings, 836830 edges, 3146 markings/sec, 265 secs
lola: sara is running 270 secs || 409033 markings, 857878 edges, 3048 markings/sec, 270 secs
lola: sara is running 275 secs || 424678 markings, 879564 edges, 3129 markings/sec, 275 secs
lola: sara is running 280 secs || 440545 markings, 901842 edges, 3173 markings/sec, 280 secs
lola: sara is running 285 secs || 456580 markings, 924842 edges, 3207 markings/sec, 285 secs
lola: sara is running 290 secs || 471993 markings, 946966 edges, 3083 markings/sec, 290 secs
lola: sara is running 295 secs || 487408 markings, 968134 edges, 3083 markings/sec, 295 secs
lola: sara is running 300 secs || 503025 markings, 989923 edges, 3123 markings/sec, 300 secs
lola: sara is running 305 secs || 518347 markings, 1010252 edges, 3064 markings/sec, 305 secs
lola: sara is running 310 secs || 534262 markings, 1032902 edges, 3183 markings/sec, 310 secs
lola: sara is running 315 secs || 549745 markings, 1054142 edges, 3097 markings/sec, 315 secs
lola: sara is running 320 secs || 561342 markings, 1069648 edges, 2319 markings/sec, 320 secs
lola: sara is running 325 secs || 564969 markings, 1073480 edges, 725 markings/sec, 325 secs
lola: sara is running 330 secs || 568431 markings, 1083922 edges, 692 markings/sec, 330 secs
lola: sara is running 335 secs || 571723 markings, 1095700 edges, 658 markings/sec, 335 secs
lola: sara is running 340 secs || 575128 markings, 1107896 edges, 681 markings/sec, 340 secs
lola: sara is running 345 secs || 578532 markings, 1120055 edges, 681 markings/sec, 345 secs
lola: sara is running 350 secs || 581934 markings, 1132253 edges, 680 markings/sec, 350 secs
lola: sara is running 355 secs || 585338 markings, 1144520 edges, 681 markings/sec, 355 secs
lola: sara is running 360 secs || 588741 markings, 1156771 edges, 681 markings/sec, 360 secs
lola: sara is running 365 secs || 592144 markings, 1169177 edges, 681 markings/sec, 365 secs
lola: sara is running 370 secs || 595432 markings, 1181143 edges, 658 markings/sec, 370 secs
lola: sara is running 375 secs || 598907 markings, 1193778 edges, 695 markings/sec, 375 secs
lola: sara is running 380 secs || 602455 markings, 1206635 edges, 710 markings/sec, 380 secs
lola: sara is running 385 secs || 606006 markings, 1219684 edges, 710 markings/sec, 385 secs
lola: sara is running 390 secs || 609553 markings, 1232797 edges, 709 markings/sec, 390 secs
lola: sara is running 395 secs || 613095 markings, 1245413 edges, 708 markings/sec, 395 secs
lola: sara is running 400 secs || 616634 markings, 1258116 edges, 708 markings/sec, 400 secs
lola: sara is running 405 secs || 620166 markings, 1270743 edges, 706 markings/sec, 405 secs
lola: sara is running 410 secs || 623704 markings, 1283382 edges, 708 markings/sec, 410 secs
lola: sara is running 415 secs || 627241 markings, 1296099 edges, 707 markings/sec, 415 secs
lola: sara is running 420 secs || 630778 markings, 1308821 edges, 707 markings/sec, 420 secs
lola: sara is running 425 secs || 634314 markings, 1321653 edges, 707 markings/sec, 425 secs
lola: sara is running 430 secs || 637852 markings, 1334494 edges, 708 markings/sec, 430 secs
lola: sara is running 435 secs || 641388 markings, 1347408 edges, 707 markings/sec, 435 secs
lola: sara is running 440 secs || 644923 markings, 1360190 edges, 707 markings/sec, 440 secs
lola: sara is running 445 secs || 648458 markings, 1373124 edges, 707 markings/sec, 445 secs
lola: sara is running 450 secs || 651993 markings, 1386120 edges, 707 markings/sec, 450 secs
lola: sara is running 455 secs || 655551 markings, 1399042 edges, 712 markings/sec, 455 secs
lola: sara is running 460 secs || 659110 markings, 1411894 edges, 712 markings/sec, 460 secs
lola: sara is running 465 secs || 662670 markings, 1424639 edges, 712 markings/sec, 465 secs
lola: sara is running 470 secs || 666228 markings, 1437417 edges, 712 markings/sec, 470 secs
lola: sara is running 475 secs || 669676 markings, 1449918 edges, 690 markings/sec, 475 secs
lola: sara is running 480 secs || 673220 markings, 1462792 edges, 709 markings/sec, 480 secs
lola: sara is running 485 secs || 676769 markings, 1475557 edges, 710 markings/sec, 485 secs
lola: sara is running 490 secs || 680315 markings, 1488352 edges, 709 markings/sec, 490 secs
lola: sara is running 495 secs || 683862 markings, 1501061 edges, 709 markings/sec, 495 secs
lola: sara is running 500 secs || 687409 markings, 1513817 edges, 709 markings/sec, 500 secs
lola: sara is running 505 secs || 690954 markings, 1526675 edges, 709 markings/sec, 505 secs
lola: sara is running 510 secs || 694512 markings, 1539589 edges, 712 markings/sec, 510 secs
lola: sara is running 515 secs || 698071 markings, 1552341 edges, 712 markings/sec, 515 secs
lola: sara is running 520 secs || 701617 markings, 1565119 edges, 709 markings/sec, 520 secs
lola: sara is running 525 secs || 705173 markings, 1577866 edges, 711 markings/sec, 525 secs
lola: sara is running 530 secs || 708728 markings, 1590706 edges, 711 markings/sec, 530 secs
lola: sara is running 535 secs || 712275 markings, 1603397 edges, 709 markings/sec, 535 secs
lola: sara is running 540 secs || 715806 markings, 1616136 edges, 706 markings/sec, 540 secs
lola: sara is running 545 secs || 719352 markings, 1628840 edges, 709 markings/sec, 545 secs
lola: sara is running 550 secs || 722898 markings, 1641624 edges, 709 markings/sec, 550 secs
lola: sara is running 555 secs || 726474 markings, 1654384 edges, 715 markings/sec, 555 secs
lola: sara is running 560 secs || 730033 markings, 1667149 edges, 712 markings/sec, 560 secs
lola: sara is running 565 secs || 733591 markings, 1679903 edges, 712 markings/sec, 565 secs
lola: sara is running 570 secs || 737138 markings, 1692604 edges, 709 markings/sec, 570 secs
lola: sara is running 575 secs || 740685 markings, 1705325 edges, 709 markings/sec, 575 secs
lola: sara is running 580 secs || 744250 markings, 1718024 edges, 713 markings/sec, 580 secs
lola: sara is running 585 secs || 747810 markings, 1730742 edges, 712 markings/sec, 585 secs
lola: sara is running 590 secs || 751368 markings, 1743475 edges, 712 markings/sec, 590 secs
lola: sara is running 595 secs || 754916 markings, 1756138 edges, 710 markings/sec, 595 secs
lola: sara is running 600 secs || 758452 markings, 1768784 edges, 707 markings/sec, 600 secs
lola: sara is running 605 secs || 762036 markings, 1781473 edges, 717 markings/sec, 605 secs
lola: sara is running 610 secs || 765588 markings, 1794138 edges, 710 markings/sec, 610 secs
lola: sara is running 615 secs || 769163 markings, 1806791 edges, 715 markings/sec, 615 secs
lola: sara is running 620 secs || 772720 markings, 1819446 edges, 711 markings/sec, 620 secs
lola: sara is running 625 secs || 776265 markings, 1832055 edges, 709 markings/sec, 625 secs
lola: sara is running 630 secs || 779854 markings, 1844685 edges, 718 markings/sec, 630 secs
lola: sara is running 635 secs || 783313 markings, 1856908 edges, 692 markings/sec, 635 secs
lola: sara is running 640 secs || 786889 markings, 1869641 edges, 715 markings/sec, 640 secs
lola: sara is running 645 secs || 790518 markings, 1882406 edges, 726 markings/sec, 645 secs
lola: sara is running 650 secs || 794069 markings, 1895174 edges, 710 markings/sec, 650 secs
lola: sara is running 655 secs || 797675 markings, 1907912 edges, 721 markings/sec, 655 secs
lola: sara is running 660 secs || 801273 markings, 1920687 edges, 720 markings/sec, 660 secs
lola: sara is running 665 secs || 804889 markings, 1933560 edges, 723 markings/sec, 665 secs
lola: sara is running 670 secs || 808439 markings, 1946378 edges, 710 markings/sec, 670 secs
lola: sara is running 675 secs || 812013 markings, 1959161 edges, 715 markings/sec, 675 secs
lola: sara is running 680 secs || 815589 markings, 1971910 edges, 715 markings/sec, 680 secs
lola: sara is running 685 secs || 819193 markings, 1984629 edges, 721 markings/sec, 685 secs
lola: sara is running 690 secs || 822828 markings, 1997527 edges, 727 markings/sec, 690 secs
lola: sara is running 695 secs || 826425 markings, 2010421 edges, 719 markings/sec, 695 secs
lola: sara is running 700 secs || 830062 markings, 2023398 edges, 727 markings/sec, 700 secs
lola: sara is running 705 secs || 833615 markings, 2036264 edges, 711 markings/sec, 705 secs
lola: sara is running 710 secs || 837175 markings, 2049089 edges, 712 markings/sec, 710 secs
lola: sara is running 715 secs || 840729 markings, 2061914 edges, 711 markings/sec, 715 secs
lola: sara is running 720 secs || 844301 markings, 2074703 edges, 714 markings/sec, 720 secs
lola: sara is running 725 secs || 847876 markings, 2087460 edges, 715 markings/sec, 725 secs
lola: sara is running 730 secs || 851455 markings, 2100177 edges, 716 markings/sec, 730 secs
lola: sara is running 735 secs || 855077 markings, 2113013 edges, 724 markings/sec, 735 secs
lola: sara is running 740 secs || 858712 markings, 2125945 edges, 727 markings/sec, 740 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 749 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8))))
lola: processed formula length: 185
lola: 8 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 253676 markings, 877473 edges, 2949002610759172096 markings/sec, 0 secs
lola: 475889 markings, 1713102 edges, 44443 markings/sec, 5 secs
lola: 699560 markings, 2609514 edges, 44734 markings/sec, 10 secs
lola: 937822 markings, 3554828 edges, 47652 markings/sec, 15 secs
lola: 1139215 markings, 4329963 edges, 40279 markings/sec, 20 secs
lola: 1355427 markings, 5151552 edges, 43242 markings/sec, 25 secs
lola: 1565832 markings, 5949230 edges, 42081 markings/sec, 30 secs
lola: 1782781 markings, 6773508 edges, 43390 markings/sec, 35 secs
lola: 1951420 markings, 7519395 edges, 33728 markings/sec, 40 secs
lola: 2149682 markings, 8330631 edges, 39652 markings/sec, 45 secs
lola: 2340547 markings, 9084776 edges, 38173 markings/sec, 50 secs
lola: 2547571 markings, 9873130 edges, 41405 markings/sec, 55 secs
lola: 2745169 markings, 10700721 edges, 39520 markings/sec, 60 secs
lola: 2922222 markings, 11470268 edges, 35411 markings/sec, 65 secs
lola: 3089494 markings, 12231288 edges, 33454 markings/sec, 70 secs
lola: 3288792 markings, 13045242 edges, 39860 markings/sec, 75 secs
lola: 3463453 markings, 13809204 edges, 34932 markings/sec, 80 secs
lola: 3630352 markings, 14579043 edges, 33380 markings/sec, 85 secs
lola: 3860086 markings, 15491889 edges, 45947 markings/sec, 90 secs
lola: 4075431 markings, 16321382 edges, 43069 markings/sec, 95 secs
lola: 4289893 markings, 17134654 edges, 42892 markings/sec, 100 secs
lola: 4511168 markings, 17969489 edges, 44255 markings/sec, 105 secs
lola: 4689533 markings, 18734331 edges, 35673 markings/sec, 110 secs
lola: 4910282 markings, 19597721 edges, 44150 markings/sec, 115 secs
lola: 5117912 markings, 20433777 edges, 41526 markings/sec, 120 secs
lola: 5331091 markings, 21245236 edges, 42636 markings/sec, 125 secs
lola: 5543235 markings, 22053305 edges, 42429 markings/sec, 130 secs
lola: 5720834 markings, 22784711 edges, 35520 markings/sec, 135 secs
lola: 5907874 markings, 23538392 edges, 37408 markings/sec, 140 secs
lola: 6085791 markings, 24306846 edges, 35583 markings/sec, 145 secs
lola: 6282088 markings, 25089655 edges, 39259 markings/sec, 150 secs
lola: 6468044 markings, 25900905 edges, 37191 markings/sec, 155 secs
lola: 6663799 markings, 26733521 edges, 39151 markings/sec, 160 secs
lola: 6874999 markings, 27581129 edges, 42240 markings/sec, 165 secs
lola: 7055215 markings, 28336667 edges, 36043 markings/sec, 170 secs
lola: 7234973 markings, 29106937 edges, 35952 markings/sec, 175 secs
lola: 7437968 markings, 29932028 edges, 40599 markings/sec, 180 secs
lola: 7614582 markings, 30715777 edges, 35323 markings/sec, 185 secs
lola: 7793866 markings, 31492258 edges, 35857 markings/sec, 190 secs
lola: 8003316 markings, 32272593 edges, 41890 markings/sec, 195 secs
lola: 8194542 markings, 33064115 edges, 38245 markings/sec, 200 secs
lola: 8384548 markings, 33843681 edges, 38001 markings/sec, 205 secs
lola: 8569877 markings, 34639429 edges, 37066 markings/sec, 210 secs
lola: 8746345 markings, 35413944 edges, 35294 markings/sec, 215 secs
lola: 8939195 markings, 36229811 edges, 38570 markings/sec, 220 secs
lola: 9134345 markings, 36982000 edges, 39030 markings/sec, 225 secs
lola: 9338150 markings, 37781211 edges, 40761 markings/sec, 230 secs
lola: 9556642 markings, 38664600 edges, 43698 markings/sec, 235 secs
lola: 9758995 markings, 39454461 edges, 40471 markings/sec, 240 secs
lola: 9934587 markings, 40216171 edges, 35118 markings/sec, 245 secs
lola: 10102672 markings, 40982025 edges, 33617 markings/sec, 250 secs
lola: 10271228 markings, 41721437 edges, 33711 markings/sec, 255 secs
lola: 10454935 markings, 42479755 edges, 36741 markings/sec, 260 secs
lola: 10638619 markings, 43262545 edges, 36737 markings/sec, 265 secs
lola: 10836513 markings, 44043679 edges, 39579 markings/sec, 270 secs
lola: 11045904 markings, 44866017 edges, 41878 markings/sec, 275 secs
lola: 11233662 markings, 45664509 edges, 37552 markings/sec, 280 secs
lola: 11422924 markings, 46395880 edges, 37852 markings/sec, 285 secs
lola: 11596010 markings, 47139331 edges, 34617 markings/sec, 290 secs
lola: 11793151 markings, 47959100 edges, 39428 markings/sec, 295 secs
lola: 12002974 markings, 48765985 edges, 41965 markings/sec, 300 secs
lola: 12183878 markings, 49534053 edges, 36181 markings/sec, 305 secs
lola: 12362513 markings, 50282033 edges, 35727 markings/sec, 310 secs
lola: 12559398 markings, 51048135 edges, 39377 markings/sec, 315 secs
lola: 12745242 markings, 51810098 edges, 37169 markings/sec, 320 secs
lola: 12925618 markings, 52582855 edges, 36075 markings/sec, 325 secs
lola: 13096033 markings, 53349599 edges, 34083 markings/sec, 330 secs
lola: 13268024 markings, 54107564 edges, 34398 markings/sec, 335 secs
lola: 13449545 markings, 54883482 edges, 36304 markings/sec, 340 secs
lola: 13638135 markings, 55676208 edges, 37718 markings/sec, 345 secs
lola: 13815154 markings, 56417518 edges, 35404 markings/sec, 350 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 944 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F (((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_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) AND (2 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_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) AND (2 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 + RunE_7 + RunE_8))))
lola: processed formula length: 375
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 160651 markings, 712080 edges, 2688735838958780416 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 15 will run for 1880 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT(((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1880 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + 1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + Qu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + 1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + Qu... (shortened)
lola: processed formula length: 732
lola: 5 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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: 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: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes unknown unknown yes no no no yes yes no unknown unknown yes unknown
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496495088085

--------------------
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-S06J04T08"
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-S06J04T08.tgz
mv S_PolyORBLF-PT-S06J04T08 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-S06J04T08, 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-149441681700525"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;