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)
....................
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 239K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 732K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 825K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.6M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 19M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBLF-PT-S06J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-152673532900234
=====================================================================

--------------------
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-PT-S06J04T08-CTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T08-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526953987735


BK_STOP 1526954865769

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S06J04T08 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1656597, 'Memory': 15951.12, 'Tool': 'lola'}, {'Time': 1660186, 'Memory': 15950.56, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-PT-S06J04T08...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J04T08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-PT-S06J04T08 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 14824/65536 symbol table entries, 9110 collisions
lola: preprocessing...
lola: finding significant places
lola: 810 places, 14014 transitions, 752 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3639 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: E (F ((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 + 1 <= 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 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8))) : A (F ((1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8))) : E ((A (G ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 <= cIdleTasks))) U E (F ((2 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8))))) : (A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8))) AND E (F (((2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollingB_7_5 + DisablePollingB_7_6 + DisablePollingB_8_1 + DisablePollingB_8_2 + DisablePollingB_8_3 + DisablePollingB_8_4 + DisablePollingB_8_5 + DisablePollingB_8_6 + 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) AND (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + 1 <= 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))))) : ((((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)) OR (IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + 1 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4) OR ((1 <= 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 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8) AND (2 <= 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) AND ((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 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8) OR (1 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 + ModifiedSrc_5 + ModifiedSrc_6))) OR (P_1093 <= P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)) AND (E (G ((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 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 <= 2))) AND E (X (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8) OR (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))))) : E (F (E (G ((P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8 <= IsMonitoring))))) : E (G ((SigAbort <= 1))) : A (F ((cJobCnt <= P_1716))) : ((((P_1119_4_2 <= P_2318_4) OR ((FetchJobE_6_3 <= QueueJobB_2_4) AND (3 <= P_1119_6_5) AND (1 <= NotifyEventSourceAddedB_6))) AND A (F ((3 <= P_2318_6)))) OR (3 <= P_2318_5)) : E (X (NOT(E (G ((NotifyEventJobCompletedE_1 <= AwakeTasks_1)))))) : NOT(((A (X ((1 <= ScheduleTaskE_Idle_8))) OR (DisablePollingE_3_1 <= 1)) AND E (G (((3 <= P_1725_3) OR (DisablePollingE_8_1 <= NotifyEventJobQueuedB_2_3)))))) : E (G (E (G ((ProcessingEvt_3 <= P_1617_7))))) : E (F ((E (F ((3 <= Insert_Source_E_7))) AND ((QueueJobB_2_1 <= QueueJobB_4_3) AND (1 <= P_2579_4_6) AND (P_2579_4_6 <= Insert_Source_B_6_5))))) : E (G (((Insert_Source_B_8_4 <= DisablePollingE_3_5) OR (Abort_Check_Sources_B_4 <= QueueJobB_4_0)))) : NOT(A (F (E (G ((FetchJobE_4_3 <= P_2318_8)))))) : A (F ((2 <= NotifyEventEndOfCheckSourcesB_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: E (F ((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... (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 3008 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-PT-S06J04T08-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T08-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 86 markings, 85 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: processed formula: A (F ((1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8)))
lola: processed formula length: 244
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: 87 markings, 87 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8 <= cIdleTasks))) U E (F ((2 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (cIdleTasks + 1 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8))) U E(TRUE U (2 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_7 + FetchJobB_8)))
lola: processed formula length: 356
lola: 4 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 247444 markings, 608580 edges, 3689341722891911168 markings/sec, 0 secs
lola: 492629 markings, 1264809 edges, 49037 markings/sec, 5 secs
lola: 760919 markings, 1986500 edges, 53658 markings/sec, 10 secs
lola: 982836 markings, 2573256 edges, 44383 markings/sec, 15 secs
lola: 1212093 markings, 3175577 edges, 45851 markings/sec, 20 secs
lola: 1449753 markings, 3798197 edges, 47532 markings/sec, 25 secs
lola: 1677671 markings, 4392773 edges, 45584 markings/sec, 30 secs
lola: 1922780 markings, 5071474 edges, 49022 markings/sec, 35 secs
lola: 2151762 markings, 5707487 edges, 45796 markings/sec, 40 secs
lola: 2399252 markings, 6343726 edges, 49498 markings/sec, 45 secs
lola: 2645263 markings, 6995325 edges, 49202 markings/sec, 50 secs
lola: 2849929 markings, 7542439 edges, 40933 markings/sec, 55 secs
lola: 3070468 markings, 8168895 edges, 44108 markings/sec, 60 secs
lola: 3302761 markings, 8745753 edges, 46459 markings/sec, 65 secs
lola: 3521712 markings, 9342861 edges, 43790 markings/sec, 70 secs
lola: 3745897 markings, 9930548 edges, 44837 markings/sec, 75 secs
lola: 3969351 markings, 10536616 edges, 44691 markings/sec, 80 secs
lola: 4190186 markings, 11170249 edges, 44167 markings/sec, 85 secs
lola: 4396818 markings, 11802038 edges, 41326 markings/sec, 90 secs
lola: 4613143 markings, 12467222 edges, 43265 markings/sec, 95 secs
lola: 4821159 markings, 13103393 edges, 41603 markings/sec, 100 secs
lola: 5046618 markings, 13697194 edges, 45092 markings/sec, 105 secs
lola: 5262583 markings, 14315470 edges, 43193 markings/sec, 110 secs
lola: 5480686 markings, 14917356 edges, 43621 markings/sec, 115 secs
lola: 5724234 markings, 15617116 edges, 48710 markings/sec, 120 secs
lola: 5939969 markings, 16277500 edges, 43147 markings/sec, 125 secs
lola: 6160765 markings, 16888335 edges, 44159 markings/sec, 130 secs
lola: 6381780 markings, 17523596 edges, 44203 markings/sec, 135 secs
lola: 6570849 markings, 18146282 edges, 37814 markings/sec, 140 secs
lola: 6797783 markings, 18813028 edges, 45387 markings/sec, 145 secs
lola: 6986266 markings, 19445957 edges, 37697 markings/sec, 150 secs
lola: 7206909 markings, 20030482 edges, 44129 markings/sec, 155 secs
lola: 7430910 markings, 20646542 edges, 44800 markings/sec, 160 secs
lola: 7623799 markings, 21310246 edges, 38578 markings/sec, 165 secs
lola: 7841151 markings, 21935248 edges, 43470 markings/sec, 170 secs
lola: 8038242 markings, 22551189 edges, 39418 markings/sec, 175 secs
lola: 8243119 markings, 23114820 edges, 40975 markings/sec, 180 secs
lola: 8459489 markings, 23700154 edges, 43274 markings/sec, 185 secs
lola: 8643786 markings, 24332231 edges, 36859 markings/sec, 190 secs
lola: 8866665 markings, 24953408 edges, 44576 markings/sec, 195 secs
lola: 9095654 markings, 25548043 edges, 45798 markings/sec, 200 secs
lola: 9303014 markings, 26147711 edges, 41472 markings/sec, 205 secs
lola: 9496649 markings, 26763782 edges, 38727 markings/sec, 210 secs
lola: 9678986 markings, 27391912 edges, 36467 markings/sec, 215 secs
lola: 9877079 markings, 28020550 edges, 39619 markings/sec, 220 secs
lola: 10063382 markings, 28659771 edges, 37261 markings/sec, 225 secs
lola: 10244832 markings, 29307518 edges, 36290 markings/sec, 230 secs
lola: 10424868 markings, 29951547 edges, 36007 markings/sec, 235 secs
lola: 10620268 markings, 30591671 edges, 39080 markings/sec, 240 secs
lola: 10836427 markings, 31181808 edges, 43232 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8))) AND E (F (((2 <= DisablePollingB_5_1 + DisablePollingB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)))
lola: processed formula: A (X ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + ScheduleTaskE_Check_7 + ScheduleTaskE_Check_8)))
lola: processed formula length: 344
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_7_1 + DisablePollingB_7_2 + DisablePollingB_7_3 + DisablePollingB_7_4 + DisablePollin... (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 3008 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-PT-S06J04T08-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T08-CTLCardinality-4.sara.
lola: sara is running 0 secs || 3393 markings, 11746 edges, 679 markings/sec, 0 secs
lola: sara is running 5 secs || 6856 markings, 24229 edges, 693 markings/sec, 5 secs
lola: sara is running 10 secs || 10316 markings, 36717 edges, 692 markings/sec, 10 secs
lola: sara is running 15 secs || 13729 markings, 49105 edges, 683 markings/sec, 15 secs
lola: sara is running 20 secs || 17146 markings, 61459 edges, 683 markings/sec, 20 secs
lola: sara is running 25 secs || 20559 markings, 73757 edges, 683 markings/sec, 25 secs
lola: sara is running 30 secs || 23955 markings, 85999 edges, 679 markings/sec, 30 secs
lola: sara is running 35 secs || 27366 markings, 98360 edges, 682 markings/sec, 35 secs
lola: sara is running 40 secs || 30789 markings, 110746 edges, 685 markings/sec, 40 secs
lola: sara is running 45 secs || 34175 markings, 122956 edges, 677 markings/sec, 45 secs
lola: sara is running 50 secs || 37600 markings, 135353 edges, 685 markings/sec, 50 secs
lola: sara is running 55 secs || 40993 markings, 147593 edges, 679 markings/sec, 55 secs
lola: sara is running 60 secs || 44288 markings, 159511 edges, 659 markings/sec, 60 secs
lola: sara is running 65 secs || 47567 markings, 171316 edges, 656 markings/sec, 65 secs
lola: sara is running 70 secs || 50925 markings, 183468 edges, 672 markings/sec, 70 secs
lola: sara is running 75 secs || 54143 markings, 195166 edges, 644 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 57639 markings, 207347 edges, 699 markings/sec, 80 secs
lola: sara is running 85 secs || 61109 markings, 219767 edges, 694 markings/sec, 85 secs
lola: sara is running 90 secs || 64560 markings, 232119 edges, 690 markings/sec, 90 secs
lola: sara is running 95 secs || 68030 markings, 244518 edges, 694 markings/sec, 95 secs
lola: sara is running 100 secs || 71494 markings, 256945 edges, 693 markings/sec, 100 secs
lola: sara is running 105 secs || 74963 markings, 269447 edges, 694 markings/sec, 105 secs
lola: sara is running 110 secs || 78301 markings, 281492 edges, 668 markings/sec, 110 secs
lola: sara is running 115 secs || 81535 markings, 293267 edges, 647 markings/sec, 115 secs
lola: sara is running 120 secs || 84769 markings, 305083 edges, 647 markings/sec, 120 secs
lola: sara is running 125 secs || 88003 markings, 316809 edges, 647 markings/sec, 125 secs
lola: sara is running 130 secs || 91236 markings, 328504 edges, 647 markings/sec, 130 secs
lola: sara is running 135 secs || 94469 markings, 340383 edges, 647 markings/sec, 135 secs
lola: sara is running 140 secs || 97702 markings, 352284 edges, 647 markings/sec, 140 secs
lola: sara is running 145 secs || 100922 markings, 363912 edges, 644 markings/sec, 145 secs
lola: sara is running 150 secs || 104135 markings, 375396 edges, 643 markings/sec, 150 secs
lola: sara is running 155 secs || 107342 markings, 386892 edges, 641 markings/sec, 155 secs
lola: sara is running 160 secs || 110548 markings, 398348 edges, 641 markings/sec, 160 secs
lola: sara is running 165 secs || 113781 markings, 409926 edges, 647 markings/sec, 165 secs
lola: sara is running 170 secs || 117188 markings, 422176 edges, 681 markings/sec, 170 secs
lola: sara is running 175 secs || 120631 markings, 434573 edges, 689 markings/sec, 175 secs
lola: sara is running 180 secs || 124090 markings, 447140 edges, 692 markings/sec, 180 secs
lola: sara is running 185 secs || 127547 markings, 459743 edges, 691 markings/sec, 185 secs
lola: sara is running 190 secs || 131005 markings, 472340 edges, 692 markings/sec, 190 secs
lola: sara is running 195 secs || 134461 markings, 484832 edges, 691 markings/sec, 195 secs
lola: sara is running 200 secs || 137918 markings, 497486 edges, 691 markings/sec, 200 secs
lola: sara is running 205 secs || 141375 markings, 510239 edges, 691 markings/sec, 205 secs
lola: sara is running 210 secs || 144845 markings, 522757 edges, 694 markings/sec, 210 secs
lola: sara is running 215 secs || 148325 markings, 535206 edges, 696 markings/sec, 215 secs
lola: sara is running 220 secs || 151708 markings, 547322 edges, 677 markings/sec, 220 secs
lola: sara is running 225 secs || 155155 markings, 559634 edges, 689 markings/sec, 225 secs
lola: sara is running 230 secs || 158596 markings, 571974 edges, 688 markings/sec, 230 secs
lola: sara is running 235 secs || 162038 markings, 584383 edges, 688 markings/sec, 235 secs
lola: sara is running 240 secs || 165479 markings, 596785 edges, 688 markings/sec, 240 secs
lola: sara is running 245 secs || 168926 markings, 609334 edges, 689 markings/sec, 245 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 4 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)) OR (IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTas... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)) OR (IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTask... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8) AND (3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8)) OR (IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTask... (shortened)
lola: processed formula length: 2348
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: processed formula with 8 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((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 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= 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 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8)))
lola: processed formula length: 227
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 61 markings, 60 edges
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8) OR (AbourtToModifySrc_1 + AbourtToModif... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8) OR (AbourtToModifySrc_1 + AbourtToModifySr... (shortened)
lola: processed formula length: 727
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8 <= IsMonitoring)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (IsMonitoring + 1 <= P_1113_7 + P_1113_6 + P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_8))))
lola: processed formula length: 132
lola: 3 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 62 markings, 62 edges
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SigAbort <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= SigAbort)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 61 markings, 60 edges
lola: ========================================
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((cJobCnt <= P_1716)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((cJobCnt <= P_1716)))
lola: processed formula: A (F ((cJobCnt <= P_1716)))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: 101 markings, 101 edges
lola: ========================================
lola: subprocess 8 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((P_1119_4_2 <= P_2318_4) OR ((FetchJobE_6_3 <= QueueJobB_2_4) AND (3 <= P_1119_6_5) AND (1 <= NotifyEventSourceAddedB_6))) AND A (F ((3 <= P_2318_6)))) OR (3 <= P_2318_5))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P_1119_4_2 <= P_2318_4) OR ((FetchJobE_6_3 <= QueueJobB_2_4) AND (3 <= P_1119_6_5) AND (1 <= NotifyEventSourceAddedB_6)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P_1119_4_2 <= P_2318_4) OR ((FetchJobE_6_3 <= QueueJobB_2_4) AND (3 <= P_1119_6_5) AND (1 <= NotifyEventSourceAddedB_6)))
lola: processed formula length: 124
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: processed formula with 4 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= P_2318_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= P_2318_6)))
lola: processed formula: A (F ((3 <= P_2318_6)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: 101 markings, 101 edges
lola: ========================================
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= P_2318_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P_2318_5)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (G ((NotifyEventJobCompletedE_1 <= AwakeTasks_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (AwakeTasks_1 + 1 <= NotifyEventJobCompletedE_1)))
lola: processed formula length: 62
lola: 5 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 294 markings, 293 edges
lola: ========================================
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (X ((1 <= ScheduleTaskE_Idle_8))) OR (DisablePollingE_3_1 <= 1)) AND E (G (((3 <= P_1725_3) OR (DisablePollingE_8_1 <= NotifyEventJobQueuedB_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((ScheduleTaskE_Idle_8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((ScheduleTaskE_Idle_8 <= 0))
lola: processed formula length: 31
lola: 10 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= DisablePollingE_3_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= DisablePollingE_3_1)
lola: processed formula length: 26
lola: 9 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((P_1725_3 <= 2) AND (NotifyEventJobQueuedB_2_3 + 1 <= DisablePollingE_8_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((P_1725_3 <= 2) AND (NotifyEventJobQueuedB_2_3 + 1 <= DisablePollingE_8_1))))
lola: processed formula: A (F (((P_1725_3 <= 2) AND (NotifyEventJobQueuedB_2_3 + 1 <= DisablePollingE_8_1))))
lola: processed formula length: 84
lola: 9 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: 101 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((ProcessingEvt_3 <= P_1617_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (P_1617_7 + 1 <= ProcessingEvt_3))))
lola: processed formula length: 58
lola: 4 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 61 markings, 181 edges
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((3 <= Insert_Source_E_7))) AND ((QueueJobB_2_1 <= QueueJobB_4_3) AND (1 <= P_2579_4_6) AND (P_2579_4_6 <= Insert_Source_B_6_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U (3 <= Insert_Source_E_7)) AND ((QueueJobB_2_1 <= QueueJobB_4_3) AND (1 <= P_2579_4_6) AND (P_2579_4_6 <= Insert_Source_B_6_5))))
lola: processed formula length: 147
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 273811 markings, 674042 edges, 54762 markings/sec, 0 secs
lola: 513702 markings, 1334612 edges, 47978 markings/sec, 5 secs
lola: 805181 markings, 2102591 edges, 58296 markings/sec, 10 secs
lola: 1053336 markings, 2759491 edges, 49631 markings/sec, 15 secs
lola: 1304935 markings, 3419534 edges, 50320 markings/sec, 20 secs
lola: 1559314 markings, 4093703 edges, 50876 markings/sec, 25 secs
lola: 1826535 markings, 4798226 edges, 53444 markings/sec, 30 secs
lola: 2067018 markings, 5463135 edges, 48097 markings/sec, 35 secs
lola: 2315365 markings, 6127048 edges, 49669 markings/sec, 40 secs
lola: 2578134 markings, 6815202 edges, 52554 markings/sec, 45 secs
lola: 2829067 markings, 7488140 edges, 50187 markings/sec, 50 secs
lola: 3065127 markings, 8156891 edges, 47212 markings/sec, 55 secs
lola: 3318659 markings, 8794516 edges, 50706 markings/sec, 60 secs
lola: 3574059 markings, 9484246 edges, 51080 markings/sec, 65 secs
lola: 3829006 markings, 10157965 edges, 50989 markings/sec, 70 secs
lola: 4078914 markings, 10847433 edges, 49982 markings/sec, 75 secs
lola: 4290074 markings, 11487354 edges, 42232 markings/sec, 80 secs
lola: 4501204 markings, 12151450 edges, 42226 markings/sec, 85 secs
lola: 4735164 markings, 12836353 edges, 46792 markings/sec, 90 secs
lola: 4966604 markings, 13496806 edges, 46288 markings/sec, 95 secs
lola: 5199418 markings, 14148500 edges, 46563 markings/sec, 100 secs
lola: 5445812 markings, 14814825 edges, 49279 markings/sec, 105 secs
lola: 5696575 markings, 15551530 edges, 50153 markings/sec, 110 secs
lola: 5919464 markings, 16218712 edges, 44578 markings/sec, 115 secs
lola: 6155034 markings, 16878134 edges, 47114 markings/sec, 120 secs
lola: 6389364 markings, 17554628 edges, 46866 markings/sec, 125 secs
lola: 6581784 markings, 18185570 edges, 38484 markings/sec, 130 secs
lola: 6812551 markings, 18873081 edges, 46153 markings/sec, 135 secs
lola: 7011346 markings, 19517284 edges, 39759 markings/sec, 140 secs
lola: 7264317 markings, 20186419 edges, 50594 markings/sec, 145 secs
lola: 7485489 markings, 20844645 edges, 44234 markings/sec, 150 secs
lola: 7691861 markings, 21511838 edges, 41274 markings/sec, 155 secs
lola: 7895670 markings, 22124345 edges, 40762 markings/sec, 160 secs
lola: 8102611 markings, 22734534 edges, 41388 markings/sec, 165 secs
lola: 8317500 markings, 23328910 edges, 42978 markings/sec, 170 secs
lola: 8543615 markings, 23971752 edges, 45223 markings/sec, 175 secs
lola: 8736260 markings, 24601198 edges, 38529 markings/sec, 180 secs
lola: 8977055 markings, 25247880 edges, 48159 markings/sec, 185 secs
lola: 9216209 markings, 25877906 edges, 47831 markings/sec, 190 secs
lola: 9415908 markings, 26502121 edges, 39940 markings/sec, 195 secs
lola: 9602313 markings, 27124666 edges, 37281 markings/sec, 200 secs
lola: 9795113 markings, 27755820 edges, 38560 markings/sec, 205 secs
lola: 9982517 markings, 28386770 edges, 37481 markings/sec, 210 secs
lola: 10165226 markings, 29029082 edges, 36542 markings/sec, 215 secs
lola: 10348366 markings, 29680445 edges, 36628 markings/sec, 220 secs
lola: 10526059 markings, 30324592 edges, 35539 markings/sec, 225 secs
lola: 10754099 markings, 30958974 edges, 45608 markings/sec, 230 secs
lola: 10966030 markings, 31571747 edges, 42386 markings/sec, 235 secs
lola: 11174435 markings, 32216147 edges, 41681 markings/sec, 240 secs
lola: 11370444 markings, 32854640 edges, 39202 markings/sec, 245 secs
lola: 11545593 markings, 33482268 edges, 35030 markings/sec, 250 secs
lola: 11718980 markings, 34113289 edges, 34677 markings/sec, 255 secs
lola: 11892146 markings, 34747349 edges, 34633 markings/sec, 260 secs
lola: 12084158 markings, 35362261 edges, 38402 markings/sec, 265 secs
lola: 12272804 markings, 35982649 edges, 37729 markings/sec, 270 secs
lola: 12487258 markings, 36604991 edges, 42891 markings/sec, 275 secs
lola: 12692410 markings, 37215692 edges, 41030 markings/sec, 280 secs
lola: 12897313 markings, 37849803 edges, 40981 markings/sec, 285 secs
lola: 13071323 markings, 38483101 edges, 34802 markings/sec, 290 secs
lola: 13273683 markings, 39099171 edges, 40472 markings/sec, 295 secs
lola: 13488209 markings, 39683726 edges, 42905 markings/sec, 300 secs
lola: 13709883 markings, 40291461 edges, 44335 markings/sec, 305 secs
lola: 13931980 markings, 40929176 edges, 44419 markings/sec, 310 secs
lola: 14149894 markings, 41579011 edges, 43583 markings/sec, 315 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 902 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((Insert_Source_B_8_4 <= DisablePollingE_3_5) OR (Abort_Check_Sources_B_4 <= QueueJobB_4_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((DisablePollingE_3_5 + 1 <= Insert_Source_B_8_4) AND (QueueJobB_4_0 + 1 <= Abort_Check_Sources_B_4))))
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 61 markings, 60 edges
lola: ========================================
lola: subprocess 14 will run for 1353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (G ((FetchJobE_4_3 <= P_2318_8))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (P_2318_8 + 1 <= FetchJobE_4_3)))))
lola: processed formula length: 61
lola: 7 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 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: 61 markings, 61 edges
lola: ========================================
lola: subprocess 15 will run for 2707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= NotifyEventEndOfCheckSourcesB_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= NotifyEventEndOfCheckSourcesB_6)))
lola: processed formula: A (F ((2 <= NotifyEventEndOfCheckSourcesB_6)))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: 101 markings, 101 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown unknown yes yes yes no no no no yes unknown yes no no
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T08-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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-S06J04T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-S06J04T08.tgz
mv PolyORBLF-PT-S06J04T08 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is PolyORBLF-PT-S06J04T08, 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 r130-smll-152673532900234"
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 ;