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

About the Execution of LoLA for PolyORBNT-PT-S05J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15952.830 1340308.00 1713686.00 4767.70 TFFTF???FFF?T?FF 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 PolyORBNT-PT-S05J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926200129
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494723036839


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-PT-S05J80 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3539/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 1189 places, 2350 transitions, 1007 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J80-CTLCardinality.task
lola: A (X (E (G ((NotifyEventEndOfCheckSourcesB_1 <= mo2))))) : (E (X (A (F ((2 <= mo3))))) OR (A (X (((place_522_1 <= place_520_1) OR (place_523_1 <= Try_Check_Sources_E_1)))) AND ((place_458 <= place_500_1) AND A (X ((3 <= Check_Sources_B_1)))))) : (((((mo1 <= 0) AND (place_458 <= 2)) AND E (G ((place_518_1 <= QueueJobE_1)))) OR (((place_521_1 + 1 <= Try_Check_Sources_B_1) AND (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 + f1_61 + f1_62 + f1_63 + f1_64 + f1_65 + f1_66 + f1_67 + f1_68 + f1_69 + f1_70 + f1_71 + f1_72 + f1_73 + f1_74 + f1_75 + f1_76 + f1_77 + f1_78 + f1_79 + f1_80 <= 2)) AND E (X ((ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 <= QueueJobE_1))))) OR A (F (E (X ((2 <= QueueJobE_1)))))) : E (F ((2 <= 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 + Perform_Work_B_1_61 + Perform_Work_B_1_62 + Perform_Work_B_1_63 + Perform_Work_B_1_64 + Perform_Work_B_1_65 + Perform_Work_B_1_66 + Perform_Work_B_1_67 + Perform_Work_B_1_68 + Perform_Work_B_1_69 + Perform_Work_B_1_70 + Perform_Work_B_1_71 + Perform_Work_B_1_72 + Perform_Work_B_1_73 + Perform_Work_B_1_74 + Perform_Work_B_1_75 + Perform_Work_B_1_76 + Perform_Work_B_1_77 + Perform_Work_B_1_78 + Perform_Work_B_1_79 + Perform_Work_B_1_80))) : A (F ((((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 + Perform_Work_B_1_61 + Perform_Work_B_1_62 + Perform_Work_B_1_63 + Perform_Work_B_1_64 + Perform_Work_B_1_65 + Perform_Work_B_1_66 + Perform_Work_B_1_67 + Perform_Work_B_1_68 + Perform_Work_B_1_69 + Perform_Work_B_1_70 + Perform_Work_B_1_71 + Perform_Work_B_1_72 + Perform_Work_B_1_73 + Perform_Work_B_1_74 + Perform_Work_B_1_75 + Perform_Work_B_1_76 + Perform_Work_B_1_77 + Perform_Work_B_1_78 + Perform_Work_B_1_79 + Perform_Work_B_1_80 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_48 + AvailableJobId_49 + AvailableJobId_50 + AvailableJobId_51 + AvailableJobId_60 + AvailableJobId_61 + AvailableJobId_62 + AvailableJobId_63 + AvailableJobId_64 + AvailableJobId_70 + AvailableJobId_71 + AvailableJobId_72 + AvailableJobId_73 + AvailableJobId_74 + AvailableJobId_75 + AvailableJobId_76 + AvailableJobId_77 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_80 + AvailableJobId_79 + AvailableJobId_78 + AvailableJobId_69 + AvailableJobId_68 + AvailableJobId_67 + AvailableJobId_66 + AvailableJobId_65 + AvailableJobId_59 + AvailableJobId_58 + AvailableJobId_57 + AvailableJobId_56 + AvailableJobId_55 + AvailableJobId_54 + AvailableJobId_53 + AvailableJobId_52 + AvailableJobId_47 + AvailableJobId_46 + AvailableJobId_45 + AvailableJobId_44 + AvailableJobId_43 + AvailableJobId_42 + AvailableJobId_41 + AvailableJobId_40 + AvailableJobId_34 + AvailableJobId_33 + AvailableJobId_32 + AvailableJobId_31 + AvailableJobId_30 + AvailableJobId_29 + AvailableJobId_21 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16) AND (3 <= place_520_1) AND (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 + f1_61 + f1_62 + f1_63 + f1_64 + f1_65 + f1_66 + f1_67 + f1_68 + f1_69 + f1_70 + f1_71 + f1_72 + f1_73 + f1_74 + f1_75 + f1_76 + f1_77 + f1_78 + f1_79 + f1_80 + 1 <= NotifyEventJobQueuedE_1)) OR (3 <= place_460)))) : (A (G (E (X (TRUE)))) AND A (F (E (F ((3 <= place_458)))))) : E (G (((ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 <= cSources) OR (ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + 1 <= 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 + FetchJobE_1_61 + FetchJobE_1_62 + FetchJobE_1_63 + FetchJobE_1_64 + FetchJobE_1_65 + FetchJobE_1_66 + FetchJobE_1_67 + FetchJobE_1_68 + FetchJobE_1_69 + FetchJobE_1_70 + FetchJobE_1_71 + FetchJobE_1_72 + FetchJobE_1_73 + FetchJobE_1_74 + FetchJobE_1_75 + FetchJobE_1_76 + FetchJobE_1_77 + FetchJobE_1_78 + FetchJobE_1_79 + FetchJobE_1_80)))) : E (F ((cJobCnt <= block))) : ((NotifyEventJobQueuedE_1 <= place_500_1) AND NOT(E (G ((place_458 <= mo1))))) : A (G (NOT(E (F ((2 <= place_462)))))) : ((((3 <= NotifyEventEndOfCheckSourcesB_1) AND (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_PerformWork_61 + Schedule_Task_E_1_PerformWork_62 + Schedule_Task_E_1_PerformWork_63 + Schedule_Task_E_1_PerformWork_64 + Schedule_Task_E_1_PerformWork_65 + Schedule_Task_E_1_PerformWork_66 + Schedule_Task_E_1_PerformWork_67 + Schedule_Task_E_1_PerformWork_68 + Schedule_Task_E_1_PerformWork_69 + Schedule_Task_E_1_PerformWork_70 + Schedule_Task_E_1_PerformWork_71 + Schedule_Task_E_1_PerformWork_72 + Schedule_Task_E_1_PerformWork_73 + Schedule_Task_E_1_PerformWork_74 + Schedule_Task_E_1_PerformWork_75 + Schedule_Task_E_1_PerformWork_76 + Schedule_Task_E_1_PerformWork_77 + Schedule_Task_E_1_PerformWork_78 + Schedule_Task_E_1_PerformWork_79 + Schedule_Task_E_1_PerformWork_80 + 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 <= 2) AND (mi2 <= place_460)) OR (3 <= 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 + FetchJobE_1_61 + FetchJobE_1_62 + FetchJobE_1_63 + FetchJobE_1_64 + FetchJobE_1_65 + FetchJobE_1_66 + FetchJobE_1_67 + FetchJobE_1_68 + FetchJobE_1_69 + FetchJobE_1_70 + FetchJobE_1_71 + FetchJobE_1_72 + FetchJobE_1_73 + FetchJobE_1_74 + FetchJobE_1_75 + FetchJobE_1_76 + FetchJobE_1_77 + FetchJobE_1_78 + FetchJobE_1_79 + FetchJobE_1_80)) OR A (F (A (G ((1 <= mo3)))))) : E (G (E (((1 <= mo3) U (2 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1))))) : ((cJobCnt <= CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_78_1 + CreatedJobs_78_2 + CreatedJobs_78_3 + CreatedJobs_78_4 + CreatedJobs_78_5 + CreatedJobs_65_1 + CreatedJobs_65_2 + CreatedJobs_65_3 + CreatedJobs_65_4 + CreatedJobs_65_5 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_52_1 + CreatedJobs_52_2 + CreatedJobs_52_3 + CreatedJobs_52_4 + CreatedJobs_52_5 + CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_79_1 + CreatedJobs_79_2 + CreatedJobs_79_3 + CreatedJobs_79_4 + CreatedJobs_79_5 + CreatedJobs_66_1 + CreatedJobs_66_2 + CreatedJobs_66_3 + CreatedJobs_66_4 + CreatedJobs_66_5 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_53_1 + CreatedJobs_53_2 + CreatedJobs_53_3 + CreatedJobs_53_4 + CreatedJobs_53_5 + CreatedJobs_40_1 + CreatedJobs_40_2 + CreatedJobs_40_3 + CreatedJobs_40_4 + CreatedJobs_40_5 + CreatedJobs_18_1 + CreatedJobs_18_2 + CreatedJobs_18_3 + CreatedJobs_18_4 + CreatedJobs_18_5 + CreatedJobs_67_1 + CreatedJobs_67_2 + CreatedJobs_67_3 + CreatedJobs_67_4 + CreatedJobs_67_5 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_54_1 + CreatedJobs_54_2 + CreatedJobs_54_3 + CreatedJobs_54_4 + CreatedJobs_54_5 + CreatedJobs_41_1 + CreatedJobs_41_2 + CreatedJobs_41_3 + CreatedJobs_41_4 + CreatedJobs_41_5 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + CreatedJobs_19_4 + CreatedJobs_19_5 + CreatedJobs_68_1 + CreatedJobs_68_2 + CreatedJobs_68_3 + CreatedJobs_68_4 + CreatedJobs_68_5 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_55_1 + CreatedJobs_55_2 + CreatedJobs_55_3 + CreatedJobs_55_4 + CreatedJobs_55_5 + CreatedJobs_42_1 + CreatedJobs_42_2 + CreatedJobs_42_3 + CreatedJobs_42_4 + CreatedJobs_42_5 + CreatedJobs_69_1 + CreatedJobs_69_2 + CreatedJobs_69_3 + CreatedJobs_69_4 + CreatedJobs_69_5 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_56_1 + CreatedJobs_56_2 + CreatedJobs_56_3 + CreatedJobs_56_4 + CreatedJobs_56_5 + CreatedJobs_43_1 + CreatedJobs_43_2 + CreatedJobs_43_3 + CreatedJobs_43_4 + CreatedJobs_43_5 + CreatedJobs_30_1 + CreatedJobs_30_2 + CreatedJobs_30_3 + CreatedJobs_30_4 + CreatedJobs_30_5 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_57_1 + CreatedJobs_57_2 + CreatedJobs_57_3 + CreatedJobs_57_4 + CreatedJobs_57_5 + CreatedJobs_44_1 + CreatedJobs_44_2 + CreatedJobs_44_3 + CreatedJobs_44_4 + CreatedJobs_44_5 + CreatedJobs_31_1 + CreatedJobs_31_2 + CreatedJobs_31_3 + CreatedJobs_31_4 + CreatedJobs_31_5 + CreatedJobs_80_1 + CreatedJobs_80_2 + CreatedJobs_80_3 + CreatedJobs_80_4 + CreatedJobs_80_5 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_58_1 + CreatedJobs_58_2 + CreatedJobs_58_3 + CreatedJobs_58_4 + CreatedJobs_58_5 + CreatedJobs_45_1 + CreatedJobs_45_2 + CreatedJobs_45_3 + CreatedJobs_45_4 + CreatedJobs_45_5 + CreatedJobs_32_1 + CreatedJobs_32_2 + CreatedJobs_32_3 + CreatedJobs_32_4 + CreatedJobs_32_5 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_59_1 + CreatedJobs_59_2 + CreatedJobs_59_3 + CreatedJobs_59_4 + CreatedJobs_59_5 + CreatedJobs_46_1 + CreatedJobs_46_2 + CreatedJobs_46_3 + CreatedJobs_46_4 + CreatedJobs_46_5 + CreatedJobs_33_1 + CreatedJobs_33_2 + CreatedJobs_33_3 + CreatedJobs_33_4 + CreatedJobs_33_5 + CreatedJobs_20_1 + CreatedJobs_20_2 + CreatedJobs_20_3 + CreatedJobs_20_4 + CreatedJobs_20_5 + CreatedJobs_8_1 + CreatedJobs_8_2 + CreatedJobs_8_3 + CreatedJobs_8_4 + CreatedJobs_8_5 + CreatedJobs_47_1 + CreatedJobs_47_2 + CreatedJobs_47_3 + CreatedJobs_47_4 + CreatedJobs_47_5 + CreatedJobs_34_1 + CreatedJobs_34_2 + CreatedJobs_34_3 + CreatedJobs_34_4 + CreatedJobs_34_5 + CreatedJobs_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_64_4 + CreatedJobs_64_3 + CreatedJobs_64_2 + CreatedJobs_64_1 + CreatedJobs_77_4 + CreatedJobs_77_3 + CreatedJobs_77_2 + CreatedJobs_77_1 + CreatedJobs_70_1 + CreatedJobs_70_2 + CreatedJobs_70_3 + CreatedJobs_70_4 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_48_1 + CreatedJobs_48_2 + CreatedJobs_48_3 + CreatedJobs_48_4 + CreatedJobs_35_1 + CreatedJobs_35_2 + CreatedJobs_35_3 + CreatedJobs_35_4 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_4 + CreatedJobs_71_1 + CreatedJobs_71_2 + CreatedJobs_71_3 + CreatedJobs_71_4 + CreatedJobs_49_1 + CreatedJobs_49_2 + CreatedJobs_49_3 + CreatedJobs_49_4 + CreatedJobs_36_1 + CreatedJobs_36_2 + CreatedJobs_36_3 + CreatedJobs_36_4 + CreatedJobs_23_1 + CreatedJobs_23_2 + CreatedJobs_23_3 + CreatedJobs_23_4 + CreatedJobs_10_1 + CreatedJobs_10_2 + CreatedJobs_10_3 + CreatedJobs_10_4 + CreatedJobs_72_1 + CreatedJobs_72_2 + CreatedJobs_72_3 + CreatedJobs_72_4 + CreatedJobs_37_1 + CreatedJobs_37_2 + CreatedJobs_37_3 + CreatedJobs_37_4 + CreatedJobs_15_4 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_15_3 + CreatedJobs_24_4 + CreatedJobs_15_2 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_15_1 + CreatedJobs_73_1 + CreatedJobs_73_2 + CreatedJobs_73_3 + CreatedJobs_73_4 + CreatedJobs_60_1 + CreatedJobs_60_2 + CreatedJobs_60_3 + CreatedJobs_60_4 + CreatedJobs_38_1 + CreatedJobs_38_2 + CreatedJobs_38_3 + CreatedJobs_38_4 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_74_1 + CreatedJobs_74_2 + CreatedJobs_74_3 + CreatedJobs_74_4 + CreatedJobs_61_1 + CreatedJobs_61_2 + CreatedJobs_61_3 + CreatedJobs_61_4 + CreatedJobs_39_1 + CreatedJobs_39_2 + CreatedJobs_39_3 + CreatedJobs_39_4 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_75_1 + CreatedJobs_75_2 + CreatedJobs_75_3 + CreatedJobs_75_4 + CreatedJobs_62_1 + CreatedJobs_62_2 + CreatedJobs_62_3 + CreatedJobs_62_4 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_28_2 + CreatedJobs_27_1 + CreatedJobs_27_2 + CreatedJobs_27_3 + CreatedJobs_27_4 + CreatedJobs_28_1 + CreatedJobs_14_1 + CreatedJobs_14_2 + CreatedJobs_14_3 + CreatedJobs_14_4 + CreatedJobs_50_4 + CreatedJobs_76_1 + CreatedJobs_76_2 + CreatedJobs_76_3 + CreatedJobs_76_4 + CreatedJobs_50_3 + CreatedJobs_63_1 + CreatedJobs_63_2 + CreatedJobs_63_3 + CreatedJobs_63_4 + CreatedJobs_50_2 + CreatedJobs_50_1 + CreatedJobs_63_5 + CreatedJobs_76_5 + CreatedJobs_14_5 + CreatedJobs_50_5 + CreatedJobs_27_5 + CreatedJobs_28_5 + CreatedJobs_62_5 + CreatedJobs_75_5 + CreatedJobs_13_5 + CreatedJobs_26_5 + CreatedJobs_39_5 + CreatedJobs_61_5 + CreatedJobs_74_5 + CreatedJobs_12_5 + CreatedJobs_25_5 + CreatedJobs_38_5 + CreatedJobs_60_5 + CreatedJobs_73_5 + CreatedJobs_11_5 + CreatedJobs_24_5 + CreatedJobs_37_5 + CreatedJobs_15_5 + CreatedJobs_72_5 + CreatedJobs_10_5 + CreatedJobs_23_5 + CreatedJobs_36_5 + CreatedJobs_49_5 + CreatedJobs_71_5 + CreatedJobs_22_5 + CreatedJobs_35_5 + CreatedJobs_48_5 + CreatedJobs_70_5 + CreatedJobs_77_5 + CreatedJobs_64_5 + CreatedJobs_51_1 + CreatedJobs_51_2 + CreatedJobs_51_3 + CreatedJobs_51_4 + CreatedJobs_51_5) OR (A (G (((3 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_57 + f3_58 + f3_59 + f3_60 + f3_61 + f3_62 + f3_63 + f3_64 + f3_65 + f3_66 + f3_67 + f3_68 + f3_69 + f3_70 + f3_71 + f3_72 + f3_73 + f3_74 + f3_75 + f3_76 + f3_77 + f3_78 + f3_79 + f3_80 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9) OR (NotifyEventEndOfCheckSourcesE_1 <= Check_Sources_B_1)))) OR A (F ((AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_48 + AvailableJobId_49 + AvailableJobId_50 + AvailableJobId_51 + AvailableJobId_60 + AvailableJobId_61 + AvailableJobId_62 + AvailableJobId_63 + AvailableJobId_64 + AvailableJobId_70 + AvailableJobId_71 + AvailableJobId_72 + AvailableJobId_73 + AvailableJobId_74 + AvailableJobId_75 + AvailableJobId_76 + AvailableJobId_77 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_80 + AvailableJobId_79 + AvailableJobId_78 + AvailableJobId_69 + AvailableJobId_68 + AvailableJobId_67 + AvailableJobId_66 + AvailableJobId_65 + AvailableJobId_59 + AvailableJobId_58 + AvailableJobId_57 + AvailableJobId_56 + AvailableJobId_55 + AvailableJobId_54 + AvailableJobId_53 + AvailableJobId_52 + AvailableJobId_47 + AvailableJobId_46 + AvailableJobId_45 + AvailableJobId_44 + AvailableJobId_43 + AvailableJobId_42 + AvailableJobId_41 + AvailableJobId_40 + AvailableJobId_34 + AvailableJobId_33 + AvailableJobId_32 + AvailableJobId_31 + AvailableJobId_30 + AvailableJobId_29 + AvailableJobId_21 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16 <= JobCnt))))) : E ((((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 + QueueJobB_1_61 + QueueJobB_1_62 + QueueJobB_1_63 + QueueJobB_1_64 + QueueJobB_1_65 + QueueJobB_1_66 + QueueJobB_1_67 + QueueJobB_1_68 + QueueJobB_1_69 + QueueJobB_1_70 + QueueJobB_1_71 + QueueJobB_1_72 + QueueJobB_1_73 + QueueJobB_1_74 + QueueJobB_1_75 + QueueJobB_1_76 + QueueJobB_1_77 + QueueJobB_1_78 + QueueJobB_1_79 + QueueJobB_1_80 <= 1) OR (Check_Sources_B_1 + 1 <= Schedule_Task_B_1)) U E (X ((3 <= mi1))))) : A (F (A (X (((3 <= 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 + Perform_Work_B_1_61 + Perform_Work_B_1_62 + Perform_Work_B_1_63 + Perform_Work_B_1_64 + Perform_Work_B_1_65 + Perform_Work_B_1_66 + Perform_Work_B_1_67 + Perform_Work_B_1_68 + Perform_Work_B_1_69 + Perform_Work_B_1_70 + Perform_Work_B_1_71 + Perform_Work_B_1_72 + Perform_Work_B_1_73 + Perform_Work_B_1_74 + Perform_Work_B_1_75 + Perform_Work_B_1_76 + Perform_Work_B_1_77 + Perform_Work_B_1_78 + Perform_Work_B_1_79 + Perform_Work_B_1_80) AND (3 <= place_787_1)))))) : NOT(A (F (A (X ((3 <= 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 + QueueJobB_1_61 + QueueJobB_1_62 + QueueJobB_1_63 + QueueJobB_1_64 + QueueJobB_1_65 + QueueJobB_1_66 + QueueJobB_1_67 + QueueJobB_1_68 + QueueJobB_1_69 + QueueJobB_1_70 + QueueJobB_1_71 + QueueJobB_1_72 + QueueJobB_1_73 + QueueJobB_1_74 + QueueJobB_1_75 + QueueJobB_1_76 + QueueJobB_1_77 + QueueJobB_1_78 + QueueJobB_1_79 + QueueJobB_1_80))))))
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 (X (E (G ((NotifyEventEndOfCheckSourcesB_1 <= mo2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (mo2 + 1 <= NotifyEventEndOfCheckSourcesB_1))))
lola: processed formula length: 63
lola: 3 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F ((2 <= mo3))))) OR (A (X (((place_522_1 <= place_520_1) OR (place_523_1 <= Try_Check_Sources_E_1)))) AND ((place_458 <= place_500_1) AND A (X ((3 <= Check_Sources_B_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((2 <= mo3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (2 <= mo3)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((place_522_1 <= place_520_1) OR (place_523_1 <= Try_Check_Sources_E_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((place_522_1 <= place_520_1) OR (place_523_1 <= Try_Check_Sources_E_1)))
lola: processed formula length: 77
lola: 1 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (place_458 <= place_500_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (place_458 <= place_500_1)
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= Check_Sources_B_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= Check_Sources_B_1))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((mo1 <= 0) AND (place_458 <= 2)) AND E (G ((place_518_1 <= QueueJobE_1)))) OR (((place_521_1 + 1 <= Try_Check_Sources_B_1) AND (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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((mo1 <= 0) AND (place_458 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((mo1 <= 0) AND (place_458 <= 2))
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((place_521_1 + 1 <= Try_Check_Sources_B_1) AND (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 + f... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((place_521_1 + 1 <= Try_Check_Sources_B_1) AND (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 + f... (shortened)
lola: processed formula length: 691
lola: 1 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((2 <= QueueJobE_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((2 <= QueueJobE_1)))
lola: processed formula length: 32
lola: 3 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: SUBRESULT========================================

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= 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 + Pe... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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-S05J80-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 46105 markings, 52677 edges, 9221 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((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 + Perfo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((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 + Pe... (shortened)
lola: processed formula length: 4113
lola: 1 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (TRUE)))) AND A (F (E (F ((3 <= place_458))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (3 <= place_458)))
lola: processed formula length: 36
lola: 8 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: 389679 markings, 681968 edges, 3689348869717491712 markings/sec, 0 secs
lola: 741964 markings, 1304905 edges, 70457 markings/sec, 5 secs
lola: 1129888 markings, 1962149 edges, 77585 markings/sec, 10 secs
lola: 1517426 markings, 2598831 edges, 77508 markings/sec, 15 secs
lola: 1894478 markings, 3211904 edges, 75410 markings/sec, 20 secs
lola: 2262255 markings, 3807748 edges, 73555 markings/sec, 25 secs
lola: 2616695 markings, 4386988 edges, 70888 markings/sec, 30 secs
lola: 2943729 markings, 4931665 edges, 65407 markings/sec, 35 secs
lola: 3245564 markings, 5470390 edges, 60367 markings/sec, 40 secs
lola: 3477290 markings, 5954679 edges, 46345 markings/sec, 45 secs
lola: 3826551 markings, 6533427 edges, 69852 markings/sec, 50 secs
lola: 4170306 markings, 7089608 edges, 68751 markings/sec, 55 secs
lola: 4505431 markings, 7635506 edges, 67025 markings/sec, 60 secs
lola: 4833162 markings, 8173136 edges, 65546 markings/sec, 65 secs
lola: 5159709 markings, 8712275 edges, 65309 markings/sec, 70 secs
lola: 5448740 markings, 9196805 edges, 57806 markings/sec, 75 secs
lola: 5732460 markings, 9702954 edges, 56744 markings/sec, 80 secs
lola: 5922129 markings, 10114972 edges, 37934 markings/sec, 85 secs
lola: 6256613 markings, 10678843 edges, 66897 markings/sec, 90 secs
lola: 6597358 markings, 11225807 edges, 68149 markings/sec, 95 secs
lola: 6926612 markings, 11758313 edges, 65851 markings/sec, 100 secs
lola: 7254429 markings, 12283945 edges, 65563 markings/sec, 105 secs
lola: 7550024 markings, 12757651 edges, 59119 markings/sec, 110 secs
lola: 7810137 markings, 13223270 edges, 52023 markings/sec, 115 secs
lola: 8053161 markings, 13679385 edges, 48605 markings/sec, 120 secs
lola: 8347734 markings, 14159693 edges, 58915 markings/sec, 125 secs
lola: 8634342 markings, 14628947 edges, 57322 markings/sec, 130 secs
lola: 8917811 markings, 15097097 edges, 56694 markings/sec, 135 secs
lola: 9194538 markings, 15558172 edges, 55345 markings/sec, 140 secs
lola: 9448087 markings, 15986710 edges, 50710 markings/sec, 145 secs
lola: 9700702 markings, 16428647 edges, 50523 markings/sec, 150 secs
lola: 9941242 markings, 16883376 edges, 48108 markings/sec, 155 secs
lola: 10225253 markings, 17346387 edges, 56802 markings/sec, 160 secs
lola: 10519885 markings, 17828503 edges, 58926 markings/sec, 165 secs
lola: 10801547 markings, 18292496 edges, 56332 markings/sec, 170 secs
lola: 11083942 markings, 18760676 edges, 56479 markings/sec, 175 secs
lola: 11346938 markings, 19203815 edges, 52599 markings/sec, 180 secs
lola: 11590586 markings, 19626283 edges, 48730 markings/sec, 185 secs
lola: 11813593 markings, 20064480 edges, 44601 markings/sec, 190 secs
lola: 12099355 markings, 20529417 edges, 57152 markings/sec, 195 secs
lola: 12386028 markings, 20981630 edges, 57335 markings/sec, 200 secs
lola: 12672835 markings, 21438445 edges, 57361 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 <= cSources) OR (ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + 1 <= 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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((cSources + 1 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5) AND (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 + FetchJ... (shortened)
lola: processed formula length: 1564
lola: 2 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cJobCnt <= block)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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-S05J80-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 19518 markings, 33488 edges, 3904 markings/sec, 0 secs
lola: sara is running 5 secs || 38864 markings, 66780 edges, 3869 markings/sec, 5 secs
lola: sara is running 10 secs || 58206 markings, 100050 edges, 3868 markings/sec, 10 secs
lola: sara is running 15 secs || 78276 markings, 134188 edges, 4014 markings/sec, 15 secs
lola: sara is running 20 secs || 98226 markings, 168164 edges, 3990 markings/sec, 20 secs
lola: sara is running 25 secs || 117340 markings, 203019 edges, 3823 markings/sec, 25 secs
lola: sara is running 30 secs || 136698 markings, 239901 edges, 3872 markings/sec, 30 secs
lola: sara is running 35 secs || 156214 markings, 276082 edges, 3903 markings/sec, 35 secs
lola: sara is running 40 secs || 176084 markings, 309858 edges, 3974 markings/sec, 40 secs
lola: sara is running 45 secs || 195747 markings, 343281 edges, 3933 markings/sec, 45 secs
lola: sara is running 50 secs || 215525 markings, 376882 edges, 3956 markings/sec, 50 secs
lola: sara is running 55 secs || 235126 markings, 414850 edges, 3920 markings/sec, 55 secs
lola: sara is running 60 secs || 254678 markings, 451778 edges, 3910 markings/sec, 60 secs
lola: sara is running 65 secs || 274839 markings, 485743 edges, 4032 markings/sec, 65 secs
lola: sara is running 70 secs || 295086 markings, 519780 edges, 4049 markings/sec, 70 secs
lola: sara is running 75 secs || 314958 markings, 558014 edges, 3974 markings/sec, 75 secs
lola: sara is running 80 secs || 334594 markings, 594778 edges, 3927 markings/sec, 80 secs
lola: sara is running 85 secs || 354714 markings, 628524 edges, 4024 markings/sec, 85 secs
lola: sara is running 90 secs || 374823 markings, 662260 edges, 4022 markings/sec, 90 secs
lola: sara is running 95 secs || 394169 markings, 701711 edges, 3869 markings/sec, 95 secs
lola: sara is running 100 secs || 414238 markings, 736698 edges, 4014 markings/sec, 100 secs
lola: sara is running 105 secs || 434458 markings, 770472 edges, 4044 markings/sec, 105 secs
lola: sara is running 110 secs || 453870 markings, 810041 edges, 3882 markings/sec, 110 secs
lola: sara is running 115 secs || 474112 markings, 844895 edges, 4048 markings/sec, 115 secs
lola: sara is running 120 secs || 494092 markings, 882128 edges, 3996 markings/sec, 120 secs
lola: sara is running 125 secs || 513493 markings, 918790 edges, 3880 markings/sec, 125 secs
lola: sara is running 130 secs || 533657 markings, 952271 edges, 4033 markings/sec, 130 secs
lola: sara is running 135 secs || 553114 markings, 991170 edges, 3891 markings/sec, 135 secs
lola: sara is running 140 secs || 573175 markings, 1026009 edges, 4012 markings/sec, 140 secs
lola: sara is running 145 secs || 592980 markings, 1064043 edges, 3961 markings/sec, 145 secs
lola: sara is running 150 secs || 612898 markings, 1099747 edges, 3984 markings/sec, 150 secs
lola: sara is running 155 secs || 632693 markings, 1137374 edges, 3959 markings/sec, 155 secs
lola: sara is running 160 secs || 652341 markings, 1172903 edges, 3930 markings/sec, 160 secs
lola: sara is running 165 secs || 672025 markings, 1210499 edges, 3937 markings/sec, 165 secs
lola: sara is running 170 secs || 691901 markings, 1245956 edges, 3975 markings/sec, 170 secs
lola: sara is running 175 secs || 711490 markings, 1284702 edges, 3918 markings/sec, 175 secs
lola: sara is running 180 secs || 731822 markings, 1319230 edges, 4066 markings/sec, 180 secs
lola: sara is running 185 secs || 751657 markings, 1359346 edges, 3967 markings/sec, 185 secs
lola: sara is running 190 secs || 771296 markings, 1396705 edges, 3928 markings/sec, 190 secs
lola: sara is running 195 secs || 791097 markings, 1431586 edges, 3960 markings/sec, 195 secs
lola: sara is running 200 secs || 810478 markings, 1470858 edges, 3876 markings/sec, 200 secs
lola: sara is running 205 secs || 830167 markings, 1508698 edges, 3938 markings/sec, 205 secs
lola: sara is running 210 secs || 850273 markings, 1543196 edges, 4021 markings/sec, 210 secs
lola: sara is running 215 secs || 870007 markings, 1582656 edges, 3947 markings/sec, 215 secs
lola: sara is running 220 secs || 889986 markings, 1622313 edges, 3996 markings/sec, 220 secs
lola: sara is running 225 secs || 909530 markings, 1661307 edges, 3909 markings/sec, 225 secs
lola: sara is running 230 secs || 929112 markings, 1700246 edges, 3916 markings/sec, 230 secs
lola: sara is running 235 secs || 948778 markings, 1737871 edges, 3933 markings/sec, 235 secs
lola: sara is running 240 secs || 968988 markings, 1777591 edges, 4042 markings/sec, 240 secs
lola: sara is running 245 secs || 989261 markings, 1818223 edges, 4055 markings/sec, 245 secs
lola: sara is running 250 secs || 1009512 markings, 1857594 edges, 4050 markings/sec, 250 secs
lola: sara is running 255 secs || 1029844 markings, 1896953 edges, 4066 markings/sec, 255 secs
lola: sara is running 260 secs || 1050168 markings, 1936190 edges, 4065 markings/sec, 260 secs
lola: sara is running 265 secs || 1070201 markings, 1979802 edges, 4007 markings/sec, 265 secs
lola: sara is running 270 secs || 1090356 markings, 2020345 edges, 4031 markings/sec, 270 secs
lola: sara is running 275 secs || 1110671 markings, 2059201 edges, 4063 markings/sec, 275 secs
lola: sara is running 280 secs || 1130552 markings, 2103879 edges, 3976 markings/sec, 280 secs
lola: sara is running 285 secs || 1150691 markings, 2146506 edges, 4028 markings/sec, 285 secs
lola: sara is running 290 secs || 1170805 markings, 2186764 edges, 4023 markings/sec, 290 secs
lola: sara is running 295 secs || 1190545 markings, 2230614 edges, 3948 markings/sec, 295 secs
lola: sara is running 300 secs || 1210487 markings, 2274455 edges, 3988 markings/sec, 300 secs
lola: sara is running 305 secs || 1230446 markings, 2318104 edges, 3992 markings/sec, 305 secs
lola: sara is running 310 secs || 1250180 markings, 2361185 edges, 3947 markings/sec, 310 secs
lola: sara is running 315 secs || 1269761 markings, 2409769 edges, 3916 markings/sec, 315 secs
lola: sara is running 320 secs || 1289518 markings, 2456772 edges, 3951 markings/sec, 320 secs
lola: sara is running 325 secs || 1308976 markings, 2504548 edges, 3892 markings/sec, 325 secs
lola: sara is running 330 secs || 1328543 markings, 2552956 edges, 3913 markings/sec, 330 secs
lola: sara is running 335 secs || 1347863 markings, 2604937 edges, 3864 markings/sec, 335 secs
lola: sara is running 340 secs || 1366991 markings, 2661269 edges, 3826 markings/sec, 340 secs
lola: sara is running 345 secs || 1385814 markings, 2726418 edges, 3765 markings/sec, 345 secs
lola: sara is running 350 secs || 1402822 markings, 2837219 edges, 3402 markings/sec, 350 secs
lola: sara is running 355 secs || 1419767 markings, 2881919 edges, 3389 markings/sec, 355 secs
lola: sara is running 360 secs || 1436400 markings, 2924890 edges, 3327 markings/sec, 360 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NotifyEventJobQueuedE_1 <= place_500_1) AND NOT(E (G ((place_458 <= mo1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NotifyEventJobQueuedE_1 <= place_500_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NotifyEventJobQueuedE_1 <= place_500_1)
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-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 9 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((mo1 + 1 <= place_458)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (mo1 + 1 <= place_458))
lola: processed formula length: 32
lola: 4 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (F ((2 <= place_462))))))
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 4028 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-S05J80-CTLCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= NotifyEventEndOfCheckSourcesB_1) AND (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 + Sch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= NotifyEventEndOfCheckSourcesB_1) AND (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 + Sche... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= NotifyEventEndOfCheckSourcesB_1) AND (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 + Sche... (shortened)
lola: processed formula length: 4309
lola: 0 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((1 <= mo3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (mo3 <= 0))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: ========================================
lola: subprocess 11 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((1 <= mo3) U (2 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((1 <= mo3) U (2 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1)))))
lola: processed formula length: 110
lola: 2 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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 12 will run for 738 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((cJobCnt <= CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_78_1 + CreatedJobs_78_2 + CreatedJobs_78_3 + CreatedJobs_78_4 + CreatedJobs_78_5 + CreatedJobs_65_1 + CreatedJobs_65_2 + CreatedJobs_65_3 + CreatedJobs_65_4 + CreatedJobs_65_5 + Created... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 738 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (cJobCnt <= CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_78_1 + CreatedJobs_78_2 + CreatedJobs_78_3 + CreatedJobs_78_4 + CreatedJobs_78_5 + CreatedJobs_65_1 + CreatedJobs_65_2 + CreatedJobs_65_3 + CreatedJobs_65_4 + CreatedJobs_65_5 + CreatedJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cJobCnt <= CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_78_1 + CreatedJobs_78_2 + CreatedJobs_78_3 + CreatedJobs_78_4 + CreatedJobs_78_5 + CreatedJobs_65_1 + CreatedJobs_65_2 + CreatedJobs_65_3 + CreatedJobs_65_4 + CreatedJobs_65_5 + CreatedJ... (shortened)
lola: processed formula length: 7655
lola: 0 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 984 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_57 + f3_... (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 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J80-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 1476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_48 + AvailableJobI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_48 + AvailableJ... (shortened)
lola: processed formula length: 1629
lola: 1 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 984 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((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_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((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 ... (shortened)
lola: processed formula length: 1442
lola: 2 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: 255398 markings, 537593 edges, 51073 markings/sec, 0 secs
lola: 500357 markings, 1059288 edges, 48992 markings/sec, 5 secs
lola: 740808 markings, 1568366 edges, 48090 markings/sec, 10 secs
lola: 966331 markings, 2048906 edges, 45105 markings/sec, 15 secs
lola: 1210052 markings, 2574757 edges, 48744 markings/sec, 20 secs
lola: 1439746 markings, 3084383 edges, 45939 markings/sec, 25 secs
lola: 1660118 markings, 3586362 edges, 44074 markings/sec, 30 secs
lola: 1859478 markings, 4057967 edges, 39872 markings/sec, 35 secs
lola: 2031498 markings, 4496942 edges, 34404 markings/sec, 40 secs
lola: 2162361 markings, 4952051 edges, 26173 markings/sec, 45 secs
lola: 2372205 markings, 5402363 edges, 41969 markings/sec, 50 secs
lola: 2571017 markings, 5846406 edges, 39762 markings/sec, 55 secs
lola: 2756748 markings, 6269301 edges, 37146 markings/sec, 60 secs
lola: 2944694 markings, 6707406 edges, 37589 markings/sec, 65 secs
lola: 3109810 markings, 7113917 edges, 33023 markings/sec, 70 secs
lola: 3256856 markings, 7536841 edges, 29409 markings/sec, 75 secs
lola: 3396414 markings, 7937619 edges, 27912 markings/sec, 80 secs
lola: 3598011 markings, 8360275 edges, 40319 markings/sec, 85 secs
lola: 3769535 markings, 8717905 edges, 34305 markings/sec, 90 secs
lola: 3957334 markings, 9114884 edges, 37560 markings/sec, 95 secs
lola: 4156357 markings, 9534908 edges, 39805 markings/sec, 100 secs
lola: 4345071 markings, 9938491 edges, 37743 markings/sec, 105 secs
lola: 4514241 markings, 10303808 edges, 33834 markings/sec, 110 secs
lola: 4692704 markings, 10692340 edges, 35693 markings/sec, 115 secs
lola: 4855416 markings, 11050085 edges, 32542 markings/sec, 120 secs
lola: 5010745 markings, 11399547 edges, 31066 markings/sec, 125 secs
lola: 5163867 markings, 11762426 edges, 30624 markings/sec, 130 secs
lola: 5310344 markings, 12145553 edges, 29295 markings/sec, 135 secs
lola: 5502706 markings, 12621172 edges, 38472 markings/sec, 140 secs
lola: 5732814 markings, 13109003 edges, 46022 markings/sec, 145 secs
lola: 5976758 markings, 13621836 edges, 48789 markings/sec, 150 secs
lola: 6197296 markings, 14092610 edges, 44108 markings/sec, 155 secs
lola: 6424445 markings, 14580195 edges, 45430 markings/sec, 160 secs
lola: 6655850 markings, 15075415 edges, 46281 markings/sec, 165 secs
lola: 6880893 markings, 15571981 edges, 45009 markings/sec, 170 secs
lola: 7088529 markings, 16043697 edges, 41527 markings/sec, 175 secs
lola: 7286341 markings, 16505092 edges, 39562 markings/sec, 180 secs
lola: 7461134 markings, 16937330 edges, 34959 markings/sec, 185 secs
lola: 7602890 markings, 17375012 edges, 28351 markings/sec, 190 secs
lola: 7759565 markings, 17773592 edges, 31335 markings/sec, 195 secs
lola: 7960228 markings, 18202932 edges, 40133 markings/sec, 200 secs
lola: 8143319 markings, 18593931 edges, 36618 markings/sec, 205 secs
lola: 8321296 markings, 18971598 edges, 35595 markings/sec, 210 secs
lola: 8523915 markings, 19408943 edges, 40524 markings/sec, 215 secs
lola: 8710686 markings, 19815768 edges, 37354 markings/sec, 220 secs
lola: 8899990 markings, 20224827 edges, 37861 markings/sec, 225 secs
lola: 9078751 markings, 20617526 edges, 35752 markings/sec, 230 secs
lola: 9262988 markings, 21043952 edges, 36847 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((3 <= 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((3 <= 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_... (shortened)
lola: processed formula length: 1815
lola: 2 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: 257280 markings, 656761 edges, 51449 markings/sec, 0 secs
lola: 491179 markings, 1260041 edges, 46780 markings/sec, 5 secs
lola: 721160 markings, 1860402 edges, 45996 markings/sec, 10 secs
lola: 938757 markings, 2422343 edges, 43519 markings/sec, 15 secs
lola: 1179451 markings, 3041328 edges, 48139 markings/sec, 20 secs
lola: 1411546 markings, 3602703 edges, 46419 markings/sec, 25 secs
lola: 1657707 markings, 4188453 edges, 49232 markings/sec, 30 secs
lola: 1896197 markings, 4757434 edges, 47698 markings/sec, 35 secs
lola: 2114323 markings, 5277667 edges, 43625 markings/sec, 40 secs
lola: 2353047 markings, 5855646 edges, 47745 markings/sec, 45 secs
lola: 2575453 markings, 6400019 edges, 44481 markings/sec, 50 secs
lola: 2775591 markings, 6894408 edges, 40028 markings/sec, 55 secs
lola: 2978084 markings, 7405964 edges, 40499 markings/sec, 60 secs
lola: 3170206 markings, 7899394 edges, 38424 markings/sec, 65 secs
lola: 3352649 markings, 8378868 edges, 36489 markings/sec, 70 secs
lola: 3524104 markings, 8845304 edges, 34291 markings/sec, 75 secs
lola: 3684694 markings, 9345289 edges, 32118 markings/sec, 80 secs
lola: 3806773 markings, 9842151 edges, 24416 markings/sec, 85 secs
lola: 3930820 markings, 10239366 edges, 24809 markings/sec, 90 secs
lola: 4058789 markings, 10623524 edges, 25594 markings/sec, 95 secs
lola: 4174459 markings, 10973756 edges, 23134 markings/sec, 100 secs
lola: 4311725 markings, 11394707 edges, 27453 markings/sec, 105 secs
lola: 4437586 markings, 11790154 edges, 25172 markings/sec, 110 secs
lola: 4554896 markings, 12203759 edges, 23462 markings/sec, 115 secs
lola: 4678009 markings, 12599196 edges, 24623 markings/sec, 120 secs
lola: 4813735 markings, 13006338 edges, 27145 markings/sec, 125 secs
lola: 4940579 markings, 13391869 edges, 25369 markings/sec, 130 secs
lola: 5070059 markings, 13789828 edges, 25896 markings/sec, 135 secs
lola: 5187921 markings, 14162011 edges, 23572 markings/sec, 140 secs
lola: 5295115 markings, 14543758 edges, 21439 markings/sec, 145 secs
lola: 5393456 markings, 14911603 edges, 19668 markings/sec, 150 secs
lola: 5545783 markings, 15383257 edges, 30465 markings/sec, 155 secs
lola: 5773600 markings, 15968585 edges, 45563 markings/sec, 160 secs
lola: 6006058 markings, 16572854 edges, 46492 markings/sec, 165 secs
lola: 6218940 markings, 17118829 edges, 42576 markings/sec, 170 secs
lola: 6421979 markings, 17652737 edges, 40608 markings/sec, 175 secs
lola: 6658114 markings, 18262764 edges, 47227 markings/sec, 180 secs
lola: 6853981 markings, 18765244 edges, 39173 markings/sec, 185 secs
lola: 7079987 markings, 19330457 edges, 45201 markings/sec, 190 secs
lola: 7286552 markings, 19844250 edges, 41313 markings/sec, 195 secs
lola: 7482615 markings, 20340391 edges, 39213 markings/sec, 200 secs
lola: 7700443 markings, 20885930 edges, 43566 markings/sec, 205 secs
lola: 7901667 markings, 21399254 edges, 40245 markings/sec, 210 secs
lola: 8104234 markings, 21920177 edges, 40513 markings/sec, 215 secs
lola: 8289641 markings, 22398091 edges, 37081 markings/sec, 220 secs
lola: 8488879 markings, 22891649 edges, 39848 markings/sec, 225 secs
lola: 8698289 markings, 23411067 edges, 41882 markings/sec, 230 secs
lola: 8884440 markings, 23884964 edges, 37230 markings/sec, 235 secs
lola: 9064104 markings, 24346152 edges, 35933 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2457 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (X ((3 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((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 ... (shortened)
lola: processed formula length: 1395
lola: 7 rewrites
lola: formula mentions 0 of 1189 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 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: 249184 markings, 631995 edges, 3689348869717491712 markings/sec, 0 secs
lola: 467437 markings, 1202677 edges, 43651 markings/sec, 5 secs
lola: 697622 markings, 1791332 edges, 46037 markings/sec, 10 secs
lola: 909149 markings, 2343721 edges, 42305 markings/sec, 15 secs
lola: 1135378 markings, 2925960 edges, 45246 markings/sec, 20 secs
lola: 1359770 markings, 3473700 edges, 44878 markings/sec, 25 secs
lola: 1611701 markings, 4070119 edges, 50386 markings/sec, 30 secs
lola: 1826227 markings, 4580411 edges, 42905 markings/sec, 35 secs
lola: 2056517 markings, 5130644 edges, 46058 markings/sec, 40 secs
lola: 2288326 markings, 5684335 edges, 46362 markings/sec, 45 secs
lola: 2509426 markings, 6224829 edges, 44220 markings/sec, 50 secs
lola: 2717272 markings, 6737592 edges, 41569 markings/sec, 55 secs
lola: 2920824 markings, 7241375 edges, 40710 markings/sec, 60 secs
lola: 3112789 markings, 7730610 edges, 38393 markings/sec, 65 secs
lola: 3293877 markings, 8202680 edges, 36218 markings/sec, 70 secs
lola: 3457009 markings, 8636534 edges, 32626 markings/sec, 75 secs
lola: 3622713 markings, 9103331 edges, 33141 markings/sec, 80 secs
lola: 3759630 markings, 9610280 edges, 27383 markings/sec, 85 secs
lola: 3882729 markings, 10058866 edges, 24620 markings/sec, 90 secs
lola: 4014051 markings, 10464352 edges, 26264 markings/sec, 95 secs
lola: 4150446 markings, 10876228 edges, 27279 markings/sec, 100 secs
lola: 4281947 markings, 11278052 edges, 26300 markings/sec, 105 secs
lola: 4408901 markings, 11674353 edges, 25391 markings/sec, 110 secs
lola: 4522201 markings, 12043375 edges, 22660 markings/sec, 115 secs
lola: 4635925 markings, 12448412 edges, 22745 markings/sec, 120 secs
lola: 4762987 markings, 12829667 edges, 25412 markings/sec, 125 secs
lola: 4894669 markings, 13227014 edges, 26336 markings/sec, 130 secs
lola: 5020112 markings, 13610198 edges, 25089 markings/sec, 135 secs
lola: 5139836 markings, 13983914 edges, 23945 markings/sec, 140 secs
lola: 5249334 markings, 14339322 edges, 21900 markings/sec, 145 secs
lola: 5346696 markings, 14714384 edges, 19472 markings/sec, 150 secs
lola: 5441478 markings, 15072961 edges, 18956 markings/sec, 155 secs
lola: 5665369 markings, 15668845 edges, 44778 markings/sec, 160 secs
lola: 5887047 markings, 16233700 edges, 44336 markings/sec, 165 secs
lola: 6106949 markings, 16807434 edges, 43980 markings/sec, 170 secs
lola: 6310619 markings, 17339727 edges, 40734 markings/sec, 175 secs
lola: 6522006 markings, 17879942 edges, 42277 markings/sec, 180 secs
lola: 6739681 markings, 18454174 edges, 43535 markings/sec, 185 secs
lola: 6956555 markings, 18987697 edges, 43375 markings/sec, 190 secs
lola: 7165213 markings, 19513809 edges, 41732 markings/sec, 195 secs
lola: 7367071 markings, 20015409 edges, 40372 markings/sec, 200 secs
lola: 7580665 markings, 20552356 edges, 42719 markings/sec, 205 secs
lola: 7767210 markings, 21025526 edges, 37309 markings/sec, 210 secs
lola: 7978513 markings, 21560418 edges, 42261 markings/sec, 215 secs
lola: 8173678 markings, 22052131 edges, 39033 markings/sec, 220 secs
lola: 8374205 markings, 22569570 edges, 40105 markings/sec, 225 secs
lola: 8561913 markings, 23032536 edges, 37542 markings/sec, 230 secs
lola: 8756520 markings, 23518084 edges, 38921 markings/sec, 235 secs
lola: 8939557 markings, 23981654 edges, 36607 markings/sec, 240 secs
lola: 9115644 markings, 24441764 edges, 35217 markings/sec, 245 secs
lola: 9204864 markings, 24678781 edges, 17844 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no no no unknown yes unknown no no no yes no unknown unknown unknown
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494724377147

--------------------
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-S05J80"
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-S05J80.tgz
mv PolyORBNT-PT-S05J80 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-S05J80, 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-149440926200129"
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 ;