About the Execution of LoLA for IBMB2S565S3960-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 147.750 | 464.00 | 79.00 | 5.00 | FTTTFTTTFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.....................
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 127K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is IBMB2S565S3960-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800193
=====================================================================
--------------------
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-CTLFireability-00
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-01
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-02
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-03
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-04
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-05
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-06
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-07
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-08
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-09
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-10
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-11
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-12
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-13
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-14
FORMULA_NAME IBMB2S565S3960-PT-none-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1526785793366
info: Time: 3600 - MCC
===========================================================================================
prep: translating IBMB2S565S3960-PT-none Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating IBMB2S565S3960-PT-none formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ IBMB2S565S3960-PT-none @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 8736
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-CTLFireability.task
lola: A (((NOT FIREABLE(decision.s00003021.fire.s00001075) OR E (F (FIREABLE(callToTask.s00003966.outputCriterion.s00001055)))) U FIREABLE(merge.s00002238.fire.s00001069))) : E (F (A (F (E (F (FIREABLE(merge.s00002240.activate.s00001065))))))) : (E (G ((NOT FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR A (F (FIREABLE(callToTask.s00003965.inputCriterion.s00001053)))))) AND E (F (((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001067) AND FIREABLE(callToProcess.s00003872.outputCriterion.s00001055) AND FIREABLE(decision.s00001840.fire.s00001073))))) : NOT(A (G (E (F (FIREABLE(callToTask.s00003974.outputCriterion.s00001055)))))) : A (F ((FIREABLE(decision.s00001159.fire.s00001075) OR E (G ((FIREABLE(fork.s00002500.fire.s00001073) AND FIREABLE(callToProcess.s00003876.inputCriterion.s00001053))))))) : E (((NOT FIREABLE(callToTask.s00001360.inputCriterion.s00001053) OR NOT FIREABLE(callToTask.s00003965.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003967.inputCriterion.s00001053)) U A (G (NOT FIREABLE(callToTask.s00003966.outputCriterion.s00001055))))) : ((FIREABLE(callToTask.s00003980.inputCriterion.s00001053) OR NOT(E ((FIREABLE(callToTask.s00003964.outputCriterion.s00001055) U FIREABLE(callToTask.s00003962.inputCriterion.s00001053))))) AND E (((NOT FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) OR NOT FIREABLE(join.s00001163.activate.s00001062)) U FIREABLE(decision.s00003021.fire.s00001073)))) : (E (G (NOT FIREABLE(merge.s00002241.fire.s00001069))) AND E (F (((FIREABLE(callToTask.s00003965.inputCriterion.s00001053) OR FIREABLE(callToProcess.s00003876.outputCriterion.s00001055) OR NOT FIREABLE(decision.s00002760.fire.s00001073)) AND FIREABLE(callToTask.s00003969.inputCriterion.s00001053))))) : A (G (NOT(E (F ((FIREABLE(decision.s00001841.activate.s00001072) OR FIREABLE(callToProcess.s00001108.inputCriterion.s00001053))))))) : NOT(A (F ((FIREABLE(callToTask.s00003964.inputCriterion.s00001053) OR FIREABLE(join.s00002243.activate.s00001064) OR FIREABLE(fork.s00001071.activate.s00001072) OR FIREABLE(merge.s00002239.activate.s00001062) OR (FIREABLE(decision.s00003020.fire.s00001075) AND FIREABLE(callToProcess.s00003876.outputCriterion.s00001055)))))) : A (F (FIREABLE(callToTask.s00003972.inputCriterion.s00001053))) : (NOT((FIREABLE(callToProcess.s00003957.inputCriterion.s00001053) OR E (G (NOT FIREABLE(decision.s00001126.activate.s00001072))))) AND NOT(A (((FIREABLE(merge.s00001161.activate.s00001064) AND FIREABLE(join.s00002243.activate.s00001065)) U (FIREABLE(decision.s00002055.fire.s00001075) AND FIREABLE(callToProcess.s00003904.outputCriterion.s00001055)))))) : E (G (((A (F (FIREABLE(decision.s00001159.activate.s00001072))) OR (FIREABLE(merge.s00002238.fire.s00001069) OR FIREABLE(merge.s00002239.fire.s00001069) OR FIREABLE(decision.s00002056.activate.s00001072))) OR E (G ((FIREABLE(merge.s00002238.activate.s00001062) AND FIREABLE(callToTask.s00003966.outputCriterion.s00001055))))))) : A (G (A (F (FIREABLE(callToTask.s00003966.inputCriterion.s00001053))))) : E (F (FIREABLE(join.s00001163.fire.s00001069))) : ((A (F (FIREABLE(callToTask.s00003980.outputCriterion.s00001055))) AND NOT((A (X (FIREABLE(decision.s00002056.fire.s00001073))) AND FIREABLE(callToTask.s00003971.inputCriterion.s00001053)))) AND A (X (NOT FIREABLE(decision.s00001126.fire.s00001073))))
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(callToTask.s00003980.outputCriterion.s00001055))) AND ((E (X (NOT FIREABLE(decision.s00002056.fire.s00001073))) OR NOT FIREABLE(callToTask.s00003971.inputCriterion.s00001053)) AND A (X (NOT FIREABLE(decision.s00001126.fire.s00001073)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(callToTask.s00003971.inputCriterion.s00001053)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(callToTask.s00003971.inputCriterion.s00001053)
lola: processed formula length: 59
lola: 35 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(callToTask.s00003980.outputCriterion.s00001055)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(callToTask.s00003980.outputCriterion.s00001055)
lola: processed formula length: 60
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 128 markings, 127 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(join.s00001163.fire.s00001069)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(join.s00001163.fire.s00001069)))
lola: processed formula length: 47
lola: 36 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(join.s00001163.fire.s00001069)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 148 markings, 147 edges
FORMULA IBMB2S565S3960-PT-none-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(merge.s00002240.activate.s00001065)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(merge.s00002240.activate.s00001065)))
lola: processed formula length: 52
lola: 36 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(merge.s00002240.activate.s00001065)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
FORMULA IBMB2S565S3960-PT-none-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(decision.s00001841.activate.s00001072) AND NOT FIREABLE(callToProcess.s00001108.inputCriterion.s00001053))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((NOT FIREABLE(decision.s00001841.activate.s00001072) AND NOT FIREABLE(callToProcess.s00001108.inputCriterion.s00001053))))
lola: processed formula length: 128
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (FIREABLE(decision.s00001841.activate.s00001072) OR FIREABLE(callToProcess.s00001108.inputCriterion.s00001053))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (FIREABLE(callToTask.s00003966.inputCriterion.s00001053)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(callToTask.s00003966.inputCriterion.s00001053)
lola: processed formula length: 59
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 128 markings, 127 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(callToTask.s00003974.outputCriterion.s00001055)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(callToTask.s00003974.outputCriterion.s00001055)
lola: processed formula length: 56
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 397 markings, 396 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(callToTask.s00003972.inputCriterion.s00001053)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(callToTask.s00003972.inputCriterion.s00001053)
lola: processed formula length: 59
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 128 markings, 127 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(callToTask.s00003964.inputCriterion.s00001053) AND NOT FIREABLE(join.s00002243.activate.s00001064) AND NOT FIREABLE(fork.s00001071.activate.s00001072) AND NOT FIREABLE(merge.s00002239.activate.s00001062) AND (NOT FIREABLE(decision.s00003020.fire.s00001075) OR NOT FIREABLE(callToProcess.s00003876.outputCriterion.s00001055)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(callToTask.s00003964.inputCriterion.s00001053) AND NOT FIREABLE(join.s00002243.activate.s00001064) AND NOT FIREABLE(fork.s00001071.activate.s00001072) AND NOT FIREABLE(merge.s00002239.activate.s00001062) AND (NOT FIREABLE(decision.s00003020.fire.s00001075) OR NOT FIREABLE(callToProcess.s00003876.outputCriterion.s00001055)))))
lola: processed formula length: 348
lola: 35 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 42 markings, 42 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(decision.s00003021.fire.s00001075) OR E (F (FIREABLE(callToTask.s00003966.outputCriterion.s00001055)))) U FIREABLE(merge.s00002238.fire.s00001069)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A((NOT FIREABLE(decision.s00003021.fire.s00001075) OR E(TRUE U FIREABLE(callToTask.s00003966.outputCriterion.s00001055))) U FIREABLE(merge.s00002238.fire.s00001069))
lola: processed formula length: 165
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1186 markings, 1360 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(decision.s00001159.fire.s00001075) OR E (G ((FIREABLE(fork.s00002500.fire.s00001073) AND FIREABLE(callToProcess.s00003876.inputCriterion.s00001053)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (FIREABLE(decision.s00001159.fire.s00001075) OR NOT(A(TRUE U (NOT FIREABLE(fork.s00002500.fire.s00001073) OR NOT FIREABLE(callToProcess.s00003876.inputCriterion.s00001053))))))
lola: processed formula length: 186
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 324 markings, 647 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(callToTask.s00001360.inputCriterion.s00001053) OR NOT FIREABLE(callToTask.s00003965.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003967.inputCriterion.s00001053)) U A (G (NOT FIREABLE(callToTask.s00003966.outputCriterion.s00001055)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((NOT FIREABLE(callToTask.s00001360.inputCriterion.s00001053) OR NOT FIREABLE(callToTask.s00003965.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003967.inputCriterion.s00001053)) U NOT(E(TRUE U FIREABLE(callToTask.s00003966.outputCriterion.s00001055))))
lola: processed formula length: 267
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 369 markings, 1018 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F (FIREABLE(decision.s00001159.activate.s00001072))) OR ((FIREABLE(merge.s00002238.fire.s00001069) OR FIREABLE(merge.s00002239.fire.s00001069) OR FIREABLE(decision.s00002056.activate.s00001072)) OR E (G ((FIREABLE(merge.s00002238.activate.s00001062) AND FIREABLE(callToTask.s00003966.outputCriterion.s00001055))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U FIREABLE(decision.s00001159.activate.s00001072))) AND ((NOT FIREABLE(merge.s00002238.fire.s00001069) AND NOT FIREABLE(merge.s00002239.fire.s00001069) AND NOT FIREABLE(decision.s00002056.activate.s00001072)) AND A(TRUE U (NOT FIREABLE(merge.s00002238.activate.s00001062) OR NOT FIREABLE(callToTask.s00003966.outputCriterion.s00001055)))))))
lola: processed formula length: 367
lola: 43 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 324 markings, 325 edges
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (NOT FIREABLE(merge.s00002241.fire.s00001069))) AND E (F (((FIREABLE(callToTask.s00003965.inputCriterion.s00001053) OR FIREABLE(callToProcess.s00003876.outputCriterion.s00001055) OR NOT FIREABLE(decision.s00002760.fire.s00001073)) AND FIREABLE(callToTask.s00003969.inputCriterion.s00001053)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(merge.s00002241.fire.s00001069)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(merge.s00002241.fire.s00001069)))
lola: processed formula length: 52
lola: 35 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 128 markings, 127 edges
lola: ========================================
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToTask.s00003965.inputCriterion.s00001053) OR FIREABLE(callToProcess.s00003876.outputCriterion.s00001055) OR NOT FIREABLE(decision.s00002760.fire.s00001073)) AND FIREABLE(callToTask.s00003969.inputCriterion.s00001053))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(callToTask.s00003965.inputCriterion.s00001053) OR FIREABLE(callToProcess.s00003876.outputCriterion.s00001055) OR NOT FIREABLE(decision.s00002760.fire.s00001073)) AND FIREABLE(callToTask.s00003969.inputCriterion.s00001053))))
lola: processed formula length: 243
lola: 36 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(callToTask.s00003965.inputCriterion.s00001053) OR FIREABLE(callToProcess.s00003876.outputCriterion.s00001055) OR NOT FIREABLE(decision.s00002760.fire.s00001073)) AND FIREABLE(callToTask.s00003969.inputCriterion.s00001053))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(callToTask.s00003980.inputCriterion.s00001053) OR A ((NOT FIREABLE(callToTask.s00003964.outputCriterion.s00001055) R NOT FIREABLE(callToTask.s00003962.inputCriterion.s00001053)))) AND E (((NOT FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) OR NOT FIREABLE(join.s00001163.activate.s00001062)) U FIREABLE(decision.s00003021.fire.s00001073))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(callToTask.s00003980.inputCriterion.s00001053)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(callToTask.s00003980.inputCriterion.s00001053)
lola: processed formula length: 55
lola: 35 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-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 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(callToTask.s00003964.outputCriterion.s00001055) R NOT FIREABLE(callToTask.s00003962.inputCriterion.s00001053)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A ((NOT FIREABLE(callToTask.s00003964.outputCriterion.s00001055) R NOT FIREABLE(callToTask.s00003962.inputCriterion.s00001053)))
lola: processed formula length: 128
lola: 41 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: FIREABLE(callToTask.s00003962.inputCriterion.s00001053)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) OR NOT FIREABLE(join.s00001163.activate.s00001062)) U FIREABLE(decision.s00003021.fire.s00001073)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((NOT FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) OR NOT FIREABLE(join.s00001163.activate.s00001062)) U FIREABLE(decision.s00003021.fire.s00001073)))
lola: processed formula length: 168
lola: 38 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: FIREABLE(decision.s00003021.fire.s00001073)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 161 markings, 160 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(callToProcess.s00003957.inputCriterion.s00001053) AND (A (F (FIREABLE(decision.s00001126.activate.s00001072))) AND E (((NOT FIREABLE(merge.s00001161.activate.s00001064) OR NOT FIREABLE(join.s00002243.activate.s00001065)) R (NOT FIREABLE(decision.s00002055.fire.s00001075) OR NOT FIREABLE(callToProcess.s00003904.outputCriterion.s00001055))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(callToProcess.s00003957.inputCriterion.s00001053)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(callToProcess.s00003957.inputCriterion.s00001053)
lola: processed formula length: 62
lola: 35 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(decision.s00001126.activate.s00001072)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: NOT FIREABLE(decision.s00001126.activate.s00001072)
lola: processed formula length: 51
lola: 37 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 128 markings, 127 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((NOT FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR A (F (FIREABLE(callToTask.s00003965.inputCriterion.s00001053)))))) AND E (F (((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001067) AND FIREABLE(callToProcess.s00003872.outputCriterion.s00001055) AND FIREABLE(decision.s00001840.fire.s00001073))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001067) AND FIREABLE(callToProcess.s00003872.outputCriterion.s00001055) AND FIREABLE(decision.s00001840.fire.s00001073))))
lola: processed formula length: 376
lola: 36 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001067) AND FIREABLE(callToProcess.s00003872.outputCriterion.s00001055) AND FIREABLE(decision.s00001840.fire.s00001073))
lola: state equation: Generated DNF with 21 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 154 markings, 153 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((NOT FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR A (F (FIREABLE(callToTask.s00003965.inputCriterion.s00001053)))))) AND E (F (((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001067) AND FIREABLE(callToProcess.s00003872.outputCriterion.s00001055) AND FIREABLE(decision.s00001840.fire.s00001073))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001067) AND FIREABLE(callToProcess.s00003872.outputCriterion.s00001055) AND FIREABLE(decision.s00001840.fire.s00001073))))
lola: processed formula length: 376
lola: 36 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(decision.s00002056.fire.s00001075) OR FIREABLE(fork.s00001071.activate.s00001072)) AND FIREABLE(callToProcess.s00003904.inputCriterion.s00001053) AND FIREABLE(merge.s00002240.activate.s00001062) AND FIREABLE(merge.s00001160.activate.s00001067) AND FIREABLE(callToProcess.s00003872.outputCriterion.s00001055) AND FIREABLE(decision.s00001840.fire.s00001073))
lola: state equation: Generated DNF with 21 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLFireability-16-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 154 markings, 153 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR A (F (FIREABLE(callToTask.s00003965.inputCriterion.s00001053))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (FIREABLE(callToTask.s00003961.outputCriterion.s00001055) AND NOT(A(TRUE U FIREABLE(callToTask.s00003965.inputCriterion.s00001053))))))
lola: processed formula length: 148
lola: 39 rewrites
lola: closed formula file IBMB2S565S3960-PT-none-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 324 markings, 323 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA IBMB2S565S3960-PT-none-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes yes yes no no no no no no yes no
lola:
preliminary result: no yes yes yes no yes yes yes no no no no no no yes no
lola: memory consumption: 15048 KB
lola: time consumption: 0 seconds
BK_STOP 1526785793830
--------------------
content from 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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="CTLFireability"
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/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none 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 lola"
echo " Input is IBMB2S565S3960-PT-none, 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 r100-smll-152658630800193"
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 '
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 ;