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 188K
-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.9K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 2.1K 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.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 3.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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-01000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547000068
=====================================================================

--------------------
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-01000-ReachabilityCardinality-00
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-01
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-02
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-03
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-04
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-05
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-06
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-07
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-08
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-09
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-10
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-11
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-12
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-13
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-14
FORMULA_NAME RobotManipulation-PT-01000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1526929154552

info: Time: 3600 - MCC
===========================================================================================
prep: translating RobotManipulation-PT-01000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RobotManipulation-PT-01000 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ RobotManipulation-PT-01000 @ 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-01000-ReachabilityCardinality.task
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (p_rel <= r_active)
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (initialized <= p_i2)
lola: LP says that atomic proposition is always true: (p_rel <= r_active)
lola: always true
lola: A (G (())) : E (F (())) : E (F (())) : E (F (((access <= 0) AND (p_rdy + 1 <= moved) AND (r_stopped <= 1)))) : A (G (((1 <= r_stopped) OR (2 <= p_m) OR ((p_sc <= p_rel) AND (1 <= r_moving))))) : A (G (())) : A (G (((1 <= p_i1) OR (2 <= p_rel) OR ((1 <= initialize) AND (2 <= moved)) OR (p_rdy <= p_i2)))) : A (G (((1 <= access) OR (1 <= p_rel) OR ((initialize <= r_active) AND (initialize <= r_active)) OR (initialized + 1 <= p_rdy)))) : A (G (((3 <= access) OR (r_stopped <= initialized) OR ((3 <= p_i2) AND (p_i1 <= off)) OR (2 <= p_rel)))) : A (G ((p_sc <= p_i1))) : A (G ((3 <= access))) : E (F ((((r_stopped <= p_sc)) AND (p_rel <= p_i2)))) : A (G (((1 <= p_i1) OR (2 <= p_i1) OR (access <= 1) OR ((2 <= initialize) AND (2 <= initialized))))) : A (G (())) : A (G (((p_i1 <= 1) OR (p_rel <= r_stopped)))) : A (G ((1 <= access)))
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: 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: 15 rewrites
lola: closed formula file RobotManipulation-PT-01000-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-01000-ReachabilityCardinality-0 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: 15 rewrites
lola: closed formula file RobotManipulation-PT-01000-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-01000-ReachabilityCardinality-1 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: 15 rewrites
lola: closed formula file RobotManipulation-PT-01000-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-01000-ReachabilityCardinality-2 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: 15 rewrites
lola: closed formula file RobotManipulation-PT-01000-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-01000-ReachabilityCardinality-5 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file RobotManipulation-PT-01000-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-01000-ReachabilityCardinality-13 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 ((3 <= 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 ((3 <= access)))
lola: processed formula length: 21
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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: (access <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-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: 7993 markings, 7992 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-10 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 ((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 ((1 <= access)))
lola: processed formula length: 21
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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: (access <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-6-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: 8001 markings, 8000 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-15 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_sc <= 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 <= p_i1)))
lola: processed formula length: 22
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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 <= p_sc)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-7-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: 2005 markings, 2004 edges

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p_i1 <= 1) OR (p_rel <= 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_i1 <= 1) OR (p_rel <= r_stopped))))
lola: processed formula length: 46
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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: ((2 <= p_i1) AND (r_stopped + 1 <= p_rel))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4031 markings, 4036 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-14 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: E (F (((access <= 0) AND (p_rdy + 1 <= moved) AND (r_stopped <= 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 (((access <= 0) AND (p_rdy + 1 <= moved) AND (r_stopped <= 1))))
lola: processed formula length: 69
lola: 16 rewrites
lola: closed formula file RobotManipulation-PT-01000-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: ((access <= 0) AND (p_rdy + 1 <= moved) AND (r_stopped <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43981 markings, 57971 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-3 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: E (F ((((r_stopped <= p_sc)) AND (p_rel <= p_i2))))
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 ((((r_stopped <= p_sc)) AND (p_rel <= p_i2))))
lola: processed formula length: 51
lola: 16 rewrites
lola: closed formula file RobotManipulation-PT-01000-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: (((r_stopped <= p_sc)) AND (p_rel <= p_i2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4001 markings, 4000 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-11 TRUE 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: A (G (((1 <= p_i1) OR (2 <= p_i1) OR (access <= 1) OR ((2 <= initialize) AND (2 <= initialized)))))
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 (((1 <= p_i1) OR (2 <= p_i1) OR (access <= 1) OR ((2 <= initialize) AND (2 <= initialized)))))
lola: processed formula length: 102
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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 <= 0) AND (p_i1 <= 1) AND (2 <= access) AND ((initialize <= 1) OR (initialized <= 1)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-11-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: 2002 markings, 2001 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= r_stopped) OR (2 <= p_m) OR ((p_sc <= p_rel) AND (1 <= r_moving)))))
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 (((1 <= r_stopped) OR (2 <= p_m) OR ((p_sc <= p_rel) AND (1 <= r_moving)))))
lola: processed formula length: 83
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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: ((r_stopped <= 0) AND (p_m <= 1) AND ((p_rel + 1 <= p_sc) OR (r_moving <= 0)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4001 markings, 4000 edges
lola:
FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-4 FALSE 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: A (G (((1 <= access) OR (1 <= p_rel) OR ((initialize <= r_active) AND (initialize <= r_active)) OR (initialized + 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 (((1 <= access) OR (1 <= p_rel) OR ((initialize <= r_active) AND (initialize <= r_active)) OR (initialized + 1 <= p_rdy))))
lola: processed formula length: 131
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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: ((access <= 0) AND (p_rel <= 0) AND ((r_active + 1 <= initialize) OR (r_active + 1 <= initialize)) AND (p_rdy <= initialized))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-ReachabilityCardinality-13-0.sara.
lola: sara is running 0 secs || 4112128 markings, 5916462 edges, 822426 markings/sec, 0 secs
lola: sara is running 5 secs || 8572055 markings, 12313371 edges, 891985 markings/sec, 5 secs
lola: sara is running 10 secs || 12928970 markings, 18576062 edges, 871383 markings/sec, 10 secs
lola: sara is running 15 secs || 17233829 markings, 24764037 edges, 860972 markings/sec, 15 secs
lola: sara is running 20 secs || 21496038 markings, 30887152 edges, 852442 markings/sec, 20 secs
lola: sara is running 25 secs || 25738960 markings, 36986237 edges, 848584 markings/sec, 25 secs
lola: sara is running 30 secs || 29969787 markings, 43069851 edges, 846165 markings/sec, 30 secs
lola: sara is running 35 secs || 33726305 markings, 48462839 edges, 751304 markings/sec, 35 secs
lola: sara is running 40 secs || 37920429 markings, 54491308 edges, 838825 markings/sec, 40 secs
lola: sara is running 45 secs || 41907532 markings, 60221888 edges, 797421 markings/sec, 45 secs
lola: sara is running 50 secs || 45961608 markings, 66049712 edges, 810815 markings/sec, 50 secs
lola: sara is running 55 secs || 50234945 markings, 72194691 edges, 854667 markings/sec, 55 secs
lola: sara is running 60 secs || 54573823 markings, 78430423 edges, 867776 markings/sec, 60 secs
lola: sara is running 65 secs || 58960784 markings, 84737624 edges, 877392 markings/sec, 65 secs
lola: sara is running 70 secs || 63401605 markings, 91119883 edges, 888164 markings/sec, 70 secs
lola: sara is running 75 secs || 67474762 markings, 96978025 edges, 814631 markings/sec, 75 secs
lola: sara is running 80 secs || 72181769 markings, 103753011 edges, 941401 markings/sec, 80 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 73344801 markings, 105433514 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p_i1) OR (2 <= p_rel) OR ((1 <= initialize) AND (2 <= moved)) OR (p_rdy <= p_i2))))
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 (((1 <= p_i1) OR (2 <= p_rel) OR ((1 <= initialize) AND (2 <= moved)) OR (p_rdy <= p_i2))))
lola: processed formula length: 99
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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 <= 0) AND (p_rel <= 1) AND ((initialize <= 0) OR (moved <= 1)) AND (p_i2 + 1 <= p_rdy))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4004 markings, 4003 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= access) OR (r_stopped <= initialized) OR ((3 <= p_i2) AND (p_i1 <= off)) OR (2 <= p_rel))))
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 <= access) OR (r_stopped <= initialized) OR ((3 <= p_i2) AND (p_i1 <= off)) OR (2 <= p_rel))))
lola: processed formula length: 107
lola: 17 rewrites
lola: closed formula file RobotManipulation-PT-01000-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: ((access <= 2) AND (initialized + 1 <= r_stopped) AND ((p_i2 <= 2) OR (off + 1 <= p_i1)) AND (p_rel <= 1))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7993 markings, 7992 edges
lola: ========================================

FORMULA RobotManipulation-PT-01000-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no yes no no no no no yes no yes no no
lola:
preliminary result: yes no no yes no yes no no no no no yes no yes no no
lola: memory consumption: 23168 KB
lola: time consumption: 87 seconds

BK_STOP 1526929242133

--------------------
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-01000"
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-01000.tgz
mv RobotManipulation-PT-01000 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-01000, 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-152685547000068"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;