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-S05J40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231600111
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496324160769


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


checking for too many tokens
===========================================================================================
S_PolyORBNT-PT-S05J40: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBNT-PT-S05J40 @ 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: 2219/65536 symbol table entries, 162 collisions
lola: preprocessing...
lola: finding significant places
lola: 629 places, 1590 transitions, 527 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J40-CTLCardinality.task
lola: (((E (F ((3 <= Check_Sources_B_1))) AND (mo3 <= place_460)) OR E (X ((Perform_Work_E_1 + 1 <= NotifyEventEndOfCheckSourcesE_1)))) AND ((Check_Sources_E_1 <= FetchJobB_1) OR ((1 <= NotifyEventEndOfCheckSourcesB_1) AND (place_458 <= DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5)))) : NOT(E (G (A (X ((Perform_Work_E_1 <= JobCnt)))))) : E (G ((Perform_Work_E_1 <= mi1))) : ((((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= 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) OR (mo1 <= 0)) OR E (F ((Try_Check_Sources_E_1 <= 1)))) AND A (F (E (X ((3 <= place_520_1)))))) : A (F (NOT(E (G ((place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 <= Perform_Work_E_1)))))) : E (G ((A (G ((QueueJobE_1 <= 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))) OR ((place_518_1 <= 1) AND (Check_Sources_E_1 + 1 <= place_782_1))))) : (E (G (A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= place_521_1))))) AND A (G (E (F ((1 <= Try_Check_Sources_B_1)))))) : A ((E (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= QueueJobE_1))) U ((place_522_1 <= 0) AND (cJobCnt + 1 <= place_523_1)))) : (E (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 <= mi1))) AND E (F (A (G ((3 <= Check_Sources_E_1)))))) : A ((E (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_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + 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 <= Try_Check_Sources_E_1))) U ((1 <= place_782_1) AND (Perform_Work_E_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_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) AND (DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= mi2)))) : (A (X (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 <= place_522_1))))) AND A (X ((Perform_Work_E_1 <= 0)))) : (NOT(A (((place_462 <= NotifyEventJobQueuedE_1) U (NotifyEventEndOfCheckSourcesB_1 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))) OR A (F ((1 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))) : A (X (A (F ((2 <= Try_Check_Sources_B_1))))) : E (F (A (G (((mi2 <= Check_Sources_B_1) AND (mo2 <= NotifyEventEndOfCheckSourcesB_1)))))) : (A (G (A (F ((2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40))))) OR A (X ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 <= mo3)))) : A ((((2 <= 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_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + 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) OR (Perform_Work_E_1 <= 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)) U A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= Try_Check_Sources_E_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 (F ((3 <= Check_Sources_B_1))) AND (mo3 <= place_460)) OR E (X ((Perform_Work_E_1 + 1 <= NotifyEventEndOfCheckSourcesE_1)))) AND ((Check_Sources_E_1 <= FetchJobB_1) OR ((1 <= NotifyEventEndOfCheckSourcesB_1) AND (place_458 <= DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Check_Sources_B_1)))
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 2108 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-S05J40-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((Perform_Work_E_1 + 1 <= NotifyEventEndOfCheckSourcesE_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Perform_Work_E_1 + 1 <= NotifyEventEndOfCheckSourcesE_1))
lola: processed formula length: 61
lola: 1 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (X ((Perform_Work_E_1 <= JobCnt))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((JobCnt + 1 <= Perform_Work_E_1)))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: E (G ((Perform_Work_E_1 <= mi1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (mi1 + 1 <= Perform_Work_E_1)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= 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) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= 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) OR (m... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= 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) OR (m... (shortened)
lola: processed formula length: 409
lola: 0 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-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 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Try_Check_Sources_E_1 <= 1)))
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 2108 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((3 <= place_520_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((3 <= place_520_1)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (G ((place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 <= Perform_Work_E_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (Perform_Work_E_1 + 1 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))
lola: processed formula length: 113
lola: 5 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: E (G ((A (G ((QueueJobE_1 <= 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))) OR ((place_518_1 <= 1) AND (Check_Sources_E_1 + 1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (E(TRUE U (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 + 1 <= QueueJobE_1)) AND ((2 <= place_518_1) OR (place_782_... (shortened)
lola: processed formula length: 427
lola: 6 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= place_521_1))))) AND A (G (E (F ((1 <= Try_Check_Sources_B_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= place_521_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= place_521_1)))))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= QueueJobE_1))) U ((place_522_1 <= 0) AND (cJobCnt + 1 <= place_523_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(E(TRUE U (TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= QueueJobE_1)) U ((place_522_1 <= 0) AND (cJobCnt + 1 <= place_523_1)))
lola: processed formula length: 143
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (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 + Perfor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (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... (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 2108 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: state equation: write sara problem file to PolyORBNT-COL-S05J40-CTLCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= Check_Sources_E_1)))))
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 (Check_Sources_E_1 <= 2))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: 543157 markings, 1465116 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1020795 markings, 2777243 edges, 95528 markings/sec, 5 secs
lola: 1487137 markings, 4038546 edges, 93268 markings/sec, 10 secs
lola: 1936030 markings, 5242273 edges, 89779 markings/sec, 15 secs
lola: 2369888 markings, 6407928 edges, 86772 markings/sec, 20 secs
lola: 2809422 markings, 7591562 edges, 87907 markings/sec, 25 secs
lola: 3278572 markings, 8863527 edges, 93830 markings/sec, 30 secs
lola: 3761983 markings, 10172678 edges, 96682 markings/sec, 35 secs
lola: 4214193 markings, 11384279 edges, 90442 markings/sec, 40 secs
lola: 4622826 markings, 12504483 edges, 81727 markings/sec, 45 secs
lola: 5066634 markings, 13706364 edges, 88762 markings/sec, 50 secs
lola: 5502989 markings, 14888110 edges, 87271 markings/sec, 55 secs
lola: 5962083 markings, 16126093 edges, 91819 markings/sec, 60 secs
lola: 6420519 markings, 17351328 edges, 91687 markings/sec, 65 secs
lola: 6858713 markings, 18553309 edges, 87639 markings/sec, 70 secs
lola: 7276530 markings, 19686141 edges, 83563 markings/sec, 75 secs
lola: 7689181 markings, 20808849 edges, 82530 markings/sec, 80 secs
lola: 8079685 markings, 21867608 edges, 78101 markings/sec, 85 secs
lola: 8517272 markings, 23055546 edges, 87517 markings/sec, 90 secs
lola: 8951867 markings, 24234353 edges, 86919 markings/sec, 95 secs
lola: 9343739 markings, 25299612 edges, 78374 markings/sec, 100 secs
lola: 9790843 markings, 26518402 edges, 89421 markings/sec, 105 secs
lola: 10213081 markings, 27665636 edges, 84448 markings/sec, 110 secs
lola: 10645020 markings, 28821558 edges, 86388 markings/sec, 115 secs
lola: 11032829 markings, 29894909 edges, 77562 markings/sec, 120 secs
lola: 11472678 markings, 31105169 edges, 87970 markings/sec, 125 secs
lola: 11890416 markings, 32240702 edges, 83548 markings/sec, 130 secs
lola: 12322196 markings, 33431510 edges, 86356 markings/sec, 135 secs
lola: 12746270 markings, 34567318 edges, 84815 markings/sec, 140 secs
lola: 13128008 markings, 35634153 edges, 76348 markings/sec, 145 secs
lola: 13510882 markings, 36679058 edges, 76575 markings/sec, 150 secs
lola: 13869263 markings, 37668509 edges, 71676 markings/sec, 155 secs
lola: 14286367 markings, 38805689 edges, 83421 markings/sec, 160 secs
lola: 14728801 markings, 40035073 edges, 88487 markings/sec, 165 secs
lola: 15099855 markings, 41064355 edges, 74211 markings/sec, 170 secs
lola: 15511773 markings, 42204672 edges, 82384 markings/sec, 175 secs
lola: 15935810 markings, 43378437 edges, 84807 markings/sec, 180 secs
lola: 16301449 markings, 44397676 edges, 73128 markings/sec, 185 secs
lola: 16663973 markings, 45404724 edges, 72505 markings/sec, 190 secs
lola: 17084861 markings, 46574565 edges, 84178 markings/sec, 195 secs
lola: 17465623 markings, 47647954 edges, 76152 markings/sec, 200 secs
lola: 17870721 markings, 48777164 edges, 81020 markings/sec, 205 secs
lola: 18239591 markings, 49822330 edges, 73774 markings/sec, 210 secs
lola: 18590661 markings, 50820636 edges, 70214 markings/sec, 215 secs
lola: 18950749 markings, 51843953 edges, 72018 markings/sec, 220 secs
lola: 19294782 markings, 52838901 edges, 68807 markings/sec, 225 secs
lola: 19665106 markings, 53907498 edges, 74065 markings/sec, 230 secs
lola: 19986784 markings, 54857872 edges, 64336 markings/sec, 235 secs
lola: 20339902 markings, 55910283 edges, 70624 markings/sec, 240 secs
lola: 20671289 markings, 56937427 edges, 66277 markings/sec, 245 secs
lola: 20982313 markings, 57999938 edges, 62205 markings/sec, 250 secs
lola: 21434688 markings, 59371394 edges, 90475 markings/sec, 255 secs
lola: 21816980 markings, 60571996 edges, 76458 markings/sec, 260 secs
lola: 22107207 markings, 61633027 edges, 58045 markings/sec, 265 secs
lola: 22476384 markings, 62758895 edges, 73835 markings/sec, 270 secs
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: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================lola:
========================================
lola: ...considering subproblem: A ((E (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_9 + AvailableJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(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_9 + Available... (shortened)
lola: processed formula length: 2438
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: 586376 markings, 1196767 edges, 2486982876965371904 markings/sec, 0 secs
lola: 1044119 markings, 2255757 edges, 91549 markings/sec, 5 secs
lola: 1450662 markings, 3190229 edges, 81309 markings/sec, 10 secs
lola: 1926406 markings, 4139575 edges, 95149 markings/sec, 15 secs
lola: 2305588 markings, 5048356 edges, 75836 markings/sec, 20 secs
lola: 2772545 markings, 6071874 edges, 93391 markings/sec, 25 secs
lola: 3286718 markings, 7157913 edges, 102835 markings/sec, 30 secs
lola: 3671745 markings, 8125917 edges, 77005 markings/sec, 35 secs
lola: 4215417 markings, 9230217 edges, 108734 markings/sec, 40 secs
lola: 4605513 markings, 10162957 edges, 78019 markings/sec, 45 secs
lola: 5041810 markings, 11142563 edges, 87259 markings/sec, 50 secs
lola: 5521169 markings, 12168562 edges, 95872 markings/sec, 55 secs
lola: 5857979 markings, 13046084 edges, 67362 markings/sec, 60 secs
lola: 6332176 markings, 14008457 edges, 94839 markings/sec, 65 secs
lola: 6735045 markings, 14912094 edges, 80574 markings/sec, 70 secs
lola: 7063170 markings, 15724668 edges, 65625 markings/sec, 75 secs
lola: 7472335 markings, 16551264 edges, 81833 markings/sec, 80 secs
lola: 7830255 markings, 17349597 edges, 71584 markings/sec, 85 secs
lola: 8111869 markings, 18084755 edges, 56323 markings/sec, 90 secs
lola: 8574472 markings, 19030590 edges, 92521 markings/sec, 95 secs
lola: 8938315 markings, 19891937 edges, 72769 markings/sec, 100 secs
lola: 9268519 markings, 20673385 edges, 66041 markings/sec, 105 secs
lola: 9647706 markings, 21427863 edges, 75837 markings/sec, 110 secs
lola: 9971605 markings, 22151333 edges, 64780 markings/sec, 115 secs
lola: 10238954 markings, 22845644 edges, 53470 markings/sec, 120 secs
lola: 10670568 markings, 23713371 edges, 86323 markings/sec, 125 secs
lola: 11026698 markings, 24551027 edges, 71226 markings/sec, 130 secs
lola: 11388788 markings, 25393216 edges, 72418 markings/sec, 135 secs
lola: 11878199 markings, 26414716 edges, 97882 markings/sec, 140 secs
lola: 12219542 markings, 27274407 edges, 68269 markings/sec, 145 secs
lola: 12741451 markings, 28364557 edges, 104382 markings/sec, 150 secs
lola: 13134937 markings, 29307798 edges, 78697 markings/sec, 155 secs
lola: 13506350 markings, 30153702 edges, 74283 markings/sec, 160 secs
lola: 13888678 markings, 30949953 edges, 76466 markings/sec, 165 secs
lola: 14241287 markings, 31768594 edges, 70522 markings/sec, 170 secs
lola: 14731481 markings, 32822962 edges, 98039 markings/sec, 175 secs
lola: 15119851 markings, 33670458 edges, 77674 markings/sec, 180 secs
lola: 15469928 markings, 34420657 edges, 70015 markings/sec, 185 secs
lola: 15876436 markings, 35307421 edges, 81302 markings/sec, 190 secs
lola: 16334273 markings, 36314266 edges, 91567 markings/sec, 195 secs
lola: 16765304 markings, 37177766 edges, 86206 markings/sec, 200 secs
lola: 17094071 markings, 37971275 edges, 65753 markings/sec, 205 secs
lola: 17561927 markings, 38910145 edges, 93571 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 507 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (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 a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 507 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (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 + P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U (place_522_1 + 1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + ... (shortened)
lola: processed formula length: 929
lola: 3 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: 536909 markings, 1361713 edges, 3225752436249460736 markings/sec, 0 secs
lola: 977391 markings, 2521251 edges, 88096 markings/sec, 5 secs
lola: 1292143 markings, 3555194 edges, 62950 markings/sec, 10 secs
lola: 1699197 markings, 4624803 edges, 81411 markings/sec, 15 secs
lola: 2103022 markings, 5655522 edges, 80765 markings/sec, 20 secs
lola: 2433088 markings, 6649994 edges, 66013 markings/sec, 25 secs
lola: 2768027 markings, 7653285 edges, 66988 markings/sec, 30 secs
lola: 3255370 markings, 8885242 edges, 97469 markings/sec, 35 secs
lola: 3650367 markings, 10014192 edges, 78999 markings/sec, 40 secs
lola: 3996229 markings, 11076421 edges, 69172 markings/sec, 45 secs
lola: 4470120 markings, 12274496 edges, 94778 markings/sec, 50 secs
lola: 4870405 markings, 13382821 edges, 80057 markings/sec, 55 secs
lola: 5156449 markings, 14307530 edges, 57209 markings/sec, 60 secs
lola: 5600890 markings, 15449360 edges, 88888 markings/sec, 65 secs
lola: 6020351 markings, 16581846 edges, 83892 markings/sec, 70 secs
lola: 6317161 markings, 17535351 edges, 59362 markings/sec, 75 secs
lola: 6716338 markings, 18583230 edges, 79835 markings/sec, 80 secs
lola: 7101923 markings, 19583951 edges, 77117 markings/sec, 85 secs
lola: 7400778 markings, 20522344 edges, 59771 markings/sec, 90 secs
lola: 7704131 markings, 21404286 edges, 60671 markings/sec, 95 secs
lola: 8065874 markings, 22313871 edges, 72349 markings/sec, 100 secs
lola: 8389390 markings, 23169569 edges, 64703 markings/sec, 105 secs
lola: 8649077 markings, 24015165 edges, 51937 markings/sec, 110 secs
lola: 8970063 markings, 24926179 edges, 64197 markings/sec, 115 secs
lola: 9357149 markings, 25910733 edges, 77417 markings/sec, 120 secs
lola: 9667723 markings, 26830749 edges, 62115 markings/sec, 125 secs
lola: 9932823 markings, 27670275 edges, 53020 markings/sec, 130 secs
lola: 10274139 markings, 28525835 edges, 68263 markings/sec, 135 secs
lola: 10594496 markings, 29354168 edges, 64071 markings/sec, 140 secs
lola: 10847022 markings, 30135857 edges, 50505 markings/sec, 145 secs
lola: 11071531 markings, 30865595 edges, 44902 markings/sec, 150 secs
lola: 11463040 markings, 31854379 edges, 78302 markings/sec, 155 secs
lola: 11801771 markings, 32777251 edges, 67746 markings/sec, 160 secs
lola: 12075331 markings, 33635031 edges, 54712 markings/sec, 165 secs
lola: 12470665 markings, 34708497 edges, 79067 markings/sec, 170 secs
lola: 12885504 markings, 35811246 edges, 82968 markings/sec, 175 secs
lola: 13192570 markings, 36769213 edges, 61413 markings/sec, 180 secs
lola: 13613888 markings, 37907775 edges, 84264 markings/sec, 185 secs
lola: 14047512 markings, 39055877 edges, 86725 markings/sec, 190 secs
lola: 14348177 markings, 40036319 edges, 60133 markings/sec, 195 secs
lola: 14699167 markings, 40968128 edges, 70198 markings/sec, 200 secs
lola: 15033841 markings, 41831881 edges, 66935 markings/sec, 205 secs
lola: 15315084 markings, 42684474 edges, 56249 markings/sec, 210 secs
lola: 15781767 markings, 43873490 edges, 93337 markings/sec, 215 secs
lola: 16137406 markings, 44919603 edges, 71128 markings/sec, 220 secs
lola: 16369832 markings, 45502099 edges, 46485 markings/sec, 225 secs
lola: 16588522 markings, 46063294 edges, 43738 markings/sec, 230 secs
lola: 16787484 markings, 46622590 edges, 39792 markings/sec, 235 secs
lola: 16991467 markings, 47232002 edges, 40797 markings/sec, 240 secs
lola: 17283772 markings, 47968547 edges, 58461 markings/sec, 245 secs
lola: 17552007 markings, 48698570 edges, 53647 markings/sec, 250 secs
lola: 17772895 markings, 49355230 edges, 44178 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Perform_Work_E_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((Perform_Work_E_1 <= 0))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 11 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT(A (((place_462 <= NotifyEventJobQueuedE_1) U (NotifyEventEndOfCheckSourcesB_1 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NotifyEventJobQueuedE_1 + 1 <= place_462) R (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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + 1 <= NotifyEventEndOfCheckSource... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((place_462 <= NotifyEventJobQueuedE_1) U (NotifyEventEndOfCheckSourcesB_1 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))... (shortened)
lola: processed formula length: 401
lola: 7 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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 12 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= 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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))
lola: processed formula length: 332
lola: 5 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((2 <= Try_Check_Sources_B_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (2 <= Try_Check_Sources_B_1)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 925 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((mi2 <= Check_Sources_B_1) AND (mo2 <= NotifyEventEndOfCheckSourcesB_1))))))
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 ((Check_Sources_B_1 + 1 <= mi2) OR (NotifyEventEndOfCheckSourcesB_1 + 1 <= mo2)))))
lola: processed formula length: 106
lola: 3 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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 14 will run for 1388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + Q... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + Queu... (shortened)
lola: processed formula length: 721
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2776 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 <= mo3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 <= mo3))
lola: processed formula length: 80
lola: 1 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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 15 will run for 2776 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= 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_9 + AvailableJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((2 <= 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_9 + AvailableJob... (shortened)
lola: processed formula length: 1258
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: RESULT
lola:
SUMMARY: no no yes no no no no no unknown unknown unknown no no yes no no
lola: ========================================
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496324924674

--------------------
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-S05J40"
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-S05J40.tgz
mv S_PolyORBNT-PT-S05J40 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-S05J40, 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-149479231600111"
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 ;