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

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

=== Now, execution of the tool begins

BK_START 1496498177868


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


checking for too many tokens
===========================================================================================
S_PolyORBLF-PT-S06J06T04: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBLF-PT-S06J06T04 @ 3539 seconds
Makefile:224: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7660/65536 symbol table entries, 4125 collisions
lola: preprocessing...
lola: finding significant places
lola: 506 places, 7154 transitions, 452 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2111 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: E (X (A (G (((3 <= P_1099) OR (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= IsMonitoring)))))) : NOT(((NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 <= P_1099) AND A (((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 <= DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (2 <= P_1727))))) : (A (F ((Idle_1 + Idle_2 + Idle_3 + Idle_4 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1))) OR NOT(NOT(E (G ((1 <= cJobCnt)))))) : NOT((NOT(E (G ((2 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4)))) AND E (G ((PollingAbort <= 1))))) : (NOT(A (G (((MarkerRead <= DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) OR (ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4))))) OR A (G (A (X ((2 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4)))))) : NOT((E (G (((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 <= P_1726) OR (1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6)))) OR (((P_1099 <= 0) OR (cSources <= 1)) AND ((cPollingAbort + 1 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_2_6 + P_2579_2_5 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 + P_2579_1_6 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_3_5 + P_2579_3_6) OR (MarkerRead + 1 <= 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))))) : A (F (((P_1097 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1) AND (nyo_1 + nyo_2 + nyo_3 + nyo_4 <= cPollingAbort) AND (2 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4) AND (1 <= cJobCnt) AND ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + 1 <= cIdleTasks) OR (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 + 1 <= IsMonitoring))))) : A ((A (G ((CanInjectEvent <= MarkerRead))) U A (G ((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 <= P_1717))))) : A (F (NOT(E (F ((AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4)))))) : E ((A (F ((PollingAbort <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4))) U (3 <= 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))) : E ((A (F ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4))) U ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + 1 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6) AND (2 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4)))) : (NOT((A (F ((1 <= P_1717))) OR ((3 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4) OR (P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 <= 0)))) OR A (G (A (G ((DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_3_6 + DisablePollingB_3_5 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_4_6 <= P_1727)))))) : E (F ((2 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4))) : A (F (((MarkerWrite + 1 <= P_1099) AND (P_1095 <= 0) AND (2 <= P_1093)))) : E (F (A (((P_1160_3 + P_1160_1 + P_1160_2 + P_1160_4 <= SigAbort) U (1 <= Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6))))) : E (G (((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 <= 2) AND ((P_1160_3 + P_1160_1 + P_1160_2 + P_1160_4 + 1 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4) OR (nyo_1 + nyo_2 + nyo_3 + nyo_4 <= 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 (X (A (G (((3 <= P_1099) OR (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= IsMonitoring))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((P_1099 <= 2) AND (IsMonitoring + 1 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6)))))
lola: processed formula length: 190
lola: 3 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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: NOT(((NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 <= P_1099) AND A (((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 <= DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (2 <= P_1727)))))
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: (P_1099 + 1 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_1099 + 1 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4)
lola: processed formula length: 149
lola: 6 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 + 1 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4) R (P_1727 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 <= DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (2 <= P_1727)))
lola: processed formula length: 180
lola: 9 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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: SUBRESULT
lola: lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((Idle_1 + Idle_2 + Idle_3 + Idle_4 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + Dis... (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: A (F ((Idle_1 + Idle_2 + Idle_3 + Idle_4 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + Disa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (Idle_1 + Idle_2 + Idle_3 + Idle_4 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + D... (shortened)
lola: processed formula length: 574
lola: 7 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= cJobCnt)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (cJobCnt <= 0)))
lola: processed formula length: 29
lola: 8 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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: SUBRESULT
lola: result: yes
lola: lola: ========================================
The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(E (G ((2 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4)))) AND E (G ((PollingAbort <= 1)))))
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: E (G ((2 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 <= 1)))
lola: processed formula length: 131
lola: 12 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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: A (F ((2 <= PollingAbort)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= PollingAbort))
lola: processed formula length: 29
lola: 11 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((MarkerRead <= DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) OR (ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4))))) OR A (G (A (X ((2 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 + 1 <= MarkerRead) AND (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4))))
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 1808 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J06T04-CTLCardinality-4.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: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 <= P_1726) OR (1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJob... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((P_1726 + 1 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4) AND (QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((P_1726 + 1 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4) AND (QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3... (shortened)
lola: processed formula length: 554
lola: 6 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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: 379401 markings, 1095846 edges, 75880 markings/sec, 0 secs
lola: 745062 markings, 2172483 edges, 73132 markings/sec, 5 secs
lola: 1099579 markings, 3238524 edges, 70903 markings/sec, 10 secs
lola: 1461405 markings, 4338631 edges, 72365 markings/sec, 15 secs
lola: 1837577 markings, 5442362 edges, 75234 markings/sec, 20 secs
lola: 2198007 markings, 6534539 edges, 72086 markings/sec, 25 secs
lola: 2553477 markings, 7620703 edges, 71094 markings/sec, 30 secs
lola: 2911602 markings, 8675210 edges, 71625 markings/sec, 35 secs
lola: 3260242 markings, 9734095 edges, 69728 markings/sec, 40 secs
lola: 3627671 markings, 10835899 edges, 73486 markings/sec, 45 secs
lola: 3978250 markings, 11889711 edges, 70116 markings/sec, 50 secs
lola: 4326115 markings, 12966341 edges, 69573 markings/sec, 55 secs
lola: 4677636 markings, 13984934 edges, 70304 markings/sec, 60 secs
lola: 5026151 markings, 15049500 edges, 69703 markings/sec, 65 secs
lola: 5380658 markings, 16143621 edges, 70901 markings/sec, 70 secs
lola: 5731799 markings, 17221636 edges, 70228 markings/sec, 75 secs
lola: 6086964 markings, 18268313 edges, 71033 markings/sec, 80 secs
lola: 6434710 markings, 19342215 edges, 69549 markings/sec, 85 secs
lola: 6763099 markings, 20389412 edges, 65678 markings/sec, 90 secs
lola: 7093867 markings, 21411686 edges, 66154 markings/sec, 95 secs
lola: 7427575 markings, 22440118 edges, 66742 markings/sec, 100 secs
lola: 7741657 markings, 23523671 edges, 62816 markings/sec, 105 secs
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 6 will run for 342 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((P_1097 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisableP... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((P_1097 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + Disab... (shortened)
lola: processed formula length: 1554
lola: 1 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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 7 will run for 380 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((CanInjectEvent <= MarkerRead))) U A (G ((ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 <= P_1717)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (MarkerRead + 1 <= CanInjectEvent))) U NOT(E(TRUE U (P_1717 + 1 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4))))
lola: processed formula length: 155
lola: 5 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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 3 significant temporal operators and needs 13 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 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4))))
lola: processed formula length: 161
lola: 6 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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 9 will run for 489 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((PollingAbort <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4))) U (3 <= 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (PollingAbort <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4)) U (3 <= 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_... (shortened)
lola: processed formula length: 579
lola: 2 rewrites
lola: formula mentions 0 of 506 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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: 598387 markings, 995367 edges, 2316348567939186688 markings/sec, 0 secs
lola: 948418 markings, 1764120 edges, 70006 markings/sec, 5 secs
lola: 1286475 markings, 2507827 edges, 67611 markings/sec, 10 secs
lola: 1625104 markings, 3182314 edges, 67726 markings/sec, 15 secs
lola: 1958526 markings, 3894703 edges, 66684 markings/sec, 20 secs
lola: 2284409 markings, 4604666 edges, 65177 markings/sec, 25 secs
lola: 2618336 markings, 5289208 edges, 66785 markings/sec, 30 secs
lola: 2946980 markings, 6000638 edges, 65729 markings/sec, 35 secs
lola: 3268769 markings, 6677815 edges, 64358 markings/sec, 40 secs
lola: 3589193 markings, 7372623 edges, 64085 markings/sec, 45 secs
lola: 3916868 markings, 8052715 edges, 65535 markings/sec, 50 secs
lola: 4233856 markings, 8715835 edges, 63398 markings/sec, 55 secs
lola: 4552565 markings, 9398647 edges, 63742 markings/sec, 60 secs
lola: 4867603 markings, 10091638 edges, 63008 markings/sec, 65 secs
lola: 5192011 markings, 10785255 edges, 64882 markings/sec, 70 secs
lola: 5508066 markings, 11474815 edges, 63211 markings/sec, 75 secs
lola: 5820913 markings, 12154673 edges, 62569 markings/sec, 80 secs
lola: 6143757 markings, 12841939 edges, 64569 markings/sec, 85 secs
lola: 6465226 markings, 13501702 edges, 64294 markings/sec, 90 secs
lola: 6772766 markings, 14173052 edges, 61508 markings/sec, 95 secs
lola: 7085437 markings, 14848340 edges, 62534 markings/sec, 100 secs
lola: 7407578 markings, 15497805 edges, 64428 markings/sec, 105 secs
lola: 7718481 markings, 16176610 edges, 62181 markings/sec, 110 secs
lola: 8029431 markings, 16844017 edges, 62190 markings/sec, 115 secs
lola: 8348301 markings, 17503355 edges, 63774 markings/sec, 120 secs
lola: 8672816 markings, 18190515 edges, 64903 markings/sec, 125 secs
lola: 8978858 markings, 18868682 edges, 61208 markings/sec, 130 secs
lola: 9294248 markings, 19515565 edges, 63078 markings/sec, 135 secs
lola: 9605099 markings, 20187382 edges, 62170 markings/sec, 140 secs
lola: 9919926 markings, 20852453 edges, 62965 markings/sec, 145 secs
lola: 10227535 markings, 21508204 edges, 61522 markings/sec, 150 secs
lola: 10519236 markings, 22122202 edges, 58340 markings/sec, 155 secs
lola: 10825182 markings, 22761167 edges, 61189 markings/sec, 160 secs
lola: 11133783 markings, 23400430 edges, 61720 markings/sec, 165 secs
lola: 11439610 markings, 24062662 edges, 61165 markings/sec, 170 secs
lola: 11750025 markings, 24704746 edges, 62083 markings/sec, 175 secs
lola: 12062782 markings, 25355378 edges, 62551 markings/sec, 180 secs
lola: 12370827 markings, 25992870 edges, 61609 markings/sec, 185 secs
lola: 12675842 markings, 26633100 edges, 61003 markings/sec, 190 secs
lola: 12983933 markings, 27257027 edges, 61618 markings/sec, 195 secs
lola: 13291047 markings, 27910457 edges, 61423 markings/sec, 200 secs
lola: 13600473 markings, 28561201 edges, 61885 markings/sec, 205 secs
lola: 13907320 markings, 29194890 edges, 61369 markings/sec, 210 secs
lola: 14210113 markings, 29830121 edges, 60559 markings/sec, 215 secs
lola: 14515582 markings, 30479126 edges, 61094 markings/sec, 220 secs
lola: 14817933 markings, 31093030 edges, 60470 markings/sec, 225 secs
lola: 15126740 markings, 31723025 edges, 61761 markings/sec, 230 secs
lola: 15431654 markings, 32356008 edges, 60983 markings/sec, 235 secs
lola: 15733953 markings, 32986748 edges, 60460 markings/sec, 240 secs
lola: 16036433 markings, 33648271 edges, 60496 markings/sec, 245 secs
lola: 16339078 markings, 34272173 edges, 60529 markings/sec, 250 secs
lola: 16630984 markings, 34894516 edges, 58381 markings/sec, 255 secs
lola: 16935506 markings, 35513702 edges, 60904 markings/sec, 260 secs
lola: 17237141 markings, 36139373 edges, 60327 markings/sec, 265 secs
lola: 17542393 markings, 36761791 edges, 61050 markings/sec, 270 secs
lola: 17848969 markings, 37389745 edges, 61315 markings/sec, 275 secs
lola: 18151695 markings, 38036168 edges, 60545 markings/sec, 280 secs
lola: 18454931 markings, 38687165 edges, 60647 markings/sec, 285 secs
lola: 18760954 markings, 39313836 edges, 61205 markings/sec, 290 secs
lola: 19049604 markings, 39945992 edges, 57730 markings/sec, 295 secs
lola: 19357295 markings, 40573073 edges, 61538 markings/sec, 300 secs
lola: 19663796 markings, 41205069 edges, 61300 markings/sec, 305 secs
lola: 19964738 markings, 41829824 edges, 60188 markings/sec, 310 secs
lola: 20268944 markings, 42446349 edges, 60841 markings/sec, 315 secs
lola: 20565637 markings, 43063331 edges, 59339 markings/sec, 320 secs
lola: 20865360 markings, 43673298 edges, 59945 markings/sec, 325 secs
lola: 21166082 markings, 44286500 edges, 60144 markings/sec, 330 secs
lola: 21472350 markings, 44938225 edges, 61254 markings/sec, 335 secs
lola: 21776831 markings, 45559365 edges, 60896 markings/sec, 340 secs
lola: 22073709 markings, 46172748 edges, 59376 markings/sec, 345 secs
lola: 22371177 markings, 46788903 edges, 59494 markings/sec, 350 secs
lola: 22667510 markings, 47410682 edges, 59267 markings/sec, 355 secs
lola: 22971683 markings, 48032096 edges, 60835 markings/sec, 360 secs
lola: 23270316 markings, 48639395 edges, 59727 markings/sec, 365 secs
lola: 23573948 markings, 49251844 edges, 60726 markings/sec, 370 secs
lola: 23869122 markings, 49880139 edges, 59035 markings/sec, 375 secs
lola: 24360724 markings, 50798672 edges, 98320 markings/sec, 380 secs
Killed
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T04-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496498681355

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
make: [verify] Error 137 (ignored)
----- 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-S06J06T04"
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-S06J06T04.tgz
mv S_PolyORBLF-PT-S06J06T04 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-S06J06T04, 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-149441681700534"
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 ;