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 368K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 196K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Raft-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583700158
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527955217002


BK_STOP 1527956193930

--------------------
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 Raft-PT-09 as instance name.
Using Raft as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 4168, 'Memory': 327.59, 'Tool': 'itstools'}, {'Time': 4286, 'Memory': 295.05, 'Tool': 'itstools'}, {'Time': 323001, 'Memory': 4361.39, 'Tool': 'marcie'}, {'Time': 346213, 'Memory': 4361.76, 'Tool': 'marcie'}, {'Time': 3151231, 'Memory': 15949.09, 'Tool': 'lola'}, {'Time': 3165764, 'Memory': 15952.6, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 756.0535028790787x far from the best tool itstools.
CTLFireability lola Raft-PT-09...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Raft-PT-09: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ Raft-PT-09 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1123/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 413 places, 710 transitions, 332 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-09-CTLFireability.task
lola: (A (G (A (X (NOT FIREABLE(t27))))) OR FIREABLE(t278)) : E (X (E (X (A (G (FIREABLE(t571))))))) : ((FIREABLE(t683) OR A (G ((FIREABLE(t672) OR FIREABLE(t322) OR NOT FIREABLE(t582))))) OR E (X ((FIREABLE(t410) AND FIREABLE(t212))))) : (FIREABLE(t666) OR E (F ((FIREABLE(t204) AND FIREABLE(t699))))) : E (F (E (G (FIREABLE(t690))))) : E ((NOT(A (F (FIREABLE(t326)))) U ((FIREABLE(t433) OR NOT FIREABLE(t531)) AND FIREABLE(t86)))) : E (F (FIREABLE(t50))) : NOT((E (F (A (X (FIREABLE(t26))))) AND ((E (G (FIREABLE(t410))) OR E (X (FIREABLE(t116)))) OR (FIREABLE(t622) OR FIREABLE(t506) OR NOT FIREABLE(t355) OR FIREABLE(t420))))) : A (G (((FIREABLE(t188) OR FIREABLE(t239)) OR (A (X (FIREABLE(t605))) AND E (F (FIREABLE(t408))))))) : A ((A ((FIREABLE(t231) U FIREABLE(t302))) U E (F ((FIREABLE(t43) AND FIREABLE(t294)))))) : (A (G (FIREABLE(t656))) OR (E (F (E (X (FIREABLE(t15))))) AND ((FIREABLE(t368) AND NOT FIREABLE(t394)) OR (E (F (FIREABLE(t215))) OR (FIREABLE(t332) OR (FIREABLE(t353) AND FIREABLE(t665))))))) : NOT(E (X (A (F ((FIREABLE(t575) OR FIREABLE(t686))))))) : (A (G (FIREABLE(t538))) AND FIREABLE(t600)) : (((NOT(A (F (FIREABLE(t621)))) OR ((FIREABLE(t622) OR FIREABLE(t147) OR NOT FIREABLE(t595)) OR A (G (FIREABLE(t40))))) AND (FIREABLE(t340) OR FIREABLE(t304) OR FIREABLE(t225) OR FIREABLE(t610))) OR FIREABLE(t384)) : ((((FIREABLE(t290) AND (NOT FIREABLE(t413) OR NOT FIREABLE(t641))) AND E (G (FIREABLE(t284)))) OR A (F ((FIREABLE(t395) AND FIREABLE(t413) AND NOT FIREABLE(t80))))) AND ((NOT FIREABLE(t148) AND NOT FIREABLE(t231) AND FIREABLE(t43) AND FIREABLE(t672) AND FIREABLE(t342)) AND (FIREABLE(t425) OR (FIREABLE(t489) OR E (G (FIREABLE(t660))))))) : (E (X ((((FIREABLE(t238) AND FIREABLE(t17)) OR (FIREABLE(t524) AND FIREABLE(t9))) AND A (G (FIREABLE(t614)))))) AND (FIREABLE(t142) OR FIREABLE(t168)))
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 (G (A (X (NOT FIREABLE(t27))))) OR FIREABLE(t278))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X (NOT FIREABLE(t27)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX(NOT FIREABLE(t27)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 33 markings, 38 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t278)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t278)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: processed formula with 0 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (A (G (FIREABLE(t571)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX(NOT(E(TRUE U NOT FIREABLE(t571)))))
lola: processed formula length: 41
lola: 4 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 304 markings, 350 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t683) OR A (G ((FIREABLE(t672) OR FIREABLE(t322) OR NOT FIREABLE(t582))))) OR E (X ((FIREABLE(t410) AND FIREABLE(t212)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t683)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t683)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: processed formula with 0 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t672) OR FIREABLE(t322) OR NOT FIREABLE(t582))))
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 44 bytes per marking, with 20 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: 11 markings, 42 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(t410) AND FIREABLE(t212))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(t410) AND FIREABLE(t212)))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t666) OR E (F ((FIREABLE(t204) AND FIREABLE(t699)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t666)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t666)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: processed formula with 0 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t204) AND FIREABLE(t699))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(t690)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U NOT FIREABLE(t690))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 585730 markings, 1641999 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1160865 markings, 3255462 edges, 115027 markings/sec, 5 secs
lola: 1720040 markings, 4825537 edges, 111835 markings/sec, 10 secs
lola: 2282147 markings, 6400554 edges, 112421 markings/sec, 15 secs
lola: 2832968 markings, 7945586 edges, 110164 markings/sec, 20 secs
lola: 3375204 markings, 9466229 edges, 108447 markings/sec, 25 secs
lola: 3911876 markings, 10973868 edges, 107334 markings/sec, 30 secs
lola: 4421411 markings, 12403943 edges, 101907 markings/sec, 35 secs
lola: 4944017 markings, 13869645 edges, 104521 markings/sec, 40 secs
lola: 5480050 markings, 15376454 edges, 107207 markings/sec, 45 secs
lola: 6002900 markings, 16847562 edges, 104570 markings/sec, 50 secs
lola: 6524404 markings, 18315086 edges, 104301 markings/sec, 55 secs
lola: 7049218 markings, 19793813 edges, 104963 markings/sec, 60 secs
lola: 7552405 markings, 21211416 edges, 100637 markings/sec, 65 secs
lola: 8059784 markings, 22639136 edges, 101476 markings/sec, 70 secs
lola: 8570525 markings, 24076102 edges, 102148 markings/sec, 75 secs
lola: 9120954 markings, 25618189 edges, 110086 markings/sec, 80 secs
lola: 9622593 markings, 27023534 edges, 100328 markings/sec, 85 secs
lola: 10120603 markings, 28421580 edges, 99602 markings/sec, 90 secs
lola: 10637704 markings, 29881569 edges, 103420 markings/sec, 95 secs
lola: 11197280 markings, 31453450 edges, 111915 markings/sec, 100 secs
lola: 11760268 markings, 33032294 edges, 112598 markings/sec, 105 secs
lola: 12313077 markings, 34583126 edges, 110562 markings/sec, 110 secs
lola: 12853654 markings, 36100436 edges, 108115 markings/sec, 115 secs
lola: 13401624 markings, 37638385 edges, 109594 markings/sec, 120 secs
lola: 13982678 markings, 39267398 edges, 116211 markings/sec, 125 secs
lola: 14551349 markings, 40860263 edges, 113734 markings/sec, 130 secs
lola: 15103092 markings, 42408848 edges, 110349 markings/sec, 135 secs
lola: 15633701 markings, 43895396 edges, 106122 markings/sec, 140 secs
lola: 16166263 markings, 45390953 edges, 106512 markings/sec, 145 secs
lola: 16707581 markings, 46909047 edges, 108264 markings/sec, 150 secs
lola: 17266798 markings, 48476766 edges, 111843 markings/sec, 155 secs
lola: 17820528 markings, 50031844 edges, 110746 markings/sec, 160 secs
lola: 18364927 markings, 51562919 edges, 108880 markings/sec, 165 secs
lola: 18897278 markings, 53060663 edges, 106470 markings/sec, 170 secs
lola: 19428973 markings, 54550426 edges, 106339 markings/sec, 175 secs
lola: 19956472 markings, 56031577 edges, 105500 markings/sec, 180 secs
lola: 20489665 markings, 57530197 edges, 106639 markings/sec, 185 secs
lola: 21021573 markings, 59025570 edges, 106382 markings/sec, 190 secs
lola: 21545303 markings, 60498381 edges, 104746 markings/sec, 195 secs
lola: 22069873 markings, 61975270 edges, 104914 markings/sec, 200 secs
lola: 22592730 markings, 63448624 edges, 104571 markings/sec, 205 secs
lola: 23113055 markings, 64913227 edges, 104065 markings/sec, 210 secs
lola: 23684284 markings, 66514124 edges, 114246 markings/sec, 215 secs
lola: 24235432 markings, 68059205 edges, 110230 markings/sec, 220 secs
lola: 24787906 markings, 69608237 edges, 110495 markings/sec, 225 secs
lola: 25328509 markings, 71126038 edges, 108121 markings/sec, 230 secs
lola: 25856684 markings, 72608400 edges, 105635 markings/sec, 235 secs
lola: 26382203 markings, 74080580 edges, 105104 markings/sec, 240 secs
lola: 26902884 markings, 75539433 edges, 104136 markings/sec, 245 secs
lola: 27422412 markings, 76995719 edges, 103906 markings/sec, 250 secs
lola: 27947681 markings, 78470848 edges, 105054 markings/sec, 255 secs
lola: 28469458 markings, 79935778 edges, 104355 markings/sec, 260 secs
lola: 28981286 markings, 81374031 edges, 102366 markings/sec, 265 secs
lola: 29497377 markings, 82824411 edges, 103218 markings/sec, 270 secs
lola: 30011382 markings, 84270373 edges, 102801 markings/sec, 275 secs
lola: 30527777 markings, 85725359 edges, 103279 markings/sec, 280 secs
lola: 31035761 markings, 87157067 edges, 101597 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT(A (F (FIREABLE(t326)))) U ((FIREABLE(t433) OR NOT FIREABLE(t531)) AND FIREABLE(t86))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U FIREABLE(t326))) U ((FIREABLE(t433) OR NOT FIREABLE(t531)) AND FIREABLE(t86)))
lola: processed formula length: 94
lola: 6 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 391259 markings, 1487825 edges, 3689329903141912576 markings/sec, 0 secs
lola: 776797 markings, 2953935 edges, 77108 markings/sec, 5 secs
lola: 1157283 markings, 4402712 edges, 76097 markings/sec, 10 secs
lola: 1531919 markings, 5827748 edges, 74927 markings/sec, 15 secs
lola: 1905074 markings, 7249614 edges, 74631 markings/sec, 20 secs
lola: 2280822 markings, 8677653 edges, 75150 markings/sec, 25 secs
lola: 2652514 markings, 10092193 edges, 74338 markings/sec, 30 secs
lola: 3023832 markings, 11504635 edges, 74264 markings/sec, 35 secs
lola: 3390541 markings, 12899943 edges, 73342 markings/sec, 40 secs
lola: 3754866 markings, 14287698 edges, 72865 markings/sec, 45 secs
lola: 4116593 markings, 15665411 edges, 72345 markings/sec, 50 secs
lola: 4469985 markings, 17010400 edges, 70678 markings/sec, 55 secs
lola: 4828243 markings, 18372691 edges, 71652 markings/sec, 60 secs
lola: 5187441 markings, 19740489 edges, 71840 markings/sec, 65 secs
lola: 5552235 markings, 21131268 edges, 72959 markings/sec, 70 secs
lola: 5905506 markings, 22478724 edges, 70654 markings/sec, 75 secs
lola: 6260691 markings, 23833664 edges, 71037 markings/sec, 80 secs
lola: 6612808 markings, 25177321 edges, 70423 markings/sec, 85 secs
lola: 6971396 markings, 26545128 edges, 71718 markings/sec, 90 secs
lola: 7318866 markings, 27873340 edges, 69494 markings/sec, 95 secs
lola: 7672995 markings, 29223710 edges, 70826 markings/sec, 100 secs
lola: 8019461 markings, 30544771 edges, 69293 markings/sec, 105 secs
lola: 8369607 markings, 31879531 edges, 70029 markings/sec, 110 secs
lola: 8731048 markings, 33257233 edges, 72288 markings/sec, 115 secs
lola: 9095071 markings, 34640704 edges, 72805 markings/sec, 120 secs
lola: 9436176 markings, 35938447 edges, 68221 markings/sec, 125 secs
lola: 9779083 markings, 37241041 edges, 68581 markings/sec, 130 secs
lola: 10120747 markings, 38542724 edges, 68333 markings/sec, 135 secs
lola: 10477022 markings, 39903813 edges, 71255 markings/sec, 140 secs
lola: 10828534 markings, 41249063 edges, 70302 markings/sec, 145 secs
lola: 11217211 markings, 42726208 edges, 77735 markings/sec, 150 secs
lola: 11594750 markings, 44162564 edges, 75508 markings/sec, 155 secs
lola: 11971262 markings, 45594614 edges, 75302 markings/sec, 160 secs
lola: 12341266 markings, 47003558 edges, 74001 markings/sec, 165 secs
lola: 12708981 markings, 48404040 edges, 73543 markings/sec, 170 secs
lola: 13070414 markings, 49779097 edges, 72287 markings/sec, 175 secs
lola: 13446771 markings, 51211555 edges, 75271 markings/sec, 180 secs
lola: 13831912 markings, 52677358 edges, 77028 markings/sec, 185 secs
lola: 14215978 markings, 54137276 edges, 76813 markings/sec, 190 secs
lola: 14593970 markings, 55573735 edges, 75598 markings/sec, 195 secs
lola: 14965423 markings, 56987466 edges, 74291 markings/sec, 200 secs
lola: 15328102 markings, 58367150 edges, 72536 markings/sec, 205 secs
lola: 15688782 markings, 59738579 edges, 72136 markings/sec, 210 secs
lola: 16050632 markings, 61116365 edges, 72370 markings/sec, 215 secs
lola: 16408723 markings, 62480543 edges, 71618 markings/sec, 220 secs
lola: 16776891 markings, 63880097 edges, 73634 markings/sec, 225 secs
lola: 17150811 markings, 65302211 edges, 74784 markings/sec, 230 secs
lola: 17522874 markings, 66717987 edges, 74413 markings/sec, 235 secs
lola: 17891819 markings, 68123914 edges, 73789 markings/sec, 240 secs
lola: 18255372 markings, 69509062 edges, 72711 markings/sec, 245 secs
lola: 18617260 markings, 70890484 edges, 72378 markings/sec, 250 secs
lola: 18974520 markings, 72251157 edges, 71452 markings/sec, 255 secs
lola: 19333542 markings, 73616729 edges, 71804 markings/sec, 260 secs
lola: 19689866 markings, 74973323 edges, 71265 markings/sec, 265 secs
lola: 20048020 markings, 76336353 edges, 71631 markings/sec, 270 secs
lola: 20407778 markings, 77707336 edges, 71952 markings/sec, 275 secs
lola: 20764711 markings, 79068228 edges, 71387 markings/sec, 280 secs
lola: 21121758 markings, 80428516 edges, 71409 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t50)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F (A (X (FIREABLE(t26))))) AND ((E (G (FIREABLE(t410))) OR E (X (FIREABLE(t116)))) OR (FIREABLE(t622) OR FIREABLE(t506) OR NOT FIREABLE(t355) OR FIREABLE(t420)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(t26)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(t26)))))
lola: processed formula length: 41
lola: 18 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 265488 markings, 478606 edges, 53098 markings/sec, 0 secs
lola: 543685 markings, 980411 edges, 55639 markings/sec, 5 secs
lola: 796014 markings, 1434872 edges, 50466 markings/sec, 10 secs
lola: 1068035 markings, 1926956 edges, 54404 markings/sec, 15 secs
lola: 1334015 markings, 2407093 edges, 53196 markings/sec, 20 secs
lola: 1610812 markings, 2907025 edges, 55359 markings/sec, 25 secs
lola: 1909111 markings, 3446707 edges, 59660 markings/sec, 30 secs
lola: 2168335 markings, 3913732 edges, 51845 markings/sec, 35 secs
lola: 2442438 markings, 4408156 edges, 54821 markings/sec, 40 secs
lola: 2734279 markings, 4934266 edges, 58368 markings/sec, 45 secs
lola: 2982415 markings, 5382439 edges, 49627 markings/sec, 50 secs
lola: 3347594 markings, 6040667 edges, 73036 markings/sec, 55 secs
lola: 3612558 markings, 6520718 edges, 52993 markings/sec, 60 secs
lola: 3851658 markings, 6953349 edges, 47820 markings/sec, 65 secs
lola: 4118544 markings, 7435769 edges, 53377 markings/sec, 70 secs
lola: 4465452 markings, 8062270 edges, 69382 markings/sec, 75 secs
lola: 4707738 markings, 8499198 edges, 48457 markings/sec, 80 secs
lola: 4981283 markings, 8992752 edges, 54709 markings/sec, 85 secs
lola: 5216534 markings, 9418721 edges, 47050 markings/sec, 90 secs
lola: 5482638 markings, 9900970 edges, 53221 markings/sec, 95 secs
lola: 5721526 markings, 10334273 edges, 47778 markings/sec, 100 secs
lola: 5949507 markings, 10747257 edges, 45596 markings/sec, 105 secs
lola: 6208811 markings, 11218292 edges, 51861 markings/sec, 110 secs
lola: 6464215 markings, 11681482 edges, 51081 markings/sec, 115 secs
lola: 6720967 markings, 12148323 edges, 51350 markings/sec, 120 secs
lola: 7026480 markings, 12703260 edges, 61103 markings/sec, 125 secs
lola: 7320409 markings, 13238537 edges, 58786 markings/sec, 130 secs
lola: 7547744 markings, 13650472 edges, 45467 markings/sec, 135 secs
lola: 7767979 markings, 14050595 edges, 44047 markings/sec, 140 secs
lola: 8051106 markings, 14563479 edges, 56625 markings/sec, 145 secs
lola: 8301394 markings, 15016903 edges, 50058 markings/sec, 150 secs
lola: 8519659 markings, 15412933 edges, 43653 markings/sec, 155 secs
lola: 8818369 markings, 15952768 edges, 59742 markings/sec, 160 secs
lola: 9105762 markings, 16469903 edges, 57479 markings/sec, 165 secs
lola: 9363804 markings, 16935610 edges, 51608 markings/sec, 170 secs
lola: 9610755 markings, 17379627 edges, 49390 markings/sec, 175 secs
lola: 9871499 markings, 17850158 edges, 52149 markings/sec, 180 secs
lola: 10108427 markings, 18278749 edges, 47386 markings/sec, 185 secs
lola: 10326343 markings, 18673299 edges, 43583 markings/sec, 190 secs
lola: 10589491 markings, 19156263 edges, 52630 markings/sec, 195 secs
lola: 10870998 markings, 19668363 edges, 56301 markings/sec, 200 secs
lola: 11181445 markings, 20227681 edges, 62089 markings/sec, 205 secs
lola: 11464406 markings, 20737866 edges, 56592 markings/sec, 210 secs
lola: 11720827 markings, 21200544 edges, 51284 markings/sec, 215 secs
lola: 11974089 markings, 21657304 edges, 50652 markings/sec, 220 secs
lola: 12227522 markings, 22115415 edges, 50687 markings/sec, 225 secs
lola: 12484089 markings, 22579021 edges, 51313 markings/sec, 230 secs
lola: 12741767 markings, 23045323 edges, 51536 markings/sec, 235 secs
lola: 13067840 markings, 23633658 edges, 65215 markings/sec, 240 secs
lola: 13383116 markings, 24203526 edges, 63055 markings/sec, 245 secs
lola: 13644577 markings, 24674676 edges, 52292 markings/sec, 250 secs
lola: 13944587 markings, 25216254 edges, 60002 markings/sec, 255 secs
lola: 14231244 markings, 25732934 edges, 57331 markings/sec, 260 secs
lola: 14503094 markings, 26222450 edges, 54370 markings/sec, 265 secs
lola: 14779811 markings, 26720874 edges, 55343 markings/sec, 270 secs
lola: 15027796 markings, 27169702 edges, 49597 markings/sec, 275 secs
lola: 15273058 markings, 27611780 edges, 49052 markings/sec, 280 secs
lola: 15568327 markings, 28143705 edges, 59054 markings/sec, 285 secs
lola: 15809107 markings, 28577976 edges, 48156 markings/sec, 290 secs
lola: 16073714 markings, 29056871 edges, 52921 markings/sec, 295 secs
lola: 16363867 markings, 29582149 edges, 58031 markings/sec, 300 secs
lola: 16631246 markings, 30064274 edges, 53476 markings/sec, 305 secs
lola: 16919432 markings, 30582683 edges, 57637 markings/sec, 310 secs
lola: 17171056 markings, 31037111 edges, 50325 markings/sec, 315 secs
lola: 17461146 markings, 31561279 edges, 58018 markings/sec, 320 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 8 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t188) OR FIREABLE(t239)) OR (A (X (FIREABLE(t605))) AND E (F (FIREABLE(t408)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((NOT FIREABLE(t188) AND NOT FIREABLE(t239)) AND (NOT(AX(FIREABLE(t605))) OR NOT(E(TRUE U FIREABLE(t408)))))))
lola: processed formula length: 123
lola: 6 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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 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: 5716 markings, 10367 edges
lola: ========================================
lola: subprocess 9 will run for 374 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A ((FIREABLE(t231) U FIREABLE(t302))) U E (F ((FIREABLE(t43) AND FIREABLE(t294))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(FIREABLE(t231) U FIREABLE(t302)) U E(TRUE U (FIREABLE(t43) AND FIREABLE(t294))))
lola: processed formula length: 84
lola: 3 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1796 markings, 3224 edges
lola: ========================================
lola: subprocess 10 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (FIREABLE(t656))) OR (E (F (E (X (FIREABLE(t15))))) AND ((FIREABLE(t368) AND NOT FIREABLE(t394)) OR (E (F (FIREABLE(t215))) OR (FIREABLE(t332) OR (FIREABLE(t353) AND FIREABLE(t665)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t656)))
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 44 bytes per marking, with 20 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 11 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X (FIREABLE(t15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(FIREABLE(t15)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 34 markings, 39 edges
lola: ========================================
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t368) AND NOT FIREABLE(t394))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t368) AND NOT FIREABLE(t394))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: processed formula with 0 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 13 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t215)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (F ((FIREABLE(t575) OR FIREABLE(t686)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (FIREABLE(t575) OR FIREABLE(t686)))))
lola: processed formula length: 54
lola: 8 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (FIREABLE(t538))) AND FIREABLE(t600))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t538)))
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 44 bytes per marking, with 20 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((NOT(A (F (FIREABLE(t621)))) OR ((FIREABLE(t622) OR FIREABLE(t147) OR NOT FIREABLE(t595)) OR A (G (FIREABLE(t40))))) AND (FIREABLE(t340) OR FIREABLE(t304) OR FIREABLE(t225) OR FIREABLE(t610))) OR FIREABLE(t384))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t621)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t621)))
lola: processed formula length: 29
lola: 5 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 14 will run for 1310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t340) OR FIREABLE(t304) OR FIREABLE(t225) OR FIREABLE(t610))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t340) OR FIREABLE(t304) OR FIREABLE(t225) OR FIREABLE(t610))
lola: processed formula length: 73
lola: 3 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: processed formula with 0 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 15 will run for 2621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t384)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t384)
lola: processed formula length: 14
lola: 3 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: processed formula with 0 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 14 will run for 1310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((FIREABLE(t290) AND (NOT FIREABLE(t413) OR NOT FIREABLE(t641))) AND E (G (FIREABLE(t284)))) OR A (F ((FIREABLE(t395) AND FIREABLE(t413) AND NOT FIREABLE(t80))))) AND ((NOT FIREABLE(t148) AND NOT FIREABLE(t231) AND FIREABLE(t43) AND FIREABLE(t672) AND FIREABLE(t342)) AND (FIREABLE(t425) OR (FIREABLE(t489) OR E (G (FIREABLE(t660)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t290) AND (NOT FIREABLE(t413) OR NOT FIREABLE(t641)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t290) AND (NOT FIREABLE(t413) OR NOT FIREABLE(t641)))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: processed formula with 0 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 15 will run for 2620 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t395) AND FIREABLE(t413) AND NOT FIREABLE(t80))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(t395) AND FIREABLE(t413) AND NOT FIREABLE(t80))))
lola: processed formula: A (F ((FIREABLE(t395) AND FIREABLE(t413) AND NOT FIREABLE(t80))))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 19 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2620 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((((FIREABLE(t238) AND FIREABLE(t17)) OR (FIREABLE(t524) AND FIREABLE(t9))) AND A (G (FIREABLE(t614)))))) AND (FIREABLE(t142) OR FIREABLE(t168)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2620 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((FIREABLE(t238) AND FIREABLE(t17)) OR (FIREABLE(t524) AND FIREABLE(t9))) AND A (G (FIREABLE(t614))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((FIREABLE(t238) AND FIREABLE(t17)) OR (FIREABLE(t524) AND FIREABLE(t9))) AND NOT(E(TRUE U NOT FIREABLE(t614)))))
lola: processed formula length: 118
lola: 3 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes unknown unknown yes unknown no yes yes yes no no no no
FORMULA Raft-PT-09-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLFireability-15 FALSE 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="Raft-PT-09"
export BK_EXAMINATION="CTLFireability"
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/Raft-PT-09.tgz
mv Raft-PT-09 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 Raft-PT-09, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-qhx2-152673583700158"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;