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

About the Execution of LoLA for S_PolyORBLF-PT-S02J06T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15921.550 1269149.00 2378859.00 3244.00 FFFF?TFFTTTF?F?F normal

Execution Chart

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

Trace from the execution

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


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

=== Now, execution of the tool begins

BK_START 1496452661791


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


checking for too many tokens
===========================================================================================
S_PolyORBLF-PT-S02J06T10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBLF-PT-S02J06T10 @ 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: 2656/65536 symbol table entries, 18 collisions
lola: preprocessing...
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2543 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: A ((A (X ((AbourtToModifySrc_1 + AbourtToModifySrc_2 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6))) U (3 <= P_1097))) : (((ModifiedSrc_1 + ModifiedSrc_2 <= 1) AND (PlaceSources_1 + PlaceSources_2 <= 1)) OR A (F (((2 <= P_1716) AND (PollingAbort <= P_1093) AND (1 <= AbourtToModifySrc_1 + AbourtToModifySrc_2))))) : (E (F (((2 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9) AND (P_1093 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) AND ((P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= P_1717) OR (1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10))))) AND E (F (((Abort_Check_Sources_E_10 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_9 <= 1) AND ((1 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8 + ProcessingEvt_9 + ProcessingEvt_10) OR (2 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)))))) : (A (((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10 <= 0) U ((2 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10) AND (2 <= NoSigAbort)))) OR E (F (A (G ((RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9 <= SigAbort)))))) : A (F ((1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_10_0 + FetchJobE_10_1 + FetchJobE_10_2 + FetchJobE_10_3 + FetchJobE_10_4 + FetchJobE_10_5 + FetchJobE_10_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6 + FetchJobE_7_0 + FetchJobE_7_1 + FetchJobE_7_2 + FetchJobE_7_3 + FetchJobE_7_4 + FetchJobE_7_5 + FetchJobE_7_6 + FetchJobE_8_0 + FetchJobE_8_1 + FetchJobE_8_2 + FetchJobE_8_3 + FetchJobE_8_4 + FetchJobE_8_5 + FetchJobE_8_6 + FetchJobE_9_5 + FetchJobE_9_4 + FetchJobE_9_3 + FetchJobE_9_2 + FetchJobE_9_1 + FetchJobE_9_0 + FetchJobE_9_6))) : A (F (A (G (((2 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9) OR (2 <= P_1093)))))) : (((2 <= P_1093) OR (A (X ((2 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10))) OR E (F ((2 <= Check_Sources_B_10 + Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 + Check_Sources_B_9))))) AND (((ScheduleTaskE_Work_10_0 + ScheduleTaskE_Work_10_1 + ScheduleTaskE_Work_10_2 + ScheduleTaskE_Work_10_3 + ScheduleTaskE_Work_10_4 + ScheduleTaskE_Work_10_5 + ScheduleTaskE_Work_10_6 + ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_7_5 + ScheduleTaskE_Work_7_6 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4 + ScheduleTaskE_Work_8_5 + ScheduleTaskE_Work_8_6 + ScheduleTaskE_Work_9_0 + ScheduleTaskE_Work_9_1 + ScheduleTaskE_Work_9_2 + ScheduleTaskE_Work_9_3 + ScheduleTaskE_Work_9_4 + ScheduleTaskE_Work_9_5 + ScheduleTaskE_Work_9_6 <= cSources) AND (FetchJobB_10 + FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8 + FetchJobB_9 <= cPollingAbort)) OR (NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8 + NotifyEventEndOfCheckSourcesB_9 + NotifyEventEndOfCheckSourcesB_10 + 1 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10))) : A (F ((A (X ((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + P_2318_9 + P_2318_10 <= DataOnSrc_2 + DataOnSrc_1))) AND (((3 <= PlaceSources_1 + PlaceSources_2) OR (cIdleTasks <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6)) AND (P_1093 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_10_0 + FetchJobE_10_1 + FetchJobE_10_2 + FetchJobE_10_3 + FetchJobE_10_4 + FetchJobE_10_5 + FetchJobE_10_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6 + FetchJobE_7_0 + FetchJobE_7_1 + FetchJobE_7_2 + FetchJobE_7_3 + FetchJobE_7_4 + FetchJobE_7_5 + FetchJobE_7_6 + FetchJobE_8_0 + FetchJobE_8_1 + FetchJobE_8_2 + FetchJobE_8_3 + FetchJobE_8_4 + FetchJobE_8_5 + FetchJobE_8_6 + FetchJobE_9_5 + FetchJobE_9_4 + FetchJobE_9_3 + FetchJobE_9_2 + FetchJobE_9_1 + FetchJobE_9_0 + FetchJobE_9_6))))) : E (F ((A (X ((2 <= P_1717))) AND ((P_1097 <= P_1727) AND (1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8 + NotifyEventEndOfCheckSourcesB_9 + NotifyEventEndOfCheckSourcesB_10) AND ((P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= cPollingAbort) OR (2 <= Check_Sources_B_10 + Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 + Check_Sources_B_9)))))) : A (F ((3 <= cIdleTasks))) : A (F ((3 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6))) : A (X (A (F (((1 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10) AND (2 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9)))))) : NOT(NOT(A (G ((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10 <= 2))))) : NOT(NOT(E (F ((BlockedTasks <= P_1159_10 + P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + P_1159_9))))) : A (G (A (F ((3 <= NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9))))) : E (G (A (((1 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + Idle_10) U (3 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_9_1 + DisablePollingB_9_2 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_10_1 + DisablePollingB_10_2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((AbourtToModifySrc_1 + AbourtToModifySrc_2 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6))) U (3 <= P_1097)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((AbourtToModifySrc_1 + AbourtToModifySrc_2 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6)) U (3 <= P_1097))
lola: processed formula length: 144
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((ModifiedSrc_1 + ModifiedSrc_2 <= 1) AND (PlaceSources_1 + PlaceSources_2 <= 1)) OR A (F (((2 <= P_1716) AND (PollingAbort <= P_1093) AND (1 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ModifiedSrc_1 + ModifiedSrc_2 <= 1) AND (PlaceSources_1 + PlaceSources_2 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ModifiedSrc_1 + ModifiedSrc_2 <= 1) AND (PlaceSources_1 + PlaceSources_2 <= 1))
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= P_1716) AND (PollingAbort <= P_1093) AND (1 <= AbourtToModifySrc_1 + AbourtToModifySrc_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= P_1716) AND (PollingAbort <= P_1093) AND (1 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)))
lola: processed formula length: 107
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: nolola:
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((2 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9) AND (P_1093 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) AND ((P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= P_1717) OR (1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9) AND (P_1093 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) AND ((P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= P_1717) OR (1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1... (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 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J06T10-CTLCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Abort_Check_Sources_E_10 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_9 <= 1) AND ((1 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + Processi... (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 3144 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 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10 <= 0) U ((2 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 ... (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: A (((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10 <= 0) U ((2 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10 <= 0) U ((2 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + T... (shortened)
lola: processed formula length: 470
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9 <= SigAbort)))))
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 (SigAbort + 1 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9))))
lola: processed formula length: 131
lola: 3 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: 363780 markings, 1063422 edges, 3067840301390364672 markings/sec, 0 secs
lola: 711069 markings, 2076984 edges, 69458 markings/sec, 5 secs
lola: 1052237 markings, 3071371 edges, 68234 markings/sec, 10 secs
lola: 1388695 markings, 4051991 edges, 67292 markings/sec, 15 secs
lola: 1723159 markings, 5026598 edges, 66893 markings/sec, 20 secs
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 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + Fetc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + F... (shortened)
lola: processed formula length: 1141
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((2 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9) OR (2 <= P_1093))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9 <= 1) AND (P_1093 <= 1)))))
lola: processed formula length: 390
lola: 3 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= P_1093) OR (A (X ((2 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10))) OR E (F ((2 <= Check_Sources_B_10 + Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sour... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= P_1093)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P_1093)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((2 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10))
lola: processed formula length: 249
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= Check_Sources_B_10 + Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 + Check_Sources_B_9)))
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 3144 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 PolyORBLF-COL-S02J06T10-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 62578 markings, 75175 edges, 12516 markings/sec, 0 secs
lola: sara is running 5 secs || 124099 markings, 154091 edges, 12304 markings/sec, 5 secs
lola: sara is running 10 secs || 185352 markings, 232886 edges, 12251 markings/sec, 10 secs
lola: sara is running 15 secs || 246507 markings, 313324 edges, 12231 markings/sec, 15 secs
lola: sara is running 20 secs || 308122 markings, 393404 edges, 12323 markings/sec, 20 secs
lola: sara is running 25 secs || 369704 markings, 475237 edges, 12316 markings/sec, 25 secs
lola: sara is running 30 secs || 431179 markings, 556990 edges, 12295 markings/sec, 30 secs
lola: sara is running 35 secs || 492705 markings, 638175 edges, 12305 markings/sec, 35 secs
lola: sara is running 40 secs || 554186 markings, 719432 edges, 12296 markings/sec, 40 secs
lola: sara is running 45 secs || 615435 markings, 801567 edges, 12250 markings/sec, 45 secs
lola: sara is running 50 secs || 676830 markings, 882299 edges, 12279 markings/sec, 50 secs
lola: sara is running 55 secs || 737994 markings, 964818 edges, 12233 markings/sec, 55 secs
lola: sara is running 60 secs || 799138 markings, 1047297 edges, 12229 markings/sec, 60 secs
lola: sara is running 65 secs || 860234 markings, 1129364 edges, 12219 markings/sec, 65 secs
lola: sara is running 70 secs || 921177 markings, 1212837 edges, 12189 markings/sec, 70 secs
lola: sara is running 75 secs || 982415 markings, 1294124 edges, 12248 markings/sec, 75 secs
lola: sara is running 80 secs || 1043463 markings, 1376610 edges, 12210 markings/sec, 80 secs
lola: sara is running 85 secs || 1104469 markings, 1458512 edges, 12201 markings/sec, 85 secs
lola: sara is running 90 secs || 1165292 markings, 1541398 edges, 12165 markings/sec, 90 secs
lola: sara is running 95 secs || 1226124 markings, 1623853 edges, 12166 markings/sec, 95 secs
lola: sara is running 100 secs || 1286833 markings, 1706845 edges, 12142 markings/sec, 100 secs
lola: sara is running 105 secs || 1347581 markings, 1790206 edges, 12150 markings/sec, 105 secs
lola: sara is running 110 secs || 1407992 markings, 1874789 edges, 12082 markings/sec, 110 secs
lola: sara is running 115 secs || 1468848 markings, 1956258 edges, 12171 markings/sec, 115 secs
lola: sara is running 120 secs || 1529254 markings, 2040423 edges, 12081 markings/sec, 120 secs
lola: sara is running 125 secs || 1589822 markings, 2123679 edges, 12114 markings/sec, 125 secs
lola: sara is running 130 secs || 1651789 markings, 2207361 edges, 12393 markings/sec, 130 secs
lola: sara is running 135 secs || 1714031 markings, 2293436 edges, 12448 markings/sec, 135 secs
lola: sara is running 140 secs || 1776324 markings, 2379712 edges, 12459 markings/sec, 140 secs
lola: sara is running 145 secs || 1838684 markings, 2463736 edges, 12472 markings/sec, 145 secs
lola: sara is running 150 secs || 1901033 markings, 2549204 edges, 12470 markings/sec, 150 secs
lola: sara is running 155 secs || 1963001 markings, 2633986 edges, 12394 markings/sec, 155 secs
lola: sara is running 160 secs || 2024185 markings, 2717431 edges, 12237 markings/sec, 160 secs
lola: sara is running 165 secs || 2085655 markings, 2800217 edges, 12294 markings/sec, 165 secs
lola: sara is running 170 secs || 2147839 markings, 2885144 edges, 12437 markings/sec, 170 secs
lola: sara is running 175 secs || 2210105 markings, 2972963 edges, 12453 markings/sec, 175 secs
lola: sara is running 180 secs || 2272587 markings, 3059557 edges, 12496 markings/sec, 180 secs
lola: sara is running 185 secs || 2335209 markings, 3145483 edges, 12524 markings/sec, 185 secs
lola: sara is running 190 secs || 2397555 markings, 3232433 edges, 12469 markings/sec, 190 secs
lola: sara is running 195 secs || 2459810 markings, 3319100 edges, 12451 markings/sec, 195 secs
lola: sara is running 200 secs || 2522554 markings, 3403228 edges, 12549 markings/sec, 200 secs
lola: sara is running 205 secs || 2584858 markings, 3490588 edges, 12461 markings/sec, 205 secs
lola: sara is running 210 secs || 2646960 markings, 3579315 edges, 12420 markings/sec, 210 secs
lola: sara is running 215 secs || 2709087 markings, 3667222 edges, 12425 markings/sec, 215 secs
lola: sara is running 220 secs || 2771375 markings, 3753685 edges, 12458 markings/sec, 220 secs
lola: sara is running 225 secs || 2833762 markings, 3841183 edges, 12477 markings/sec, 225 secs
lola: sara is running 230 secs || 2896497 markings, 3926842 edges, 12547 markings/sec, 230 secs
lola: sara is running 235 secs || 2956862 markings, 4010787 edges, 12073 markings/sec, 235 secs
lola: sara is running 240 secs || 3015998 markings, 4092119 edges, 11827 markings/sec, 240 secs
lola: sara is running 245 secs || 3075159 markings, 4173083 edges, 11832 markings/sec, 245 secs
lola: sara is running 250 secs || 3134272 markings, 4254944 edges, 11823 markings/sec, 250 secs
lola: sara is running 255 secs || 3193262 markings, 4335970 edges, 11798 markings/sec, 255 secs
lola: sara is running 260 secs || 3252246 markings, 4417690 edges, 11797 markings/sec, 260 secs
lola: sara is running 265 secs || 3311561 markings, 4497557 edges, 11863 markings/sec, 265 secs
lola: sara is running 270 secs || 3370502 markings, 4579364 edges, 11788 markings/sec, 270 secs
lola: sara is running 275 secs || 3429255 markings, 4662932 edges, 11751 markings/sec, 275 secs
lola: sara is running 280 secs || 3488298 markings, 4745103 edges, 11809 markings/sec, 280 secs
lola: sara is running 285 secs || 3547215 markings, 4828030 edges, 11783 markings/sec, 285 secs
lola: sara is running 290 secs || 3606377 markings, 4909877 edges, 11832 markings/sec, 290 secs
lola: sara is running 295 secs || 3668152 markings, 4995871 edges, 12355 markings/sec, 295 secs
lola: sara is running 300 secs || 3729454 markings, 5084079 edges, 12260 markings/sec, 300 secs
lola: sara is running 305 secs || 3791072 markings, 5170072 edges, 12324 markings/sec, 305 secs
lola: sara is running 310 secs || 3852585 markings, 5257533 edges, 12303 markings/sec, 310 secs
lola: sara is running 315 secs || 3914424 markings, 5342244 edges, 12368 markings/sec, 315 secs
lola: sara is running 320 secs || 3976230 markings, 5427174 edges, 12361 markings/sec, 320 secs
lola: sara is running 325 secs || 4038055 markings, 5511081 edges, 12365 markings/sec, 325 secs
lola: sara is running 330 secs || 4099694 markings, 5597802 edges, 12328 markings/sec, 330 secs
lola: sara is running 335 secs || 4161504 markings, 5681959 edges, 12362 markings/sec, 335 secs
lola: sara is running 340 secs || 4223216 markings, 5767186 edges, 12342 markings/sec, 340 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + P_2318_9 + P_2318_10 <= DataOnSrc_2 + DataOnSrc_1))) AND (((3 <= PlaceSources_1 + PlaceSources_2) OR (cIdleTasks <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6)) AND (P_1093 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + P_2318_9 + P_2318_10 <= DataOnSrc_2 + DataOnSrc_1)) AND (((3 <= PlaceSources_1 + PlaceSources_2) OR (cIdleTasks <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6)) AND (P_1093 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_... (shortened)
lola: processed formula length: 1438
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 8 will run for 394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((2 <= P_1717))) AND ((P_1097 <= P_1727) AND (1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8 + NotifyEventEndOfCheckSourcesB_9 + NotifyEventEndOfCheckSourcesB_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((2 <= P_1717)) AND ((P_1097 <= P_1727) AND (1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8 + NotifyEventEndOfCheckSourcesB_9 + NotifyEventEndOfCheckSourcesB_10... (shortened)
lola: processed formula length: 748
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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: 488485 markings, 581033 edges, 2963410336251641856 markings/sec, 0 secs
lola: 939684 markings, 1149902 edges, 90240 markings/sec, 5 secs
lola: 1378690 markings, 1714741 edges, 87801 markings/sec, 10 secs
lola: 1807845 markings, 2282038 edges, 85831 markings/sec, 15 secs
lola: 2232402 markings, 2838797 edges, 84911 markings/sec, 20 secs
lola: 2648857 markings, 3400695 edges, 83291 markings/sec, 25 secs
lola: 3059018 markings, 3958064 edges, 82032 markings/sec, 30 secs
lola: 3467852 markings, 4517805 edges, 81767 markings/sec, 35 secs
lola: 3871256 markings, 5077632 edges, 80681 markings/sec, 40 secs
lola: 4265943 markings, 5620329 edges, 78937 markings/sec, 45 secs
lola: 4659344 markings, 6164612 edges, 78680 markings/sec, 50 secs
lola: 5049823 markings, 6711167 edges, 78096 markings/sec, 55 secs
lola: 5439326 markings, 7255974 edges, 77901 markings/sec, 60 secs
lola: 5823815 markings, 7808695 edges, 76898 markings/sec, 65 secs
lola: 6207300 markings, 8359414 edges, 76697 markings/sec, 70 secs
lola: 6591804 markings, 8900875 edges, 76901 markings/sec, 75 secs
lola: 6972929 markings, 9450959 edges, 76225 markings/sec, 80 secs
lola: 7352258 markings, 9995201 edges, 75866 markings/sec, 85 secs
lola: 7729483 markings, 10542482 edges, 75445 markings/sec, 90 secs
lola: 8110678 markings, 11088318 edges, 76239 markings/sec, 95 secs
lola: 8495049 markings, 11642167 edges, 76874 markings/sec, 100 secs
lola: 8876273 markings, 12200440 edges, 76245 markings/sec, 105 secs
lola: 9257349 markings, 12758327 edges, 76215 markings/sec, 110 secs
lola: 9636333 markings, 13314297 edges, 75797 markings/sec, 115 secs
lola: 10014189 markings, 13872104 edges, 75571 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= cIdleTasks)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= cIdleTasks))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U (3 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6))
lola: processed formula length: 91
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 11 will run for 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10) AND (2 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((1 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10) AND (2 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9))))
lola: processed formula length: 361
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 12 will run for 757 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G ((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10 <= 2)))))
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 3144 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 PolyORBLF-COL-S02J06T10-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 63859 markings, 78786 edges, 12772 markings/sec, 0 secs
lola: sara is running 5 secs || 126931 markings, 159372 edges, 12614 markings/sec, 5 secs
lola: sara is running 10 secs || 189411 markings, 240743 edges, 12496 markings/sec, 10 secs
lola: sara is running 15 secs || 251617 markings, 325049 edges, 12441 markings/sec, 15 secs
lola: sara is running 20 secs || 313914 markings, 407056 edges, 12459 markings/sec, 20 secs
lola: sara is running 25 secs || 376093 markings, 490364 edges, 12436 markings/sec, 25 secs
lola: sara is running 30 secs || 438093 markings, 574229 edges, 12400 markings/sec, 30 secs
lola: sara is running 35 secs || 500250 markings, 657093 edges, 12431 markings/sec, 35 secs
lola: sara is running 40 secs || 562176 markings, 740110 edges, 12385 markings/sec, 40 secs
lola: sara is running 45 secs || 623862 markings, 824198 edges, 12337 markings/sec, 45 secs
lola: sara is running 50 secs || 685712 markings, 906895 edges, 12370 markings/sec, 50 secs
lola: sara is running 55 secs || 747625 markings, 990279 edges, 12383 markings/sec, 55 secs
lola: sara is running 60 secs || 807773 markings, 1073095 edges, 12030 markings/sec, 60 secs
lola: sara is running 65 secs || 866708 markings, 1152603 edges, 11787 markings/sec, 65 secs
lola: sara is running 70 secs || 925498 markings, 1233147 edges, 11758 markings/sec, 70 secs
lola: sara is running 75 secs || 984494 markings, 1312135 edges, 11799 markings/sec, 75 secs
lola: sara is running 80 secs || 1043277 markings, 1392236 edges, 11757 markings/sec, 80 secs
lola: sara is running 85 secs || 1102135 markings, 1472597 edges, 11772 markings/sec, 85 secs
lola: sara is running 90 secs || 1160984 markings, 1552013 edges, 11770 markings/sec, 90 secs
lola: sara is running 95 secs || 1219761 markings, 1633328 edges, 11755 markings/sec, 95 secs
lola: sara is running 100 secs || 1278609 markings, 1712790 edges, 11770 markings/sec, 100 secs
lola: sara is running 105 secs || 1337266 markings, 1793663 edges, 11731 markings/sec, 105 secs
lola: sara is running 110 secs || 1394602 markings, 1873197 edges, 11467 markings/sec, 110 secs
lola: sara is running 115 secs || 1455979 markings, 1958214 edges, 12275 markings/sec, 115 secs
lola: sara is running 120 secs || 1517382 markings, 2042863 edges, 12281 markings/sec, 120 secs
lola: sara is running 125 secs || 1578743 markings, 2127769 edges, 12272 markings/sec, 125 secs
lola: sara is running 130 secs || 1640055 markings, 2214112 edges, 12262 markings/sec, 130 secs
lola: sara is running 135 secs || 1701523 markings, 2298240 edges, 12294 markings/sec, 135 secs
lola: sara is running 140 secs || 1762877 markings, 2383644 edges, 12271 markings/sec, 140 secs
lola: sara is running 145 secs || 1824324 markings, 2466823 edges, 12289 markings/sec, 145 secs
lola: sara is running 150 secs || 1885552 markings, 2552387 edges, 12246 markings/sec, 150 secs
lola: sara is running 155 secs || 1946898 markings, 2637108 edges, 12269 markings/sec, 155 secs
lola: sara is running 160 secs || 2008106 markings, 2722450 edges, 12242 markings/sec, 160 secs
lola: sara is running 165 secs || 2069371 markings, 2808008 edges, 12253 markings/sec, 165 secs
lola: sara is running 170 secs || 2130875 markings, 2891722 edges, 12301 markings/sec, 170 secs
lola: sara is running 175 secs || 2191951 markings, 2977205 edges, 12215 markings/sec, 175 secs
lola: sara is running 180 secs || 2253085 markings, 3063155 edges, 12227 markings/sec, 180 secs
lola: sara is running 185 secs || 2314340 markings, 3147727 edges, 12251 markings/sec, 185 secs
lola: sara is running 190 secs || 2375630 markings, 3231331 edges, 12258 markings/sec, 190 secs
lola: sara is running 195 secs || 2436916 markings, 3315756 edges, 12257 markings/sec, 195 secs
lola: sara is running 200 secs || 2498107 markings, 3401470 edges, 12238 markings/sec, 200 secs
lola: sara is running 205 secs || 2558662 markings, 3486825 edges, 12111 markings/sec, 205 secs
lola: sara is running 210 secs || 2619813 markings, 3571161 edges, 12230 markings/sec, 210 secs
lola: sara is running 215 secs || 2681271 markings, 3657994 edges, 12292 markings/sec, 215 secs
lola: sara is running 220 secs || 2742757 markings, 3743963 edges, 12297 markings/sec, 220 secs
lola: sara is running 225 secs || 2804205 markings, 3830161 edges, 12290 markings/sec, 225 secs
lola: sara is running 230 secs || 2865634 markings, 3915877 edges, 12286 markings/sec, 230 secs
lola: sara is running 235 secs || 2927112 markings, 4002065 edges, 12296 markings/sec, 235 secs
lola: sara is running 240 secs || 2988595 markings, 4088100 edges, 12297 markings/sec, 240 secs
lola: sara is running 245 secs || 3049822 markings, 4175236 edges, 12245 markings/sec, 245 secs
lola: sara is running 250 secs || 3111003 markings, 4262617 edges, 12236 markings/sec, 250 secs
lola: sara is running 255 secs || 3172677 markings, 4346286 edges, 12335 markings/sec, 255 secs
lola: sara is running 260 secs || 3233931 markings, 4432655 edges, 12251 markings/sec, 260 secs
lola: sara is running 265 secs || 3295377 markings, 4517480 edges, 12289 markings/sec, 265 secs
lola: sara is running 270 secs || 3356546 markings, 4604054 edges, 12234 markings/sec, 270 secs
lola: sara is running 275 secs || 3418258 markings, 4686213 edges, 12342 markings/sec, 275 secs
lola: sara is running 280 secs || 3479550 markings, 4772088 edges, 12258 markings/sec, 280 secs
lola: sara is running 285 secs || 3540797 markings, 4858536 edges, 12249 markings/sec, 285 secs
lola: sara is running 290 secs || 3602086 markings, 4944081 edges, 12258 markings/sec, 290 secs
lola: sara is running 295 secs || 3663382 markings, 5030172 edges, 12259 markings/sec, 295 secs
lola: sara is running 300 secs || 3724661 markings, 5115458 edges, 12256 markings/sec, 300 secs
lola: sara is running 305 secs || 3785716 markings, 5202268 edges, 12211 markings/sec, 305 secs
lola: sara is running 310 secs || 3847009 markings, 5287508 edges, 12259 markings/sec, 310 secs
lola: sara is running 315 secs || 3908077 markings, 5374379 edges, 12214 markings/sec, 315 secs
lola: sara is running 320 secs || 3969195 markings, 5459805 edges, 12224 markings/sec, 320 secs
lola: sara is running 325 secs || 4030281 markings, 5545659 edges, 12217 markings/sec, 325 secs
lola: sara is running 330 secs || 4091302 markings, 5632574 edges, 12204 markings/sec, 330 secs
lola: sara is running 335 secs || 4152436 markings, 5717409 edges, 12227 markings/sec, 335 secs
lola: sara is running 340 secs || 4213954 markings, 5801158 edges, 12304 markings/sec, 340 secs
lola: sara is running 345 secs || 4275060 markings, 5887583 edges, 12221 markings/sec, 345 secs
lola: sara is running 350 secs || 4335985 markings, 5974562 edges, 12185 markings/sec, 350 secs
lola: sara is running 355 secs || 4396807 markings, 6062925 edges, 12164 markings/sec, 355 secs
lola: sara is running 360 secs || 4457965 markings, 6148515 edges, 12232 markings/sec, 360 secs
lola: sara is running 365 secs || 4519049 markings, 6234035 edges, 12217 markings/sec, 365 secs
lola: sara is running 370 secs || 4580050 markings, 6319781 edges, 12200 markings/sec, 370 secs
lola: sara is running 375 secs || 4641140 markings, 6406167 edges, 12218 markings/sec, 375 secs
lola: sara is running 380 secs || 4702273 markings, 6491553 edges, 12227 markings/sec, 380 secs
lola: sara is running 385 secs || 4763548 markings, 6576936 edges, 12255 markings/sec, 385 secs
lola: sara is running 390 secs || 4824392 markings, 6664127 edges, 12169 markings/sec, 390 secs
lola: sara is running 395 secs || 4885149 markings, 6751648 edges, 12151 markings/sec, 395 secs
lola: sara is running 400 secs || 4946314 markings, 6835819 edges, 12233 markings/sec, 400 secs
lola: sara is running 405 secs || 5007223 markings, 6923738 edges, 12182 markings/sec, 405 secs
lola: sara is running 410 secs || 5068160 markings, 7011908 edges, 12187 markings/sec, 410 secs
lola: sara is running 415 secs || 5128955 markings, 7100460 edges, 12159 markings/sec, 415 secs
lola: sara is running 420 secs || 5189967 markings, 7187218 edges, 12202 markings/sec, 420 secs
lola: sara is running 425 secs || 5251175 markings, 7272474 edges, 12242 markings/sec, 425 secs
lola: sara is running 430 secs || 5312177 markings, 7358712 edges, 12200 markings/sec, 430 secs
lola: sara is running 435 secs || 5373268 markings, 7444776 edges, 12218 markings/sec, 435 secs
lola: sara is running 440 secs || 5434209 markings, 7532217 edges, 12188 markings/sec, 440 secs
lola: sara is running 445 secs || 5495237 markings, 7616530 edges, 12206 markings/sec, 445 secs
lola: sara is running 450 secs || 5555784 markings, 7705847 edges, 12109 markings/sec, 450 secs
lola: sara is running 455 secs || 5616828 markings, 7791654 edges, 12209 markings/sec, 455 secs
lola: sara is running 460 secs || 5677732 markings, 7877663 edges, 12181 markings/sec, 460 secs
lola: sara is running 465 secs || 5738836 markings, 7963418 edges, 12221 markings/sec, 465 secs
lola: sara is running 470 secs || 5799937 markings, 8048445 edges, 12220 markings/sec, 470 secs
lola: sara is running 475 secs || 5860926 markings, 8133855 edges, 12198 markings/sec, 475 secs
lola: sara is running 480 secs || 5921683 markings, 8221654 edges, 12151 markings/sec, 480 secs
lola: sara is running 485 secs || 5982565 markings, 8307728 edges, 12176 markings/sec, 485 secs
lola: sara is running 490 secs || 6043198 markings, 8396429 edges, 12127 markings/sec, 490 secs
lola: sara is running 495 secs || 6104266 markings, 8481838 edges, 12214 markings/sec, 495 secs
lola: sara is running 500 secs || 6165220 markings, 8567217 edges, 12191 markings/sec, 500 secs
lola: sara is running 505 secs || 6226149 markings, 8653719 edges, 12186 markings/sec, 505 secs
lola: sara is running 510 secs || 6287078 markings, 8739922 edges, 12186 markings/sec, 510 secs
lola: sara is running 515 secs || 6347775 markings, 8827089 edges, 12139 markings/sec, 515 secs
lola: sara is running 520 secs || 6408499 markings, 8913984 edges, 12145 markings/sec, 520 secs
lola: sara is running 525 secs || 6469195 markings, 9001490 edges, 12139 markings/sec, 525 secs
lola: sara is running 530 secs || 6529925 markings, 9088141 edges, 12146 markings/sec, 530 secs
lola: sara is running 535 secs || 6590831 markings, 9173530 edges, 12181 markings/sec, 535 secs
lola: sara is running 540 secs || 6651688 markings, 9260072 edges, 12171 markings/sec, 540 secs
lola: sara is running 545 secs || 6712639 markings, 9345222 edges, 12190 markings/sec, 545 secs
lola: sara is running 550 secs || 6773381 markings, 9432347 edges, 12148 markings/sec, 550 secs
lola: sara is running 555 secs || 6834029 markings, 9518908 edges, 12130 markings/sec, 555 secs
lola: sara is running 560 secs || 6894467 markings, 9606737 edges, 12088 markings/sec, 560 secs
lola: sara is running 565 secs || 6955843 markings, 9691522 edges, 12275 markings/sec, 565 secs
lola: sara is running 570 secs || 7016799 markings, 9777648 edges, 12191 markings/sec, 570 secs
lola: sara is running 575 secs || 7077447 markings, 9864964 edges, 12130 markings/sec, 575 secs
lola: sara is running 580 secs || 7138136 markings, 9950912 edges, 12138 markings/sec, 580 secs
lola: sara is running 585 secs || 7198894 markings, 10037117 edges, 12152 markings/sec, 585 secs
lola: sara is running 590 secs || 7259757 markings, 10122099 edges, 12173 markings/sec, 590 secs
lola: sara is running 595 secs || 7320461 markings, 10207720 edges, 12141 markings/sec, 595 secs
lola: sara is running 600 secs || 7381404 markings, 10291564 edges, 12189 markings/sec, 600 secs
lola: sara is running 605 secs || 7441787 markings, 10381091 edges, 12077 markings/sec, 605 secs
lola: sara is running 610 secs || 7502487 markings, 10466747 edges, 12140 markings/sec, 610 secs
lola: sara is running 615 secs || 7563186 markings, 10553202 edges, 12140 markings/sec, 615 secs
lola: sara is running 620 secs || 7623982 markings, 10639289 edges, 12159 markings/sec, 620 secs
lola: sara is running 625 secs || 7684598 markings, 10725105 edges, 12123 markings/sec, 625 secs
lola: sara is running 630 secs || 7745154 markings, 10812653 edges, 12111 markings/sec, 630 secs
lola: sara is running 635 secs || 7806056 markings, 10898264 edges, 12180 markings/sec, 635 secs
lola: sara is running 640 secs || 7866781 markings, 10985051 edges, 12145 markings/sec, 640 secs
lola: sara is running 645 secs || 7927368 markings, 11071767 edges, 12117 markings/sec, 645 secs
lola: sara is running 650 secs || 7988320 markings, 11156325 edges, 12190 markings/sec, 650 secs
lola: sara is running 655 secs || 8048936 markings, 11242169 edges, 12123 markings/sec, 655 secs
lola: sara is running 660 secs || 8109557 markings, 11328439 edges, 12124 markings/sec, 660 secs
lola: sara is running 665 secs || 8170211 markings, 11414152 edges, 12131 markings/sec, 665 secs
lola: sara is running 670 secs || 8230639 markings, 11500531 edges, 12086 markings/sec, 670 secs
lola: sara is running 675 secs || 8291220 markings, 11586247 edges, 12116 markings/sec, 675 secs
lola: sara is running 680 secs || 8351783 markings, 11671752 edges, 12113 markings/sec, 680 secs
lola: sara is running 685 secs || 8412358 markings, 11757282 edges, 12115 markings/sec, 685 secs
lola: sara is running 690 secs || 8472883 markings, 11842684 edges, 12105 markings/sec, 690 secs
lola: sara is running 695 secs || 8533314 markings, 11930111 edges, 12086 markings/sec, 695 secs
lola: sara is running 700 secs || 8593875 markings, 12014535 edges, 12112 markings/sec, 700 secs
lola: sara is running 705 secs || 8654356 markings, 12101540 edges, 12096 markings/sec, 705 secs
lola: sara is running 710 secs || 8715058 markings, 12184550 edges, 12140 markings/sec, 710 secs
lola: sara is running 715 secs || 8775601 markings, 12271817 edges, 12109 markings/sec, 715 secs
lola: sara is running 720 secs || 8836111 markings, 12358945 edges, 12102 markings/sec, 720 secs
lola: sara is running 725 secs || 8896634 markings, 12445292 edges, 12105 markings/sec, 725 secs
lola: sara is running 730 secs || 8957126 markings, 12532155 edges, 12098 markings/sec, 730 secs
lola: sara is running 735 secs || 9017817 markings, 12618352 edges, 12138 markings/sec, 735 secs
lola: sara is running 740 secs || 9078340 markings, 12706176 edges, 12105 markings/sec, 740 secs
lola: sara is running 745 secs || 9138916 markings, 12794258 edges, 12115 markings/sec, 745 secs
lola: sara is running 750 secs || 9199346 markings, 12881345 edges, 12086 markings/sec, 750 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 757 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (F ((BlockedTasks <= P_1159_10 + P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + P_1159_9)))))
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 3144 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 PolyORBLF-COL-S02J06T10-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1135 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9)))))
lola: processed formula length: 325
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 2271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((1 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + Idle_10) U (3 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_9_1 + DisablePollingB_9_2 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((1 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + Idle_10) U (3 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_9_1 + DisablePollingB_9_2 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollin... (shortened)
lola: processed formula length: 567
lola: 2 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 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 yes yes no unknown no unknown no no no unknown yes no no
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496453930940

--------------------
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_PolyORBLF-PT-S02J06T10"
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_PolyORBLF-PT-S02J06T10.tgz
mv S_PolyORBLF-PT-S02J06T10 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_PolyORBLF-PT-S02J06T10, 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 r128-smll-149441681600444"
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 ;