About the Execution of LoLA for S_PolyORBNT-PT-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15937.000 | 698510.00 | 971429.00 | 2727.70 | TF?TF?T?F?T?TTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
................................................................
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PolyORBNT-PT-S05J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231600120
=====================================================================
--------------------
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-S05J60-CTLCardinality-0
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-1
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-15
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-2
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-3
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-4
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-5
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-6
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-7
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-8
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496328648012
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBNT-PT-S05J60: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBNT-PT-S05J60: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBNT-PT-S05J60 @ 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: 2879/65536 symbol table entries, 182 collisions
lola: preprocessing...
lola: finding significant places
lola: 909 places, 1970 transitions, 767 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1668 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J60-CTLCardinality.task
lola: E ((((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 + 1 <= Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_PerformWork_41 + Schedule_Task_E_1_PerformWork_42 + Schedule_Task_E_1_PerformWork_43 + Schedule_Task_E_1_PerformWork_44 + Schedule_Task_E_1_PerformWork_45 + Schedule_Task_E_1_PerformWork_46 + Schedule_Task_E_1_PerformWork_47 + Schedule_Task_E_1_PerformWork_48 + Schedule_Task_E_1_PerformWork_49 + Schedule_Task_E_1_PerformWork_50 + Schedule_Task_E_1_PerformWork_51 + Schedule_Task_E_1_PerformWork_52 + Schedule_Task_E_1_PerformWork_53 + Schedule_Task_E_1_PerformWork_54 + Schedule_Task_E_1_PerformWork_55 + Schedule_Task_E_1_PerformWork_56 + Schedule_Task_E_1_PerformWork_57 + Schedule_Task_E_1_PerformWork_58 + Schedule_Task_E_1_PerformWork_59 + Schedule_Task_E_1_PerformWork_60 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9) OR (NotifyEventJobQueuedE_1 + 1 <= place_522_1)) U E (F ((1 <= NotifyEventJobQueuedE_1))))) : NOT(NOT(A (G ((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 <= mi2))))) : E ((((mo1 + 1 <= Check_Sources_E_1) OR (3 <= cSources)) U ((place_522_1 + 1 <= cJobCnt) AND (3 <= mo1)))) : E (F (((2 <= Check_Sources_E_1) OR ((place_460 + 1 <= 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) AND (2 <= place_462))))) : E (G ((NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQueuedB_1_46 + NotifyEventJobQueuedB_1_45 + NotifyEventJobQueuedB_1_44 + NotifyEventJobQueuedB_1_43 + NotifyEventJobQueuedB_1_42 + NotifyEventJobQueuedB_1_41 + NotifyEventJobQueuedB_1_40 + NotifyEventJobQueuedB_1_39 + NotifyEventJobQueuedB_1_38 + NotifyEventJobQueuedB_1_37 + NotifyEventJobQueuedB_1_36 + NotifyEventJobQueuedB_1_35 + NotifyEventJobQueuedB_1_34 + NotifyEventJobQueuedB_1_33 + NotifyEventJobQueuedB_1_32 + NotifyEventJobQueuedB_1_31 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_60 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9 <= mo1))) : A (X (A (G ((3 <= cJobCnt))))) : A (F (E (F (((3 <= Perform_Work_E_1) OR (3 <= NotifyEventJobQueuedE_1)))))) : E (G (A (((place_518_1 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (1 <= cSources))))) : A (G (NOT(A (X ((3 <= mo2)))))) : NOT((E (G ((NotifyEventJobQueuedE_1 <= 1))) AND (A (F ((Try_Check_Sources_E_1 <= place_522_1))) AND A (X ((1 <= CanInjectEvent)))))) : (A ((((place_521_1 <= place_460) OR (mo1 <= mo3)) 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 + 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 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9) AND (mi1 <= mo2)))) AND (mi3 <= Try_Check_Sources_E_1)) : (E (F (A (G ((mi3 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))))) AND A (X (E (F ((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_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_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_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_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_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_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_15_4 + CreatedJobs_15_3 + CreatedJobs_15_2 + CreatedJobs_15_1 + 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_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_37_1 + CreatedJobs_37_2 + CreatedJobs_37_3 + CreatedJobs_37_4 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_60_1 + CreatedJobs_60_2 + CreatedJobs_60_3 + CreatedJobs_60_4 + CreatedJobs_28_4 + CreatedJobs_38_1 + CreatedJobs_38_2 + CreatedJobs_38_3 + CreatedJobs_38_4 + CreatedJobs_28_3 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_28_2 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_28_1 + CreatedJobs_39_1 + CreatedJobs_39_2 + CreatedJobs_39_3 + CreatedJobs_39_4 + CreatedJobs_50_4 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_50_3 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_50_2 + CreatedJobs_50_1 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_4 + CreatedJobs_27_3 + CreatedJobs_27_2 + CreatedJobs_27_1 + CreatedJobs_27_5 + CreatedJobs_14_5 + CreatedJobs_13_5 + CreatedJobs_26_5 + CreatedJobs_39_5 + CreatedJobs_50_5 + CreatedJobs_12_5 + CreatedJobs_25_5 + CreatedJobs_38_5 + CreatedJobs_28_5 + CreatedJobs_60_5 + CreatedJobs_11_5 + CreatedJobs_24_5 + CreatedJobs_37_5 + CreatedJobs_10_5 + CreatedJobs_23_5 + CreatedJobs_36_5 + CreatedJobs_49_5 + CreatedJobs_22_5 + CreatedJobs_35_5 + CreatedJobs_48_5 + CreatedJobs_15_5 + CreatedJobs_51_1 + CreatedJobs_51_2 + CreatedJobs_51_3 + CreatedJobs_51_4 + CreatedJobs_51_5 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))))) : A (F ((A (X ((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))) AND E (G ((1 <= CanInjectEvent)))))) : ((A (((cSources <= place_787_1) U (Schedule_Task_B_1 <= place_523_1))) AND (3 <= cSources)) OR (A (F ((2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))) OR (E (F ((1 <= place_458))) AND (((NotifyEventJobQueuedE_1 <= NotifyEventEndOfCheckSourcesE_1) OR (3 <= place_523_1)) AND (1 <= JobCnt))))) : NOT(A (G ((Try_Check_Sources_B_1 <= mi1)))) : A (X ((E (G ((FetchJobB_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5))) AND A (F ((Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_PerformWork_41 + Schedule_Task_E_1_PerformWork_42 + Schedule_Task_E_1_PerformWork_43 + Schedule_Task_E_1_PerformWork_44 + Schedule_Task_E_1_PerformWork_45 + Schedule_Task_E_1_PerformWork_46 + Schedule_Task_E_1_PerformWork_47 + Schedule_Task_E_1_PerformWork_48 + Schedule_Task_E_1_PerformWork_49 + Schedule_Task_E_1_PerformWork_50 + Schedule_Task_E_1_PerformWork_51 + Schedule_Task_E_1_PerformWork_52 + Schedule_Task_E_1_PerformWork_53 + Schedule_Task_E_1_PerformWork_54 + Schedule_Task_E_1_PerformWork_55 + Schedule_Task_E_1_PerformWork_56 + Schedule_Task_E_1_PerformWork_57 + Schedule_Task_E_1_PerformWork_58 + Schedule_Task_E_1_PerformWork_59 + Schedule_Task_E_1_PerformWork_60 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9 <= place_518_1))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((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_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((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 ... (shortened)
lola: processed formula length: 3287
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G ((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 +... (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 3068 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-S05J60-CTLCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((mo1 + 1 <= Check_Sources_E_1) OR (3 <= cSources)) U ((place_522_1 + 1 <= cJobCnt) AND (3 <= mo1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((mo1 + 1 <= Check_Sources_E_1) OR (3 <= cSources)) U ((place_522_1 + 1 <= cJobCnt) AND (3 <= mo1)))
lola: processed formula length: 103
lola: 1 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= Check_Sources_E_1) OR ((place_460 + 1 <= 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 ... (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 3068 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J60-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 22580 markings, 51706 edges, 4516 markings/sec, 0 secs
lola: sara is running 5 secs || 44826 markings, 103257 edges, 4449 markings/sec, 5 secs
lola: sara is running 10 secs || 67197 markings, 154107 edges, 4474 markings/sec, 10 secs
lola: sara is running 15 secs || 89453 markings, 202035 edges, 4451 markings/sec, 15 secs
lola: sara is running 20 secs || 111685 markings, 248028 edges, 4446 markings/sec, 20 secs
lola: sara is running 25 secs || 133907 markings, 294006 edges, 4444 markings/sec, 25 secs
lola: sara is running 30 secs || 156069 markings, 339887 edges, 4432 markings/sec, 30 secs
lola: sara is running 35 secs || 178265 markings, 385807 edges, 4439 markings/sec, 35 secs
lola: sara is running 40 secs || 200451 markings, 431709 edges, 4437 markings/sec, 40 secs
lola: sara is running 45 secs || 222658 markings, 477660 edges, 4441 markings/sec, 45 secs
lola: sara is running 50 secs || 244874 markings, 523603 edges, 4443 markings/sec, 50 secs
lola: sara is running 55 secs || 267109 markings, 569620 edges, 4447 markings/sec, 55 secs
lola: sara is running 60 secs || 289352 markings, 615644 edges, 4449 markings/sec, 60 secs
lola: sara is running 65 secs || 311569 markings, 661628 edges, 4443 markings/sec, 65 secs
lola: sara is running 70 secs || 333738 markings, 707492 edges, 4434 markings/sec, 70 secs
lola: sara is running 75 secs || 355928 markings, 753388 edges, 4438 markings/sec, 75 secs
lola: sara is running 80 secs || 378149 markings, 799345 edges, 4444 markings/sec, 80 secs
lola: sara is running 85 secs || 400391 markings, 845365 edges, 4448 markings/sec, 85 secs
lola: sara is running 90 secs || 422638 markings, 891407 edges, 4449 markings/sec, 90 secs
lola: sara is running 95 secs || 444834 markings, 937311 edges, 4439 markings/sec, 95 secs
lola: sara is running 100 secs || 466937 markings, 983050 edges, 4421 markings/sec, 100 secs
lola: sara is running 105 secs || 489057 markings, 1028800 edges, 4424 markings/sec, 105 secs
lola: sara is running 110 secs || 511177 markings, 1074554 edges, 4424 markings/sec, 110 secs
lola: sara is running 115 secs || 533340 markings, 1120397 edges, 4433 markings/sec, 115 secs
lola: sara is running 120 secs || 555470 markings, 1167249 edges, 4426 markings/sec, 120 secs
lola: sara is running 125 secs || 577694 markings, 1213205 edges, 4445 markings/sec, 125 secs
lola: sara is running 130 secs || 599914 markings, 1259179 edges, 4444 markings/sec, 130 secs
lola: sara is running 135 secs || 622036 markings, 1304961 edges, 4424 markings/sec, 135 secs
lola: sara is running 140 secs || 644158 markings, 1350707 edges, 4424 markings/sec, 140 secs
lola: sara is running 145 secs || 666282 markings, 1396466 edges, 4425 markings/sec, 145 secs
lola: sara is running 150 secs || 688441 markings, 1443354 edges, 4432 markings/sec, 150 secs
lola: sara is running 155 secs || 710653 markings, 1489293 edges, 4442 markings/sec, 155 secs
lola: sara is running 160 secs || 732791 markings, 1535075 edges, 4428 markings/sec, 160 secs
lola: sara is running 165 secs || 755408 markings, 1582589 edges, 4523 markings/sec, 165 secs
lola: sara is running 170 secs || 778664 markings, 1630939 edges, 4651 markings/sec, 170 secs
lola: sara is running 175 secs || 802082 markings, 1679296 edges, 4684 markings/sec, 175 secs
lola: sara is running 180 secs || 825124 markings, 1727974 edges, 4608 markings/sec, 180 secs
lola: sara is running 185 secs || 848216 markings, 1775660 edges, 4618 markings/sec, 185 secs
lola: sara is running 190 secs || 871118 markings, 1823749 edges, 4580 markings/sec, 190 secs
lola: sara is running 195 secs || 894129 markings, 1871576 edges, 4602 markings/sec, 195 secs
lola: sara is running 200 secs || 917191 markings, 1919242 edges, 4612 markings/sec, 200 secs
lola: sara is running 205 secs || 940292 markings, 1968041 edges, 4620 markings/sec, 205 secs
lola: sara is running 210 secs || 962997 markings, 2015969 edges, 4541 markings/sec, 210 secs
lola: sara is running 215 secs || 986379 markings, 2064256 edges, 4676 markings/sec, 215 secs
lola: sara is running 220 secs || 1009650 markings, 2113339 edges, 4654 markings/sec, 220 secs
lola: sara is running 225 secs || 1032888 markings, 2162176 edges, 4648 markings/sec, 225 secs
lola: sara is running 230 secs || 1056187 markings, 2210498 edges, 4660 markings/sec, 230 secs
lola: sara is running 235 secs || 1079455 markings, 2259628 edges, 4654 markings/sec, 235 secs
lola: sara is running 240 secs || 1102698 markings, 2308646 edges, 4649 markings/sec, 240 secs
lola: sara is running 245 secs || 1125890 markings, 2357557 edges, 4638 markings/sec, 245 secs
lola: sara is running 250 secs || 1149034 markings, 2406437 edges, 4629 markings/sec, 250 secs
lola: sara is running 255 secs || 1172228 markings, 2455334 edges, 4639 markings/sec, 255 secs
lola: sara is running 260 secs || 1195400 markings, 2504260 edges, 4634 markings/sec, 260 secs
lola: sara is running 265 secs || 1218480 markings, 2552924 edges, 4616 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (mo1 + 1 <= NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 ... (shortened)
lola: processed formula length: 1784
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= cJobCnt)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U (cJobCnt <= 2))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 409025 markings, 1052161 edges, 2026545065526034432 markings/sec, 0 secs
lola: 788271 markings, 2016924 edges, 75849 markings/sec, 5 secs
lola: 1183630 markings, 2959533 edges, 79072 markings/sec, 10 secs
lola: 1554051 markings, 3866709 edges, 74084 markings/sec, 15 secs
lola: 1868218 markings, 4670951 edges, 62833 markings/sec, 20 secs
lola: 2128962 markings, 5505712 edges, 52149 markings/sec, 25 secs
lola: 2353670 markings, 6197808 edges, 44942 markings/sec, 30 secs
lola: 2566269 markings, 6896606 edges, 42520 markings/sec, 35 secs
lola: 2785115 markings, 7559359 edges, 43769 markings/sec, 40 secs
lola: 2975210 markings, 8198591 edges, 38019 markings/sec, 45 secs
lola: 3235466 markings, 8944693 edges, 52051 markings/sec, 50 secs
lola: 3538174 markings, 9724718 edges, 60542 markings/sec, 55 secs
lola: 3851437 markings, 10534811 edges, 62653 markings/sec, 60 secs
lola: 4147007 markings, 11276489 edges, 59114 markings/sec, 65 secs
lola: 4467845 markings, 12090894 edges, 64168 markings/sec, 70 secs
lola: 4766673 markings, 12859977 edges, 59766 markings/sec, 75 secs
lola: 5042902 markings, 13587047 edges, 55246 markings/sec, 80 secs
lola: 5301554 markings, 14297253 edges, 51730 markings/sec, 85 secs
lola: 5535438 markings, 15055947 edges, 46777 markings/sec, 90 secs
lola: 5718933 markings, 15690677 edges, 36699 markings/sec, 95 secs
lola: 5929217 markings, 16356312 edges, 42057 markings/sec, 100 secs
lola: 6149312 markings, 17051882 edges, 44019 markings/sec, 105 secs
lola: 6438566 markings, 17798541 edges, 57851 markings/sec, 110 secs
lola: 6693132 markings, 18469365 edges, 50913 markings/sec, 115 secs
lola: 7000611 markings, 19207681 edges, 61496 markings/sec, 120 secs
lola: 7305647 markings, 19938015 edges, 61007 markings/sec, 125 secs
lola: 7606049 markings, 20672976 edges, 60080 markings/sec, 130 secs
lola: 7875025 markings, 21359202 edges, 53795 markings/sec, 135 secs
lola: 8116863 markings, 22027891 edges, 48368 markings/sec, 140 secs
lola: 8305686 markings, 22697585 edges, 37765 markings/sec, 145 secs
lola: 8514825 markings, 23337875 edges, 41828 markings/sec, 150 secs
lola: 8706217 markings, 23964686 edges, 38278 markings/sec, 155 secs
lola: 8920770 markings, 24620861 edges, 42911 markings/sec, 160 secs
lola: 9092617 markings, 25240170 edges, 34369 markings/sec, 165 secs
lola: 9397347 markings, 26037375 edges, 60946 markings/sec, 170 secs
lola: 9642243 markings, 26670540 edges, 48979 markings/sec, 175 secs
lola: 9941328 markings, 27440966 edges, 59817 markings/sec, 180 secs
lola: 10217569 markings, 28130559 edges, 55248 markings/sec, 185 secs
lola: 10525208 markings, 28909870 edges, 61528 markings/sec, 190 secs
lola: 10798910 markings, 29617582 edges, 54740 markings/sec, 195 secs
lola: 11073225 markings, 30338177 edges, 54863 markings/sec, 200 secs
lola: 11311071 markings, 30984395 edges, 47569 markings/sec, 205 secs
lola: 11545044 markings, 31712887 edges, 46795 markings/sec, 210 secs
lola: 11724895 markings, 32349026 edges, 35970 markings/sec, 215 secs
lola: 11923274 markings, 32971044 edges, 39676 markings/sec, 220 secs
lola: 12100652 markings, 33565072 edges, 35476 markings/sec, 225 secs
lola: 12436406 markings, 34474132 edges, 67151 markings/sec, 230 secs
lola: 12765343 markings, 35328031 edges, 65787 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((3 <= Perform_Work_E_1) OR (3 <= NotifyEventJobQueuedE_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((3 <= Perform_Work_E_1) OR (3 <= NotifyEventJobQueuedE_1))))
lola: processed formula length: 80
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 447646 markings, 815650 edges, 3689320832170983424 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 7 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((place_518_1 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (1 <= cSources)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((place_518_1 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (1 <= cSources)))))
lola: processed formula length: 125
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((3 <= mo2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((mo2 <= 2)))))
lola: processed formula length: 34
lola: 5 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((NotifyEventJobQueuedE_1 <= 1))) AND (A (F ((Try_Check_Sources_E_1 <= place_522_1))) AND A (X ((1 <= CanInjectEvent))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= NotifyEventJobQueuedE_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= NotifyEventJobQueuedE_1))
lola: processed formula length: 40
lola: 12 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: subprocess 10 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((place_522_1 + 1 <= Try_Check_Sources_E_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Try_Check_Sources_E_1 <= place_522_1)))
lola: processed formula length: 53
lola: 13 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: subprocess 11 will run for 604 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((CanInjectEvent <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((CanInjectEvent <= 0))
lola: processed formula length: 25
lola: 12 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: lola: ================================================================================
========================================
lola: ========================================
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A ((((place_521_1 <= place_460) OR (mo1 <= mo3)) 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 + Per... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((place_521_1 <= place_460) OR (mo1 <= mo3)) 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 + Perf... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((place_521_1 <= place_460) OR (mo1 <= mo3)) 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 + Perfor... (shortened)
lola: processed formula length: 1880
lola: 1 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 498487 markings, 787749 edges, 99691 markings/sec, 0 secs
lola: 969340 markings, 1555892 edges, 94171 markings/sec, 5 secs
lola: 1421461 markings, 2288028 edges, 90424 markings/sec, 10 secs
lola: 1853734 markings, 3007312 edges, 86455 markings/sec, 15 secs
lola: 2266965 markings, 3705158 edges, 82646 markings/sec, 20 secs
lola: 2686300 markings, 4423501 edges, 83867 markings/sec, 25 secs
lola: 3084926 markings, 5124103 edges, 79725 markings/sec, 30 secs
lola: 3468796 markings, 5823051 edges, 76774 markings/sec, 35 secs
lola: 3819654 markings, 6490622 edges, 70172 markings/sec, 40 secs
lola: 4137447 markings, 7142973 edges, 63559 markings/sec, 45 secs
lola: 4417441 markings, 7850888 edges, 55999 markings/sec, 50 secs
lola: 4862126 markings, 8633522 edges, 88937 markings/sec, 55 secs
lola: 5298922 markings, 9379753 edges, 87359 markings/sec, 60 secs
lola: 5715419 markings, 10080808 edges, 83299 markings/sec, 65 secs
lola: 6159421 markings, 10829994 edges, 88800 markings/sec, 70 secs
lola: 6551259 markings, 11472079 edges, 78368 markings/sec, 75 secs
lola: 6952614 markings, 12152271 edges, 80271 markings/sec, 80 secs
lola: 7347804 markings, 12823071 edges, 79038 markings/sec, 85 secs
lola: 7729747 markings, 13475893 edges, 76389 markings/sec, 90 secs
lola: 8126024 markings, 14151182 edges, 79255 markings/sec, 95 secs
lola: 8506588 markings, 14804627 edges, 76113 markings/sec, 100 secs
lola: 8888214 markings, 15430537 edges, 76325 markings/sec, 105 secs
lola: 9285517 markings, 16020524 edges, 79461 markings/sec, 110 secs
lola: 9696595 markings, 16643207 edges, 82216 markings/sec, 115 secs
lola: 10128790 markings, 17306252 edges, 86439 markings/sec, 120 secs
lola: 10504425 markings, 17893757 edges, 75127 markings/sec, 125 secs
lola: 10911342 markings, 18546503 edges, 81383 markings/sec, 130 secs
lola: 11276960 markings, 19151623 edges, 73124 markings/sec, 135 secs
lola: 11629307 markings, 19767136 edges, 70469 markings/sec, 140 secs
lola: 11942250 markings, 20372008 edges, 62589 markings/sec, 145 secs
lola: 12207745 markings, 20998811 edges, 53099 markings/sec, 150 secs
lola: 12496261 markings, 21606713 edges, 57703 markings/sec, 155 secs
lola: 12794766 markings, 22233834 edges, 59701 markings/sec, 160 secs
lola: 13099308 markings, 22892185 edges, 60908 markings/sec, 165 secs
lola: 13358103 markings, 23457333 edges, 51759 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 568 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (mi3 <= Try_Check_Sources_E_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (mi3 <= Try_Check_Sources_E_1)
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 11 will run for 568 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((mi3 <= 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 568 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((mi3 <= 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_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (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 + f... (shortened)
lola: processed formula length: 513
lola: 3 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 710 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((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_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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (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_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_... (shortened)
lola: processed formula length: 6237
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 710 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((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 + ... (shortened)
lola: processed formula length: 1088
lola: 4 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 947 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((cSources <= place_787_1) U (Schedule_Task_B_1 <= place_523_1))) AND (3 <= cSources)) OR (A (F ((2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))) OR (E (F ((1 <= place_458))) AND (((NotifyEventJobQueuedE_1 <= NotifyEventEndOfCheckSourcesE_1) OR (3 <= place_523_1)) AND (1 <= JobCnt)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 947 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((cSources <= place_787_1) U (Schedule_Task_B_1 <= place_523_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((cSources <= place_787_1) U (Schedule_Task_B_1 <= place_523_1))
lola: processed formula length: 65
lola: 1 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))
lola: processed formula length: 94
lola: 1 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2842 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= place_458)))
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 3068 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 1421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((Try_Check_Sources_B_1 <= mi1))))
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 3068 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-S05J60-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-CTLCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2842 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (G ((FetchJobB_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5))) AND A (F ((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_P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2842 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((FetchJobB_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + 1 <= FetchJobB_1))))
lola: processed formula length: 97
lola: 4 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no unknown yes unknown yes yes no no unknown yes no unknown yes unknown
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496329346522
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_PolyORBNT-PT-S05J60"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/S_PolyORBNT-PT-S05J60.tgz
mv S_PolyORBNT-PT-S05J60 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_PolyORBNT-PT-S05J60, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-149479231600120"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;