About the Execution of LoLA for TriangularGrid-PT-1200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
148.640 | 476.00 | 50.00 | 2.50 | TFTTFTFFFTFFTTTF | 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 180K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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
-rwxr-xr-x 1 mcc users 9.7K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is TriangularGrid-PT-1200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743300364
=====================================================================
--------------------
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 TriangularGrid-PT-1200-ReachabilityFireability-00
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-01
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-02
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-03
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-04
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-05
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-06
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-07
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-08
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-09
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-10
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-11
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-12
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-13
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-14
FORMULA_NAME TriangularGrid-PT-1200-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527371572561
info: Time: 3600 - MCC
===========================================================================================
prep: translating TriangularGrid-PT-1200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TriangularGrid-PT-1200 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ TriangularGrid-PT-1200 @ 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: 28/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 12 transitions, 8 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 19 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-1200-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(ti1_2_1_1) OR NOT FIREABLE(t_1_0) OR NOT FIREABLE(to3_1_1) OR NOT FIREABLE(t_1_0) OR FIREABLE(t_2_1)))) : E (F ((NOT FIREABLE(ti1_3_1_1) AND NOT FIREABLE(to3_1_1) AND ((FIREABLE(to3_1_1) AND FIREABLE(ti3_1_1_1)) OR (FIREABLE(ti3_2_1_1) AND FIREABLE(ti1_3_1_1))) AND (NOT FIREABLE(ti1_3_1_1) OR NOT FIREABLE(t_1_0) OR FIREABLE(ti1_2_1_1))))) : A (G (())) : E (F ((NOT FIREABLE(ti3_1_1_1) AND NOT FIREABLE(to1_1_1) AND NOT FIREABLE(to1_1_1) AND FIREABLE(to2_1_1)))) : A (G (((NOT FIREABLE(ti3_1_1_1))))) : A (G ((FIREABLE(ti2_3_1_1) OR FIREABLE(ti3_1_1_1) OR (((FIREABLE(ti3_1_1_1) AND FIREABLE(to3_1_1)) OR NOT FIREABLE(ti2_3_1_1)) AND ((FIREABLE(t_2_1) AND FIREABLE(ti1_3_1_1)) OR NOT FIREABLE(ti3_1_1_1)))))) : E (F ((NOT FIREABLE(ti3_1_1_1) AND FIREABLE(t_1_2) AND FIREABLE(ti3_2_1_1) AND NOT FIREABLE(ti1_3_1_1) AND NOT FIREABLE(ti3_1_1_1) AND ((FIREABLE(ti1_2_1_1) AND FIREABLE(ti3_1_1_1)) OR NOT FIREABLE(to2_1_1))))) : E (F (())) : E (F ((FIREABLE(ti1_2_1_1) AND FIREABLE(ti2_3_1_1) AND (FIREABLE(to3_1_1) OR FIREABLE(ti2_3_1_1)) AND FIREABLE(ti3_1_1_1) AND FIREABLE(t_1_2)))) : A (G ((NOT FIREABLE(ti2_1_1_1) OR NOT FIREABLE(t_1_2) OR FIREABLE(ti3_1_1_1) OR (NOT FIREABLE(ti3_2_1_1) AND NOT FIREABLE(ti3_1_1_1))))) : E (F ((FIREABLE(ti1_3_1_1) AND FIREABLE(t_1_0) AND FIREABLE(t_1_2) AND (FIREABLE(to2_1_1) OR FIREABLE(to3_1_1) OR FIREABLE(t_2_1)) AND ((NOT FIREABLE(t_2_1) AND NOT FIREABLE(to3_1_1)) OR NOT FIREABLE(to2_1_1))))) : E (F (())) : A (G (())) : A (G ((NOT FIREABLE(to2_1_1) OR NOT FIREABLE(t_1_2) OR FIREABLE(ti3_1_1_1) OR FIREABLE(ti3_2_1_1)))) : E (F ((FIREABLE(t_1_0) AND NOT FIREABLE(ti3_1_1_1)))) : A (G (FIREABLE(ti3_1_1_1)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file TriangularGrid-PT-1200-ReachabilityFireability.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: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-2 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file TriangularGrid-PT-1200-ReachabilityFireability.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: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file TriangularGrid-PT-1200-ReachabilityFireability.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: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-11 FALSE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file TriangularGrid-PT-1200-ReachabilityFireability.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: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-12 TRUE 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 (((NOT FIREABLE(ti3_1_1_1)))))
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(ti3_1_1_1)))))
lola: processed formula length: 35
lola: 14 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(ti3_1_1_1)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-1200-ReachabilityFireability-4-0.sara
lola: 3 markings, 2 edges
lola: state equation: calling and running sara
lola:
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-4 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: A (G (FIREABLE(ti3_1_1_1)))
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 (FIREABLE(ti3_1_1_1)))
lola: processed formula length: 27
lola: 14 rewrites
lola: closed formula file TriangularGrid-PT-1200-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: NOT FIREABLE(ti3_1_1_1)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_1_0) AND NOT FIREABLE(ti3_1_1_1))))
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(t_1_0) AND NOT FIREABLE(ti3_1_1_1))))
lola: processed formula length: 53
lola: 13 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(t_1_0) AND NOT FIREABLE(ti3_1_1_1))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-14 TRUE 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 ((NOT FIREABLE(ti3_1_1_1) AND NOT FIREABLE(to1_1_1) AND NOT FIREABLE(to1_1_1) AND FIREABLE(to2_1_1))))
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(ti3_1_1_1) AND NOT FIREABLE(to1_1_1) AND NOT FIREABLE(to1_1_1) AND FIREABLE(to2_1_1))))
lola: processed formula length: 107
lola: 13 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(ti3_1_1_1) AND NOT FIREABLE(to1_1_1) AND NOT FIREABLE(to1_1_1) AND FIREABLE(to2_1_1))
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-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 (G ((NOT FIREABLE(to2_1_1) OR NOT FIREABLE(t_1_2) OR FIREABLE(ti3_1_1_1) OR FIREABLE(ti3_2_1_1))))
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(to2_1_1) OR NOT FIREABLE(t_1_2) OR FIREABLE(ti3_1_1_1) OR FIREABLE(ti3_2_1_1))))
lola: processed formula length: 103
lola: 14 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(to2_1_1) AND FIREABLE(t_1_2) AND NOT FIREABLE(ti3_1_1_1) AND NOT FIREABLE(ti3_2_1_1))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-1200-ReachabilityFireability-8-0.sara
sara: try reading problem file TriangularGrid-PT-1200-ReachabilityFireability-4-0.sara.
lola: state equation: calling and running sara
sara: sara: place or transition ordering is non-deterministic
try reading problem file TriangularGrid-PT-1200-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-13 TRUE 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 (G ((NOT FIREABLE(ti1_2_1_1) OR NOT FIREABLE(t_1_0) OR NOT FIREABLE(to3_1_1) OR NOT FIREABLE(t_1_0) OR FIREABLE(t_2_1))))
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(ti1_2_1_1) OR NOT FIREABLE(t_1_0) OR NOT FIREABLE(to3_1_1) OR NOT FIREABLE(t_1_0) OR FIREABLE(t_2_1))))
lola: processed formula length: 127
lola: 14 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(ti1_2_1_1) AND FIREABLE(t_1_0) AND FIREABLE(to3_1_1) AND FIREABLE(t_1_0) AND NOT FIREABLE(t_2_1))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-1200-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-1200-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-0 TRUE 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: A (G ((NOT FIREABLE(ti2_1_1_1) OR NOT FIREABLE(t_1_2) OR FIREABLE(ti3_1_1_1) OR (NOT FIREABLE(ti3_2_1_1) AND NOT FIREABLE(ti3_1_1_1)))))
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(ti2_1_1_1) OR NOT FIREABLE(t_1_2) OR FIREABLE(ti3_1_1_1) OR (NOT FIREABLE(ti3_2_1_1) AND NOT FIREABLE(ti3_1_1_1)))))
lola: processed formula length: 139
lola: 14 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(ti2_1_1_1) AND FIREABLE(t_1_2) AND NOT FIREABLE(ti3_1_1_1) AND (FIREABLE(ti3_2_1_1) OR FIREABLE(ti3_1_1_1)))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-9 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: A (G ((FIREABLE(ti2_3_1_1) OR FIREABLE(ti3_1_1_1) OR (((FIREABLE(ti3_1_1_1) AND FIREABLE(to3_1_1)) OR NOT FIREABLE(ti2_3_1_1)) AND ((FIREABLE(t_2_1) AND FIREABLE(ti1_3_1_1)) OR NOT FIREABLE(ti3_1_1_1))))))
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 ((FIREABLE(ti2_3_1_1) OR FIREABLE(ti3_1_1_1) OR (((FIREABLE(ti3_1_1_1) AND FIREABLE(to3_1_1)) OR NOT FIREABLE(ti2_3_1_1)) AND ((FIREABLE(t_2_1) AND FIREABLE(ti1_3_1_1)) OR NOT FIREABLE(ti3_1_1_1))))))
lola: processed formula length: 209
lola: 14 rewrites
lola: closed formula file TriangularGrid-PT-1200-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: (NOT FIREABLE(ti2_3_1_1) AND NOT FIREABLE(ti3_1_1_1) AND (((NOT FIREABLE(ti3_1_1_1) OR NOT FIREABLE(to3_1_1)) AND FIREABLE(ti2_3_1_1)) OR ((NOT FIREABLE(t_2_1) OR NOT FIREABLE(ti1_3_1_1)) AND FIREABLE(ti3_1_1_1))))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-5 TRUE 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(ti1_2_1_1) AND FIREABLE(ti2_3_1_1) AND (FIREABLE(to3_1_1) OR FIREABLE(ti2_3_1_1)) AND FIREABLE(ti3_1_1_1) AND FIREABLE(t_1_2))))
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(ti1_2_1_1) AND FIREABLE(ti2_3_1_1) AND (FIREABLE(to3_1_1) OR FIREABLE(ti2_3_1_1)) AND FIREABLE(ti3_1_1_1) AND FIREABLE(t_1_2))))
lola: processed formula length: 145
lola: 13 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(ti1_2_1_1) AND FIREABLE(ti2_3_1_1) AND (FIREABLE(to3_1_1) OR FIREABLE(ti2_3_1_1)) AND FIREABLE(ti3_1_1_1) AND FIREABLE(t_1_2))
lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-1200-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-1200-ReachabilityFireability-12-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 TriangularGrid-PT-1200-ReachabilityFireability-8 FALSE 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: E (F ((FIREABLE(ti1_3_1_1) AND FIREABLE(t_1_0) AND FIREABLE(t_1_2) AND (FIREABLE(to2_1_1) OR FIREABLE(to3_1_1) OR FIREABLE(t_2_1)) AND ((NOT FIREABLE(t_2_1) AND NOT FIREABLE(to3_1_1)) OR NOT FIREABLE(to2_1_1)))))
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(ti1_3_1_1) AND FIREABLE(t_1_0) AND FIREABLE(t_1_2) AND (FIREABLE(to2_1_1) OR FIREABLE(to3_1_1) OR FIREABLE(t_2_1)) AND ((NOT FIREABLE(t_2_1) AND NOT FIREABLE(to3_1_1)) OR NOT FIREABLE(to2_1_1)))))
lola: processed formula length: 215
lola: 13 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(ti1_3_1_1) AND FIREABLE(t_1_0) AND FIREABLE(t_1_2) AND (FIREABLE(to2_1_1) OR FIREABLE(to3_1_1) OR FIREABLE(t_2_1)) AND ((NOT FIREABLE(t_2_1) AND NOT FIREABLE(to3_1_1)) OR NOT FIREABLE(to2_1_1)))
lola: state equation: Generated DNF with 76 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-1200-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-1200-ReachabilityFireability-13-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 TriangularGrid-PT-1200-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ti3_1_1_1) AND FIREABLE(t_1_2) AND FIREABLE(ti3_2_1_1) AND NOT FIREABLE(ti1_3_1_1) AND NOT FIREABLE(ti3_1_1_1) AND ((FIREABLE(ti1_2_1_1) AND FIREABLE(ti3_1_1_1)) OR NOT FIREABLE(to2_1_1)))))
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(ti3_1_1_1) AND FIREABLE(t_1_2) AND FIREABLE(ti3_2_1_1) AND NOT FIREABLE(ti1_3_1_1) AND NOT FIREABLE(ti3_1_1_1) AND ((FIREABLE(ti1_2_1_1) AND FIREABLE(ti3_1_1_1)) OR NOT FIREABLE(to2_1_1)))))
lola: processed formula length: 211
lola: 13 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(ti3_1_1_1) AND FIREABLE(t_1_2) AND FIREABLE(ti3_2_1_1) AND NOT FIREABLE(ti1_3_1_1) AND NOT FIREABLE(ti3_1_1_1) AND ((FIREABLE(ti1_2_1_1) AND FIREABLE(ti3_1_1_1)) OR NOT FIREABLE(to2_1_1)))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ti1_3_1_1) AND NOT FIREABLE(to3_1_1) AND ((FIREABLE(to3_1_1) AND FIREABLE(ti3_1_1_1)) OR (FIREABLE(ti3_2_1_1) AND FIREABLE(ti1_3_1_1))) AND (NOT FIREABLE(ti1_3_1_1) OR NOT FIREABLE(t_1_0) OR FIREABLE(ti1_2_1_1)))))
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(ti1_3_1_1) AND NOT FIREABLE(to3_1_1) AND ((FIREABLE(to3_1_1) AND FIREABLE(ti3_1_1_1)) OR (FIREABLE(ti3_2_1_1) AND FIREABLE(ti1_3_1_1))) AND (NOT FIREABLE(ti1_3_1_1) OR NOT FIREABLE(t_1_0) OR FIREABLE(ti1_2_1_1)))))
lola: processed formula length: 237
lola: 13 rewrites
lola: closed formula file TriangularGrid-PT-1200-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(ti1_3_1_1) AND NOT FIREABLE(to3_1_1) AND ((FIREABLE(to3_1_1) AND FIREABLE(ti3_1_1_1)) OR (FIREABLE(ti3_2_1_1) AND FIREABLE(ti1_3_1_1))) AND (NOT FIREABLE(ti1_3_1_1) OR NOT FIREABLE(t_1_0) OR FIREABLE(ti1_2_1_1)))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola:
FORMULA TriangularGrid-PT-1200-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes no yes no no no yes no no yes yes yes no
lola:
preliminary result: yes no yes yes no yes no no no yes no no yes yes yes no
========================================
lola: memory consumption: 14724 KB
lola: time consumption: 1 seconds
BK_STOP 1527371573037
--------------------
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="TriangularGrid-PT-1200"
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/TriangularGrid-PT-1200.tgz
mv TriangularGrid-PT-1200 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 TriangularGrid-PT-1200, 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 r172-smll-152708743300364"
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 ;