About the Execution of LoLA for DES-PT-10a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 668.070 | 48043.00 | 97034.00 | 249.60 | FTTF?TFFFTTFTFTT | 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 208K
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 43K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-10a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380100217
=====================================================================
--------------------
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 DES-PT-10a-ReachabilityFireability-00
FORMULA_NAME DES-PT-10a-ReachabilityFireability-01
FORMULA_NAME DES-PT-10a-ReachabilityFireability-02
FORMULA_NAME DES-PT-10a-ReachabilityFireability-03
FORMULA_NAME DES-PT-10a-ReachabilityFireability-04
FORMULA_NAME DES-PT-10a-ReachabilityFireability-05
FORMULA_NAME DES-PT-10a-ReachabilityFireability-06
FORMULA_NAME DES-PT-10a-ReachabilityFireability-07
FORMULA_NAME DES-PT-10a-ReachabilityFireability-08
FORMULA_NAME DES-PT-10a-ReachabilityFireability-09
FORMULA_NAME DES-PT-10a-ReachabilityFireability-10
FORMULA_NAME DES-PT-10a-ReachabilityFireability-11
FORMULA_NAME DES-PT-10a-ReachabilityFireability-12
FORMULA_NAME DES-PT-10a-ReachabilityFireability-13
FORMULA_NAME DES-PT-10a-ReachabilityFireability-14
FORMULA_NAME DES-PT-10a-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1526597971450
info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-10a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DES-PT-10a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-10a @ 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: 267/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 155
lola: finding significant places
lola: 155 places, 112 transitions, 96 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-10a-ReachabilityFireability.task
lola: E (F ((FIREABLE(t8) AND NOT FIREABLE(t97) AND FIREABLE(t78) AND FIREABLE(t16) AND (FIREABLE(t105) OR FIREABLE(t104)) AND FIREABLE(t30) AND FIREABLE(t33) AND NOT FIREABLE(t37) AND FIREABLE(t30) AND FIREABLE(t94) AND NOT FIREABLE(t9)))) : E (F ((((FIREABLE(t21) AND FIREABLE(t27)) OR NOT FIREABLE(t20)) AND FIREABLE(t44) AND NOT FIREABLE(t101)))) : E (F (FIREABLE(t21))) : A (G (NOT FIREABLE(t27))) : E (F (FIREABLE(t26))) : E (F ((FIREABLE(t43) AND NOT FIREABLE(t34) AND ((FIREABLE(t23) AND FIREABLE(t65)) OR (FIREABLE(t45) AND FIREABLE(t50))) AND FIREABLE(t87)))) : E (F ((NOT FIREABLE(t1) AND ((FIREABLE(t80) AND FIREABLE(t6)) OR (FIREABLE(t74) AND FIREABLE(t49))) AND FIREABLE(t38) AND FIREABLE(t77) AND (FIREABLE(t21) OR FIREABLE(t53)) AND NOT FIREABLE(t10)))) : A (G ((NOT FIREABLE(t102) OR NOT FIREABLE(t33) OR FIREABLE(t35) OR (FIREABLE(t47) AND FIREABLE(t33))))) : A (G (NOT FIREABLE(t72))) : E (F (FIREABLE(t72))) : E (F (FIREABLE(t63))) : A (G (((NOT FIREABLE(t78) AND NOT FIREABLE(t98) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t0))) OR NOT FIREABLE(t21)))) : E (F ((FIREABLE(t102) AND (FIREABLE(t68) OR (NOT FIREABLE(t24) AND NOT FIREABLE(t11)))))) : E (F ((FIREABLE(t2) AND FIREABLE(t111) AND NOT FIREABLE(t110) AND FIREABLE(t57) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t36)) AND FIREABLE(t104)))) : E (F ((FIREABLE(t1) AND (NOT FIREABLE(t74) OR NOT FIREABLE(t65)) AND NOT FIREABLE(t0)))) : E (F ((FIREABLE(t71) AND (FIREABLE(t65) OR FIREABLE(t27)) AND FIREABLE(t67) AND FIREABLE(t52) AND (FIREABLE(t19) OR FIREABLE(t57)) AND FIREABLE(t43))))
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(t21)))
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(t21)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t21)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10a-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t27)))
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:694
lola: processed formula: A (G (NOT FIREABLE(t27)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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:694
lola: formula 0: FIREABLE(t27)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10a-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-3 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: E (F (FIREABLE(t26)))
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(t26)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t26)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10a-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================FORMULA DES-PT-10a-ReachabilityFireability-4 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: A (G (NOT FIREABLE(t72)))
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:694
lola: processed formula: A (G (NOT FIREABLE(t72)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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:694
lola: formula 0: FIREABLE(t72)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-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: E (F (FIREABLE(t72)))
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(t72)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t72)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-9 TRUE 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 (FIREABLE(t63)))
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(t63)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t63)
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: 12 markings, 11 edges
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-5-0.sara
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t102) OR NOT FIREABLE(t33) OR FIREABLE(t35) OR (FIREABLE(t47) AND FIREABLE(t33)))))
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:694
lola: processed formula: A (G ((NOT FIREABLE(t102) OR NOT FIREABLE(t33) OR FIREABLE(t35) OR (FIREABLE(t47) AND FIREABLE(t33)))))
lola: processed formula length: 106
lola: 2 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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)
sara: try reading problem file DES-PT-10a-ReachabilityFireability-5-0.sara.
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:694
lola: formula 0: (FIREABLE(t102) AND FIREABLE(t33) AND NOT FIREABLE(t35) AND (NOT FIREABLE(t47) OR NOT FIREABLE(t33)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10a-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1979 markings, 3139 edges
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-7 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 (F ((FIREABLE(t102) AND (FIREABLE(t68) OR (NOT FIREABLE(t24) AND NOT FIREABLE(t11))))))
lola: sara: place or transition ordering is non-deterministic
========================================
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(t102) AND (FIREABLE(t68) OR (NOT FIREABLE(t24) AND NOT FIREABLE(t11))))))
lola: processed formula length: 90
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t102) AND (FIREABLE(t68) OR (NOT FIREABLE(t24) AND NOT FIREABLE(t11))))
lola: state equation: Generated DNF with 28 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-7-0.sara
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-12 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: E (F ((FIREABLE(t1) AND (NOT FIREABLE(t74) OR NOT FIREABLE(t65)) AND NOT FIREABLE(t0))))
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(t1) AND (NOT FIREABLE(t74) OR NOT FIREABLE(t65)) AND NOT FIREABLE(t0))))
lola: processed formula length: 89
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t1) AND (NOT FIREABLE(t74) OR NOT FIREABLE(t65)) AND NOT FIREABLE(t0))
lola: state equation: Generated DNF with 80 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t21) AND FIREABLE(t27)) OR NOT FIREABLE(t20)) AND FIREABLE(t44) AND NOT FIREABLE(t101))))
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(t21) AND FIREABLE(t27)) OR NOT FIREABLE(t20)) AND FIREABLE(t44) AND NOT FIREABLE(t101))))
lola: processed formula length: 108
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t21) AND FIREABLE(t27)) OR NOT FIREABLE(t20)) AND FIREABLE(t44) AND NOT FIREABLE(t101))
lola: state equation: Generated DNF with 38 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
FORMULA DES-PT-10a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t78) AND NOT FIREABLE(t98) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t0))) OR NOT FIREABLE(t21))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file DES-PT-10a-ReachabilityFireability-9-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(t78) AND NOT FIREABLE(t98) AND (NOT FIREABLE(t38) OR NOT FIREABLE(t0))) OR NOT FIREABLE(t21))))
lola: processed formula length: 118
lola: 2 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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
sara: try reading problem file DES-PT-10a-ReachabilityFireability-8-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(t78) OR FIREABLE(t98) OR (FIREABLE(t38) AND FIREABLE(t0))) AND FIREABLE(t21))
lola: state equation: Generated DNF with 14 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file DES-PT-10a-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-11 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: E (F ((FIREABLE(t2) AND FIREABLE(t111) AND NOT FIREABLE(t110) AND FIREABLE(t57) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t36)) AND FIREABLE(t104))))
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(t2) AND FIREABLE(t111) AND NOT FIREABLE(t110) AND FIREABLE(t57) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t36)) AND FIREABLE(t104))))
lola: processed formula length: 146
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t2) AND FIREABLE(t111) AND NOT FIREABLE(t110) AND FIREABLE(t57) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t36)) AND FIREABLE(t104))
lola: state equation: Generated DNF with 60 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10a-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-13 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 (F ((FIREABLE(t43) AND NOT FIREABLE(t34) AND ((FIREABLE(t23) AND FIREABLE(t65)) OR (FIREABLE(t45) AND FIREABLE(t50))) AND FIREABLE(t87))))
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(t43) AND NOT FIREABLE(t34) AND ((FIREABLE(t23) AND FIREABLE(t65)) OR (FIREABLE(t45) AND FIREABLE(t50))) AND FIREABLE(t87))))
lola: processed formula length: 141
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t43) AND NOT FIREABLE(t34) AND ((FIREABLE(t23) AND FIREABLE(t65)) OR (FIREABLE(t45) AND FIREABLE(t50))) AND FIREABLE(t87))
lola: state equation: Generated DNF with 36 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 143948 markings, 257657 edges
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t71) AND (FIREABLE(t65) OR FIREABLE(t27)) AND FIREABLE(t67) AND FIREABLE(t52) AND (FIREABLE(t19) OR FIREABLE(t57)) AND FIREABLE(t43))))
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(t71) AND (FIREABLE(t65) OR FIREABLE(t27)) AND FIREABLE(t67) AND FIREABLE(t52) AND (FIREABLE(t19) OR FIREABLE(t57)) AND FIREABLE(t43))))
lola: processed formula length: 153
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t71) AND (FIREABLE(t65) OR FIREABLE(t27)) AND FIREABLE(t67) AND FIREABLE(t52) AND (FIREABLE(t19) OR FIREABLE(t57)) AND FIREABLE(t43))
lola: state equation: Generated DNF with 54 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10a-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1490106 markings, 2963781 edges, 298021 markings/sec, 0 secs
lola: sara is running 5 secs || 2911784 markings, 5838559 edges, 284336 markings/sec, 5 secs
lola: sara is running 10 secs || 4310393 markings, 8612708 edges, 279722 markings/sec, 10 secs
lola: sara is running 15 secs || 5715792 markings, 11442676 edges, 281080 markings/sec, 15 secs
lola: sara is running 20 secs || 7112371 markings, 14206632 edges, 279316 markings/sec, 20 secs
lola: sara is running 25 secs || 8507127 markings, 17007044 edges, 278951 markings/sec, 25 secs
lola: sara is running 30 secs || 9778756 markings, 19500997 edges, 254326 markings/sec, 30 secs
lola: sara is running 35 secs || 11171972 markings, 22186833 edges, 278643 markings/sec, 35 secs
lola: sara is running 40 secs || 12574005 markings, 25041320 edges, 280407 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12786284 markings, 25460438 edges
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1) AND ((FIREABLE(t80) AND FIREABLE(t6)) OR (FIREABLE(t74) AND FIREABLE(t49))) AND FIREABLE(t38) AND FIREABLE(t77) AND (FIREABLE(t21) OR FIREABLE(t53)) AND NOT FIREABLE(t10))))
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 ((NOT FIREABLE(t1) AND ((FIREABLE(t80) AND FIREABLE(t6)) OR (FIREABLE(t74) AND FIREABLE(t49))) AND FIREABLE(t38) AND FIREABLE(t77) AND (FIREABLE(t21) OR FIREABLE(t53)) AND NOT FIREABLE(t10))))
lola: processed formula length: 199
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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: (NOT FIREABLE(t1) AND ((FIREABLE(t80) AND FIREABLE(t6)) OR (FIREABLE(t74) AND FIREABLE(t49))) AND FIREABLE(t38) AND FIREABLE(t77) AND (FIREABLE(t21) OR FIREABLE(t53)) AND NOT FIREABLE(t10))
lola: state equation: Generated DNF with 368 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-10a-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t8) AND NOT FIREABLE(t97) AND FIREABLE(t78) AND FIREABLE(t16) AND (FIREABLE(t105) OR FIREABLE(t104)) AND FIREABLE(t30) AND FIREABLE(t33) AND NOT FIREABLE(t37) AND FIREABLE(t30) AND FIREABLE(t94) AND NOT FIREABLE(t9))))
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(t8) AND NOT FIREABLE(t97) AND FIREABLE(t78) AND FIREABLE(t16) AND (FIREABLE(t105) OR FIREABLE(t104)) AND FIREABLE(t30) AND FIREABLE(t33) AND NOT FIREABLE(t37) AND FIREABLE(t30) AND FIREABLE(t94) AND NOT FIREABLE(t9))))
lola: processed formula length: 235
lola: 1 rewrites
lola: closed formula file DES-PT-10a-ReachabilityFireability.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(t8) AND NOT FIREABLE(t97) AND FIREABLE(t78) AND FIREABLE(t16) AND (FIREABLE(t105) OR FIREABLE(t104)) AND FIREABLE(t30) AND FIREABLE(t33) AND NOT FIREABLE(t37) AND FIREABLE(t30) AND FIREABLE(t94) AND NOT FIREABLE(t9))
lola: state equation: Generated DNF with 80 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-10a-ReachabilityFireability-15-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: 412 markings, 618 edges
lola: ========================================
FORMULA DES-PT-10a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes no no no yes yes no yes no yes yes
lola:
preliminary result: no yes yes no yes yes no no no yes yes no yes no yes yes
lola: memory consumption: 14848 KB
lola: time consumption: 48 seconds
BK_STOP 1526598019493
--------------------
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="DES-PT-10a"
export BK_EXAMINATION="ReachabilityFireability"
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/DES-PT-10a.tgz
mv DES-PT-10a 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 DES-PT-10a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r052-smll-152646380100217"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 ;