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 PolyORBNT-PT-S10J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926200165
=====================================================================

--------------------
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 1494742659881


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ 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 || 6128 markings, 7284 edges, 1226 markings/sec, 0 secs
lola: sara is running 5 secs || 12106 markings, 14077 edges, 1196 markings/sec, 5 secs
lola: sara is running 10 secs || 18101 markings, 20912 edges, 1199 markings/sec, 10 secs
lola: sara is running 15 secs || 24064 markings, 27817 edges, 1193 markings/sec, 15 secs
lola: sara is running 20 secs || 30062 markings, 34829 edges, 1200 markings/sec, 20 secs
lola: sara is running 25 secs || 36039 markings, 41971 edges, 1195 markings/sec, 25 secs
lola: sara is running 30 secs || 41935 markings, 49265 edges, 1179 markings/sec, 30 secs
lola: sara is running 35 secs || 47959 markings, 56967 edges, 1205 markings/sec, 35 secs
lola: sara is running 40 secs || 53905 markings, 65596 edges, 1189 markings/sec, 40 secs
lola: sara is running 45 secs || 60794 markings, 76248 edges, 1378 markings/sec, 45 secs
lola: sara is running 50 secs || 67963 markings, 85505 edges, 1434 markings/sec, 50 secs
lola: sara is running 55 secs || 75289 markings, 94757 edges, 1465 markings/sec, 55 secs
lola: sara is running 60 secs || 82586 markings, 104179 edges, 1459 markings/sec, 60 secs
lola: sara is running 65 secs || 89825 markings, 113384 edges, 1448 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 97091 markings, 122810 edges, 1453 markings/sec, 70 secs
lola: sara is running 75 secs || 104763 markings, 132614 edges, 1534 markings/sec, 75 secs
lola: sara is running 80 secs || 112361 markings, 142380 edges, 1520 markings/sec, 80 secs
lola: sara is running 85 secs || 120006 markings, 152231 edges, 1529 markings/sec, 85 secs
lola: sara is running 90 secs || 127660 markings, 162118 edges, 1531 markings/sec, 90 secs
lola: sara is running 95 secs || 135303 markings, 172018 edges, 1529 markings/sec, 95 secs
lola: sara is running 100 secs || 142943 markings, 181962 edges, 1528 markings/sec, 100 secs
lola: sara is running 105 secs || 150545 markings, 191761 edges, 1520 markings/sec, 105 secs
lola: sara is running 110 secs || 158245 markings, 201830 edges, 1540 markings/sec, 110 secs
lola: sara is running 115 secs || 165844 markings, 211745 edges, 1520 markings/sec, 115 secs
lola: sara is running 120 secs || 173450 markings, 221715 edges, 1521 markings/sec, 120 secs
lola: sara is running 125 secs || 181090 markings, 231772 edges, 1528 markings/sec, 125 secs
lola: sara is running 130 secs || 188725 markings, 241865 edges, 1527 markings/sec, 130 secs
lola: sara is running 135 secs || 196303 markings, 251942 edges, 1516 markings/sec, 135 secs
lola: sara is running 140 secs || 203898 markings, 262112 edges, 1519 markings/sec, 140 secs
lola: sara is running 145 secs || 211462 markings, 272360 edges, 1513 markings/sec, 145 secs
lola: sara is running 150 secs || 219093 markings, 282776 edges, 1526 markings/sec, 150 secs
lola: sara is running 155 secs || 226658 markings, 293344 edges, 1513 markings/sec, 155 secs
lola: sara is running 160 secs || 234218 markings, 304256 edges, 1512 markings/sec, 160 secs
lola: sara is running 165 secs || 241731 markings, 317098 edges, 1503 markings/sec, 165 secs
lola: sara is running 170 secs || 246285 markings, 324774 edges, 911 markings/sec, 170 secs
lola: sara is running 175 secs || 250699 markings, 331913 edges, 883 markings/sec, 175 secs
lola: sara is running 180 secs || 255260 markings, 339146 edges, 912 markings/sec, 180 secs
lola: sara is running 185 secs || 259780 markings, 346360 edges, 904 markings/sec, 185 secs
lola: sara is running 190 secs || 264231 markings, 353559 edges, 890 markings/sec, 190 secs
lola: sara is running 195 secs || 268631 markings, 360775 edges, 880 markings/sec, 195 secs
lola: sara is running 200 secs || 273122 markings, 368035 edges, 898 markings/sec, 200 secs
lola: sara is running 205 secs || 277586 markings, 375393 edges, 893 markings/sec, 205 secs
lola: sara is running 210 secs || 282092 markings, 382792 edges, 901 markings/sec, 210 secs
lola: sara is running 215 secs || 286542 markings, 390183 edges, 890 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 237 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 || 6202 markings, 6918 edges, 1240 markings/sec, 0 secs
lola: sara is running 5 secs || 12338 markings, 13920 edges, 1227 markings/sec, 5 secs
lola: sara is running 10 secs || 18604 markings, 21070 edges, 1253 markings/sec, 10 secs
lola: sara is running 15 secs || 24687 markings, 28181 edges, 1217 markings/sec, 15 secs
lola: sara is running 20 secs || 30969 markings, 35511 edges, 1256 markings/sec, 20 secs
lola: sara is running 25 secs || 37133 markings, 42957 edges, 1233 markings/sec, 25 secs
lola: sara is running 30 secs || 43382 markings, 50661 edges, 1250 markings/sec, 30 secs
lola: sara is running 35 secs || 49575 markings, 58777 edges, 1239 markings/sec, 35 secs
lola: sara is running 40 secs || 55849 markings, 69538 edges, 1255 markings/sec, 40 secs
lola: sara is running 45 secs || 64043 markings, 79450 edges, 1639 markings/sec, 45 secs
lola: sara is running 50 secs || 72056 markings, 89317 edges, 1603 markings/sec, 50 secs
lola: sara is running 55 secs || 80166 markings, 99099 edges, 1622 markings/sec, 55 secs
lola: sara is running 60 secs || 88046 markings, 108819 edges, 1576 markings/sec, 60 secs
lola: sara is running 65 secs || 96113 markings, 118667 edges, 1613 markings/sec, 65 secs
lola: sara is running 70 secs || 104225 markings, 128612 edges, 1622 markings/sec, 70 secs
lola: sara is running 75 secs || 112298 markings, 138593 edges, 1615 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 80 secs || 120334 markings, 148498 edges, 1607 markings/sec, 80 secs
lola: sara is running 85 secs || 128548 markings, 158679 edges, 1643 markings/sec, 85 secs
lola: sara is running 90 secs || 136644 markings, 168747 edges, 1619 markings/sec, 90 secs
lola: sara is running 95 secs || 144780 markings, 178939 edges, 1627 markings/sec, 95 secs
lola: sara is running 100 secs || 152771 markings, 189060 edges, 1598 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: subprocess 5 will run for 292 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 321 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 356 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: 161183 markings, 563571 edges, 2217563083180605440 markings/sec, 0 secs
lola: 314090 markings, 1093836 edges, 30581 markings/sec, 5 secs
lola: 456621 markings, 1594560 edges, 28506 markings/sec, 10 secs
lola: 611216 markings, 2129533 edges, 30919 markings/sec, 15 secs
lola: 758170 markings, 2642874 edges, 29391 markings/sec, 20 secs
lola: 891853 markings, 3113090 edges, 26737 markings/sec, 25 secs
lola: 1033364 markings, 3602131 edges, 28302 markings/sec, 30 secs
lola: 1174372 markings, 4082273 edges, 28202 markings/sec, 35 secs
lola: 1306201 markings, 4534173 edges, 26366 markings/sec, 40 secs
lola: 1448719 markings, 5026228 edges, 28504 markings/sec, 45 secs
lola: 1575746 markings, 5470930 edges, 25405 markings/sec, 50 secs
lola: 1708072 markings, 5938606 edges, 26465 markings/sec, 55 secs
lola: 1829382 markings, 6376996 edges, 24262 markings/sec, 60 secs
lola: 1941565 markings, 6862551 edges, 22437 markings/sec, 65 secs
lola: 2056677 markings, 7292353 edges, 23022 markings/sec, 70 secs
lola: 2155784 markings, 7748820 edges, 19821 markings/sec, 75 secs
lola: 2270121 markings, 8210458 edges, 22867 markings/sec, 80 secs
lola: 2380300 markings, 8668839 edges, 22036 markings/sec, 85 secs
lola: 2485520 markings, 9133573 edges, 21044 markings/sec, 90 secs
lola: 2597708 markings, 9592364 edges, 22438 markings/sec, 95 secs
lola: 2703349 markings, 10022113 edges, 21128 markings/sec, 100 secs
lola: 2810536 markings, 10456016 edges, 21437 markings/sec, 105 secs
lola: 2918524 markings, 10904638 edges, 21598 markings/sec, 110 secs
lola: 3009068 markings, 11333218 edges, 18109 markings/sec, 115 secs
lola: 3143352 markings, 11847685 edges, 26857 markings/sec, 120 secs
lola: 3297942 markings, 12392429 edges, 30918 markings/sec, 125 secs
lola: 3445889 markings, 12908516 edges, 29589 markings/sec, 130 secs
lola: 3593793 markings, 13421536 edges, 29581 markings/sec, 135 secs
lola: 3738183 markings, 13924821 edges, 28878 markings/sec, 140 secs
lola: 3877979 markings, 14415842 edges, 27959 markings/sec, 145 secs
lola: 4014502 markings, 14896086 edges, 27305 markings/sec, 150 secs
lola: 4152225 markings, 15381249 edges, 27545 markings/sec, 155 secs
lola: 4287703 markings, 15860738 edges, 27096 markings/sec, 160 secs
lola: 4418758 markings, 16326151 edges, 26211 markings/sec, 165 secs
lola: 4557130 markings, 16823413 edges, 27674 markings/sec, 170 secs
lola: 4694062 markings, 17315723 edges, 27386 markings/sec, 175 secs
lola: 4828427 markings, 17804034 edges, 26873 markings/sec, 180 secs
lola: 4951823 markings, 18258568 edges, 24679 markings/sec, 185 secs
lola: 5072810 markings, 18711349 edges, 24197 markings/sec, 190 secs
lola: 5188755 markings, 19153463 edges, 23189 markings/sec, 195 secs
lola: 5293231 markings, 19644461 edges, 20895 markings/sec, 200 secs
lola: 5400377 markings, 20101937 edges, 21429 markings/sec, 205 secs
lola: 5503257 markings, 20552638 edges, 20576 markings/sec, 210 secs
lola: 5613602 markings, 21004369 edges, 22069 markings/sec, 215 secs
lola: 5718918 markings, 21436893 edges, 21063 markings/sec, 220 secs
lola: 5828194 markings, 21891658 edges, 21855 markings/sec, 225 secs
lola: 5932525 markings, 22335464 edges, 20866 markings/sec, 230 secs
lola: 6033728 markings, 22790317 edges, 20241 markings/sec, 235 secs
lola: 6170230 markings, 23267430 edges, 27300 markings/sec, 240 secs
lola: 6302548 markings, 23729487 edges, 26464 markings/sec, 245 secs
lola: 6433401 markings, 24181929 edges, 26171 markings/sec, 250 secs
lola: 6574904 markings, 24674659 edges, 28301 markings/sec, 255 secs
lola: 6710319 markings, 25147531 edges, 27083 markings/sec, 260 secs
lola: 6833888 markings, 25583504 edges, 24714 markings/sec, 265 secs
lola: 6967200 markings, 26052079 edges, 26662 markings/sec, 270 secs
lola: 7094145 markings, 26498165 edges, 25389 markings/sec, 275 secs
lola: 7220357 markings, 26942434 edges, 25242 markings/sec, 280 secs
lola: 7337531 markings, 27359551 edges, 23435 markings/sec, 285 secs
lola: 7464309 markings, 27813886 edges, 25356 markings/sec, 290 secs
lola: 7590219 markings, 28265249 edges, 25182 markings/sec, 295 secs
lola: 7704187 markings, 28679195 edges, 22794 markings/sec, 300 secs
lola: 7838277 markings, 29167313 edges, 26818 markings/sec, 305 secs
lola: 7953987 markings, 29596639 edges, 23142 markings/sec, 310 secs
lola: 8070156 markings, 30042634 edges, 23234 markings/sec, 315 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 360 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: 112200 markings, 285301 edges, 2217563083180605440 markings/sec, 0 secs
lola: 226243 markings, 568785 edges, 22809 markings/sec, 5 secs
lola: 336207 markings, 838079 edges, 21993 markings/sec, 10 secs
lola: 444093 markings, 1104058 edges, 21577 markings/sec, 15 secs
lola: 558917 markings, 1392358 edges, 22965 markings/sec, 20 secs
lola: 668446 markings, 1664881 edges, 21906 markings/sec, 25 secs
lola: 775659 markings, 1932531 edges, 21443 markings/sec, 30 secs
lola: 880522 markings, 2193343 edges, 20973 markings/sec, 35 secs
lola: 989155 markings, 2464038 edges, 21727 markings/sec, 40 secs
lola: 1097487 markings, 2724984 edges, 21666 markings/sec, 45 secs
lola: 1205380 markings, 2982328 edges, 21579 markings/sec, 50 secs
lola: 1307933 markings, 3232261 edges, 20511 markings/sec, 55 secs
lola: 1417142 markings, 3499235 edges, 21842 markings/sec, 60 secs
lola: 1517381 markings, 3749017 edges, 20048 markings/sec, 65 secs
lola: 1618213 markings, 4002466 edges, 20166 markings/sec, 70 secs
lola: 1722490 markings, 4268446 edges, 20855 markings/sec, 75 secs
lola: 1819437 markings, 4521659 edges, 19389 markings/sec, 80 secs
lola: 1909714 markings, 4811253 edges, 18055 markings/sec, 85 secs
lola: 2001205 markings, 5081303 edges, 18298 markings/sec, 90 secs
lola: 2089368 markings, 5335264 edges, 17633 markings/sec, 95 secs
lola: 2167288 markings, 5627501 edges, 15584 markings/sec, 100 secs
lola: 2251643 markings, 5884059 edges, 16871 markings/sec, 105 secs
lola: 2337707 markings, 6150343 edges, 17213 markings/sec, 110 secs
lola: 2415909 markings, 6420602 edges, 15640 markings/sec, 115 secs
lola: 2497127 markings, 6684539 edges, 16244 markings/sec, 120 secs
lola: 2579357 markings, 6937871 edges, 16446 markings/sec, 125 secs
lola: 2661015 markings, 7190192 edges, 16332 markings/sec, 130 secs
lola: 2744946 markings, 7444152 edges, 16786 markings/sec, 135 secs
lola: 2824421 markings, 7688342 edges, 15895 markings/sec, 140 secs
lola: 2908625 markings, 7953465 edges, 16841 markings/sec, 145 secs
lola: 2979991 markings, 8216143 edges, 14273 markings/sec, 150 secs
lola: 3060866 markings, 8486414 edges, 16175 markings/sec, 155 secs
lola: 3173560 markings, 8778846 edges, 22539 markings/sec, 160 secs
lola: 3286767 markings, 9067721 edges, 22641 markings/sec, 165 secs
lola: 3389510 markings, 9325788 edges, 20549 markings/sec, 170 secs
lola: 3502051 markings, 9604534 edges, 22508 markings/sec, 175 secs
lola: 3613475 markings, 9880532 edges, 22285 markings/sec, 180 secs
lola: 3723991 markings, 10155023 edges, 22103 markings/sec, 185 secs
lola: 3830090 markings, 10418010 edges, 21220 markings/sec, 190 secs
lola: 3936697 markings, 10684831 edges, 21321 markings/sec, 195 secs
lola: 4042105 markings, 10950275 edges, 21082 markings/sec, 200 secs
lola: 4147990 markings, 11219828 edges, 21177 markings/sec, 205 secs
lola: 4254386 markings, 11487688 edges, 21279 markings/sec, 210 secs
lola: 4359319 markings, 11754003 edges, 20987 markings/sec, 215 secs
lola: 4461068 markings, 12017249 edges, 20350 markings/sec, 220 secs
lola: 4567820 markings, 12292247 edges, 21350 markings/sec, 225 secs
lola: 4674901 markings, 12570935 edges, 21416 markings/sec, 230 secs
lola: 4778083 markings, 12842802 edges, 20636 markings/sec, 235 secs
lola: 4878923 markings, 13111517 edges, 20168 markings/sec, 240 secs
lola: 4975089 markings, 13369803 edges, 19233 markings/sec, 245 secs
lola: 5069906 markings, 13630140 edges, 18963 markings/sec, 250 secs
lola: 5162607 markings, 13891350 edges, 18540 markings/sec, 255 secs
lola: 5244493 markings, 14171903 edges, 16377 markings/sec, 260 secs
lola: 5324450 markings, 14473275 edges, 15991 markings/sec, 265 secs
lola: 5409653 markings, 14729067 edges, 17041 markings/sec, 270 secs
lola: 5485513 markings, 14994871 edges, 15172 markings/sec, 275 secs
lola: 5566390 markings, 15243979 edges, 16175 markings/sec, 280 secs
lola: 5642970 markings, 15481254 edges, 15316 markings/sec, 285 secs
lola: 5717563 markings, 15714191 edges, 14919 markings/sec, 290 secs
lola: 5791302 markings, 15946620 edges, 14748 markings/sec, 295 secs
lola: 5868949 markings, 16195040 edges, 15529 markings/sec, 300 secs
lola: 5944853 markings, 16444277 edges, 15181 markings/sec, 305 secs
lola: 6016592 markings, 16716356 edges, 14348 markings/sec, 310 secs
lola: 6119642 markings, 16972529 edges, 20610 markings/sec, 315 secs
lola: 6224916 markings, 17235995 edges, 21055 markings/sec, 320 secs
lola: 6326909 markings, 17483950 edges, 20399 markings/sec, 325 secs
lola: 6428767 markings, 17737261 edges, 20372 markings/sec, 330 secs
lola: 6540133 markings, 18015333 edges, 22273 markings/sec, 335 secs
lola: 6645153 markings, 18277237 edges, 21004 markings/sec, 340 secs
lola: 6747512 markings, 18531125 edges, 20472 markings/sec, 345 secs
lola: 6845867 markings, 18777954 edges, 19671 markings/sec, 350 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 360 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 421 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 505 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 505 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 631 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 631 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 842 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 1263 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 1263 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 2526 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 2526 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 2526 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 || 1647 markings, 2100 edges, 329 markings/sec, 0 secs
lola: sara is running 5 secs || 3423 markings, 4358 edges, 355 markings/sec, 5 secs
lola: sara is running 10 secs || 5182 markings, 6619 edges, 352 markings/sec, 10 secs
lola: sara is running 15 secs || 6944 markings, 8885 edges, 352 markings/sec, 15 secs
lola: sara is running 20 secs || 8713 markings, 11137 edges, 354 markings/sec, 20 secs
lola: sara is running 25 secs || 10479 markings, 13421 edges, 353 markings/sec, 25 secs
lola: sara is running 30 secs || 12242 markings, 15663 edges, 353 markings/sec, 30 secs
lola: sara is running 35 secs || 14003 markings, 17936 edges, 352 markings/sec, 35 secs
lola: sara is running 40 secs || 15775 markings, 20208 edges, 354 markings/sec, 40 secs
lola: sara is running 45 secs || 17549 markings, 22479 edges, 355 markings/sec, 45 secs
lola: sara is running 50 secs || 19315 markings, 24756 edges, 353 markings/sec, 50 secs
lola: sara is running 55 secs || 21088 markings, 27004 edges, 355 markings/sec, 55 secs
lola: sara is running 60 secs || 22842 markings, 29283 edges, 351 markings/sec, 60 secs
lola: sara is running 65 secs || 24607 markings, 37166 edges, 353 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 26381 markings, 39415 edges, 355 markings/sec, 70 secs

lola: sara is running 75 secs || 28139 markings, 41698 edges, 352 markings/sec, 75 secs
lola: sara is running 80 secs || 29913 markings, 43953 edges, 355 markings/sec, 80 secs
lola: sara is running 85 secs || 31664 markings, 46201 edges, 350 markings/sec, 85 secs
lola: sara is running 90 secs || 33409 markings, 48454 edges, 349 markings/sec, 90 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: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes no no no no unknown unknown no no yes no no no unknown
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 1494743770966

--------------------
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="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/PolyORBNT-PT-S10J60.tgz
mv 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 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 r058-smll-149440926200165"
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 ;