About the Execution of LoLA for RobotManipulation-PT-00002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
230.670 | 3600000.00 | 41065.00 | 8221.30 | FFTTFFFFFFFFTFTF | 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 172K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RobotManipulation-PT-00002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685546900012
=====================================================================
--------------------
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 RobotManipulation-PT-00002-ReachabilityCardinality-00
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-01
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-02
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-03
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-04
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-05
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-06
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-07
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-08
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-09
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-10
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-11
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-12
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-13
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-14
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526892961820
info: Time: 3600 - MCC
===========================================================================================
prep: translating RobotManipulation-PT-00002 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RobotManipulation-PT-00002 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ RobotManipulation-PT-00002 @ 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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00002-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (moved <= p_m)
lola: always true
lola: LP says that atomic proposition is always true: (off <= access)
lola: LP says that atomic proposition is always true: (initialize <= p_i2)
lola: A (G (((((p_m <= initialized) OR (1 <= off)) AND (p_rel <= 2)) OR ((r_stopped <= initialized) AND (p_i1 <= moved) AND ((p_sc <= r_stopped) OR (2 <= r_active)))))) : A (G (((off <= 0) AND (moved <= 1) AND (move + 1 <= r_stopped) AND (r_moving <= 0)))) : A (G (())) : E (F ((initialize <= 1))) : A (G ((((p_i2 <= p_i1) OR (2 <= r_active)) AND ((3 <= off) OR (initialize <= r_active)) AND ((3 <= p_sc) OR (2 <= p_rel)) AND ((3 <= p_sc) OR (1 <= access))))) : A (G (((3 <= r_active) AND (p_m <= r_moving) AND (initialized <= p_rdy) AND ((p_rel <= off) OR (1 <= moved) OR (2 <= p_i2) OR (1 <= moved))))) : A (G (((moved <= p_rel) OR (2 <= p_rdy)))) : A (G (((p_m + 1 <= off) AND (3 <= r_stopped)))) : A (G (((p_sc <= 0) AND (initialized <= move) AND ((p_rel <= r_moving) OR (2 <= r_stopped) OR ((moved <= initialized) AND (1 <= p_rdy)))))) : A (G (((move <= 0) AND (initialize <= 0) AND (p_rel + 1 <= p_i1)))) : A (G (((((initialized <= p_i1) AND (1 <= r_active)) OR (move <= p_rel)) AND ((moved + 1 <= initialized) OR (moved + 1 <= p_i1))))) : A (G ((p_sc + 1 <= p_i1))) : E (F ((1 <= off))) : A (G (((access <= 0) AND (moved <= r_stopped) AND (2 <= p_i2) AND (2 <= initialize) AND ((1 <= p_i1) OR (p_rel <= initialize))))) : E (F ((1 <= off))) : A (G (()))
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:163
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: 6 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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 RobotManipulation-PT-00002-ReachabilityCardinality-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: 6 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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 RobotManipulation-PT-00002-ReachabilityCardinality-15 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: E (F ((1 <= off)))
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 ((1 <= off)))
lola: processed formula length: 18
lola: 7 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: (1 <= off)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00002-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-12 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 ((1 <= off)))
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 ((1 <= off)))
lola: processed formula length: 18
lola: 7 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: (1 <= off)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-14 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: E (F ((initialize <= 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 ((initialize <= 1)))
lola: processed formula length: 25
lola: 7 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: (initialize <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-3 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: A (G ((p_sc + 1 <= p_i1)))
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 ((p_sc + 1 <= p_i1)))
lola: processed formula length: 26
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: (p_i1 <= p_sc)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00002-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((moved <= p_rel) OR (2 <= p_rdy))))
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 (((moved <= p_rel) OR (2 <= p_rdy))))
lola: processed formula length: 43
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: ((p_rel + 1 <= moved) AND (p_rdy <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to RobotManipulation-PT-00002-ReachabilityCardinality-6-0.sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: state equation: calling and running sara
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-6 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 (((p_m + 1 <= off) AND (3 <= r_stopped))))
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 (((p_m + 1 <= off) AND (3 <= r_stopped))))
lola: processed formula length: 47
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola:
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
formula 0: ((off <= p_m) OR (r_stopped <= 2))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((move <= 0) AND (initialize <= 0) AND (p_rel + 1 <= p_i1))))
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 (((move <= 0) AND (initialize <= 0) AND (p_rel + 1 <= p_i1))))
lola: processed formula length: 67
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
sara: try reading problem file RobotManipulation-PT-00002-ReachabilityCardinality-6-0.sara.
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((off <= 0) AND (moved <= 1) AND (move + 1 <= r_stopped) AND (r_moving <= 0))))
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 (((off <= 0) AND (moved <= 1) AND (move + 1 <= r_stopped) AND (r_moving <= 0))))
lola: processed formula length: 85
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: ((1 <= off) OR (2 <= moved) OR (r_stopped <= move) OR (1 <= r_moving))
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00002-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((initialized <= p_i1) AND (1 <= r_active)) OR (move <= p_rel)) AND ((moved + 1 <= initialized) OR (moved + 1 <= p_i1)))))
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 (((((initialized <= p_i1) AND (1 <= r_active)) OR (move <= p_rel)) AND ((moved + 1 <= initialized) OR (moved + 1 <= p_i1)))))
lola: processed formula length: 132
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: ((((p_i1 + 1 <= initialized) OR (r_active <= 0)) AND (p_rel + 1 <= move)) OR ((initialized <= moved) AND (p_i1 <= moved)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00002-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-10 FALSE 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 (((access <= 0) AND (moved <= r_stopped) AND (2 <= p_i2) AND (2 <= initialize) AND ((1 <= p_i1) OR (p_rel <= initialize)))))
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 (((access <= 0) AND (moved <= r_stopped) AND (2 <= p_i2) AND (2 <= initialize) AND ((1 <= p_i1) OR (p_rel <= initialize)))))
lola: processed formula length: 130
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: ((1 <= access) OR (r_stopped + 1 <= moved) OR (p_i2 <= 1) OR (initialize <= 1) OR ((p_i1 <= 0) AND (initialize + 1 <= p_rel)))
lola: state equation: Generated DNF with 6 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to RobotManipulation-PT-00002-ReachabilityCardinality-11-0.sara
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-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: A (G (((p_sc <= 0) AND (initialized <= move) AND ((p_rel <= r_moving) OR (2 <= r_stopped) OR ((moved <= initialized) AND (1 <= p_rdy))))))
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 (((p_sc <= 0) AND (initialized <= move) AND ((p_rel <= r_moving) OR (2 <= r_stopped) OR ((moved <= initialized) AND (1 <= p_rdy))))))
lola: processed formula length: 140
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((1 <= p_sc) OR (move + 1 <= initialized) OR ((r_moving + 1 <= p_rel) AND (r_stopped <= 1) AND ((initialized + 1 <= moved) OR (p_rdy <= 0))))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-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: A (G ((((p_i2 <= p_i1) OR (2 <= r_active)) AND ((3 <= off) OR (initialize <= r_active)) AND ((3 <= p_sc) OR (2 <= p_rel)) AND ((3 <= p_sc) OR (1 <= access)))))
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 ((((p_i2 <= p_i1) OR (2 <= r_active)) AND ((3 <= off) OR (initialize <= r_active)) AND ((3 <= p_sc) OR (2 <= p_rel)) AND ((3 <= p_sc) OR (1 <= access)))))
lola: processed formula length: 163
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: (((p_i1 + 1 <= p_i2) AND (r_active <= 1)) OR ((off <= 2) AND (r_active + 1 <= initialize)) OR ((p_sc <= 2) AND (p_rel <= 1)) OR ((p_sc <= 2) AND (access <= 0)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p_m <= initialized) OR (1 <= off)) AND (p_rel <= 2)) OR ((r_stopped <= initialized) AND (p_i1 <= moved) AND ((p_sc <= r_stopped) OR (2 <= r_active))))))
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 (((((p_m <= initialized) OR (1 <= off)) AND (p_rel <= 2)) OR ((r_stopped <= initialized) AND (p_i1 <= moved) AND ((p_sc <= r_stopped) OR (2 <= r_active))))))
lola: processed formula length: 165
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 18 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((((initialized + 1 <= p_m) AND (off <= 0)) OR (3 <= p_rel)) AND ((initialized + 1 <= r_stopped) OR (moved + 1 <= p_i1) OR ((r_stopped + 1 <= p_sc) AND (r_active <= 1))))
lola: state equation: Generated DNF with 17 literals and 6 conjunctive subformulas
lola: ========================================
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= r_active) AND (p_m <= r_moving) AND (initialized <= p_rdy) AND ((p_rel <= off) OR (1 <= moved) OR (2 <= p_i2) OR (1 <= moved)))))
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 (((3 <= r_active) AND (p_m <= r_moving) AND (initialized <= p_rdy) AND ((p_rel <= off) OR (1 <= moved) OR (2 <= p_i2) OR (1 <= moved)))))
lola: processed formula length: 145
lola: 8 rewrites
lola: closed formula file RobotManipulation-PT-00002-ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((r_active <= 2) OR (r_moving + 1 <= p_m) OR (p_rdy + 1 <= initialized) OR ((off + 1 <= p_rel) AND (moved <= 0) AND (p_i2 <= 1) AND (moved <= 0)))
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00002-ReachabilityCardinality-15-0.sara
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no no no no no no no no yes no yes no
lola:
preliminary result: no no yes yes no no no no no no no no yes no yes no
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-00002-ReachabilityCardinality-15-0.sara.
lola: memory consumption: 25848 KB
lola: time consumption: 0 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="RobotManipulation-PT-00002"
export BK_EXAMINATION="ReachabilityCardinality"
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/RobotManipulation-PT-00002.tgz
mv RobotManipulation-PT-00002 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 RobotManipulation-PT-00002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r148-smll-152685546900012"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;