Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_IBMB2S565S3960-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649800093
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496351678595


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


checking for too many tokens
===========================================================================================
S_IBMB2S565S3960-PT-none: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_IBMB2S565S3960-PT-none @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 452/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 273 places, 179 transitions, 172 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 171 transition conflict sets
lola: TASK
lola: reading formula from IBMB2S565S3960-PT-none-CTLCardinality.task
lola: NOT(E (F (A (F ((3 <= callToTask.s00003980.input.s00001066)))))) : NOT(((((callToTask.s00003977.input.s00001066 <= 0) AND (join.s00001163.activated.s00001062 <= 1)) AND A (G ((merge.s00002238.input.s00001052 <= fork.s00002500.input.s00001052)))) OR A (((callToTask.s00003977.input.s00001066 <= callToTask.s00003981.output.s00001077) U (3 <= callToTask.s00003980.input.s00001068))))) : ((A (G (((endNode.s00001402.input.default <= callToProcess.s00001108.output.s00001077) OR (callToTask.s00003967.output.s00001054 <= callToTask.s00003964.output.s00001077)))) OR E (G ((callToProcess.s00003957.input.s00001052 + 1 <= merge.s00002240.input.s00001052)))) OR A (G ((callToTask.s00003976.inputCriterion.s00001053.used + 1 <= process.s00000565__s00003960.output.s00001249)))) : A (F (((2 <= callToTask.s00003980.inputCriterion.s00001053.used) OR E (G ((3 <= callToTask.s00003971.input.s00001066)))))) : E (G (((decision.s00002055.activated <= callToTask.s00003981.output.s00001054) OR (3 <= join.s00002243.input.s00001167)))) : E (G ((((callToProcess.s00003880.output.s00001077 <= merge.s00001160.input.s00001165) AND ((process.s00000565__s00003960.outputCriterion.s00001055_omega <= fork.s00002500.input.s00001052) OR (3 <= callToProcess.s00003957.input.s00001066))) OR (2 <= fork.s00001298.input.s00001068)))) : (A ((((fork.s00001298.input.s00001068 <= merge.s00001162.input.s00001128) OR (2 <= callToProcess.s00003872.inputCriterion.s00001053.used)) U (merge.s00002238.input.s00001066 + 1 <= join.s00002243.activated.s00001065))) AND E ((((3 <= fork.s00001403.activated.s00001075) OR (2 <= callToTask.s00003970.inputCriterion.s00001053.used)) U ((callToTask.s00003972.output.s00001077 <= fork.s00002500.activated.s00001075) OR (callToTask.s00003979.inputCriterion.s00001053.used <= decision.s00001157.activated))))) : NOT(A (F ((1 <= join.s00002243.input.s00001167)))) : NOT(E (X (A (G ((callToTask.s00003965.output.s00001077 <= callToProcess.s00003859.output.s00001083)))))) : E (G (((callToTask.s00003976.input.s00001052 + 1 <= callToProcess.s00003859.inputCriterion.s00001053.used) OR (callToTask.s00003964.inputCriterion.s00001053.used + 1 <= callToTask.s00003975.input.s00001068) OR ((callToProcess.s00003872.inputCriterion.s00001053.used <= callToTask.s00003962.output.s00001080) AND (callToTask.s00003974.inputCriterion.s00001053.used <= join.s00001163.input.s00001066))))) : A (F (((join.s00002243.input.s00001052 <= 2) AND (merge.s00002240.input.s00001127 + 1 <= alpha) AND (3 <= callToTask.s00003976.input.s00001066)))) : E (F ((2 <= merge.s00002240.input.s00001068))) : E (((callToProcess.s00003904.input.s00001066 <= callToTask.s00003963.inputCriterion.s00001053.used) U (2 <= callToTask.s00003976.inputCriterion.s00001053.used))) : (NOT(((3 <= merge.s00001161.input.s00001128) OR A (F ((callToProcess.s00003904.input.s00001066 <= fork.s00001298.input.s00001066))))) OR A (G ((merge.s00001161.activated <= 0)))) : A (F (E (G (((callToProcess.s00003880.output.s00001077 <= join.s00001163.input.s00001259) OR (callToProcess.s00003880.input.s00001052 <= callToTask.s00003970.input.s00001052)))))) : A ((E (F ((2 <= callToTask.s00003963.output.s00001054))) U (callToProcess.s00003957.input.s00001066 + 1 <= callToTask.s00003964.inputCriterion.s00001053.used)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (F ((3 <= callToTask.s00003980.input.s00001066))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (3 <= callToTask.s00003980.input.s00001066))))
lola: processed formula length: 68
lola: 9 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 671879 markings, 3674629 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1216597 markings, 6525571 edges, 108944 markings/sec, 5 secs
lola: 1761568 markings, 9647076 edges, 108994 markings/sec, 10 secs
lola: 2261222 markings, 12839670 edges, 99931 markings/sec, 15 secs
lola: 2773470 markings, 15883612 edges, 102450 markings/sec, 20 secs
lola: 3295026 markings, 19052792 edges, 104311 markings/sec, 25 secs
lola: 3777308 markings, 22069836 edges, 96456 markings/sec, 30 secs
lola: 4256638 markings, 25071434 edges, 95866 markings/sec, 35 secs
lola: 4747595 markings, 28010542 edges, 98191 markings/sec, 40 secs
lola: 5242217 markings, 30769368 edges, 98924 markings/sec, 45 secs
lola: 5777933 markings, 33772407 edges, 107143 markings/sec, 50 secs
lola: 6238492 markings, 36661560 edges, 92112 markings/sec, 55 secs
lola: 6670672 markings, 39599856 edges, 86436 markings/sec, 60 secs
lola: 7084439 markings, 42724080 edges, 82753 markings/sec, 65 secs
lola: 7477820 markings, 45666362 edges, 78676 markings/sec, 70 secs
lola: 7906107 markings, 48551326 edges, 85657 markings/sec, 75 secs
lola: 8319218 markings, 51464900 edges, 82622 markings/sec, 80 secs
lola: 8761667 markings, 54575979 edges, 88490 markings/sec, 85 secs
lola: 9108671 markings, 57113483 edges, 69401 markings/sec, 90 secs
lola: 9496568 markings, 60009912 edges, 77579 markings/sec, 95 secs
lola: 9939725 markings, 63219961 edges, 88631 markings/sec, 100 secs
lola: 10304860 markings, 65941822 edges, 73027 markings/sec, 105 secs
lola: 10737597 markings, 68795066 edges, 86547 markings/sec, 110 secs
lola: 11161634 markings, 71549103 edges, 84807 markings/sec, 115 secs
lola: 11588244 markings, 74353500 edges, 85322 markings/sec, 120 secs
lola: 12112617 markings, 77033849 edges, 104875 markings/sec, 125 secs
lola: 12577826 markings, 79982710 edges, 93042 markings/sec, 130 secs
lola: 13002290 markings, 82901626 edges, 84893 markings/sec, 135 secs
lola: 13449968 markings, 85719340 edges, 89536 markings/sec, 140 secs
lola: 13877986 markings, 88390915 edges, 85604 markings/sec, 145 secs
lola: 14310769 markings, 91129261 edges, 86557 markings/sec, 150 secs
lola: 14727757 markings, 93873082 edges, 83398 markings/sec, 155 secs
lola: 15141079 markings, 96615852 edges, 82664 markings/sec, 160 secs
lola: 15575913 markings, 99481264 edges, 86967 markings/sec, 165 secs
lola: 15956555 markings, 102164774 edges, 76128 markings/sec, 170 secs
lola: 16358951 markings, 104923222 edges, 80479 markings/sec, 175 secs
lola: 16744955 markings, 107457376 edges, 77201 markings/sec, 180 secs
lola: 17122804 markings, 109904170 edges, 75570 markings/sec, 185 secs
lola: 17525336 markings, 112596716 edges, 80506 markings/sec, 190 secs
lola: 17911890 markings, 115270674 edges, 77311 markings/sec, 195 secs
lola: 18226909 markings, 117563083 edges, 63004 markings/sec, 200 secs
lola: 18601382 markings, 120180530 edges, 74895 markings/sec, 205 secs
lola: 19062217 markings, 122727780 edges, 92167 markings/sec, 210 secs
lola: 19491511 markings, 125104795 edges, 85859 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((callToTask.s00003977.input.s00001066 <= 0) AND (join.s00001163.activated.s00001062 <= 1)) AND A (G ((merge.s00002238.input.s00001052 <= fork.s00002500.input.s00001052)))) OR A (((callToTask.s00003977.input.s00001066 <= callToTask.s00003981.output.s00001077) U (3 <= callToTask.s00003980.input.s00001068)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= callToTask.s00003977.input.s00001066) OR (2 <= join.s00001163.activated.s00001062))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= callToTask.s00003977.input.s00001066) OR (2 <= join.s00001163.activated.s00001062))
lola: processed formula length: 91
lola: 10 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((fork.s00002500.input.s00001052 + 1 <= merge.s00002238.input.s00001052)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((callToTask.s00003981.output.s00001077 + 1 <= callToTask.s00003977.input.s00001066) R (callToTask.s00003980.input.s00001068 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: NOT(A((callToTask.s00003977.input.s00001066 <= callToTask.s00003981.output.s00001077) U (3 <= callToTask.s00003980.input.s00001068)))
lola: processed formula length: 133
lola: 13 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((endNode.s00001402.input.default <= callToProcess.s00001108.output.s00001077) OR (callToTask.s00003967.output.s00001054 <= callToTask.s00003964.output.s00001077)))) OR E (G ((callToProcess.s00003957.input.s00001052 + 1 <= merge.s00002240.input.s00001052)))) OR A (G ((callToTask.s00003976.inputCriterion.s00001053.used + 1 <= process.s00000565__s00003960.output.s00001249))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((endNode.s00001402.input.default <= callToProcess.s00001108.output.s00001077) OR (callToTask.s00003967.output.s00001054 <= callToTask.s00003964.output.s00001077))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((callToProcess.s00003957.input.s00001052 + 1 <= merge.s00002240.input.s00001052)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (merge.s00002240.input.s00001052 <= callToProcess.s00003957.input.s00001052)))
lola: processed formula length: 91
lola: 3 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((callToTask.s00003976.inputCriterion.s00001053.used + 1 <= process.s00000565__s00003960.output.s00001249)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= callToTask.s00003980.inputCriterion.s00001053.used) OR E (G ((3 <= callToTask.s00003971.input.s00001066))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= callToTask.s00003980.inputCriterion.s00001053.used) OR NOT(A(TRUE U (callToTask.s00003971.input.s00001066 <= 2)))))
lola: processed formula length: 131
lola: 3 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((decision.s00002055.activated <= callToTask.s00003981.output.s00001054) OR (3 <= join.s00002243.input.s00001167))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((callToTask.s00003981.output.s00001054 + 1 <= decision.s00002055.activated) AND (join.s00002243.input.s00001167 <= 2))))
lola: processed formula length: 134
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((callToProcess.s00003880.output.s00001077 <= merge.s00001160.input.s00001165) AND ((process.s00000565__s00003960.outputCriterion.s00001055_omega <= fork.s00002500.input.s00001052) OR (3 <= callToProcess.s00003957.input.s00001066))) OR (2 <= fork.s00001298.input.s00001068))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((merge.s00001160.input.s00001165 + 1 <= callToProcess.s00003880.output.s00001077) OR ((fork.s00002500.input.s00001052 + 1 <= process.s00000565__s00003960.outputCriterion.s00001055_omega) AND (callToProcess.s00003957.input.s00001066 <= 2))) AND (fork.s00001298.input.s00001068 <= 1))))
lola: processed formula length: 300
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((fork.s00001298.input.s00001068 <= merge.s00001162.input.s00001128) OR (2 <= callToProcess.s00003872.inputCriterion.s00001053.used)) U (merge.s00002238.input.s00001066 + 1 <= join.s00002243.activated.s00001065))) AND E ((((3 <= fork.s00001403.activated.s00001075) OR (2 <= callToTask.s00003970.inputCriterion.s00001053.used)) U ((callToTask.s00003972.output.s00001077 <= fork.s00002500.activa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((fork.s00001298.input.s00001068 <= merge.s00001162.input.s00001128) OR (2 <= callToProcess.s00003872.inputCriterion.s00001053.used)) U (merge.s00002238.input.s00001066 + 1 <= join.s00002243.activated.s00001065)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((fork.s00001298.input.s00001068 <= merge.s00001162.input.s00001128) OR (2 <= callToProcess.s00003872.inputCriterion.s00001053.used)) U (merge.s00002238.input.s00001066 + 1 <= join.s00002243.activated.s00001065))
lola: processed formula length: 215
lola: 1 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: ========================================
========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((1 <= join.s00002243.input.s00001167))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= join.s00002243.input.s00001167)))
lola: processed formula length: 52
lola: 5 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((callToTask.s00003965.output.s00001077 <= callToProcess.s00003859.output.s00001083))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (callToProcess.s00003859.output.s00001083 + 1 <= callToTask.s00003965.output.s00001077)))
lola: processed formula length: 101
lola: 7 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((callToTask.s00003976.input.s00001052 + 1 <= callToProcess.s00003859.inputCriterion.s00001053.used) OR (callToTask.s00003964.inputCriterion.s00001053.used + 1 <= callToTask.s00003975.input.s00001068) OR ((callToProcess.s00003872.inputCriterion.s00001053.used <= callToTask.s00003962.output.s00001080) AND (callToTask.s00003974.inputCriterion.s00001053.used <= join.s00001163.input.s00001066)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((callToProcess.s00003859.inputCriterion.s00001053.used <= callToTask.s00003976.input.s00001052) AND (callToTask.s00003975.input.s00001068 <= callToTask.s00003964.inputCriterion.s00001053.used) AND ((callToTask.s00003962.output.s00001080 + 1 <= callToProcess.s00003872.inputCriterion.s00001053.used) OR (join.s00001163.input.s00001066 + 1 <= callToTask.s00003974.inputCriterion.s0000105... (shortened)
lola: processed formula length: 411
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((join.s00002243.input.s00001052 <= 2) AND (merge.s00002240.input.s00001127 + 1 <= alpha) AND (3 <= callToTask.s00003976.input.s00001066))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((join.s00002243.input.s00001052 <= 2) AND (merge.s00002240.input.s00001127 + 1 <= alpha) AND (3 <= callToTask.s00003976.input.s00001066)))
lola: processed formula length: 148
lola: 1 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= merge.s00002240.input.s00001068)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-11.sara
lola: ========================================
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((callToProcess.s00003904.input.s00001066 <= callToTask.s00003963.inputCriterion.s00001053.used) U (2 <= callToTask.s00003976.inputCriterion.s00001053.used)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((callToProcess.s00003904.input.s00001066 <= callToTask.s00003963.inputCriterion.s00001053.used) U (2 <= callToTask.s00003976.inputCriterion.s00001053.used))
lola: processed formula length: 158
lola: 1 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((3 <= merge.s00001161.input.s00001128) OR A (F ((callToProcess.s00003904.input.s00001066 <= fork.s00001298.input.s00001066))))) OR A (G ((merge.s00001161.activated <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (merge.s00001161.input.s00001128 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (merge.s00001161.input.s00001128 <= 2)
lola: processed formula length: 38
lola: 5 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((fork.s00001298.input.s00001066 + 1 <= callToProcess.s00003904.input.s00001066)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (callToProcess.s00003904.input.s00001066 <= fork.s00001298.input.s00001066)))
lola: processed formula length: 90
lola: 7 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((merge.s00001161.activated <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((callToProcess.s00003880.output.s00001077 <= join.s00001163.input.s00001259) OR (callToProcess.s00003880.input.s00001052 <= callToTask.s00003970.input.s00001052))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((join.s00001163.input.s00001259 + 1 <= callToProcess.s00003880.output.s00001077) AND (callToTask.s00003970.input.s00001052 + 1 <= callToProcess.s00003880.input.s00001052)))))
lola: processed formula length: 197
lola: 3 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 3319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= callToTask.s00003963.output.s00001054))) U (callToProcess.s00003957.input.s00001066 + 1 <= callToTask.s00003964.inputCriterion.s00001053.used)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (2 <= callToTask.s00003963.output.s00001054)) U (callToProcess.s00003957.input.s00001066 + 1 <= callToTask.s00003964.inputCriterion.s00001053.used))
lola: processed formula length: 159
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1028181 markings, 3490022 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1898935 markings, 6653051 edges, 174151 markings/sec, 5 secs
lola: 2661128 markings, 9816369 edges, 152439 markings/sec, 10 secs
lola: 3449774 markings, 12932413 edges, 157729 markings/sec, 15 secs
lola: 4143237 markings, 15993517 edges, 138693 markings/sec, 20 secs
lola: 4845276 markings, 18793306 edges, 140408 markings/sec, 25 secs
lola: 5565277 markings, 21408280 edges, 144000 markings/sec, 30 secs
lola: 6273911 markings, 24157036 edges, 141727 markings/sec, 35 secs
lola: 6985844 markings, 27269170 edges, 142387 markings/sec, 40 secs
lola: 7445592 markings, 30103878 edges, 91950 markings/sec, 45 secs
lola: 7970914 markings, 32797599 edges, 105064 markings/sec, 50 secs
lola: 8507196 markings, 35574697 edges, 107256 markings/sec, 55 secs
lola: 9059838 markings, 38307266 edges, 110528 markings/sec, 60 secs
lola: 9594959 markings, 41055772 edges, 107024 markings/sec, 65 secs
lola: 10107129 markings, 43783610 edges, 102434 markings/sec, 70 secs
lola: 10598865 markings, 46422375 edges, 98347 markings/sec, 75 secs
lola: 11116071 markings, 48942867 edges, 103441 markings/sec, 80 secs
lola: 11782178 markings, 51500692 edges, 133221 markings/sec, 85 secs
lola: 12567218 markings, 54059864 edges, 157008 markings/sec, 90 secs
lola: 13177412 markings, 56816762 edges, 122039 markings/sec, 95 secs
lola: 13794833 markings, 59554822 edges, 123484 markings/sec, 100 secs
lola: 14381708 markings, 62054678 edges, 117375 markings/sec, 105 secs
lola: 14984255 markings, 64782546 edges, 120509 markings/sec, 110 secs
lola: 15555148 markings, 67398194 edges, 114179 markings/sec, 115 secs
lola: 16125178 markings, 70227144 edges, 114006 markings/sec, 120 secs
lola: 16627742 markings, 72769453 edges, 100513 markings/sec, 125 secs
lola: 17115147 markings, 75122634 edges, 97481 markings/sec, 130 secs
lola: 17620499 markings, 77734026 edges, 101070 markings/sec, 135 secs
lola: 18053260 markings, 80105435 edges, 86552 markings/sec, 140 secs
lola: 18572572 markings, 82415913 edges, 103862 markings/sec, 145 secs
lola: 19272466 markings, 84766975 edges, 139979 markings/sec, 150 secs
lola: 19884833 markings, 86985774 edges, 122473 markings/sec, 155 secs
lola: 20477565 markings, 89481392 edges, 118546 markings/sec, 160 secs
lola: 21165730 markings, 91660801 edges, 137633 markings/sec, 165 secs
lola: 21783623 markings, 93940201 edges, 123579 markings/sec, 170 secs
lola: 22326078 markings, 96190135 edges, 108491 markings/sec, 175 secs
lola: 22926159 markings, 98502772 edges, 120016 markings/sec, 180 secs
lola: 23535634 markings, 100640393 edges, 121895 markings/sec, 185 secs
lola: 24108169 markings, 102745080 edges, 114507 markings/sec, 190 secs
lola: 24693918 markings, 104918846 edges, 117150 markings/sec, 195 secs
lola: 25361556 markings, 107380051 edges, 133528 markings/sec, 200 secs
lola: 25907681 markings, 109833705 edges, 109225 markings/sec, 205 secs
lola: 26440928 markings, 112311090 edges, 106649 markings/sec, 210 secs
lola: 27013899 markings, 114820339 edges, 114594 markings/sec, 215 secs
lola: 27622522 markings, 117317623 edges, 121725 markings/sec, 220 secs
lola: 28249994 markings, 119753735 edges, 125494 markings/sec, 225 secs
lola: 28851396 markings, 122373511 edges, 120280 markings/sec, 230 secs
lola: 29465815 markings, 124996587 edges, 122884 markings/sec, 235 secs
lola: 30123171 markings, 127835256 edges, 131471 markings/sec, 240 secs
lola: 30687322 markings, 130492506 edges, 112830 markings/sec, 245 secs
lola: 31268673 markings, 132994782 edges, 116270 markings/sec, 250 secs
lola: 31831389 markings, 135386303 edges, 112543 markings/sec, 255 secs
lola: 32357625 markings, 137602600 edges, 105247 markings/sec, 260 secs
lola: 32983735 markings, 140285119 edges, 125222 markings/sec, 265 secs
lola: 33371064 markings, 142543002 edges, 77466 markings/sec, 270 secs
lola: 33816825 markings, 145026379 edges, 89152 markings/sec, 275 secs
lola: 34310916 markings, 147173723 edges, 98818 markings/sec, 280 secs
lola: 34738718 markings, 149539799 edges, 85560 markings/sec, 285 secs
lola: 35149545 markings, 151796348 edges, 82165 markings/sec, 290 secs
lola: 35608644 markings, 154052172 edges, 91820 markings/sec, 295 secs
lola: 36186553 markings, 156777171 edges, 115582 markings/sec, 300 secs
lola: 36735266 markings, 159657707 edges, 109743 markings/sec, 305 secs
lola: 37242344 markings, 162466083 edges, 101416 markings/sec, 310 secs
lola: 37696598 markings, 165021261 edges, 90851 markings/sec, 315 secs
lola: 38164238 markings, 167641761 edges, 93528 markings/sec, 320 secs
lola: 38652981 markings, 169798390 edges, 97749 markings/sec, 325 secs
lola: 39186467 markings, 171962698 edges, 106697 markings/sec, 330 secs
lola: 39632856 markings, 173939787 edges, 89278 markings/sec, 335 secs
lola: 40193832 markings, 176272791 edges, 112195 markings/sec, 340 secs
lola: 40956960 markings, 179305939 edges, 152626 markings/sec, 345 secs
lola: 41344557 markings, 181417815 edges, 77519 markings/sec, 350 secs
lola: 41688669 markings, 183569539 edges, 68822 markings/sec, 355 secs
lola: 42029226 markings, 185666536 edges, 68111 markings/sec, 360 secs
lola: 42410087 markings, 187975322 edges, 76172 markings/sec, 365 secs
lola: 42849851 markings, 190682302 edges, 87953 markings/sec, 370 secs
lola: 43271888 markings, 192918266 edges, 84407 markings/sec, 375 secs
lola: 43735618 markings, 194825933 edges, 92746 markings/sec, 380 secs
lola: 44249321 markings, 196894860 edges, 102741 markings/sec, 385 secs
lola: 44711391 markings, 198986236 edges, 92414 markings/sec, 390 secs
lola: 45159286 markings, 201240323 edges, 89579 markings/sec, 395 secs
lola: 45671196 markings, 203684134 edges, 102382 markings/sec, 400 secs
lola: 46133386 markings, 206202022 edges, 92438 markings/sec, 405 secs
lola: 46535839 markings, 208291132 edges, 80491 markings/sec, 410 secs
lola: 46957687 markings, 210524457 edges, 84370 markings/sec, 415 secs
lola: 47377581 markings, 212650129 edges, 83979 markings/sec, 420 secs
lola: 47714287 markings, 214608430 edges, 67341 markings/sec, 425 secs
lola: 48170079 markings, 217021175 edges, 91158 markings/sec, 430 secs
lola: 48621445 markings, 219686340 edges, 90273 markings/sec, 435 secs
lola: 49001169 markings, 222064483 edges, 75945 markings/sec, 440 secs
lola: 49358074 markings, 224137696 edges, 71381 markings/sec, 445 secs
lola: 49718377 markings, 226334780 edges, 72061 markings/sec, 450 secs
lola: 50130992 markings, 228334511 edges, 82523 markings/sec, 455 secs
lola: 50643175 markings, 230428874 edges, 102437 markings/sec, 460 secs
lola: 50970295 markings, 232297379 edges, 65424 markings/sec, 465 secs
lola: 51413384 markings, 234419997 edges, 88618 markings/sec, 470 secs
lola: 51902596 markings, 236554184 edges, 97842 markings/sec, 475 secs
lola: 52603197 markings, 239428082 edges, 140120 markings/sec, 480 secs
lola: 53106024 markings, 241934979 edges, 100565 markings/sec, 485 secs
lola: 53660132 markings, 244335197 edges, 110822 markings/sec, 490 secs
lola: 54168508 markings, 246863462 edges, 101675 markings/sec, 495 secs
lola: 54632030 markings, 249106805 edges, 92704 markings/sec, 500 secs
lola: 55036906 markings, 251279625 edges, 80975 markings/sec, 505 secs
lola: 55499037 markings, 253679167 edges, 92426 markings/sec, 510 secs
lola: 56024142 markings, 256268946 edges, 105021 markings/sec, 515 secs
lola: 56634092 markings, 259173670 edges, 121990 markings/sec, 520 secs
lola: 57290436 markings, 262250937 edges, 131269 markings/sec, 525 secs
lola: 57755632 markings, 264892871 edges, 93039 markings/sec, 530 secs
lola: 58255263 markings, 267603499 edges, 99926 markings/sec, 535 secs
lola: 58613941 markings, 269873792 edges, 71736 markings/sec, 540 secs
lola: 58949881 markings, 272080553 edges, 67188 markings/sec, 545 secs
lola: 59337548 markings, 274543903 edges, 77533 markings/sec, 550 secs
lola: 59723513 markings, 277017081 edges, 77193 markings/sec, 555 secs
lola: 60040830 markings, 279317152 edges, 63463 markings/sec, 560 secs
lola: 60395549 markings, 281768444 edges, 70944 markings/sec, 565 secs
lola: 60778317 markings, 284311444 edges, 76554 markings/sec, 570 secs
lola: 61108188 markings, 286495025 edges, 65974 markings/sec, 575 secs
lola: 61432276 markings, 288692263 edges, 64818 markings/sec, 580 secs
lola: 61831192 markings, 290907668 edges, 79783 markings/sec, 585 secs
lola: 62193811 markings, 292939202 edges, 72524 markings/sec, 590 secs
lola: 62628961 markings, 295333740 edges, 87030 markings/sec, 595 secs
lola: 62973476 markings, 297223641 edges, 68903 markings/sec, 600 secs
lola: 63399590 markings, 299523717 edges, 85223 markings/sec, 605 secs
lola: 63755774 markings, 301716247 edges, 71237 markings/sec, 610 secs
lola: 64147165 markings, 303987231 edges, 78278 markings/sec, 615 secs
lola: 64493286 markings, 306224425 edges, 69224 markings/sec, 620 secs
lola: 64852210 markings, 308530318 edges, 71785 markings/sec, 625 secs
lola: 65227311 markings, 310848277 edges, 75020 markings/sec, 630 secs
lola: 65676754 markings, 313298607 edges, 89889 markings/sec, 635 secs
lola: 66113534 markings, 315738605 edges, 87356 markings/sec, 640 secs
lola: 66517649 markings, 318276640 edges, 80823 markings/sec, 645 secs
lola: 66940948 markings, 320946105 edges, 84660 markings/sec, 650 secs
lola: 67308873 markings, 323167374 edges, 73585 markings/sec, 655 secs
lola: 67662427 markings, 325511389 edges, 70711 markings/sec, 660 secs
lola: 68048115 markings, 327864929 edges, 77138 markings/sec, 665 secs
lola: 68414900 markings, 330406373 edges, 73357 markings/sec, 670 secs
lola: 68787329 markings, 333100580 edges, 74486 markings/sec, 675 secs
lola: 69112611 markings, 335301680 edges, 65056 markings/sec, 680 secs
lola: 69402142 markings, 337450321 edges, 57906 markings/sec, 685 secs
lola: 69707392 markings, 339680951 edges, 61050 markings/sec, 690 secs
lola: 70072901 markings, 341851697 edges, 73102 markings/sec, 695 secs
lola: 70412494 markings, 343881030 edges, 67919 markings/sec, 700 secs
lola: 70771459 markings, 346048392 edges, 71793 markings/sec, 705 secs
lola: 71176628 markings, 348154995 edges, 81034 markings/sec, 710 secs
lola: 71596973 markings, 350314806 edges, 84069 markings/sec, 715 secs
lola: 72038416 markings, 352601742 edges, 88289 markings/sec, 720 secs
lola: 72434418 markings, 354669454 edges, 79200 markings/sec, 725 secs
lola: 72802633 markings, 356785369 edges, 73643 markings/sec, 730 secs
lola: 73204774 markings, 359019574 edges, 80428 markings/sec, 735 secs
lola: 73587276 markings, 361064725 edges, 76500 markings/sec, 740 secs
lola: 73923243 markings, 363033882 edges, 67193 markings/sec, 745 secs
lola: 74231416 markings, 364950613 edges, 61635 markings/sec, 750 secs
lola: 74613207 markings, 366968744 edges, 76358 markings/sec, 755 secs
lola: 75048345 markings, 369329646 edges, 87028 markings/sec, 760 secs
lola: 75486032 markings, 371577557 edges, 87537 markings/sec, 765 secs
lola: 75951488 markings, 373807131 edges, 93091 markings/sec, 770 secs
lola: 76444590 markings, 375987725 edges, 98620 markings/sec, 775 secs
lola: 77035809 markings, 377978046 edges, 118244 markings/sec, 780 secs
lola: 77645036 markings, 380076786 edges, 121845 markings/sec, 785 secs
lola: 78157015 markings, 382446769 edges, 102396 markings/sec, 790 secs
lola: 78703258 markings, 384814545 edges, 109249 markings/sec, 795 secs
lola: 79228485 markings, 387071867 edges, 105045 markings/sec, 800 secs
lola: 79769882 markings, 389494516 edges, 108279 markings/sec, 805 secs
lola: 80254232 markings, 391759404 edges, 96870 markings/sec, 810 secs
lola: 80781116 markings, 394073123 edges, 105377 markings/sec, 815 secs
lola: 81215857 markings, 396478393 edges, 86948 markings/sec, 820 secs
lola: 81670086 markings, 398624983 edges, 90846 markings/sec, 825 secs
lola: 82081411 markings, 400686574 edges, 82265 markings/sec, 830 secs
lola: 82548056 markings, 403103173 edges, 93329 markings/sec, 835 secs
lola: 82920892 markings, 405180361 edges, 74567 markings/sec, 840 secs
lola: 83357989 markings, 407211773 edges, 87419 markings/sec, 845 secs
lola: 83965671 markings, 409332849 edges, 121536 markings/sec, 850 secs
lola: 84564224 markings, 411978515 edges, 119711 markings/sec, 855 secs
lola: 85054827 markings, 414551774 edges, 98121 markings/sec, 860 secs
lola: 85521366 markings, 416818904 edges, 93308 markings/sec, 865 secs
lola: 85984956 markings, 419160047 edges, 92718 markings/sec, 870 secs
lola: 86414356 markings, 421456292 edges, 85880 markings/sec, 875 secs
lola: 86841945 markings, 423778531 edges, 85518 markings/sec, 880 secs
lola: 87437600 markings, 426032677 edges, 119131 markings/sec, 885 secs
lola: 88083327 markings, 428749943 edges, 129145 markings/sec, 890 secs
lola: 88595399 markings, 431343769 edges, 102414 markings/sec, 895 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown yes no no yes yes no yes yes yes no yes yes no yes unknown
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496352805629

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_IBMB2S565S3960-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_IBMB2S565S3960-PT-none.tgz
mv S_IBMB2S565S3960-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_IBMB2S565S3960-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441649800093"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;