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

About the Execution of LoLA for PolyORBLF-PT-S04J06T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
728.020 147268.00 147288.00 395.10 FFTFTFFTTFFFFTFF 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 PolyORBLF-PT-S04J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440870000482
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494709263326


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-PT-S04J06T06 @ 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: 3808/65536 symbol table entries, 872 collisions
lola: preprocessing...
lola: finding significant places
lola: 618 places, 3190 transitions, 564 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2157 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: A (X (G (((AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_4 + P_2579_1_3 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4) U (2 <= CanInjectEvent))))) : A (F (X ((2 <= PollingAbort)))) : A (F (((P_1726 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) U (AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4)))) : A ((G (F ((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 + 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))) U F ((3 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4)))) : A (F (G ((3 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_4_5 + NotifyEventJobQueuedB_4_6 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_5_5 + NotifyEventJobQueuedB_5_6 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_6_5 + NotifyEventJobQueuedB_6_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6)))) : A ((2 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6)) : A (G (F (F (G ((3 <= P_1717)))))) : A ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6)) : A ((2 <= BlockedTasks)) : A ((((cJobCnt <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) U (IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= P_1726)) U ((3 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6) U (3 <= P_1093)))) : A ((JobCnt <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4)) : A ((F (G ((P_1099 <= 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_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6))) U G (X ((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_2_4 + DisablePollingB_2_3 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_4_4 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6))))) : A (X (X ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6)))) : A (X (G (G (G ((1 <= P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)))))) : A (F (G (((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6))))) : A (F ((1 <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_4 + P_2579_1_3 + P_2579_1_2 + P_2579_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_4 + P_2579_1_3 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4) U (2 <= CanInjectEvent)))))
lola: processed formula: A (X (G (((AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_4 + P_2579_1_3 + P_2579_1_2 + P_2579_1... (shortened)
lola: processed formula length: 483
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= PollingAbort))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= PollingAbort))))
lola: processed formula: A (F (X ((2 <= PollingAbort))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((P_1726 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) U (AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((P_1726 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) U (AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4))))
lola: processed formula: A (F (((P_1726 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) U (AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4))))
lola: processed formula length: 230
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((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 + ScheduleT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((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 + 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))) U F ((3 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4))))
lola: processed formula: A ((G (F ((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 + ScheduleT... (shortened)
lola: processed formula length: 1167
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_4_5 + NotifyEventJobQueuedB_4_6 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_5_5 + NotifyEventJobQueuedB_5_6 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_6_5 + NotifyEventJobQueuedB_6_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6))))
lola: processed formula: A (F (G ((3 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB... (shortened)
lola: processed formula length: 1192
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6)
lola: processed formula length: 124
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (G ((3 <= P_1717))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= P_1717))))
lola: processed formula: A (F (G ((3 <= P_1717))))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6)
lola: processed formula length: 288
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= BlockedTasks))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= BlockedTasks)
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((cJobCnt <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) U (IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= P_1726)) U ((3 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6) U (3 <= P_1093))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cJobCnt <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) U (IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= P_1726)) U ((3 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6) U (3 <= P_1093))))
lola: processed formula: A ((((cJobCnt <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) U (IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= P_1726)) U ((3 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6) U (3 <= P_1093))))
lola: processed formula length: 319
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((JobCnt <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (JobCnt <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4)
lola: processed formula length: 73
lola: 1 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((P_1099 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((P_1099 <= 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_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6))) U G (X ((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_2_4 + DisablePollingB_2_3 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_4_4 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6)))))
lola: processed formula: A ((F (G ((P_1099 <= 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... (shortened)
lola: processed formula length: 1324
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6))))
lola: processed formula: A (X (X ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6))))
lola: processed formula length: 330
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (G ((1 <= P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (G (G ((1 <= P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1))))))
lola: processed formula: A (X (G (G (G ((1 <= P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1))))))
lola: processed formula length: 90
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= Abort_Check_Sources_B_1 + Abor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6)))))
lola: processed formula: A (F (G (((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= Abort_Check_Sources_B_1 + Abor... (shortened)
lola: processed formula length: 528
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6)))
lola: processed formula: A (F ((1 <= P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6)))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 618 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2260 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 12773 markings, 20684 edges, 2555 markings/sec, 0 secs
lola: 26048 markings, 44267 edges, 2655 markings/sec, 5 secs
lola: 39251 markings, 67604 edges, 2641 markings/sec, 10 secs
lola: 52363 markings, 91417 edges, 2622 markings/sec, 15 secs
lola: 65602 markings, 117754 edges, 2648 markings/sec, 20 secs
lola: 78928 markings, 140899 edges, 2665 markings/sec, 25 secs
lola: 92041 markings, 163555 edges, 2623 markings/sec, 30 secs
lola: 105025 markings, 190954 edges, 2597 markings/sec, 35 secs
lola: 118367 markings, 214385 edges, 2668 markings/sec, 40 secs
lola: 131732 markings, 241470 edges, 2673 markings/sec, 45 secs
lola: 144976 markings, 265106 edges, 2649 markings/sec, 50 secs
lola: 158357 markings, 292303 edges, 2676 markings/sec, 55 secs
lola: 171721 markings, 315480 edges, 2673 markings/sec, 60 secs
lola: 185101 markings, 339470 edges, 2676 markings/sec, 65 secs
lola: 198257 markings, 366519 edges, 2631 markings/sec, 70 secs
lola: 211042 markings, 389871 edges, 2557 markings/sec, 75 secs
lola: 223880 markings, 415189 edges, 2568 markings/sec, 80 secs
lola: 236544 markings, 441537 edges, 2533 markings/sec, 85 secs
lola: 249308 markings, 465033 edges, 2553 markings/sec, 90 secs
lola: 262124 markings, 491376 edges, 2563 markings/sec, 95 secs
lola: 275024 markings, 516923 edges, 2580 markings/sec, 100 secs
lola: 287848 markings, 543208 edges, 2565 markings/sec, 105 secs
lola: 300612 markings, 570037 edges, 2553 markings/sec, 110 secs
lola: 313504 markings, 601636 edges, 2578 markings/sec, 115 secs
lola: 326365 markings, 633522 edges, 2572 markings/sec, 120 secs
lola: 339218 markings, 656862 edges, 2571 markings/sec, 125 secs
lola: 352111 markings, 679184 edges, 2579 markings/sec, 130 secs
lola: 364943 markings, 701452 edges, 2566 markings/sec, 135 secs
lola: 377726 markings, 723164 edges, 2557 markings/sec, 140 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes no no yes no yes no no yes
lola: ========================================
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J06T06-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494709410594

--------------------
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="PolyORBLF-PT-S04J06T06"
export BK_EXAMINATION="LTLCardinality"
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/PolyORBLF-PT-S04J06T06.tgz
mv PolyORBLF-PT-S04J06T06 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 PolyORBLF-PT-S04J06T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-smll-149440870000482"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;