About the Execution of LoLA for RobotManipulation-PT-05000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.070 | 1343011.00 | 1347736.00 | 6838.70 | ??TFFTFFTFFTTFTF | 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 176K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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-05000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547000080
=====================================================================
--------------------
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-05000-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-05000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526936253345
info: Time: 3600 - MCC
===========================================================================================
prep: translating RobotManipulation-PT-05000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RobotManipulation-PT-05000 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RobotManipulation-PT-05000 @ 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-05000-CTLCardinality.task
lola: LP says that atomic proposition is always true: (initialized <= p_i2)
lola: always true
lola: (A (G (E (F ((initialized <= r_moving))))) AND A (F (A (X ((p_i2 <= r_stopped)))))) : A (F (E (((p_sc <= r_moving) U (3 <= p_m))))) : A ((TRUE U E (F ((r_stopped <= r_moving))))) : A (X (E (G ((r_active <= p_sc))))) : A (G (E (((p_i1 <= initialized) U (off <= r_stopped))))) : (A (F (((moved <= 2) AND ((r_stopped <= p_i1) OR (initialized <= initialize))))) AND (NOT(A (G ((initialize <= r_stopped)))) OR A (((2 <= p_sc) U (3 <= p_rdy))))) : (A ((FALSE U (p_i2 <= p_rdy))) AND A (G ((p_m <= r_stopped)))) : ((NOT(E (G ((1 <= moved)))) AND E (G (((initialize <= r_active) AND (move <= off))))) OR NOT(E (F ((p_i1 <= 1))))) : NOT(A (F (A (G ((off <= r_stopped)))))) : A (G (A (((2 <= r_moving) U (2 <= r_stopped))))) : (A (X (A (G ((moved <= p_i1))))) OR (1 <= p_sc)) : (A (((initialize + 1 <= initialized) U (r_stopped + 1 <= p_m))) OR (NOT(A (G ((p_rel <= access)))) OR (2 <= p_m))) : (E (F (((p_rdy + 1 <= initialized) OR (p_m <= 2)))) AND NOT(A (G (((initialized <= p_sc) OR (moved <= access)))))) : A (G (E (G ((3 <= r_stopped))))) : E ((((initialized + 1 <= p_i1) OR (p_rdy <= 0)) U ((p_i1 <= 1) AND ((r_moving <= p_sc) OR (3 <= p_m))))) : NOT(E (((p_rel <= off) U ((3 <= r_active) AND (p_i1 <= p_i2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: (A (G (E (F ((initialized <= r_moving))))) AND A (F (A (X ((p_i2 <= r_stopped))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((initialized <= r_moving)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (initialized <= r_moving)
lola: processed formula length: 25
lola: 31 rewrites
lola: closed formula file RobotManipulation-PT-05000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 3230435 markings, 5890864 edges, 646087 markings/sec, 0 secs
lola: 6027888 markings, 11269164 edges, 559491 markings/sec, 5 secs
lola: 8672509 markings, 16632458 edges, 528924 markings/sec, 10 secs
lola: 11143064 markings, 21833305 edges, 494111 markings/sec, 15 secs
lola: 13633366 markings, 26894730 edges, 498060 markings/sec, 20 secs
lola: 15806006 markings, 31753545 edges, 434528 markings/sec, 25 secs
lola: 18104873 markings, 36846593 edges, 459773 markings/sec, 30 secs
lola: 20393026 markings, 41514236 edges, 457631 markings/sec, 35 secs
lola: 22667473 markings, 46476273 edges, 454889 markings/sec, 40 secs
lola: 25086012 markings, 51610192 edges, 483708 markings/sec, 45 secs
lola: 27323339 markings, 56330881 edges, 447465 markings/sec, 50 secs
lola: 29590898 markings, 61065706 edges, 453512 markings/sec, 55 secs
lola: 31863572 markings, 65688246 edges, 454535 markings/sec, 60 secs
lola: 34010867 markings, 70502622 edges, 429459 markings/sec, 65 secs
lola: 36264691 markings, 75396722 edges, 450765 markings/sec, 70 secs
lola: 38446139 markings, 80222842 edges, 436290 markings/sec, 75 secs
lola: 40464594 markings, 84916639 edges, 403691 markings/sec, 80 secs
lola: 42541210 markings, 89691742 edges, 415323 markings/sec, 85 secs
lola: 44595018 markings, 94285740 edges, 410762 markings/sec, 90 secs
lola: 46620863 markings, 98896896 edges, 405169 markings/sec, 95 secs
lola: 48586682 markings, 103595751 edges, 393164 markings/sec, 100 secs
lola: 50557261 markings, 108237056 edges, 394116 markings/sec, 105 secs
lola: 52472569 markings, 112731894 edges, 383062 markings/sec, 110 secs
lola: 54574885 markings, 117560202 edges, 420463 markings/sec, 115 secs
lola: 56604611 markings, 122134984 edges, 405945 markings/sec, 120 secs
lola: 58647048 markings, 126744147 edges, 408487 markings/sec, 125 secs
lola: 60634470 markings, 131281589 edges, 397484 markings/sec, 130 secs
lola: 62675601 markings, 135880260 edges, 408226 markings/sec, 135 secs
lola: 64768726 markings, 140469573 edges, 418625 markings/sec, 140 secs
lola: 66640720 markings, 144878785 edges, 374399 markings/sec, 145 secs
lola: 68609654 markings, 149482825 edges, 393787 markings/sec, 150 secs
lola: 70521961 markings, 154062763 edges, 382461 markings/sec, 155 secs
lola: 72498510 markings, 158683861 edges, 395310 markings/sec, 160 secs
lola: 74367648 markings, 163336309 edges, 373828 markings/sec, 165 secs
lola: 76392471 markings, 167909508 edges, 404965 markings/sec, 170 secs
lola: 78395261 markings, 172533382 edges, 400558 markings/sec, 175 secs
lola: 80293341 markings, 177088827 edges, 379616 markings/sec, 180 secs
lola: 82199512 markings, 181702842 edges, 381234 markings/sec, 185 secs
lola: 84078492 markings, 186264426 edges, 375796 markings/sec, 190 secs
lola: 86047323 markings, 190594680 edges, 393766 markings/sec, 195 secs
lola: 87948520 markings, 195124390 edges, 380239 markings/sec, 200 secs
lola: 89867257 markings, 199674987 edges, 383747 markings/sec, 205 secs
lola: 91648924 markings, 204120833 edges, 356333 markings/sec, 210 secs
lola: 93477412 markings, 208582563 edges, 365698 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 22236 KB
lola: time consumption: 223 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((r_active <= p_sc)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (p_sc + 1 <= r_active))))
lola: processed formula length: 41
lola: 33 rewrites
lola: closed formula file RobotManipulation-PT-05000-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 1 significant temporal operators and needs 5 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: 20002 markings, 20001 edges
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((moved <= p_i1))))) OR (1 <= p_sc))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p_sc)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_sc)
lola: processed formula length: 11
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-05000-CTLCardinality.task
lola: processed formula with 1 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: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((moved <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p_i1 + 1 <= moved)
lola: processed formula length: 19
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--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 /EXEF
lola: The predicate is not invariant from successors.
lola: 50005 markings, 50006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((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 ((3 <= r_stopped)))
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19997 markings, 19996 edges
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((r_stopped <= r_moving)))
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 <= r_moving)))
lola: processed formula length: 31
lola: 31 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: (r_stopped <= r_moving)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20001 markings, 20000 edges
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((2 <= r_moving) U (2 <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((2 <= r_moving) U (2 <= r_stopped)))))
lola: processed formula length: 57
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20001 markings, 40001 edges
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((p_sc <= r_moving) U (3 <= p_m)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U E((p_sc <= r_moving) U (3 <= p_m)))
lola: processed formula length: 44
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: 2568292 markings, 5314395 edges, 513658 markings/sec, 0 secs
lola: 4714648 markings, 10317562 edges, 429271 markings/sec, 5 secs
lola: 6668119 markings, 14984117 edges, 390694 markings/sec, 10 secs
lola: 8704567 markings, 19706302 edges, 407290 markings/sec, 15 secs
lola: 10608679 markings, 24196048 edges, 380822 markings/sec, 20 secs
lola: 12423184 markings, 28592094 edges, 362901 markings/sec, 25 secs
lola: 14265759 markings, 32991130 edges, 368515 markings/sec, 30 secs
lola: 16069844 markings, 37319536 edges, 360817 markings/sec, 35 secs
lola: 18048478 markings, 41869353 edges, 395727 markings/sec, 40 secs
lola: 19793987 markings, 46154669 edges, 349102 markings/sec, 45 secs
lola: 21530436 markings, 50422560 edges, 347290 markings/sec, 50 secs
lola: 23292163 markings, 54724209 edges, 352345 markings/sec, 55 secs
lola: 25091917 markings, 58972566 edges, 359951 markings/sec, 60 secs
lola: 26868953 markings, 63246810 edges, 355407 markings/sec, 65 secs
lola: 28617530 markings, 67499110 edges, 349715 markings/sec, 70 secs
lola: 30352443 markings, 71692677 edges, 346983 markings/sec, 75 secs
lola: 32100336 markings, 75942531 edges, 349579 markings/sec, 80 secs
lola: 33826178 markings, 80136736 edges, 345168 markings/sec, 85 secs
lola: 35600790 markings, 84355639 edges, 354922 markings/sec, 90 secs
lola: 37350078 markings, 88586805 edges, 349858 markings/sec, 95 secs
lola: 38943799 markings, 92624829 edges, 318744 markings/sec, 100 secs
lola: 40577943 markings, 96757597 edges, 326829 markings/sec, 105 secs
lola: 42228899 markings, 101008671 edges, 330191 markings/sec, 110 secs
lola: 43817264 markings, 105104733 edges, 317673 markings/sec, 115 secs
lola: 45543747 markings, 109321075 edges, 345297 markings/sec, 120 secs
lola: 47292984 markings, 113506195 edges, 349847 markings/sec, 125 secs
lola: 48860920 markings, 117507718 edges, 313587 markings/sec, 130 secs
lola: 50480450 markings, 121670140 edges, 323906 markings/sec, 135 secs
lola: 52111824 markings, 125773983 edges, 326275 markings/sec, 140 secs
lola: 53850854 markings, 130000415 edges, 347806 markings/sec, 145 secs
lola: 55511315 markings, 134181976 edges, 332092 markings/sec, 150 secs
lola: 57162833 markings, 138264251 edges, 330304 markings/sec, 155 secs
lola: 58786297 markings, 142152019 edges, 324693 markings/sec, 160 secs
lola: 60311327 markings, 146100582 edges, 305006 markings/sec, 165 secs
lola: 62017206 markings, 150307764 edges, 341176 markings/sec, 170 secs
lola: 63641567 markings, 154436437 edges, 324872 markings/sec, 175 secs
lola: 65298988 markings, 158555122 edges, 331484 markings/sec, 180 secs
lola: 66921265 markings, 162778343 edges, 324455 markings/sec, 185 secs
lola: 68505523 markings, 166791464 edges, 316852 markings/sec, 190 secs
lola: 70160196 markings, 170887866 edges, 330935 markings/sec, 195 secs
lola: 71736212 markings, 174979431 edges, 315203 markings/sec, 200 secs
lola: 73453254 markings, 179433399 edges, 343408 markings/sec, 205 secs
lola: 75264656 markings, 184013438 edges, 362280 markings/sec, 210 secs
lola: 76933604 markings, 188337107 edges, 333790 markings/sec, 215 secs
lola: 78649739 markings, 192788770 edges, 343227 markings/sec, 220 secs
lola: 80249991 markings, 196905959 edges, 320050 markings/sec, 225 secs
lola: 81947639 markings, 201234632 edges, 339530 markings/sec, 230 secs
lola: 83699367 markings, 205718375 edges, 350346 markings/sec, 235 secs
lola: 85467426 markings, 210257501 edges, 353612 markings/sec, 240 secs
lola: 87322655 markings, 214978330 edges, 371046 markings/sec, 245 secs
lola: 89076829 markings, 219479068 edges, 350835 markings/sec, 250 secs
lola: 90666953 markings, 223479419 edges, 318025 markings/sec, 255 secs
lola: 92258375 markings, 227566524 edges, 318284 markings/sec, 260 secs
lola: 93852301 markings, 231698306 edges, 318785 markings/sec, 265 secs
lola: 95542975 markings, 236028540 edges, 338135 markings/sec, 270 secs
lola: 97262640 markings, 240501924 edges, 343933 markings/sec, 275 secs
lola: 98968057 markings, 244928112 edges, 341083 markings/sec, 280 secs
lola: 100722556 markings, 249494890 edges, 350900 markings/sec, 285 secs
lola: 102251326 markings, 253470197 edges, 305754 markings/sec, 290 secs
lola: 103981013 markings, 257959507 edges, 345937 markings/sec, 295 secs
lola: 105679942 markings, 262373789 edges, 339786 markings/sec, 300 secs
lola: 107371957 markings, 266774545 edges, 338403 markings/sec, 305 secs
lola: 108911016 markings, 270715434 edges, 307812 markings/sec, 310 secs
lola: 110490681 markings, 274836479 edges, 315933 markings/sec, 315 secs
lola: 112351064 markings, 279623606 edges, 372077 markings/sec, 320 secs
lola: 114012319 markings, 283831687 edges, 332251 markings/sec, 325 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown yes no unknown unknown unknown unknown unknown no no unknown unknown no unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((p_i1 <= initialized) U (off <= r_stopped)))))
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((p_i1 <= initialized) U (off <= r_stopped)))))
lola: processed formula length: 65
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 50011 markings, 100024 edges
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((r_stopped + 1 <= off)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (r_stopped + 1 <= off)
lola: processed formula length: 22
lola: 31 rewrites
lola: closed formula file RobotManipulation-PT-05000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 50006 markings, 50006 edges
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_i2 <= p_rdy) AND A (G ((p_m <= r_stopped))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_i2 <= p_rdy)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_i2 <= p_rdy)
lola: processed formula length: 15
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-05000-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 10 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_m <= 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 <= r_stopped)))
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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 <= p_m)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20005 markings, 20004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((off + 1 <= p_rel) R ((r_active <= 2) OR (p_i2 + 1 <= p_i1))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((off + 1 <= p_rel) R ((r_active <= 2) OR (p_i2 + 1 <= p_i1))))
lola: processed formula length: 67
lola: 36 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: ((3 <= r_active) AND (p_i1 <= p_i2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 10004 markings, 10003 edges
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((initialized + 1 <= p_i1) OR (p_rdy <= 0)) U ((p_i1 <= 1) AND ((r_moving <= p_sc) OR (3 <= p_m)))))
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 ((((initialized + 1 <= p_i1) OR (p_rdy <= 0)) U ((p_i1 <= 1) AND ((r_moving <= p_sc) OR (3 <= p_m)))))
lola: processed formula length: 106
lola: 33 rewrites
lola: closed formula file RobotManipulation-PT-05000-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 <= 1) AND ((r_moving <= p_sc) OR (3 <= p_m)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-11-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: 10000 markings, 9999 edges
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p_rdy + 1 <= initialized) OR (p_m <= 2)))) AND E (F (((p_sc + 1 <= initialized) AND (access + 1 <= moved)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p_rdy + 1 <= initialized) OR (p_m <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p_rdy + 1 <= initialized) OR (p_m <= 2))))
lola: processed formula length: 51
lola: 31 rewrites
lola: closed formula file RobotManipulation-PT-05000-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_rdy + 1 <= initialized) OR (p_m <= 2))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-12-0.sara
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1003 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p_sc + 1 <= initialized) AND (access + 1 <= moved))))
lola: sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-12-0.sara.
========================================
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_sc + 1 <= initialized) AND (access + 1 <= moved))))
lola:
processed formula length: 61
lola: 31 rewrites
lola: closed formula file RobotManipulation-PT-05000-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_sc + 1 <= initialized) AND (access + 1 <= moved))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 220013 markings, 240027 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1003 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((initialize + 1 <= initialized) U (r_stopped + 1 <= p_m))) OR (E (F ((access + 1 <= p_rel))) OR (2 <= p_m)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1003 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((initialize + 1 <= initialized) U (r_stopped + 1 <= p_m)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((initialize + 1 <= initialized) U (r_stopped + 1 <= p_m)))
lola: processed formula length: 62
lola: 34 rewrites
lola: closed formula file RobotManipulation-PT-05000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p_m)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_m)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-05000-CTLCardinality.task
lola: processed formula with 1 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: subprocess 15 will run for 3011 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((access + 1 <= p_rel)))
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 + 1 <= p_rel)))
lola: processed formula length: 29
lola: 31 rewrites
lola: closed formula file RobotManipulation-PT-05000-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 + 1 <= p_rel)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40005 markings, 40004 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((moved <= 0))) AND E (G (((initialize <= r_active) AND (move <= off))))) OR A (G ((2 <= p_i1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= 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:695
lola: processed formula: A (G ((2 <= p_i1)))
lola: processed formula length: 19
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: (p_i1 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10001 markings, 10000 edges
lola: ========================================
lola: subprocess 15 will run for 3011 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((moved <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (1 <= moved)
lola: processed formula length: 12
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: 1 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 3011 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((moved <= 2) AND ((r_stopped <= p_i1) OR (initialized <= initialize))))) AND (E (F ((r_stopped + 1 <= initialize))) OR A (((2 <= p_sc) U (3 <= p_rdy)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3011 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((moved <= 2) AND ((r_stopped <= p_i1) OR (initialized <= initialize)))))
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: ((3 <= moved) OR ((p_i1 + 1 <= r_stopped) AND (initialize + 1 <= initialized)))
lola: processed formula length: 80
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: 1 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 (F ((r_stopped + 1 <= initialize)))
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 + 1 <= initialize)))
lola: processed formula length: 37
lola: 31 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: (r_stopped + 1 <= initialize)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-05000-CTLCardinality-17-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10002 markings, 10001 edges
lola: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((initialized <= r_moving))))) AND A (F (A (X ((p_i2 <= r_stopped))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((initialized <= r_moving)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (initialized <= r_moving)
lola: processed formula length: 25
lola: 31 rewrites
lola: closed formula file RobotManipulation-PT-05000-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 3298174 markings, 6072810 edges, 659635 markings/sec, 0 secs
lola: 6047858 markings, 11310466 edges, 549937 markings/sec, 5 secs
lola: 8616235 markings, 16510586 edges, 513675 markings/sec, 10 secs
lola: 11004499 markings, 21507058 edges, 477653 markings/sec, 15 secs
lola: 13369124 markings, 26324040 edges, 472925 markings/sec, 20 secs
lola: 15394548 markings, 30890538 edges, 405085 markings/sec, 25 secs
lola: 17546671 markings, 35566374 edges, 430425 markings/sec, 30 secs
lola: 19726111 markings, 40189567 edges, 435888 markings/sec, 35 secs
lola: 21843594 markings, 44715270 edges, 423497 markings/sec, 40 secs
lola: 24069713 markings, 49415294 edges, 445224 markings/sec, 45 secs
lola: 26135689 markings, 53916019 edges, 413195 markings/sec, 50 secs
lola: 28173920 markings, 58159371 edges, 407646 markings/sec, 55 secs
lola: 30324533 markings, 62494778 edges, 430123 markings/sec, 60 secs
lola: 32285718 markings, 66679316 edges, 392237 markings/sec, 65 secs
lola: 34278750 markings, 70946681 edges, 398606 markings/sec, 70 secs
lola: 36281014 markings, 75421207 edges, 400453 markings/sec, 75 secs
lola: 38193400 markings, 79693246 edges, 382477 markings/sec, 80 secs
lola: 40003857 markings, 83899676 edges, 362091 markings/sec, 85 secs
lola: 41877671 markings, 88094912 edges, 374763 markings/sec, 90 secs
lola: 43606120 markings, 92226387 edges, 345690 markings/sec, 95 secs
lola: 45492059 markings, 96318414 edges, 377188 markings/sec, 100 secs
lola: 47292090 markings, 100470729 edges, 360006 markings/sec, 105 secs
lola: 49069709 markings, 104690163 edges, 355524 markings/sec, 110 secs
lola: 50749162 markings, 108681499 edges, 335891 markings/sec, 115 secs
lola: 52436342 markings, 112610451 edges, 337436 markings/sec, 120 secs
lola: 54275225 markings, 116886890 edges, 367777 markings/sec, 125 secs
lola: 56105641 markings, 120959317 edges, 366083 markings/sec, 130 secs
lola: 57803135 markings, 124867472 edges, 339499 markings/sec, 135 secs
lola: 59600867 markings, 128951641 edges, 359546 markings/sec, 140 secs
lola: 61352030 markings, 132988913 edges, 350233 markings/sec, 145 secs
lola: 63200312 markings, 137098818 edges, 369656 markings/sec, 150 secs
lola: 65031485 markings, 141049860 edges, 366235 markings/sec, 155 secs
lola: 66664180 markings, 144913975 edges, 326539 markings/sec, 160 secs
lola: 68380151 markings, 148930484 edges, 343194 markings/sec, 165 secs
lola: 70047874 markings, 152953143 edges, 333545 markings/sec, 170 secs
lola: 71764368 markings, 156951881 edges, 343299 markings/sec, 175 secs
lola: 73461792 markings, 161070300 edges, 339485 markings/sec, 180 secs
lola: 75225786 markings, 165255455 edges, 352799 markings/sec, 185 secs
lola: 76990006 markings, 169223825 edges, 352844 markings/sec, 190 secs
lola: 78791902 markings, 173544758 edges, 360379 markings/sec, 195 secs
lola: 80811316 markings, 178292731 edges, 403883 markings/sec, 200 secs
lola: 82715659 markings, 182985759 edges, 380869 markings/sec, 205 secs
lola: 84734460 markings, 187591833 edges, 403760 markings/sec, 210 secs
lola: 86682826 markings, 192154419 edges, 389673 markings/sec, 215 secs
lola: 88687506 markings, 196863469 edges, 400936 markings/sec, 220 secs
lola: 90588468 markings, 201488307 edges, 380192 markings/sec, 225 secs
lola: 92333733 markings, 205785380 edges, 349053 markings/sec, 230 secs
lola: 94303177 markings, 210436553 edges, 393889 markings/sec, 235 secs
lola: 96192231 markings, 215119941 edges, 377811 markings/sec, 240 secs
lola: 98128356 markings, 219684124 edges, 387225 markings/sec, 245 secs
lola: 100119521 markings, 224272979 edges, 398233 markings/sec, 250 secs
lola: 101765836 markings, 228159685 edges, 329263 markings/sec, 255 secs
lola: 103404369 markings, 231937294 edges, 327707 markings/sec, 260 secs
lola: 104986591 markings, 235830637 edges, 316444 markings/sec, 265 secs
lola: 106531743 markings, 239527352 edges, 309030 markings/sec, 270 secs
lola: 108169956 markings, 243336490 edges, 327643 markings/sec, 275 secs
lola: 109819952 markings, 247251941 edges, 329999 markings/sec, 280 secs
lola: 111425234 markings, 251045547 edges, 321056 markings/sec, 285 secs
lola: 113003222 markings, 254859275 edges, 315598 markings/sec, 290 secs
lola: 114582896 markings, 258783186 edges, 315935 markings/sec, 295 secs
lola: 116240743 markings, 262731434 edges, 331569 markings/sec, 300 secs
lola: 117783415 markings, 266567650 edges, 308534 markings/sec, 305 secs
lola: 119358824 markings, 270437487 edges, 315082 markings/sec, 310 secs
lola: 120930164 markings, 274276342 edges, 314268 markings/sec, 315 secs
lola: 122406632 markings, 277990316 edges, 295294 markings/sec, 320 secs
lola: 124149009 markings, 281872460 edges, 348475 markings/sec, 325 secs
lola: 125668133 markings, 285648503 edges, 303825 markings/sec, 330 secs
lola: 127133812 markings, 289353422 edges, 293136 markings/sec, 335 secs
lola: 128803173 markings, 293265559 edges, 333872 markings/sec, 340 secs
lola: 130463155 markings, 297127459 edges, 331996 markings/sec, 345 secs
lola: 131973812 markings, 300811418 edges, 302131 markings/sec, 350 secs
lola: 133572779 markings, 304733540 edges, 319793 markings/sec, 355 secs
lola: 135213408 markings, 308617061 edges, 328126 markings/sec, 360 secs
lola: 136801147 markings, 312392485 edges, 317548 markings/sec, 365 secs
lola: 138329164 markings, 316034871 edges, 305603 markings/sec, 370 secs
lola: 140083585 markings, 319809651 edges, 350884 markings/sec, 375 secs
lola: 141628057 markings, 323628435 edges, 308894 markings/sec, 380 secs
lola: 143211896 markings, 327402560 edges, 316768 markings/sec, 385 secs
lola: 145000680 markings, 331410047 edges, 357757 markings/sec, 390 secs
lola: 145585518 markings, 332792673 edges, 116968 markings/sec, 395 secs
lola: 145624898 markings, 332862540 edges, 7876 markings/sec, 400 secs
lola: 145642181 markings, 332911224 edges, 3457 markings/sec, 405 secs
lola: 145698366 markings, 333029923 edges, 11237 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((p_i2 <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX((p_i2 <= r_stopped)))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
FORMULA RobotManipulation-PT-05000-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (F (E (((p_sc <= r_moving) U (3 <= p_m)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U E((p_sc <= r_moving) U (3 <= p_m)))
lola: processed formula length: 44
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: 2492196 markings, 5164597 edges, 498439 markings/sec, 0 secs
lola: 4637277 markings, 10130796 edges, 429016 markings/sec, 5 secs
lola: 6582334 markings, 14752318 edges, 389011 markings/sec, 10 secs
lola: 8569154 markings, 19428469 edges, 397364 markings/sec, 15 secs
lola: 10522735 markings, 23961376 edges, 390716 markings/sec, 20 secs
lola: 12310945 markings, 28344537 edges, 357642 markings/sec, 25 secs
lola: 14173973 markings, 32781204 edges, 372606 markings/sec, 30 secs
lola: 15989582 markings, 37124087 edges, 363122 markings/sec, 35 secs
lola: 17931284 markings, 41631629 edges, 388340 markings/sec, 40 secs
lola: 19707872 markings, 45920139 edges, 355318 markings/sec, 45 secs
lola: 21424054 markings, 50146200 edges, 343236 markings/sec, 50 secs
lola: 23158479 markings, 54407304 edges, 346885 markings/sec, 55 secs
lola: 24972570 markings, 58653995 edges, 362818 markings/sec, 60 secs
lola: 26710203 markings, 62850626 edges, 347527 markings/sec, 65 secs
lola: 28468564 markings, 67126194 edges, 351672 markings/sec, 70 secs
lola: 30112809 markings, 71218702 edges, 328849 markings/sec, 75 secs
lola: 31904769 markings, 75475745 edges, 358392 markings/sec, 80 secs
lola: 33597648 markings, 79610103 edges, 338576 markings/sec, 85 secs
lola: 35366193 markings, 83819408 edges, 353709 markings/sec, 90 secs
lola: 37064004 markings, 87961239 edges, 339562 markings/sec, 95 secs
lola: 38690799 markings, 92021919 edges, 325359 markings/sec, 100 secs
lola: 40319740 markings, 96143798 edges, 325788 markings/sec, 105 secs
lola: 41972329 markings, 100340840 edges, 330518 markings/sec, 110 secs
lola: 43552273 markings, 104430338 edges, 315989 markings/sec, 115 secs
lola: 45226092 markings, 108573960 edges, 334764 markings/sec, 120 secs
lola: 47220701 markings, 113335869 edges, 398922 markings/sec, 125 secs
lola: 49028033 markings, 117949058 edges, 361466 markings/sec, 130 secs
lola: 50844962 markings, 122611521 edges, 363386 markings/sec, 135 secs
lola: 52736161 markings, 127312395 edges, 378240 markings/sec, 140 secs
lola: 54685364 markings, 132043994 edges, 389841 markings/sec, 145 secs
lola: 56504190 markings, 136672065 edges, 363765 markings/sec, 150 secs
lola: 58486083 markings, 141380449 edges, 396379 markings/sec, 155 secs
lola: 60286570 markings, 146037039 edges, 360097 markings/sec, 160 secs
lola: 62175553 markings, 150721518 edges, 377797 markings/sec, 165 secs
lola: 64011024 markings, 155363035 edges, 367094 markings/sec, 170 secs
lola: 65831916 markings, 159940278 edges, 364178 markings/sec, 175 secs
lola: 67634042 markings, 164600800 edges, 360425 markings/sec, 180 secs
lola: 69512658 markings, 169231188 edges, 375723 markings/sec, 185 secs
lola: 71098089 markings, 173329073 edges, 317086 markings/sec, 190 secs
lola: 72739431 markings, 177584225 edges, 328268 markings/sec, 195 secs
lola: 74315303 markings, 181643837 edges, 315174 markings/sec, 200 secs
lola: 75913712 markings, 185704844 edges, 319682 markings/sec, 205 secs
lola: 77530689 markings, 189873166 edges, 323395 markings/sec, 210 secs
lola: 79180014 markings, 194157739 edges, 329865 markings/sec, 215 secs
lola: 80810466 markings, 198370292 edges, 326090 markings/sec, 220 secs
lola: 82384232 markings, 202351795 edges, 314753 markings/sec, 225 secs
lola: 83992595 markings, 206480234 edges, 321673 markings/sec, 230 secs
lola: 85533538 markings, 210430262 edges, 308189 markings/sec, 235 secs
lola: 87219919 markings, 214712687 edges, 337276 markings/sec, 240 secs
lola: 88764845 markings, 218692185 edges, 308985 markings/sec, 245 secs
lola: 90388336 markings, 222750329 edges, 324698 markings/sec, 250 secs
lola: 92003345 markings, 226899129 edges, 323002 markings/sec, 255 secs
lola: 93577228 markings, 230982153 edges, 314777 markings/sec, 260 secs
lola: 95192592 markings, 235116564 edges, 323073 markings/sec, 265 secs
lola: 96899318 markings, 239555572 edges, 341345 markings/sec, 270 secs
lola: 98561677 markings, 243888872 edges, 332472 markings/sec, 275 secs
lola: 100356106 markings, 248539529 edges, 358886 markings/sec, 280 secs
lola: 102130703 markings, 253159340 edges, 354919 markings/sec, 285 secs
lola: 103940476 markings, 257854800 edges, 361955 markings/sec, 290 secs
lola: 105696416 markings, 262416530 edges, 351188 markings/sec, 295 secs
lola: 107444557 markings, 266958695 edges, 349628 markings/sec, 300 secs
lola: 109201485 markings, 271476341 edges, 351386 markings/sec, 305 secs
lola: 110957916 markings, 276051551 edges, 351286 markings/sec, 310 secs
lola: 112825555 markings, 280845348 edges, 373528 markings/sec, 315 secs
lola: 114592916 markings, 285316895 edges, 353472 markings/sec, 320 secs
lola: 116403205 markings, 289974294 edges, 362058 markings/sec, 325 secs
lola: 118168823 markings, 294481536 edges, 353124 markings/sec, 330 secs
lola: 119786809 markings, 298699939 edges, 323597 markings/sec, 335 secs
lola: 121384175 markings, 302802934 edges, 319473 markings/sec, 340 secs
lola: 122997726 markings, 306985683 edges, 322710 markings/sec, 345 secs
lola: 124563646 markings, 311047195 edges, 313184 markings/sec, 350 secs
lola: 124888878 markings, 311898762 edges, 65046 markings/sec, 355 secs
lola: 124891045 markings, 311904545 edges, 433 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA RobotManipulation-PT-05000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((A (F ((moved <= 0))) AND E (G (((initialize <= r_active) AND (move <= off))))) OR A (G ((2 <= p_i1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= 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:695
lola: processed formula: A (G ((2 <= p_i1)))
lola: processed formula length: 19
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: (p_i1 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-05000-CTLCardinality-18-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: 10001 markings, 10000 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((moved <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (1 <= moved)
lola: processed formula length: 12
lola: 32 rewrites
lola: closed formula file RobotManipulation-PT-05000-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: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((initialize <= r_active) AND (move <= off))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((initialize <= r_active) AND (move <= off))))
lola: processed formula length: 52
lola: 30 rewrites
lola: closed formula file RobotManipulation-PT-05000-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-05000-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: unknown unknown yes no no yes no no yes no no yes yes no yes no
lola:
preliminary result: unknown unknown yes no no yes no no yes no no yes yes no yes no
lola: memory consumption: 20948 KB
lola: time consumption: 1343 seconds
BK_STOP 1526937596356
--------------------
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-05000"
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-05000.tgz
mv RobotManipulation-PT-05000 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-05000, 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-152685547000080"
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 ;