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 2.1M
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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 7.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K 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 15K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.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 1.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-PT-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260800399
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527427267395


BK_STOP 1527427790305

--------------------
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-S02J06T10 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 214761, 'Memory': 15933.73, 'Tool': 'lola'}, {'Time': 222963, 'Memory': 15940.76, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-PT-S02J06T10...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S02J06T10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-PT-S02J06T10 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2656/65536 symbol table entries, 18 collisions
lola: preprocessing...
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2543 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: A (F (G (((3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) U (2 <= P_1716))))) : A (G ((2 <= Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9))) : A (F ((2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10))) : A ((G (G ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1))) U G (G ((DataOnSrc_2 + DataOnSrc_1 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10))))) : A ((X (G ((P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9))) U F (X ((QueueJobE_10 + QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 <= cIsMonitoring))))) : A ((IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)) : A (G (F (G (G ((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1)))))) : A (F ((F ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10 <= 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_10_0 + NotifyEventJobQueuedB_10_1 + NotifyEventJobQueuedB_10_2 + NotifyEventJobQueuedB_10_3 + NotifyEventJobQueuedB_10_4 + NotifyEventJobQueuedB_10_5 + NotifyEventJobQueuedB_10_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_7_0 + NotifyEventJobQueuedB_7_1 + NotifyEventJobQueuedB_7_2 + NotifyEventJobQueuedB_7_3 + NotifyEventJobQueuedB_7_4 + NotifyEventJobQueuedB_7_5 + NotifyEventJobQueuedB_7_6 + NotifyEventJobQueuedB_8_0 + NotifyEventJobQueuedB_8_1 + NotifyEventJobQueuedB_8_2 + NotifyEventJobQueuedB_8_3 + NotifyEventJobQueuedB_8_4 + NotifyEventJobQueuedB_8_5 + NotifyEventJobQueuedB_8_6 + NotifyEventJobQueuedB_9_0 + NotifyEventJobQueuedB_9_1 + NotifyEventJobQueuedB_9_2 + NotifyEventJobQueuedB_9_3 + NotifyEventJobQueuedB_9_4 + NotifyEventJobQueuedB_9_5 + NotifyEventJobQueuedB_9_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6)) U F ((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10))))) : A (G ((NotifyEventJobQueuedB_5_3 <= FetchJobB_3))) : A (X ((NotifyEventJobQueuedE_9 <= NotifyEventJobCompletedE_2))) : A (X (G (((ScheduleTaskE_Work_6_1 <= P_1119_3_2) U (ScheduleTaskE_Work_5_5 <= Check_Sources_B_6))))) : A ((F (G ((NotifyEventJobQueuedB_5_2 <= P_1155_5))) U X ((QueueJobB_8_3 <= P_2321_1)))) : A ((EnablePollingE_10 <= AwakeTasks_4)) : A (G (X ((NotifyEventEndOfCheckSourcesE_9 <= ProcessingEvt_9)))) : A (X (G (F (F ((FetchJobB_1 <= RunE_10)))))) : A (G (X (G (F ((NotifyEventJobQueuedB_9_1 <= Idle_5))))))
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 (F (G (((3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) U (2 <= P_1716)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) U (2 <= P_1716)))))
lola: processed formula: A (F (G (((3 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10) U (2 <= P_1716)))))
lola: processed formula length: 145
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 405 markings, 406 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)))
lola: processed formula: A (F ((2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)))
lola: processed formula length: 123
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 73450 markings, 111675 edges, 14690 markings/sec, 0 secs
lola: 141611 markings, 222167 edges, 13632 markings/sec, 5 secs
lola: 212743 markings, 332208 edges, 14226 markings/sec, 10 secs
lola: 283723 markings, 441888 edges, 14196 markings/sec, 15 secs
lola: 350126 markings, 544141 edges, 13281 markings/sec, 20 secs
lola: 414916 markings, 645388 edges, 12958 markings/sec, 25 secs
lola: 481918 markings, 749257 edges, 13400 markings/sec, 30 secs
lola: 546962 markings, 850849 edges, 13009 markings/sec, 35 secs
lola: 618419 markings, 961567 edges, 14291 markings/sec, 40 secs
lola: 690937 markings, 1073777 edges, 14504 markings/sec, 45 secs
lola: 759008 markings, 1184263 edges, 13614 markings/sec, 50 secs
lola: 827715 markings, 1294207 edges, 13741 markings/sec, 55 secs
lola: 899552 markings, 1405235 edges, 14367 markings/sec, 60 secs
lola: 969714 markings, 1515750 edges, 14032 markings/sec, 65 secs
lola: 1033600 markings, 1619540 edges, 12777 markings/sec, 70 secs
lola: 1105867 markings, 1731455 edges, 14453 markings/sec, 75 secs
lola: 1175441 markings, 1842653 edges, 13915 markings/sec, 80 secs
lola: 1246725 markings, 1953601 edges, 14257 markings/sec, 85 secs
lola: 1318245 markings, 2064107 edges, 14304 markings/sec, 90 secs
lola: 1383736 markings, 2165747 edges, 13098 markings/sec, 95 secs
lola: 1447418 markings, 2264843 edges, 12736 markings/sec, 100 secs
lola: 1511047 markings, 2363965 edges, 12726 markings/sec, 105 secs
lola: 1575227 markings, 2463841 edges, 12836 markings/sec, 110 secs
lola: 1641605 markings, 2567675 edges, 13276 markings/sec, 115 secs
lola: 1708075 markings, 2675344 edges, 13294 markings/sec, 120 secs
lola: 1772711 markings, 2782712 edges, 12927 markings/sec, 125 secs
lola: 1837950 markings, 2889117 edges, 13048 markings/sec, 130 secs
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: 1857354 markings, 2921023 edges
lola: ========================================
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePoll... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1))) U G (G ((DataOnSrc_2 + DataOnSrc_1 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10)))))
lola: processed formula: A ((G (G ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 + P_1617_9 + P_1617_10 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePoll... (shortened)
lola: processed formula length: 797
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 629 markings, 629 edges
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9))) U F (X ((QueueJobE_10 + QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 <= cIsMonitoring)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9))) U F (X ((QueueJobE_10 + QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 <= cIsMonitoring)))))
lola: processed formula: A ((X (G ((P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10 <= nyo_10 + nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9))) U F (X ((QueueJobE_10 + QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 <= cIsMonitoring)))))
lola: processed formula length: 374
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 3 markings, 2 edges
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)
lola: processed formula length: 252
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: ========================================
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 6 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (G ((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + Dis... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1)))))
lola: processed formula: A (F (G (G ((1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_2_2 + Disabl... (shortened)
lola: processed formula length: 462
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 630 markings, 631 edges
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10 <= 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_10_0 + NotifyEventJobQueuedB_10_1 + NotifyEventJobQueuedB_10_2 + NotifyEventJobQueuedB_10_3 + NotifyEventJobQueuedB_10_4 + NotifyEventJobQueuedB_10_5 + NotifyEventJobQueuedB_10_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_7_0 + NotifyEventJobQueuedB_7_1 + NotifyEventJobQueuedB_7_2 + NotifyEventJobQueuedB_7_3 + NotifyEventJobQueuedB_7_4 + NotifyEventJobQueuedB_7_5 + NotifyEventJobQueuedB_7_6 + NotifyEventJobQueuedB_8_0 + NotifyEventJobQueuedB_8_1 + NotifyEventJobQueuedB_8_2 + NotifyEventJobQueuedB_8_3 + NotifyEventJobQueuedB_8_4 + NotifyEventJobQueuedB_8_5 + NotifyEventJobQueuedB_8_6 + NotifyEventJobQueuedB_9_0 + NotifyEventJobQueuedB_9_1 + NotifyEventJobQueuedB_9_2 + NotifyEventJobQueuedB_9_3 + NotifyEventJobQueuedB_9_4 + NotifyEventJobQueuedB_9_5 + NotifyEventJobQueuedB_9_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6)) U F ((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9 + EnablePollingE_10 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10)))))
lola: processed formula: A (F ((F ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_10 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2... (shortened)
lola: processed formula length: 2701
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventJobQueuedB_5_3 <= FetchJobB_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31314 markings, 35842 edges
lola: ========================================
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NotifyEventJobQueuedE_9 <= NotifyEventJobCompletedE_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NotifyEventJobQueuedE_9 <= NotifyEventJobCompletedE_2)))
lola: processed formula: A (X ((NotifyEventJobQueuedE_9 <= NotifyEventJobCompletedE_2)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((ScheduleTaskE_Work_6_1 <= P_1119_3_2) U (ScheduleTaskE_Work_5_5 <= Check_Sources_B_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((ScheduleTaskE_Work_6_1 <= P_1119_3_2) U (ScheduleTaskE_Work_5_5 <= Check_Sources_B_6)))))
lola: processed formula: A (X (G (((ScheduleTaskE_Work_6_1 <= P_1119_3_2) U (ScheduleTaskE_Work_5_5 <= Check_Sources_B_6)))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 588165 markings, 702754 edges, 117633 markings/sec, 0 secs
lola: 1163688 markings, 1437335 edges, 115105 markings/sec, 5 secs
lola: 1713353 markings, 2155153 edges, 109933 markings/sec, 10 secs
lola: 2243994 markings, 2854315 edges, 106128 markings/sec, 15 secs
lola: 2756382 markings, 3547510 edges, 102478 markings/sec, 20 secs
lola: 3260589 markings, 4233282 edges, 100841 markings/sec, 25 secs
lola: 3756962 markings, 4918639 edges, 99275 markings/sec, 30 secs
lola: 4250250 markings, 5599544 edges, 98658 markings/sec, 35 secs
lola: 4738277 markings, 6275533 edges, 97605 markings/sec, 40 secs
lola: 5219823 markings, 6950740 edges, 96309 markings/sec, 45 secs
lola: 5698080 markings, 7625971 edges, 95651 markings/sec, 50 secs
lola: 6169062 markings, 8304766 edges, 94196 markings/sec, 55 secs
lola: 6641395 markings, 8972059 edges, 94467 markings/sec, 60 secs
lola: 7106804 markings, 9644436 edges, 93082 markings/sec, 65 secs
lola: 7570275 markings, 10313816 edges, 92694 markings/sec, 70 secs
lola: 8035532 markings, 10979496 edges, 93051 markings/sec, 75 secs
lola: 8494007 markings, 11640898 edges, 91695 markings/sec, 80 secs
lola: 8946125 markings, 12305899 edges, 90424 markings/sec, 85 secs
lola: 9397079 markings, 12963714 edges, 90191 markings/sec, 90 secs
lola: 9833012 markings, 13604154 edges, 87187 markings/sec, 95 secs
lola: 10237155 markings, 14203750 edges, 80829 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 658 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((NotifyEventJobQueuedB_5_2 <= P_1155_5))) U X ((QueueJobB_8_3 <= P_2321_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((NotifyEventJobQueuedB_5_2 <= P_1155_5))) U X ((QueueJobB_8_3 <= P_2321_1))))
lola: processed formula: A ((F (G ((NotifyEventJobQueuedB_5_2 <= P_1155_5))) U X ((QueueJobB_8_3 <= P_2321_1))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 823 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((EnablePollingE_10 <= AwakeTasks_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (EnablePollingE_10 <= AwakeTasks_4)
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1097 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((NotifyEventEndOfCheckSourcesE_9 <= ProcessingEvt_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((NotifyEventEndOfCheckSourcesE_9 <= ProcessingEvt_9))))
lola: processed formula: A (G (X ((NotifyEventEndOfCheckSourcesE_9 <= ProcessingEvt_9))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 1583 markings, 1583 edges
lola: ========================================
lola: subprocess 14 will run for 1646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (F ((FetchJobB_1 <= RunE_10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((FetchJobB_1 <= RunE_10)))))
lola: processed formula: A (X (G (F ((FetchJobB_1 <= RunE_10)))))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 547263 markings, 653400 edges, 109453 markings/sec, 0 secs
lola: 1125109 markings, 1388379 edges, 115569 markings/sec, 5 secs
lola: 1680016 markings, 2110256 edges, 110981 markings/sec, 10 secs
lola: 2219935 markings, 2822360 edges, 107984 markings/sec, 15 secs
lola: 2743076 markings, 3528459 edges, 104628 markings/sec, 20 secs
lola: 3257213 markings, 4228638 edges, 102827 markings/sec, 25 secs
lola: 3762983 markings, 4926587 edges, 101154 markings/sec, 30 secs
lola: 4264846 markings, 5618556 edges, 100373 markings/sec, 35 secs
lola: 4744425 markings, 6283667 edges, 95916 markings/sec, 40 secs
lola: 5180795 markings, 6895005 edges, 87274 markings/sec, 45 secs
lola: 5633186 markings, 7533529 edges, 90478 markings/sec, 50 secs
lola: 6099065 markings, 8202160 edges, 93176 markings/sec, 55 secs
lola: 6557421 markings, 8852034 edges, 91671 markings/sec, 60 secs
lola: 7015797 markings, 9510945 edges, 91675 markings/sec, 65 secs
lola: 7475520 markings, 10175283 edges, 91945 markings/sec, 70 secs
lola: 7937330 markings, 10837704 edges, 92362 markings/sec, 75 secs
lola: 8394868 markings, 11495958 edges, 91508 markings/sec, 80 secs
lola: 8846455 markings, 12154933 edges, 90317 markings/sec, 85 secs
lola: 9294315 markings, 12810883 edges, 89572 markings/sec, 90 secs
lola: 9738667 markings, 13465063 edges, 88870 markings/sec, 95 secs
lola: 10180733 markings, 14114872 edges, 88413 markings/sec, 100 secs
lola: 10246530 markings, 14215940 edges, 13159 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3173 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (F ((NotifyEventJobQueuedB_9_1 <= Idle_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (F ((NotifyEventJobQueuedB_9_1 <= Idle_5))))))
lola: processed formula: A (G (X (G (F ((NotifyEventJobQueuedB_9_1 <= Idle_5))))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 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: 577953 markings, 690144 edges, 115591 markings/sec, 0 secs
lola: 1100283 markings, 1356419 edges, 104466 markings/sec, 5 secs
lola: 1644966 markings, 2058728 edges, 108937 markings/sec, 10 secs
lola: 2172254 markings, 2760676 edges, 105458 markings/sec, 15 secs
lola: 2663600 markings, 3420652 edges, 98269 markings/sec, 20 secs
lola: 3176290 markings, 4119305 edges, 102538 markings/sec, 25 secs
lola: 3680764 markings, 4813874 edges, 100895 markings/sec, 30 secs
lola: 4178847 markings, 5502585 edges, 99617 markings/sec, 35 secs
lola: 4673451 markings, 6184389 edges, 98921 markings/sec, 40 secs
lola: 5159644 markings, 6865961 edges, 97239 markings/sec, 45 secs
lola: 5641622 markings, 7546422 edges, 96396 markings/sec, 50 secs
lola: 6116897 markings, 8228302 edges, 95055 markings/sec, 55 secs
lola: 6592067 markings, 8901409 edges, 95034 markings/sec, 60 secs
lola: 7060914 markings, 9578182 edges, 93769 markings/sec, 65 secs
lola: 7527218 markings, 10251254 edges, 93261 markings/sec, 70 secs
lola: 7994472 markings, 10920303 edges, 93451 markings/sec, 75 secs
lola: 8450854 markings, 11578196 edges, 91276 markings/sec, 80 secs
lola: 8893461 markings, 12224881 edges, 88521 markings/sec, 85 secs
lola: 9335012 markings, 12872517 edges, 88310 markings/sec, 90 secs
lola: 9773198 markings, 13515720 edges, 87637 markings/sec, 95 secs
lola: 10207254 markings, 14158283 edges, 86811 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes no yes unknown yes yes no unknown unknown
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T10-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- 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-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 irma4mcc-full"
echo " Input is PolyORBLF-PT-S02J06T10, 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 r210-smll-152732260800399"
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 ;