About the Execution of LoLA for IBM5964-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
219.480 | 3600000.00 | 56626.00 | 9006.50 | FF?TF?TFFFF?FF?? | 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 376K
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K 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 6.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 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.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 171K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is IBM5964-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-152658630800179
=====================================================================
--------------------
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 IBM5964-PT-none-CTLFireability-00
FORMULA_NAME IBM5964-PT-none-CTLFireability-01
FORMULA_NAME IBM5964-PT-none-CTLFireability-02
FORMULA_NAME IBM5964-PT-none-CTLFireability-03
FORMULA_NAME IBM5964-PT-none-CTLFireability-04
FORMULA_NAME IBM5964-PT-none-CTLFireability-05
FORMULA_NAME IBM5964-PT-none-CTLFireability-06
FORMULA_NAME IBM5964-PT-none-CTLFireability-07
FORMULA_NAME IBM5964-PT-none-CTLFireability-08
FORMULA_NAME IBM5964-PT-none-CTLFireability-09
FORMULA_NAME IBM5964-PT-none-CTLFireability-10
FORMULA_NAME IBM5964-PT-none-CTLFireability-11
FORMULA_NAME IBM5964-PT-none-CTLFireability-12
FORMULA_NAME IBM5964-PT-none-CTLFireability-13
FORMULA_NAME IBM5964-PT-none-CTLFireability-14
FORMULA_NAME IBM5964-PT-none-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1526778438649
info: Time: 3600 - MCC
===========================================================================================
prep: translating IBM5964-PT-none Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating IBM5964-PT-none formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ IBM5964-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: 402/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: Size of bit vector: 8416
lola: finding significant places
lola: 263 places, 139 transitions, 135 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 133 transition conflict sets
lola: TASK
lola: reading formula from IBM5964-PT-none-CTLFireability.task
lola: E ((NOT(A (G (FIREABLE(decision_s00001616_fire_s00000991)))) U (FIREABLE(callToTask_s00005969_outputCriterion_s00000939) AND FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(fork_s00001067_fire_s00000991) AND (FIREABLE(decision_s00001617_fire_s00000991) OR FIREABLE(decision_s00001288_activate_s00000990) OR (FIREABLE(merge_s00000945_activate_s00000946) AND FIREABLE(callToTask_s00005970_inputCriterion_s00000937)))))) : (E (F (E ((FIREABLE(decision_s00001289_fire_s00000991) U FIREABLE(merge_s00001291_activate_s00000946))))) AND (E (X ((FIREABLE(fork_s00001293_fire_s00000993) AND FIREABLE(decision_s00000989_activate_s00000990)))) OR A (F ((NOT FIREABLE(callToTask_s00001632_inputCriterion_s00000937) AND NOT FIREABLE(callToTask_s00005972_inputCriterion_s00000937)))))) : (A (F (NOT FIREABLE(decision_s00001288_fire_s00000993))) AND E (((NOT FIREABLE(decision_s00000999_fire_s00000993) OR NOT FIREABLE(fork_s00001536_activate_s00000990)) U (FIREABLE(join_s00001294_activate_s00000946) AND FIREABLE(callToTask_s00001746_inputCriterion_s00000937) AND NOT FIREABLE(decision_s00001287_fire_s00000993))))) : NOT(E (F (FIREABLE(callToTask_s00005970_inputCriterion_s00000937)))) : (E (F ((A (G (FIREABLE(callToProcess_s00002411_outputCriterion_s00000939))) OR (FIREABLE(callToTask_s00002189_inputCriterion_s00000937) AND (FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR FIREABLE(callToTask_s00002190_inputCriterion_s00000937)))))) OR A (X (((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(callToTask_s00002189_inputCriterion_s00000937)) AND A (F (FIREABLE(callToTask_s00002741_outputCriterion_s00000939))))))) : (E (G ((NOT FIREABLE(process_s00000383__s00005964_outputCriterion_s00000939) AND NOT FIREABLE(callToTask_s00001971_outputCriterion_s00000939)))) AND NOT(E (((FIREABLE(decision_s00000999_activate_s00000990) OR FIREABLE(callToTask_s00001632_outputCriterion_s00000939)) U (FIREABLE(fork_s00001536_fire_s00000991) OR FIREABLE(decision_s00000989_fire_s00000993)))))) : NOT((E (X ((FIREABLE(decision_s00001618_fire_s00000993) OR FIREABLE(merge_s00000945_activate_s00000946) OR FIREABLE(merge_s00001066_fire_s00000953)))) OR A ((NOT FIREABLE(decision_s00001289_fire_s00000993) U FIREABLE(callToTask_s00005967_inputCriterion_s00000937))))) : ((E (F (((FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) OR FIREABLE(decision_s00001617_fire_s00000991)) AND FIREABLE(merge_s00003354_activate_s00000949)))) OR E (X (FIREABLE(callToTask_s00005965_outputCriterion_s00000939)))) OR E (F ((FIREABLE(callToProcess_s00005925_inputCriterion_s00000937) AND FIREABLE(merge_s00001369_activate_s00000946))))) : A (X ((E (F (FIREABLE(callToTask_s00001746_inputCriterion_s00000937))) OR ((NOT FIREABLE(merge_s00001290_activate_s00000949) AND NOT FIREABLE(merge_s00001120_fire_s00000953)) OR E (F (FIREABLE(callToTask_s00005965_inputCriterion_s00000937))))))) : A (F (FIREABLE(merge_s00000945_activate_s00000948))) : NOT(A (X (NOT(E (F (FIREABLE(callToTask_s00001632_inputCriterion_s00000937))))))) : (FIREABLE(merge_s00001290_activate_s00000948) OR NOT(A (F ((FIREABLE(callToTask_s00005971_outputCriterion_s00000939) OR FIREABLE(merge_s00000945_fire_s00000953) OR (FIREABLE(callToTask_s00002186_outputCriterion_s00000939) AND FIREABLE(decision_s00000989_fire_s00000995))))))) : A (F (FIREABLE(fork_s00001536_fire_s00000993))) : NOT((E ((NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939) U FIREABLE(decision_s00000989_fire_s00000993))) OR A (X (E (G (FIREABLE(callToTask_s00002189_outputCriterion_s00000939))))))) : E (G (E (F ((FIREABLE(callToTask_s00002190_inputCriterion_s00000937) AND FIREABLE(fork_s00001536_fire_s00000993) AND (FIREABLE(fork_s00001293_fire_s00000991) OR FIREABLE(decision_s00000999_fire_s00000993))))))) : E (((NOT FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR NOT FIREABLE(decision_s00001615_fire_s00000991) OR (NOT FIREABLE(callToTask_s00005972_outputCriterion_s00000939) AND NOT FIREABLE(callToTask_s00002181_inputCriterion_s00000937))) U (NOT FIREABLE(callToTask_s00001632_outputCriterion_s00000939) AND NOT FIREABLE(merge_s00003354_activate_s00000948) AND FIREABLE(decision_s00000999_fire_s00000991))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:446
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:548
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:254
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(merge_s00001291_activate_s00000946))) AND (E (X ((FIREABLE(fork_s00001293_fire_s00000993) AND FIREABLE(decision_s00000989_activate_s00000990)))) OR A (F ((NOT FIREABLE(callToTask_s00001632_inputCriterion_s00000937) AND NOT FIREABLE(callToTask_s00005972_inputCriterion_s00000937))))))
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: E (F (FIREABLE(merge_s00001291_activate_s00000946)))
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_s00001291_activate_s00000946)))
lola: processed formula length: 52
lola: 45 rewrites
lola: closed formula file IBM5964-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_s00001291_activate_s00000946)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-1 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 (A (G (FIREABLE(callToProcess_s00002411_outputCriterion_s00000939))))) OR (E (F ((FIREABLE(callToTask_s00002189_inputCriterion_s00000937) AND (FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR FIREABLE(callToTask_s00002190_inputCriterion_s00000937))))) OR (A (X ((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(cal... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(callToProcess_s00002411_outputCriterion_s00000939)))))
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:694
lola: processed formula: NOT FIREABLE(callToProcess_s00002411_outputCriterion_s00000939)
lola: processed formula length: 63
lola: 46 rewrites
lola: closed formula file IBM5964-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: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 15546 markings, 59846 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask_s00002189_inputCriterion_s00000937) AND (FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR FIREABLE(callToTask_s00002190_inputCriterion_s00000937)))))
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_s00002189_inputCriterion_s00000937) AND (FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR FIREABLE(callToTask_s00002190_inputCriterion_s00000937)))))
lola: processed formula length: 188
lola: 45 rewrites
lola: closed formula file IBM5964-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_s00002189_inputCriterion_s00000937) AND (FIREABLE(callToTask_s00005965_outputCriterion_s00000939) OR FIREABLE(callToTask_s00002190_inputCriterion_s00000937)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(callToTask_s00002189_inputCriterion_s00000937))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((FIREABLE(callToProcess_s00002538_inputCriterion_s00000937) OR FIREABLE(fork_s00001536_fire_s00000993) OR FIREABLE(callToTask_s00002189_inputCriterion_s00000937)))
lola: processed formula length: 168
lola: 45 rewrites
lola: closed formula file IBM5964-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((NOT FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(merge_s00000945_activate_s00000946) AND NOT FIREABLE(merge_s00001066_fire_s00000953)))) AND E ((FIREABLE(decision_s00001289_fire_s00000993) R NOT FIREABLE(callToTask_s00005967_inputCriterion_s00000937))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(decision_s00001289_fire_s00000993) R NOT FIREABLE(callToTask_s00005967_inputCriterion_s00000937)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E ((FIREABLE(decision_s00001289_fire_s00000993) R NOT FIREABLE(callToTask_s00005967_inputCriterion_s00000937)))
lola: processed formula length: 111
lola: 46 rewrites
lola: closed formula file IBM5964-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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(merge_s00000945_activate_s00000946) AND NOT FIREABLE(merge_s00001066_fire_s00000953))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((NOT FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(merge_s00000945_activate_s00000946) AND NOT FIREABLE(merge_s00001066_fire_s00000953)))
lola: processed formula length: 155
lola: 45 rewrites
lola: closed formula file IBM5964-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) OR FIREABLE(decision_s00001617_fire_s00000991)) AND FIREABLE(merge_s00003354_activate_s00000949)))) OR (E (X (FIREABLE(callToTask_s00005965_outputCriterion_s00000939))) OR E (F ((FIREABLE(callToProcess_s00005925_inputCriterion_s00000937) AND FIREABLE(merge_s00001369_activate_s00000946))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToProcess_s00005925_outputCriterion_s00000939) OR FIREABLE(decision_s00001617_fire_s00000991)) AND FIREABLE(merge_s00003354_activate_s00000949))))
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(callToProcess_s00005925_outputCriterion_s00000939) OR FIREABLE(decision_s00001617_fire_s00000991)) AND FIREABLE(merge_s00003354_activate_s00000949))))
lola: processed formula length: 168
lola: 45 rewrites
lola: closed formula file IBM5964-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(callToProcess_s00005925_outputCriterion_s00000939) OR FIREABLE(decision_s00001617_fire_s00000991)) AND FIREABLE(merge_s00003354_activate_s00000949))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2205 markings, 4353 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToProcess_s00005925_inputCriterion_s00000937) AND FIREABLE(merge_s00001369_activate_s00000946))))
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(callToProcess_s00005925_inputCriterion_s00000937) AND FIREABLE(merge_s00001369_activate_s00000946))))
lola: processed formula length: 117
lola: 45 rewrites
lola: closed formula file IBM5964-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(callToProcess_s00005925_inputCriterion_s00000937) AND FIREABLE(merge_s00001369_activate_s00000946))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 477 markings, 584 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(callToTask_s00005965_outputCriterion_s00000939)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(callToTask_s00005965_outputCriterion_s00000939))
lola: processed formula length: 60
lola: 45 rewrites
lola: closed formula file IBM5964-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-7 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 (X ((E (F (FIREABLE(callToTask_s00001746_inputCriterion_s00000937))) OR ((NOT FIREABLE(merge_s00001290_activate_s00000949) AND NOT FIREABLE(merge_s00001120_fire_s00000953)) OR E (F (FIREABLE(callToTask_s00005965_inputCriterion_s00000937)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((E(TRUE U FIREABLE(callToTask_s00001746_inputCriterion_s00000937)) OR ((NOT FIREABLE(merge_s00001290_activate_s00000949) AND NOT FIREABLE(merge_s00001120_fire_s00000953)) OR E(TRUE U FIREABLE(callToTask_s00005965_inputCriterion_s00000937)))))
lola: processed formula length: 245
lola: 47 rewrites
lola: closed formula file IBM5964-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: 7121 markings, 42585 edges
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-8 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 (X (E (F (FIREABLE(callToTask_s00001632_inputCriterion_s00000937)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: FIREABLE(callToTask_s00001632_inputCriterion_s00000937)
lola: processed formula length: 55
lola: 45 rewrites
lola: closed formula file IBM5964-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 /EXEF)
lola: state space: using reachability graph (EXef 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 /EXEF
lola: The predicate is unreachable from any successor.
lola: 1865 markings, 2533 edges
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((FIREABLE(callToTask_s00001632_outputCriterion_s00000939) R NOT FIREABLE(decision_s00000989_fire_s00000993))) AND E (X (A (F (NOT FIREABLE(callToTask_s00002189_outputCriterion_s00000939))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(callToTask_s00001632_outputCriterion_s00000939) R NOT FIREABLE(decision_s00000989_fire_s00000993)))
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 ((FIREABLE(callToTask_s00001632_outputCriterion_s00000939) R NOT FIREABLE(decision_s00000989_fire_s00000993)))
lola: processed formula length: 112
lola: 50 rewrites
lola: closed formula file IBM5964-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_s00000989_fire_s00000993)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: state equation: write sara problem file to IBM5964-PT-none-CTLFireability-6-0.sara
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 46 markings, 45 edges
lola: lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
state equation: calling and running sara
FORMULA IBM5964-PT-none-CTLFireability-13 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: A (G (NOT FIREABLE(callToTask_s00005970_inputCriterion_s00000937)))
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(callToTask_s00005970_inputCriterion_s00000937)))
lola: processed formula length: 67
lola: 46 rewrites
lola: closed formula file IBM5964-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(callToTask_s00005970_inputCriterion_s00000937)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLFireability-7-0.sara
sara: try reading problem file IBM5964-PT-none-CTLFireability-6-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-CTLFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-3 TRUE 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 (F (FIREABLE(fork_s00001536_fire_s00000993)))
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(fork_s00001536_fire_s00000993)
lola: processed formula length: 43
lola: 46 rewrites
lola: closed formula file IBM5964-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: 43 markings, 42 edges
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(merge_s00000945_activate_s00000948)))
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(merge_s00000945_activate_s00000948)
lola: processed formula length: 48
lola: 46 rewrites
lola: closed formula file IBM5964-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: 43 markings, 42 edges
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (NOT FIREABLE(decision_s00001616_fire_s00000991))) U (FIREABLE(callToTask_s00005969_outputCriterion_s00000939) AND FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(fork_s00001067_fire_s00000991) AND (FIREABLE(decision_s00001617_fire_s00000991) OR FIREABLE(decision_s00001288_activate_s00000990) OR (FIREABLE(merge_s00000945_activate_s00000946) AND FIREABLE(callToTask_s00005970... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(E(TRUE U NOT FIREABLE(decision_s00001616_fire_s00000991)) U (FIREABLE(callToTask_s00005969_outputCriterion_s00000939) AND FIREABLE(decision_s00001618_fire_s00000993) AND NOT FIREABLE(fork_s00001067_fire_s00000991) AND (FIREABLE(decision_s00001617_fire_s00000991) OR FIREABLE(decision_s00001288_activate_s00000990) OR (FIREABLE(merge_s00000945_activate_s00000946) AND FIREABLE(callToTask_s00005970... (shortened)
lola: processed formula length: 430
lola: 46 rewrites
lola: closed formula file IBM5964-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).
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7712 markings, 35321 edges
lola: ========================================
FORMULA IBM5964-PT-none-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(merge_s00001290_activate_s00000948) OR E (G ((NOT FIREABLE(callToTask_s00005971_outputCriterion_s00000939) AND NOT FIREABLE(merge_s00000945_fire_s00000953) AND (NOT FIREABLE(callToTask_s00002186_outputCriterion_s00000939) OR NOT FIREABLE(decision_s00000989_fire_s00000995))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown yes no unknown yes no no no no unknown no no unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 14712 KB
lola: time consumption: 714 seconds
lola: time limit reached - aborting
lola:
preliminary result: no no unknown yes no unknown yes no no no no unknown no no unknown unknown
lola:
preliminary result: no no unknown yes no unknown yes no no no no unknown no no unknown unknown
lola: memory consumption: 14712 KB
lola: time consumption: 3570 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
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="IBM5964-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/IBM5964-PT-none.tgz
mv IBM5964-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 IBM5964-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-152658630800179"
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 ;