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

About the Execution of LoLA for S_PolyORBNT-PT-S10J60

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15944.800 1114380.00 1536684.00 4140.80 ?FFTFFF?TFFFF??F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PolyORBNT-PT-S10J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231600165
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496354470883


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


checking for too many tokens
===========================================================================================
S_PolyORBNT-PT-S10J60: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBNT-PT-S10J60 @ 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: 14154/65536 symbol table entries, 4750 collisions
lola: preprocessing...
lola: finding significant places
lola: 1234 places, 12920 transitions, 1082 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3498 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J60-CTLCardinality.task
lola: A (G (((mo2 <= FetchJobB_1) OR (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40 + QueueJobB_1_41 + QueueJobB_1_42 + QueueJobB_1_43 + QueueJobB_1_44 + QueueJobB_1_45 + QueueJobB_1_46 + QueueJobB_1_47 + QueueJobB_1_48 + QueueJobB_1_49 + QueueJobB_1_50 + QueueJobB_1_51 + QueueJobB_1_52 + QueueJobB_1_53 + QueueJobB_1_54 + QueueJobB_1_55 + QueueJobB_1_56 + QueueJobB_1_57 + QueueJobB_1_58 + QueueJobB_1_59 + QueueJobB_1_60) OR ((3 <= mo1) AND (2 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 + f1_41 + f1_42 + f1_43 + f1_44 + f1_45 + f1_46 + f1_47 + f1_48 + f1_49 + f1_50 + f1_51 + f1_52 + f1_53 + f1_54 + f1_55 + f1_56 + f1_57 + f1_58 + f1_59 + f1_60)) OR (Perform_Work_E_1 + 1 <= NotifyEventJobQueuedE_1) OR ((2 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_23 + FetchJobE_1_24 + FetchJobE_1_25 + FetchJobE_1_26 + FetchJobE_1_27 + FetchJobE_1_28 + FetchJobE_1_29 + FetchJobE_1_30 + FetchJobE_1_31 + FetchJobE_1_32 + FetchJobE_1_33 + FetchJobE_1_34 + FetchJobE_1_35 + FetchJobE_1_36 + FetchJobE_1_37 + FetchJobE_1_38 + FetchJobE_1_39 + FetchJobE_1_40 + FetchJobE_1_41 + FetchJobE_1_42 + FetchJobE_1_43 + FetchJobE_1_44 + FetchJobE_1_45 + FetchJobE_1_46 + FetchJobE_1_47 + FetchJobE_1_48 + FetchJobE_1_49 + FetchJobE_1_50 + FetchJobE_1_51 + FetchJobE_1_52 + FetchJobE_1_53 + FetchJobE_1_54 + FetchJobE_1_55 + FetchJobE_1_56 + FetchJobE_1_57 + FetchJobE_1_58 + FetchJobE_1_59 + FetchJobE_1_60) AND (1 <= DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1))))) : A (G ((A (F ((3 <= place_522_1))) AND E (F ((f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f2_41 + f2_42 + f2_43 + f2_44 + f2_45 + f2_46 + f2_47 + f2_48 + f2_49 + f2_50 + f2_51 + f2_52 + f2_53 + f2_54 + f2_55 + f2_56 + f2_57 + f2_58 + f2_59 + f2_60 <= place_456)))))) : E ((((1 <= cSources) AND ((1 <= cSources) OR (1 <= NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQueuedB_1_46 + NotifyEventJobQueuedB_1_45 + NotifyEventJobQueuedB_1_44 + NotifyEventJobQueuedB_1_43 + NotifyEventJobQueuedB_1_42 + NotifyEventJobQueuedB_1_41 + NotifyEventJobQueuedB_1_40 + NotifyEventJobQueuedB_1_39 + NotifyEventJobQueuedB_1_38 + NotifyEventJobQueuedB_1_37 + NotifyEventJobQueuedB_1_36 + NotifyEventJobQueuedB_1_35 + NotifyEventJobQueuedB_1_34 + NotifyEventJobQueuedB_1_33 + NotifyEventJobQueuedB_1_32 + NotifyEventJobQueuedB_1_31 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_60 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9))) U A (G ((Check_Sources_E_1 <= place_520_1))))) : NOT(E (G ((place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9 <= place_522_1)))) : A (G ((Perform_Work_E_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f2_41 + f2_42 + f2_43 + f2_44 + f2_45 + f2_46 + f2_47 + f2_48 + f2_49 + f2_50 + f2_51 + f2_52 + f2_53 + f2_54 + f2_55 + f2_56 + f2_57 + f2_58 + f2_59 + f2_60))) : A (G ((((3 <= place_460) AND (1 <= JobCnt)) OR (NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQueuedB_1_46 + NotifyEventJobQueuedB_1_45 + NotifyEventJobQueuedB_1_44 + NotifyEventJobQueuedB_1_43 + NotifyEventJobQueuedB_1_42 + NotifyEventJobQueuedB_1_41 + NotifyEventJobQueuedB_1_40 + NotifyEventJobQueuedB_1_39 + NotifyEventJobQueuedB_1_38 + NotifyEventJobQueuedB_1_37 + NotifyEventJobQueuedB_1_36 + NotifyEventJobQueuedB_1_35 + NotifyEventJobQueuedB_1_34 + NotifyEventJobQueuedB_1_33 + NotifyEventJobQueuedB_1_32 + NotifyEventJobQueuedB_1_31 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_60 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9 <= 1) OR (DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= place_520_1)))) : NOT(E (G (A (F ((Try_Check_Sources_E_1 <= cJobCnt)))))) : E ((E (F ((mo3 <= QueueJobE_1))) U (place_782_1 + 1 <= place_518_1))) : E (F (E (X (((2 <= FetchJobB_1) AND (1 <= mi2)))))) : A ((((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10) OR (2 <= mi3) OR (2 <= NotifyEventEndOfCheckSourcesB_1) OR (1 <= place_500_1)) U (((2 <= Schedule_Task_B_1) AND (2 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9)) OR (Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_PerformWork_41 + Schedule_Task_E_1_PerformWork_42 + Schedule_Task_E_1_PerformWork_43 + Schedule_Task_E_1_PerformWork_44 + Schedule_Task_E_1_PerformWork_45 + Schedule_Task_E_1_PerformWork_46 + Schedule_Task_E_1_PerformWork_47 + Schedule_Task_E_1_PerformWork_48 + Schedule_Task_E_1_PerformWork_49 + Schedule_Task_E_1_PerformWork_50 + Schedule_Task_E_1_PerformWork_51 + Schedule_Task_E_1_PerformWork_52 + Schedule_Task_E_1_PerformWork_53 + Schedule_Task_E_1_PerformWork_54 + Schedule_Task_E_1_PerformWork_55 + Schedule_Task_E_1_PerformWork_56 + Schedule_Task_E_1_PerformWork_57 + Schedule_Task_E_1_PerformWork_58 + Schedule_Task_E_1_PerformWork_59 + Schedule_Task_E_1_PerformWork_60 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9 + 1 <= Try_Check_Sources_E_1)))) : E ((((CanInjectEvent + 1 <= NotifyEventEndOfCheckSourcesE_1) OR (place_462 + 1 <= mo2)) U A (G ((Check_Sources_B_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f2_41 + f2_42 + f2_43 + f2_44 + f2_45 + f2_46 + f2_47 + f2_48 + f2_49 + f2_50 + f2_51 + f2_52 + f2_53 + f2_54 + f2_55 + f2_56 + f2_57 + f2_58 + f2_59 + f2_60))))) : NOT((NOT(E (F ((1 <= place_460)))) OR (Check_Sources_B_1 + 1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60))) : A (G (E (X ((place_460 <= 1))))) : A (G ((3 <= DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1))) : (E (G (A (F ((mo3 <= ModifiedSrc_10 + ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + ModifiedSrc_6 + ModifiedSrc_7 + ModifiedSrc_8 + ModifiedSrc_9))))) AND A (F ((CanInjectEvent + 1 <= place_458)))) : (((A (G ((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_23 + FetchJobE_1_24 + FetchJobE_1_25 + FetchJobE_1_26 + FetchJobE_1_27 + FetchJobE_1_28 + FetchJobE_1_29 + FetchJobE_1_30 + FetchJobE_1_31 + FetchJobE_1_32 + FetchJobE_1_33 + FetchJobE_1_34 + FetchJobE_1_35 + FetchJobE_1_36 + FetchJobE_1_37 + FetchJobE_1_38 + FetchJobE_1_39 + FetchJobE_1_40 + FetchJobE_1_41 + FetchJobE_1_42 + FetchJobE_1_43 + FetchJobE_1_44 + FetchJobE_1_45 + FetchJobE_1_46 + FetchJobE_1_47 + FetchJobE_1_48 + FetchJobE_1_49 + FetchJobE_1_50 + FetchJobE_1_51 + FetchJobE_1_52 + FetchJobE_1_53 + FetchJobE_1_54 + FetchJobE_1_55 + FetchJobE_1_56 + FetchJobE_1_57 + FetchJobE_1_58 + FetchJobE_1_59 + FetchJobE_1_60 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9))) OR (f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f2_41 + f2_42 + f2_43 + f2_44 + f2_45 + f2_46 + f2_47 + f2_48 + f2_49 + f2_50 + f2_51 + f2_52 + f2_53 + f2_54 + f2_55 + f2_56 + f2_57 + f2_58 + f2_59 + f2_60 + 1 <= place_456)) AND (place_782_1 <= mo2)) AND E (X (((2 <= place_518_1) OR (JobCnt <= mo1) OR (1 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9)))))
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 (((mo2 <= FetchJobB_1) OR (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 ... (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 4328 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J60-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality.sara.
lola: sara is running 0 secs || 6282 markings, 7438 edges, 1256 markings/sec, 0 secs
lola: sara is running 5 secs || 12058 markings, 14029 edges, 1155 markings/sec, 5 secs
lola: sara is running 10 secs || 17901 markings, 20689 edges, 1169 markings/sec, 10 secs
lola: sara is running 15 secs || 23618 markings, 27338 edges, 1143 markings/sec, 15 secs
lola: sara is running 20 secs || 29501 markings, 34191 edges, 1177 markings/sec, 20 secs
lola: sara is running 25 secs || 35450 markings, 41267 edges, 1190 markings/sec, 25 secs
lola: sara is running 30 secs || 41305 markings, 48438 edges, 1171 markings/sec, 30 secs
lola: sara is running 35 secs || 46936 markings, 55621 edges, 1126 markings/sec, 35 secs
lola: sara is running 40 secs || 52942 markings, 64000 edges, 1201 markings/sec, 40 secs
lola: sara is running 45 secs || 59573 markings, 74632 edges, 1326 markings/sec, 45 secs
lola: sara is running 50 secs || 66893 markings, 84041 edges, 1464 markings/sec, 50 secs
lola: sara is running 55 secs || 73991 markings, 93211 edges, 1420 markings/sec, 55 secs
lola: sara is running 60 secs || 81031 markings, 102106 edges, 1408 markings/sec, 60 secs
lola: sara is running 65 secs || 88135 markings, 111264 edges, 1421 markings/sec, 65 secs
lola: sara is running 70 secs || 95365 markings, 120493 edges, 1446 markings/sec, 70 secs
lola: sara is running 75 secs || 102659 markings, 129969 edges, 1459 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 109964 markings, 139301 edges, 1461 markings/sec, 80 secs
lola: sara is running 85 secs || 117228 markings, 148639 edges, 1453 markings/sec, 85 secs
lola: sara is running 90 secs || 124519 markings, 158042 edges, 1458 markings/sec, 90 secs
lola: sara is running 95 secs || 131803 markings, 167479 edges, 1457 markings/sec, 95 secs
lola: sara is running 100 secs || 139109 markings, 176911 edges, 1461 markings/sec, 100 secs
lola: sara is running 105 secs || 146434 markings, 186439 edges, 1465 markings/sec, 105 secs
lola: sara is running 110 secs || 153734 markings, 195949 edges, 1460 markings/sec, 110 secs
lola: sara is running 115 secs || 160946 markings, 205413 edges, 1442 markings/sec, 115 secs
lola: sara is running 120 secs || 168301 markings, 214969 edges, 1471 markings/sec, 120 secs
lola: sara is running 125 secs || 175564 markings, 224493 edges, 1453 markings/sec, 125 secs
lola: sara is running 130 secs || 182840 markings, 234077 edges, 1455 markings/sec, 130 secs
lola: sara is running 135 secs || 190119 markings, 243710 edges, 1456 markings/sec, 135 secs
lola: sara is running 140 secs || 197318 markings, 253344 edges, 1440 markings/sec, 140 secs
lola: sara is running 145 secs || 204598 markings, 263083 edges, 1456 markings/sec, 145 secs
lola: sara is running 150 secs || 211845 markings, 272857 edges, 1449 markings/sec, 150 secs
lola: sara is running 155 secs || 219105 markings, 282793 edges, 1452 markings/sec, 155 secs
lola: sara is running 160 secs || 226329 markings, 292860 edges, 1445 markings/sec, 160 secs
lola: sara is running 165 secs || 233527 markings, 303235 edges, 1440 markings/sec, 165 secs
lola: sara is running 170 secs || 240693 markings, 314690 edges, 1433 markings/sec, 170 secs
lola: sara is running 175 secs || 245470 markings, 323456 edges, 955 markings/sec, 175 secs
lola: sara is running 180 secs || 249773 markings, 330384 edges, 861 markings/sec, 180 secs
lola: sara is running 185 secs || 253943 markings, 336955 edges, 834 markings/sec, 185 secs
lola: sara is running 190 secs || 257795 markings, 343283 edges, 770 markings/sec, 190 secs
lola: sara is running 195 secs || 261750 markings, 349553 edges, 791 markings/sec, 195 secs
lola: sara is running 200 secs || 265831 markings, 356204 edges, 816 markings/sec, 200 secs
lola: sara is running 205 secs || 270017 markings, 362994 edges, 837 markings/sec, 205 secs
lola: sara is running 210 secs || 274400 markings, 370060 edges, 877 markings/sec, 210 secs
lola: sara is running 215 secs || 278680 markings, 377166 edges, 856 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((3 <= place_522_1))) AND E (F ((f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f2_41 + f2_42 + f2_43 + f2_44 + f2_45... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= place_522_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= place_522_1)))))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((1 <= cSources) AND ((1 <= cSources) OR (1 <= NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= cSources) AND ((1 <= cSources) OR (1 <= NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + No... (shortened)
lola: processed formula length: 1866
lola: 3 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9 <= place_522_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (place_522_1 + 1 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9))
lola: processed formula length: 189
lola: 4 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Perform_Work_E_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_38 + f2_39 + f2_40 + f2_41 + f2_42 + f2_43 + f2_44 + f2_45 + f2_46 + f2_47 +... (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 4328 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 PolyORBNT-COL-S10J60-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-4.sara.
lola: sara is running 0 secs || 5862 markings, 6560 edges, 1172 markings/sec, 0 secs
lola: sara is running 5 secs || 12193 markings, 13717 edges, 1266 markings/sec, 5 secs
lola: sara is running 10 secs || 18428 markings, 20873 edges, 1247 markings/sec, 10 secs
lola: sara is running 15 secs || 24633 markings, 28093 edges, 1241 markings/sec, 15 secs
lola: sara is running 20 secs || 30949 markings, 35491 edges, 1263 markings/sec, 20 secs
lola: sara is running 25 secs || 37155 markings, 42979 edges, 1241 markings/sec, 25 secs
lola: sara is running 30 secs || 43421 markings, 50715 edges, 1253 markings/sec, 30 secs
lola: sara is running 35 secs || 49683 markings, 58943 edges, 1252 markings/sec, 35 secs
lola: sara is running 40 secs || 55989 markings, 69678 edges, 1261 markings/sec, 40 secs
lola: sara is running 45 secs || 64152 markings, 79581 edges, 1633 markings/sec, 45 secs
lola: sara is running 50 secs || 72095 markings, 89373 edges, 1589 markings/sec, 50 secs
lola: sara is running 55 secs || 80268 markings, 99223 edges, 1635 markings/sec, 55 secs
lola: sara is running 60 secs || 88226 markings, 109006 edges, 1592 markings/sec, 60 secs
lola: sara is running 65 secs || 96310 markings, 118945 edges, 1617 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 70 secs || 104422 markings, 128890 edges, 1622 markings/sec, 70 secs
lola: sara is running 75 secs || 112466 markings, 138831 edges, 1609 markings/sec, 75 secs
lola: sara is running 80 secs || 120561 markings, 148754 edges, 1619 markings/sec, 80 secs
lola: sara is running 85 secs || 128687 markings, 158877 edges, 1625 markings/sec, 85 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= place_460) AND (1 <= JobCnt)) OR (NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + Not... (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 4328 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 PolyORBNT-COL-S10J60-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((Try_Check_Sources_E_1 <= cJobCnt))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (Try_Check_Sources_E_1 <= cJobCnt))))
lola: processed formula length: 59
lola: 8 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((mo3 <= QueueJobE_1))) U (place_782_1 + 1 <= place_518_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (mo3 <= QueueJobE_1)) U (place_782_1 + 1 <= place_518_1))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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: 159273 markings, 557222 edges, 2217563083180605440 markings/sec, 0 secs
lola: 308764 markings, 1078330 edges, 29898 markings/sec, 5 secs
lola: 447832 markings, 1562631 edges, 27814 markings/sec, 10 secs
lola: 599441 markings, 2092796 edges, 30322 markings/sec, 15 secs
lola: 743732 markings, 2595256 edges, 28858 markings/sec, 20 secs
lola: 876318 markings, 3060425 edges, 26517 markings/sec, 25 secs
lola: 1017187 markings, 3548403 edges, 28174 markings/sec, 30 secs
lola: 1155099 markings, 4016820 edges, 27582 markings/sec, 35 secs
lola: 1282500 markings, 4453586 edges, 25480 markings/sec, 40 secs
lola: 1417864 markings, 4919791 edges, 27073 markings/sec, 45 secs
lola: 1545372 markings, 5363809 edges, 25502 markings/sec, 50 secs
lola: 1679652 markings, 5837670 edges, 26856 markings/sec, 55 secs
lola: 1801081 markings, 6273146 edges, 24286 markings/sec, 60 secs
lola: 1914921 markings, 6740831 edges, 22768 markings/sec, 65 secs
lola: 2024629 markings, 7169410 edges, 21942 markings/sec, 70 secs
lola: 2125437 markings, 7610279 edges, 20162 markings/sec, 75 secs
lola: 2229535 markings, 8046008 edges, 20820 markings/sec, 80 secs
lola: 2343804 markings, 8513126 edges, 22854 markings/sec, 85 secs
lola: 2442466 markings, 8951726 edges, 19732 markings/sec, 90 secs
lola: 2550291 markings, 9397545 edges, 21565 markings/sec, 95 secs
lola: 2655232 markings, 9827935 edges, 20988 markings/sec, 100 secs
lola: 2761906 markings, 10258131 edges, 21335 markings/sec, 105 secs
lola: 2871264 markings, 10705385 edges, 21872 markings/sec, 110 secs
lola: 2966549 markings, 11126945 edges, 19057 markings/sec, 115 secs
lola: 3068927 markings, 11577531 edges, 20476 markings/sec, 120 secs
lola: 3219928 markings, 12118178 edges, 30200 markings/sec, 125 secs
lola: 3365179 markings, 12627392 edges, 29050 markings/sec, 130 secs
lola: 3513920 markings, 13146011 edges, 29748 markings/sec, 135 secs
lola: 3654718 markings, 13636446 edges, 28160 markings/sec, 140 secs
lola: 3793358 markings, 14121139 edges, 27728 markings/sec, 145 secs
lola: 3926101 markings, 14586629 edges, 26549 markings/sec, 150 secs
lola: 4063634 markings, 15067227 edges, 27507 markings/sec, 155 secs
lola: 4197536 markings, 15542051 edges, 26780 markings/sec, 160 secs
lola: 4337728 markings, 16038762 edges, 28038 markings/sec, 165 secs
lola: 4469627 markings, 16507078 edges, 26380 markings/sec, 170 secs
lola: 4607678 markings, 17004112 edges, 27610 markings/sec, 175 secs
lola: 4742868 markings, 17494078 edges, 27038 markings/sec, 180 secs
lola: 4876880 markings, 17982750 edges, 26802 markings/sec, 185 secs
lola: 5001528 markings, 18442942 edges, 24930 markings/sec, 190 secs
lola: 5120472 markings, 18891347 edges, 23789 markings/sec, 195 secs
lola: 5233324 markings, 19362949 edges, 22570 markings/sec, 200 secs
lola: 5339292 markings, 19865763 edges, 21194 markings/sec, 205 secs
lola: 5443835 markings, 20299004 edges, 20909 markings/sec, 210 secs
lola: 5554817 markings, 20763082 edges, 22196 markings/sec, 215 secs
lola: 5660459 markings, 21196103 edges, 21128 markings/sec, 220 secs
lola: 5767360 markings, 21637792 edges, 21380 markings/sec, 225 secs
lola: 5879496 markings, 22108237 edges, 22427 markings/sec, 230 secs
lola: 5978024 markings, 22549845 edges, 19706 markings/sec, 235 secs
lola: 6096925 markings, 23013820 edges, 23780 markings/sec, 240 secs
lola: 6235490 markings, 23493908 edges, 27713 markings/sec, 245 secs
lola: 6364343 markings, 23940007 edges, 25771 markings/sec, 250 secs
lola: 6505648 markings, 24433472 edges, 28261 markings/sec, 255 secs
lola: 6642377 markings, 24912070 edges, 27346 markings/sec, 260 secs
lola: 6772069 markings, 25365987 edges, 25938 markings/sec, 265 secs
lola: 6895517 markings, 25796844 edges, 24690 markings/sec, 270 secs
lola: 7027588 markings, 26264481 edges, 26414 markings/sec, 275 secs
lola: 7160168 markings, 26730210 edges, 26516 markings/sec, 280 secs
lola: 7281204 markings, 27158579 edges, 24207 markings/sec, 285 secs
lola: 7400729 markings, 27587299 edges, 23905 markings/sec, 290 secs
lola: 7531793 markings, 28057168 edges, 26213 markings/sec, 295 secs
lola: 7649081 markings, 28478403 edges, 23458 markings/sec, 300 secs
lola: 7777168 markings, 28942865 edges, 25617 markings/sec, 305 secs
lola: 7901243 markings, 29401542 edges, 24815 markings/sec, 310 secs
lola: 8015593 markings, 29829195 edges, 22870 markings/sec, 315 secs
lola: 8101374 markings, 30175036 edges, 17156 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X (((2 <= FetchJobB_1) AND (1 <= mi2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(((2 <= FetchJobB_1) AND (1 <= mi2))))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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: 103509 markings, 267062 edges, 2217563083180605440 markings/sec, 0 secs
lola: 219202 markings, 550981 edges, 23139 markings/sec, 5 secs
lola: 330703 markings, 822835 edges, 22300 markings/sec, 10 secs
lola: 439221 markings, 1090923 edges, 21704 markings/sec, 15 secs
lola: 554622 markings, 1379671 edges, 23080 markings/sec, 20 secs
lola: 665016 markings, 1654505 edges, 22079 markings/sec, 25 secs
lola: 772706 markings, 1926034 edges, 21538 markings/sec, 30 secs
lola: 878053 markings, 2188085 edges, 21069 markings/sec, 35 secs
lola: 987253 markings, 2459596 edges, 21840 markings/sec, 40 secs
lola: 1095785 markings, 2720677 edges, 21706 markings/sec, 45 secs
lola: 1201224 markings, 2971798 edges, 21088 markings/sec, 50 secs
lola: 1299863 markings, 3215050 edges, 19728 markings/sec, 55 secs
lola: 1406434 markings, 3474490 edges, 21314 markings/sec, 60 secs
lola: 1508084 markings, 3725493 edges, 20330 markings/sec, 65 secs
lola: 1607552 markings, 3975051 edges, 19894 markings/sec, 70 secs
lola: 1712195 markings, 4240979 edges, 20929 markings/sec, 75 secs
lola: 1807198 markings, 4490169 edges, 19001 markings/sec, 80 secs
lola: 1899631 markings, 4781406 edges, 18487 markings/sec, 85 secs
lola: 1991021 markings, 5051845 edges, 18278 markings/sec, 90 secs
lola: 2079159 markings, 5304668 edges, 17628 markings/sec, 95 secs
lola: 2155697 markings, 5592909 edges, 15308 markings/sec, 100 secs
lola: 2239807 markings, 5847912 edges, 16822 markings/sec, 105 secs
lola: 2326695 markings, 6115859 edges, 17378 markings/sec, 110 secs
lola: 2406322 markings, 6390254 edges, 15925 markings/sec, 115 secs
lola: 2487902 markings, 6656126 edges, 16316 markings/sec, 120 secs
lola: 2572398 markings, 6916404 edges, 16899 markings/sec, 125 secs
lola: 2652656 markings, 7164030 edges, 16052 markings/sec, 130 secs
lola: 2736439 markings, 7418901 edges, 16757 markings/sec, 135 secs
lola: 2817731 markings, 7667477 edges, 16258 markings/sec, 140 secs
lola: 2900974 markings, 7928975 edges, 16649 markings/sec, 145 secs
lola: 2973891 markings, 8193046 edges, 14583 markings/sec, 150 secs
lola: 3051753 markings, 8464854 edges, 15572 markings/sec, 155 secs
lola: 3164999 markings, 8756306 edges, 22649 markings/sec, 160 secs
lola: 3277367 markings, 9047856 edges, 22474 markings/sec, 165 secs
lola: 3386544 markings, 9317449 edges, 21835 markings/sec, 170 secs
lola: 3500424 markings, 9600469 edges, 22776 markings/sec, 175 secs
lola: 3611517 markings, 9876373 edges, 22219 markings/sec, 180 secs
lola: 3722094 markings, 10150706 edges, 22115 markings/sec, 185 secs
lola: 3829991 markings, 10417755 edges, 21579 markings/sec, 190 secs
lola: 3936300 markings, 10683882 edges, 21262 markings/sec, 195 secs
lola: 4041566 markings, 10948554 edges, 21053 markings/sec, 200 secs
lola: 4146962 markings, 11217493 edges, 21079 markings/sec, 205 secs
lola: 4253240 markings, 11484746 edges, 21256 markings/sec, 210 secs
lola: 4358123 markings, 11750623 edges, 20977 markings/sec, 215 secs
lola: 4459169 markings, 12013214 edges, 20209 markings/sec, 220 secs
lola: 4565923 markings, 12287998 edges, 21351 markings/sec, 225 secs
lola: 4673034 markings, 12564700 edges, 21422 markings/sec, 230 secs
lola: 4776101 markings, 12836898 edges, 20613 markings/sec, 235 secs
lola: 4876576 markings, 13105058 edges, 20095 markings/sec, 240 secs
lola: 4973118 markings, 13363129 edges, 19308 markings/sec, 245 secs
lola: 5069307 markings, 13628456 edges, 19238 markings/sec, 250 secs
lola: 5162447 markings, 13890778 edges, 18628 markings/sec, 255 secs
lola: 5246986 markings, 14182628 edges, 16908 markings/sec, 260 secs
lola: 5330456 markings, 14491693 edges, 16694 markings/sec, 265 secs
lola: 5418156 markings, 14756762 edges, 17540 markings/sec, 270 secs
lola: 5496512 markings, 15028871 edges, 15671 markings/sec, 275 secs
lola: 5582823 markings, 15295008 edges, 17262 markings/sec, 280 secs
lola: 5662851 markings, 15543921 edges, 16006 markings/sec, 285 secs
lola: 5745031 markings, 15800728 edges, 16436 markings/sec, 290 secs
lola: 5828931 markings, 16065997 edges, 16780 markings/sec, 295 secs
lola: 5910344 markings, 16329923 edges, 16283 markings/sec, 300 secs
lola: 5986021 markings, 16597386 edges, 15135 markings/sec, 305 secs
lola: 6076298 markings, 16866267 edges, 18055 markings/sec, 310 secs
lola: 6183040 markings, 17132569 edges, 21348 markings/sec, 315 secs
lola: 6286070 markings, 17382432 edges, 20606 markings/sec, 320 secs
lola: 6385103 markings, 17630407 edges, 19807 markings/sec, 325 secs
lola: 6494050 markings, 17901133 edges, 21789 markings/sec, 330 secs
lola: 6597038 markings, 18158400 edges, 20598 markings/sec, 335 secs
lola: 6703404 markings, 18423018 edges, 21273 markings/sec, 340 secs
lola: 6801886 markings, 18670487 edges, 19696 markings/sec, 345 secs
lola: 6898881 markings, 18911501 edges, 19399 markings/sec, 350 secs
lola: 7004586 markings, 19177654 edges, 21141 markings/sec, 355 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Wo... (shortened)
lola: processed formula length: 3932
lola: 1 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 10 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((CanInjectEvent + 1 <= NotifyEventEndOfCheckSourcesE_1) OR (place_462 + 1 <= mo2)) U A (G ((Check_Sources_B_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((CanInjectEvent + 1 <= NotifyEventEndOfCheckSourcesE_1) OR (place_462 + 1 <= mo2)) U NOT(E(TRUE U (f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + f2_31 + f2_32 + f2_33 + f2_34 + f2_35 + f2_36 + f2_37 + f2_... (shortened)
lola: processed formula length: 607
lola: 3 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 11 will run for 506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (F ((1 <= place_460)))) OR (Check_Sources_B_1 + 1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= place_460)))
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 4328 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 PolyORBNT-COL-S10J60-CTLCardinality-11.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: subprocess 12 will run for 633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_... (shortened)
lola: processed formula length: 1352
lola: 8 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((place_460 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((place_460 <= 1)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 13 will run for 844 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1)))
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 4328 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 PolyORBNT-COL-S10J60-CTLCardinality-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((mo3 <= ModifiedSrc_10 + ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + ModifiedSrc_6 + ModifiedSrc_7 + ModifiedSrc_8 + ModifiedSrc_9))))) AND A (F ((CanInjectEvent + 1 <= place_458))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((mo3 <= ModifiedSrc_10 + ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + ModifiedSrc_6 + ModifiedSrc_7 + ModifiedSrc_8 + ModifiedSrc_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (mo3 <= ModifiedSrc_10 + ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + ModifiedSrc_6 + ModifiedSrc_7 + ModifiedSrc_8 + ModifiedSrc_9)))))
lola: processed formula length: 197
lola: 2 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 15 will run for 2533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CanInjectEvent + 1 <= place_458)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (CanInjectEvent + 1 <= place_458))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (G ((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_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 4328 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 PolyORBNT-COL-S10J60-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-CTLCardinality-15.sara.
lola: sara is running 0 secs || 1686 markings, 2145 edges, 337 markings/sec, 0 secs
lola: sara is running 5 secs || 3332 markings, 4254 edges, 329 markings/sec, 5 secs
lola: sara is running 10 secs || 4974 markings, 6356 edges, 328 markings/sec, 10 secs
lola: sara is running 15 secs || 6618 markings, 8456 edges, 329 markings/sec, 15 secs
lola: sara is running 20 secs || 8261 markings, 10554 edges, 329 markings/sec, 20 secs
lola: sara is running 25 secs || 9912 markings, 12675 edges, 330 markings/sec, 25 secs
lola: sara is running 30 secs || 11563 markings, 14800 edges, 330 markings/sec, 30 secs
lola: sara is running 35 secs || 13183 markings, 16880 edges, 324 markings/sec, 35 secs
lola: sara is running 40 secs || 14859 markings, 19041 edges, 335 markings/sec, 40 secs
lola: sara is running 45 secs || 16544 markings, 21197 edges, 337 markings/sec, 45 secs
lola: sara is running 50 secs || 18225 markings, 23341 edges, 336 markings/sec, 50 secs
lola: sara is running 55 secs || 19903 markings, 25487 edges, 336 markings/sec, 55 secs
lola: sara is running 60 secs || 21548 markings, 27608 edges, 329 markings/sec, 60 secs
lola: sara is running 65 secs || 23185 markings, 29707 edges, 327 markings/sec, 65 secs
lola: sara is running 70 secs || 24854 markings, 37467 edges, 334 markings/sec, 70 secs
lola: sara is running 75 secs || 26535 markings, 39641 edges, 336 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 28209 markings, 41785 edges, 335 markings/sec, 80 secs

lola: sara is running 85 secs || 29897 markings, 43934 edges, 338 markings/sec, 85 secs
lola: sara is running 90 secs || 31584 markings, 46087 edges, 337 markings/sec, 90 secs
lola: sara is running 95 secs || 33264 markings, 48254 edges, 336 markings/sec, 95 secs
lola: sara is running 100 secs || 34945 markings, 50426 edges, 336 markings/sec, 100 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (place_782_1 <= mo2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (place_782_1 <= mo2)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= place_518_1) OR (JobCnt <= mo1) OR (1 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((2 <= place_518_1) OR (JobCnt <= mo1) OR (1 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9)))
lola: processed formula length: 214
lola: 2 rewrites
lola: formula mentions 0 of 1234 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4328 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 0 significant temporal operators and needs 0 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes no no no no unknown unknown no no yes no no no unknown
lola: ========================================
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496355585263

--------------------
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_PolyORBNT-PT-S10J60"
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_PolyORBNT-PT-S10J60.tgz
mv S_PolyORBNT-PT-S10J60 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_PolyORBNT-PT-S10J60, 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 r138-smll-149479231600165"
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 ;