About the Execution of LoLA for RobotManipulation-PT-02000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6513.690 | 3600000.00 | 167047.00 | 7031.90 | FFTTFTTFTFTFFFTF | 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 184K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 12K 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 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.6K 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 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.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RobotManipulation-PT-02000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547000073
=====================================================================
--------------------
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-02000-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-02000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526929329822
info: Time: 3600 - MCC
===========================================================================================
prep: translating RobotManipulation-PT-02000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RobotManipulation-PT-02000 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RobotManipulation-PT-02000 @ 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-02000-CTLCardinality.task
lola: LP says that atomic proposition is always true: (off <= access)
lola: always true
lola: LP says that atomic proposition is always true: (move <= r_active)
lola: LP says that atomic proposition is always true: (off <= r_active)
lola: E (((((3 <= r_active) AND (3 <= access)) OR (r_active <= p_rel)) U FALSE)) : (A (G (A (G ((initialize <= p_i1))))) AND ((p_m <= r_stopped) OR (initialize <= 1))) : NOT(A (G (((moved <= 2) OR (p_rdy + 1 <= off))))) : (E ((((r_active <= access) AND (off <= moved)) U (p_i1 <= r_moving))) AND (2 <= p_i1)) : (E ((((2 <= p_rel) OR (1 <= p_m)) U (p_i2 <= p_i1))) AND (NOT(A (G (TRUE))) OR (E (G ((p_i1 <= initialized))) AND (p_rdy <= p_sc)))) : E (F ((access <= p_i2))) : A ((((p_rel <= p_i2) OR (3 <= p_m) OR (r_stopped <= 2)) U E (F ((p_i1 <= p_rdy))))) : E ((A (F ((p_rdy <= p_rel))) U A (F ((2 <= p_rel))))) : (E ((((move <= p_rel) AND (r_stopped <= off)) U ((1 <= access) AND (initialized <= moved)))) AND NOT((A (G ((initialized <= p_i1))) OR A (G ((2 <= initialized)))))) : A (F ((E (F ((initialize <= p_i1))) AND A (G ((2 <= p_i1)))))) : E (F ((A (F (TRUE)) AND A (F ((p_i1 <= initialized)))))) : A (G (E (((3 <= access) U (r_active <= p_rdy))))) : ((((3 <= p_i2) OR (2 <= p_m)) AND A (F (((p_rdy <= initialize) AND (1 <= r_moving))))) OR (A (G ((2 <= r_stopped))) OR A (F (((3 <= move) AND (p_m <= p_rel)))))) : NOT(A (G (((p_rdy <= initialize) OR (3 <= r_active) OR (p_rdy <= 2))))) : NOT(NOT((E (F ((2 <= off))) AND A (F ((1 <= initialized)))))) : (NOT(E (F ((access + 1 <= p_sc)))) AND E (((3 <= p_sc) U ((r_moving <= p_rel)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 45 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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-02000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((access <= 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 ((access <= p_i2)))
lola: processed formula length: 24
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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 <= p_i2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-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: 4001 markings, 4000 edges
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-5 TRUE 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 ((p_i1 <= p_rdy)))
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 ((p_i1 <= p_rdy)))
lola: processed formula length: 23
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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: (p_i1 <= p_rdy)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-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: 4002 markings, 4001 edges
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p_i1 <= initialized)))
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 ((p_i1 <= initialized)))
lola: processed formula length: 29
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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: (p_i1 <= initialized)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-02000-CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4002 markings, 4001 edges
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-10 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 (((3 <= moved) AND (off <= p_rdy))))
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 (((3 <= moved) AND (off <= p_rdy))))
lola: processed formula length: 41
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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: ((3 <= moved) AND (off <= p_rdy))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola:
FORMULA RobotManipulation-PT-02000-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-4-0.sara
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((initialize + 1 <= p_rdy) AND (r_active <= 2) AND (3 <= p_rdy))))
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 <= p_rdy) AND (r_active <= 2) AND (3 <= p_rdy))))
lola: processed formula length: 72
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: ========================================
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 <= p_rdy) AND (r_active <= 2) AND (3 <= p_rdy))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-02000-CTLCardinality-5-0.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-13 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 (E (((3 <= access) U (r_active <= p_rdy)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(E((3 <= access) U (r_active <= p_rdy)))))
lola: processed formula length: 58
lola: 47 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3930224 markings, 5903408 edges, 786045 markings/sec, 0 secs
lola: 7770381 markings, 11662509 edges, 768031 markings/sec, 5 secs
lola: 11475967 markings, 17220201 edges, 741117 markings/sec, 10 secs
lola: 15107547 markings, 22667406 edges, 726316 markings/sec, 15 secs
lola: 18702723 markings, 28059619 edges, 719035 markings/sec, 20 secs
lola: 22247874 markings, 33377707 edges, 709030 markings/sec, 25 secs
lola: 25743502 markings, 38619508 edges, 699126 markings/sec, 30 secs
lola: 29178773 markings, 43772792 edges, 687054 markings/sec, 35 secs
lola: 32580063 markings, 48874061 edges, 680258 markings/sec, 40 secs
lola: 35945339 markings, 53921804 edges, 673055 markings/sec, 45 secs
lola: 39261009 markings, 58895391 edges, 663134 markings/sec, 50 secs
lola: 42551566 markings, 63830038 edges, 658111 markings/sec, 55 secs
lola: 45819830 markings, 68732137 edges, 653653 markings/sec, 60 secs
lola: 48019972 markings, 72033962 edges, 440028 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 48019972 markings, 72049950 edges
FORMULA RobotManipulation-PT-02000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((initialize <= p_i1))) AND A (G ((2 <= p_i1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (E(TRUE U (initialize <= p_i1)) AND NOT(E(TRUE U (p_i1 <= 1)))))
lola: processed formula length: 73
lola: 49 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20011 markings, 82027 edges
FORMULA RobotManipulation-PT-02000-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((p_rdy <= p_rel))) U A (F ((2 <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(A(TRUE U (p_rdy <= p_rel)) U A(TRUE U (2 <= p_rel)))
lola: processed formula length: 54
lola: 48 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1542955 markings, 7590763 edges, 308591 markings/sec, 0 secs
lola: 2938402 markings, 14567998 edges, 279089 markings/sec, 5 secs
lola: 4300795 markings, 21379961 edges, 272479 markings/sec, 10 secs
lola: 5628132 markings, 28016645 edges, 265467 markings/sec, 15 secs
lola: 6947297 markings, 34612469 edges, 263833 markings/sec, 20 secs
lola: 8253168 markings, 41141826 edges, 261174 markings/sec, 25 secs
lola: 9530847 markings, 47530219 edges, 255536 markings/sec, 30 secs
lola: 10806087 markings, 53906421 edges, 255048 markings/sec, 35 secs
lola: 12068407 markings, 60218022 edges, 252464 markings/sec, 40 secs
lola: 13352783 markings, 66639902 edges, 256875 markings/sec, 45 secs
lola: 14621511 markings, 72983540 edges, 253746 markings/sec, 50 secs
lola: 15921168 markings, 79481824 edges, 259931 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 16048004 markings, 80116007 edges
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= off))) AND A (F ((1 <= initialized))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= initialized)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (initialized <= 0)
lola: processed formula length: 18
lola: 47 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 4002 markings, 4001 edges
lola: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= 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 ((2 <= off)))
lola: processed formula length: 18
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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: yes
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (2 <= off)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-02000-CTLCardinality-10-0.sara.
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((initialize <= p_i1))) AND ((p_m <= r_stopped) OR (initialize <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_m <= r_stopped) OR (initialize <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_m <= r_stopped) OR (initialize <= 1))
lola: processed formula length: 42
lola: 45 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((initialize <= 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 ((initialize <= p_i1)))
lola: processed formula length: 28
lola: 47 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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 <= initialize)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p_sc <= access))) AND E (((3 <= p_sc) U ((r_moving <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_sc <= 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:695
lola: processed formula: A (G ((p_sc <= access)))
lola: processed formula length: 24
lola: 47 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (access + 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-02000-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-02000-CTLCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8005 markings, 8004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((r_active <= access) AND (off <= moved)) U (p_i1 <= r_moving))) AND (2 <= p_i1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p_i1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_i1)
lola: processed formula length: 11
lola: 45 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((r_active <= access) AND (off <= moved)) U (p_i1 <= r_moving)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((r_active <= access) AND (off <= moved)) U (p_i1 <= r_moving)))
lola: processed formula length: 68
lola: 48 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (p_i1 <= r_moving)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-02000-CTLCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 4001 markings, 4000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((2 <= p_rel) OR (1 <= p_m)) U (p_i2 <= p_i1))) AND (E (G ((p_i1 <= initialized))) AND (p_rdy <= p_sc)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_rdy <= p_sc)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_rdy <= p_sc)
lola: processed formula length: 15
lola: 45 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p_i1 <= initialized)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p_i1 <= initialized)))
lola: processed formula length: 29
lola: 45 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((3 <= p_i2) OR (2 <= p_m)) AND A (F (((p_rdy <= initialize) AND (1 <= r_moving))))) OR (A (G ((2 <= r_stopped))) OR A (F (((3 <= move) AND (p_m <= p_rel))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= 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 ((2 <= r_stopped)))
lola: processed formula length: 24
lola: 47 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-02000-CTLCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7999 markings, 7998 edges
lola: ========================================
lola: subprocess 15 will run for 3436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p_i2) OR (2 <= p_m))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p_i2) OR (2 <= p_m))
lola: processed formula length: 28
lola: 45 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((move <= p_rel) AND (r_stopped <= off)) U ((1 <= access) AND (initialized <= moved)))) AND (E (F ((p_i1 + 1 <= initialized))) AND E (F ((initialized <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((initialized <= 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 ((initialized <= 1)))
lola: processed formula length: 26
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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: (initialized <= 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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((move <= p_rel) AND (r_stopped <= off)) U ((1 <= access) AND (initialized <= moved))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((move <= p_rel) AND (r_stopped <= off)) U ((1 <= access) AND (initialized <= moved))))
lola: processed formula length: 91
lola: 48 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: formula 0: ((1 <= access) AND (initialized <= moved))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-17-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((3 <= p_i2) OR (2 <= p_m)) AND A (F (((p_rdy <= initialize) AND (1 <= r_moving))))) OR (A (G ((2 <= r_stopped))) OR A (F (((3 <= move) AND (p_m <= p_rel))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= 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 ((2 <= r_stopped)))
lola: processed formula length: 24
lola: 47 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-02000-CTLCardinality-16-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7999 markings, 7998 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((3 <= p_i2) OR (2 <= p_m))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p_i2) OR (2 <= p_m))
lola: processed formula length: 28
lola: 45 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= move) AND (p_m <= p_rel))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((move <= 2) OR (p_rel + 1 <= p_m))
lola: processed formula length: 36
lola: 47 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 16006 markings, 16006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E ((((move <= p_rel) AND (r_stopped <= off)) U ((1 <= access) AND (initialized <= moved)))) AND (E (F ((p_i1 + 1 <= initialized))) AND E (F ((initialized <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((initialized <= 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 ((initialized <= 1)))
lola: processed formula length: 26
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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: (initialized <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-17-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: lola: The predicate is reachable.
lola: 0 markings, 0 edges
state equation: calling and running saralola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((p_i1 + 1 <= initialized)))
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 ((p_i1 + 1 <= initialized)))
lola: processed formula length: 33
lola: 46 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.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: (p_i1 + 1 <= initialized)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-02000-CTLCardinality-18-0.sara
sara: try reading problem file RobotManipulation-PT-02000-CTLCardinality-17-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4003 markings, 4002 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((move <= p_rel) AND (r_stopped <= off)) U ((1 <= access) AND (initialized <= moved))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((move <= p_rel) AND (r_stopped <= off)) U ((1 <= access) AND (initialized <= moved))))
lola: processed formula length: 91
lola: 48 rewrites
lola: closed formula file RobotManipulation-PT-02000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: formula 0: ((1 <= access) AND (initialized <= moved))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA RobotManipulation-PT-02000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no yes yes no yes no yes no no no yes no
lola:
preliminary result: no no yes yes no yes yes no yes no yes no no no yes no
lola: memory consumption: 24268 KB
lola: time consumption: 134 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-02000"
export BK_EXAMINATION="CTLCardinality"
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-02000.tgz
mv RobotManipulation-PT-02000 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-02000, examination is CTLCardinality"
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-152685547000073"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;