About the Execution of LoLA for Kanban-PT-0020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.110 | 1527402.00 | 1580376.00 | 4742.00 | ?FTTFTFFT?TFFFFF | 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 188K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 14K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Kanban-PT-0020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666468900017
=====================================================================
--------------------
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 Kanban-PT-0020-CTLCardinality-00
FORMULA_NAME Kanban-PT-0020-CTLCardinality-01
FORMULA_NAME Kanban-PT-0020-CTLCardinality-02
FORMULA_NAME Kanban-PT-0020-CTLCardinality-03
FORMULA_NAME Kanban-PT-0020-CTLCardinality-04
FORMULA_NAME Kanban-PT-0020-CTLCardinality-05
FORMULA_NAME Kanban-PT-0020-CTLCardinality-06
FORMULA_NAME Kanban-PT-0020-CTLCardinality-07
FORMULA_NAME Kanban-PT-0020-CTLCardinality-08
FORMULA_NAME Kanban-PT-0020-CTLCardinality-09
FORMULA_NAME Kanban-PT-0020-CTLCardinality-10
FORMULA_NAME Kanban-PT-0020-CTLCardinality-11
FORMULA_NAME Kanban-PT-0020-CTLCardinality-12
FORMULA_NAME Kanban-PT-0020-CTLCardinality-13
FORMULA_NAME Kanban-PT-0020-CTLCardinality-14
FORMULA_NAME Kanban-PT-0020-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527010672276
info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-0020 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-0020 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Kanban-PT-0020 @ 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: 32/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from Kanban-PT-0020-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: always true
lola: A (G ((E (F ((P1 <= Pout2))) OR ((1 <= Pout1) AND (2 <= Pout3) AND (Pm4 + 1 <= Pout4))))) : A (G (((Pm4 + 1 <= Pm3) OR (Pback2 <= P2)))) : E (F (A (F (((P3 <= P4) AND (3 <= Pback4)))))) : ((A (G (((Pm3 <= P2) AND (3 <= P2)))) AND (1 <= Pback2)) OR (() OR E (((1 <= P3) U (P1 <= Pm1))))) : NOT(E (F (A (X ((2 <= Pout1)))))) : NOT(A (G (A (X ((3 <= P2)))))) : (NOT(((Pm4 <= Pout3) AND E (F ((2 <= Pout1))))) OR ((P2 + 1 <= Pm2) AND (Pback4 <= 0))) : (A (G (((1 <= Pback2) OR (3 <= P2) OR (Pm3 + 1 <= Pout3)))) OR NOT(((Pout4 <= Pback3) AND A (F ((Pback4 <= Pm3)))))) : (E (F (E (X ((P4 <= Pm1))))) OR (3 <= Pback3)) : NOT(E (((Pout2 <= 2) U ((P4 <= Pback2) AND (3 <= Pout2))))) : (E (((Pout1 <= Pback1) U ((3 <= Pm1) AND (Pout3 <= Pback2)))) OR E (((2 <= Pm2) U (3 <= Pout1)))) : (NOT((E (F ((3 <= Pout1))) AND ((Pm2 <= Pback2) AND (Pback3 <= Pout1) AND (Pm3 <= 2)))) AND (1 <= P4)) : A (X (NOT(A (G (TRUE))))) : NOT((E (F ((P4 <= 2))) OR (A (G ((1 <= Pm2))) AND ((Pout3 <= 0) AND (Pback4 <= 2))))) : (NOT(E (F ((P1 <= 1)))) AND (1 <= P4)) : (A (G (A (X ((3 <= P3))))) AND E (F (((Pback1 <= P1) AND (2 <= Pout1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:395
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: 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: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:139
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:315
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: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:398
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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 Kanban-PT-0020-CTLCardinality-12 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 (X (E (F ((P2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (P2 <= 2)
lola: processed formula length: 9
lola: 54 rewrites
lola: closed formula file Kanban-PT-0020-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: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 54 markings, 53 edges
lola: ========================================
FORMULA Kanban-PT-0020-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 (X (E (F ((P4 <= Pm1))))) OR (3 <= Pback3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Pback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Pback3)
lola: processed formula length: 13
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((P4 <= Pm1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (P4 <= Pm1)
lola: processed formula length: 11
lola: 54 rewrites
lola: closed formula file Kanban-PT-0020-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: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-8 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: A (G (E (X ((Pout1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((Pout1 <= 1)))))
lola: processed formula length: 36
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: 10437 markings, 22567 edges
FORMULA Kanban-PT-0020-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((3 <= P3))))) AND E (F (((Pback1 <= P1) AND (2 <= Pout1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Pback1 <= P1) AND (2 <= Pout1))))
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 (((Pback1 <= P1) AND (2 <= Pout1))))
lola: processed formula length: 41
lola: 54 rewrites
lola: closed formula file Kanban-PT-0020-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: ((Pback1 <= P1) AND (2 <= Pout1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0020-CTLCardinality-4-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: 15 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= P3)))))
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: (P3 <= 2)
lola: processed formula length: 9
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: 54 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
FORMULA Kanban-PT-0020-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P3 <= P4) AND (3 <= Pback4))))
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 (((P3 <= P4) AND (3 <= Pback4))))
lola: processed formula length: 38
lola: 54 rewrites
lola: closed formula file Kanban-PT-0020-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: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-2 TRUE 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 (((Pm4 + 1 <= Pm3) OR (Pback2 <= P2))))
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 (((Pm4 + 1 <= Pm3) OR (Pback2 <= P2))))
lola: processed formula length: 45
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((P1 <= Pout2))) OR ((1 <= Pout1) AND (2 <= Pout3) AND (Pm4 + 1 <= Pout4)))))
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (P1 <= Pout2))) AND ((Pout1 <= 0) OR (Pout3 <= 1) OR (Pout4 <= Pm4)))))
lola: processed formula length: 100
lola: 57 rewrites
lola: closed formula file Kanban-PT-0020-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: 1493560 markings, 6947809 edges, 298712 markings/sec, 0 secs
lola: 2881675 markings, 13247664 edges, 277623 markings/sec, 5 secs
lola: 4219535 markings, 19308570 edges, 267572 markings/sec, 10 secs
lola: 5613879 markings, 25612793 edges, 278869 markings/sec, 15 secs
lola: 6987588 markings, 31805200 edges, 274742 markings/sec, 20 secs
lola: 8366277 markings, 38019814 edges, 275738 markings/sec, 25 secs
lola: 9769226 markings, 44330422 edges, 280590 markings/sec, 30 secs
lola: 11040580 markings, 50035065 edges, 254271 markings/sec, 35 secs
lola: 12384661 markings, 56065527 edges, 268816 markings/sec, 40 secs
lola: 13725848 markings, 62070414 edges, 268237 markings/sec, 45 secs
lola: 15065203 markings, 68068121 edges, 267871 markings/sec, 50 secs
lola: 16497733 markings, 74472453 edges, 286506 markings/sec, 55 secs
lola: 17871651 markings, 80609816 edges, 274784 markings/sec, 60 secs
lola: 19291178 markings, 86943882 edges, 283905 markings/sec, 65 secs
lola: 20517834 markings, 92418465 edges, 245331 markings/sec, 70 secs
lola: 21756134 markings, 97909215 edges, 247660 markings/sec, 75 secs
lola: 22994532 markings, 103401591 edges, 247680 markings/sec, 80 secs
lola: 24214810 markings, 108819473 edges, 244056 markings/sec, 85 secs
lola: 25429517 markings, 114228492 edges, 242941 markings/sec, 90 secs
lola: 26603887 markings, 119465416 edges, 234874 markings/sec, 95 secs
lola: 27792574 markings, 124747320 edges, 237737 markings/sec, 100 secs
lola: 29005323 markings, 130138810 edges, 242550 markings/sec, 105 secs
lola: 30246049 markings, 135648799 edges, 248145 markings/sec, 110 secs
lola: 31452658 markings, 141000440 edges, 241322 markings/sec, 115 secs
lola: 32683695 markings, 146461041 edges, 246207 markings/sec, 120 secs
lola: 33909345 markings, 151889361 edges, 245130 markings/sec, 125 secs
lola: 35154985 markings, 157417203 edges, 249128 markings/sec, 130 secs
lola: 36566739 markings, 163636141 edges, 282351 markings/sec, 135 secs
lola: 37950213 markings, 169750301 edges, 276695 markings/sec, 140 secs
lola: 39331658 markings, 175848904 edges, 276289 markings/sec, 145 secs
lola: 40729855 markings, 182028401 edges, 279639 markings/sec, 150 secs
lola: 42125498 markings, 188158786 edges, 279129 markings/sec, 155 secs
lola: 43493248 markings, 194188145 edges, 273550 markings/sec, 160 secs
lola: 44879453 markings, 200296366 edges, 277241 markings/sec, 165 secs
lola: 46272439 markings, 206439391 edges, 278597 markings/sec, 170 secs
lola: 47655402 markings, 212536791 edges, 276593 markings/sec, 175 secs
lola: 49017035 markings, 218501132 edges, 272327 markings/sec, 180 secs
lola: 50415227 markings, 224646220 edges, 279638 markings/sec, 185 secs
lola: 51808421 markings, 230805992 edges, 278639 markings/sec, 190 secs
lola: 53193425 markings, 236885978 edges, 277001 markings/sec, 195 secs
lola: 54569581 markings, 242940542 edges, 275231 markings/sec, 200 secs
lola: 55940809 markings, 248969193 edges, 274246 markings/sec, 205 secs
lola: 57323785 markings, 255046037 edges, 276595 markings/sec, 210 secs
lola: 58710644 markings, 261117928 edges, 277372 markings/sec, 215 secs
lola: 60087471 markings, 267141764 edges, 275365 markings/sec, 220 secs
lola: 61429932 markings, 273041191 edges, 268492 markings/sec, 225 secs
lola: 62809499 markings, 279090017 edges, 275913 markings/sec, 230 secs
lola: 64190793 markings, 285138513 edges, 276259 markings/sec, 235 secs
lola: 65560474 markings, 291149648 edges, 273936 markings/sec, 240 secs
lola: 66950131 markings, 297222905 edges, 277931 markings/sec, 245 secs
lola: 68325620 markings, 303274049 edges, 275098 markings/sec, 250 secs
lola: 69662466 markings, 309145111 edges, 267369 markings/sec, 255 secs
lola: 70995268 markings, 314979907 edges, 266560 markings/sec, 260 secs
lola: 72301405 markings, 320684570 edges, 261227 markings/sec, 265 secs
lola: 73612414 markings, 326429988 edges, 262202 markings/sec, 270 secs
lola: 74866074 markings, 331869101 edges, 250732 markings/sec, 275 secs
lola: 76071277 markings, 337118675 edges, 241041 markings/sec, 280 secs
lola: 77269028 markings, 342355749 edges, 239550 markings/sec, 285 secs
lola: 78483759 markings, 347675632 edges, 242946 markings/sec, 290 secs
lola: 79813960 markings, 353479825 edges, 266040 markings/sec, 295 secs
lola: 81143499 markings, 359307492 edges, 265908 markings/sec, 300 secs
lola: 82484797 markings, 365136051 edges, 268260 markings/sec, 305 secs
lola: 83815162 markings, 370920501 edges, 266073 markings/sec, 310 secs
lola: 85164939 markings, 376814866 edges, 269955 markings/sec, 315 secs
lola: 86541495 markings, 382824488 edges, 275311 markings/sec, 320 secs
lola: 87942321 markings, 388951131 edges, 280165 markings/sec, 325 secs
lola: 89354081 markings, 395107458 edges, 282352 markings/sec, 330 secs
lola: 90777986 markings, 401293871 edges, 284781 markings/sec, 335 secs
lola: 92183291 markings, 407403815 edges, 281061 markings/sec, 340 secs
lola: 93614531 markings, 413603542 edges, 286248 markings/sec, 345 secs
lola: 95023944 markings, 419777116 edges, 281883 markings/sec, 350 secs
lola: 96472369 markings, 426072752 edges, 289685 markings/sec, 355 secs
lola: 97854310 markings, 432095632 edges, 276388 markings/sec, 360 secs
lola: 99202947 markings, 437955655 edges, 269727 markings/sec, 365 secs
lola: 100559554 markings, 443861569 edges, 271321 markings/sec, 370 secs
lola: 101927767 markings, 449822595 edges, 273643 markings/sec, 375 secs
lola: 103282117 markings, 455687919 edges, 270870 markings/sec, 380 secs
lola: 104642876 markings, 461581126 edges, 272152 markings/sec, 385 secs
lola: 105991772 markings, 467434528 edges, 269779 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no yes unknown no yes unknown unknown yes unknown unknown unknown no unknown unknown no
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((2 <= P1))) AND (1 <= P4))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= P4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P4)
lola: processed formula length: 9
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= P1)))
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 <= P1)))
lola: processed formula length: 17
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 115 markings, 114 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (P1 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= Pout2) R ((Pback2 + 1 <= P4) OR (Pout2 <= 2))))
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 (((3 <= Pout2) R ((Pback2 + 1 <= P4) OR (Pout2 <= 2))))
lola: processed formula length: 58
lola: 59 rewrites
lola: closed formula file Kanban-PT-0020-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: ((P4 <= Pback2) AND (3 <= Pout2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0020-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0020-CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || 2710013 markings, 7743989 edges, 542003 markings/sec, 0 secs
lola: sara is running 5 secs || 5251629 markings, 15317329 edges, 508323 markings/sec, 5 secs
lola: sara is running 10 secs || 7652879 markings, 22557889 edges, 480250 markings/sec, 10 secs
lola: sara is running 15 secs || 10190344 markings, 30248518 edges, 507493 markings/sec, 15 secs
lola: sara is running 20 secs || 12907080 markings, 38533032 edges, 543347 markings/sec, 20 secs
lola: sara is running 25 secs || 15547282 markings, 46642674 edges, 528040 markings/sec, 25 secs
lola: sara is running 30 secs || 18132376 markings, 54623375 edges, 517019 markings/sec, 30 secs
lola: sara is running 35 secs || 20769145 markings, 62795597 edges, 527354 markings/sec, 35 secs
lola: sara is running 40 secs || 23418971 markings, 70988081 edges, 529965 markings/sec, 40 secs
lola: sara is running 45 secs || 26033553 markings, 79107588 edges, 522916 markings/sec, 45 secs
lola: sara is running 50 secs || 28619921 markings, 87191917 edges, 517274 markings/sec, 50 secs
lola: sara is running 55 secs || 31244689 markings, 95363866 edges, 524954 markings/sec, 55 secs
lola: sara is running 60 secs || 33854011 markings, 103505249 edges, 521864 markings/sec, 60 secs
lola: sara is running 65 secs || 36474010 markings, 111746328 edges, 524000 markings/sec, 65 secs
lola: sara is running 70 secs || 39051532 markings, 119853035 edges, 515504 markings/sec, 70 secs
lola: sara is running 75 secs || 41318397 markings, 126883978 edges, 453373 markings/sec, 75 secs
lola: sara is running 80 secs || 43542043 markings, 133875977 edges, 444729 markings/sec, 80 secs
lola: sara is running 85 secs || 45768810 markings, 140879485 edges, 445353 markings/sec, 85 secs
lola: sara is running 90 secs || 48309241 markings, 148927249 edges, 508086 markings/sec, 90 secs
lola: sara is running 95 secs || 50849439 markings, 156878348 edges, 508040 markings/sec, 95 secs
lola: sara is running 100 secs || 53379981 markings, 164867713 edges, 506108 markings/sec, 100 secs
lola: sara is running 105 secs || 55764060 markings, 172389628 edges, 476816 markings/sec, 105 secs
lola: sara is running 110 secs || 57977710 markings, 179333263 edges, 442730 markings/sec, 110 secs
lola: sara is running 115 secs || 60174401 markings, 186251269 edges, 439338 markings/sec, 115 secs
lola: sara is running 120 secs || 62372782 markings, 193205949 edges, 439676 markings/sec, 120 secs
lola: sara is running 125 secs || 64772476 markings, 200793172 edges, 479939 markings/sec, 125 secs
lola: sara is running 130 secs || 67197035 markings, 208457567 edges, 484912 markings/sec, 130 secs
lola: sara is running 135 secs || 69662803 markings, 216287899 edges, 493154 markings/sec, 135 secs
lola: sara is running 140 secs || 72116767 markings, 224066519 edges, 490793 markings/sec, 140 secs
lola: sara is running 145 secs || 74292335 markings, 230956457 edges, 435114 markings/sec, 145 secs
lola: sara is running 150 secs || 76463421 markings, 237868997 edges, 434217 markings/sec, 150 secs
lola: sara is running 155 secs || 78594613 markings, 244704306 edges, 426238 markings/sec, 155 secs
lola: sara is running 160 secs || 80923705 markings, 252117642 edges, 465818 markings/sec, 160 secs
lola: sara is running 165 secs || 83466778 markings, 260246794 edges, 508615 markings/sec, 165 secs
lola: sara is running 170 secs || 86002726 markings, 268310587 edges, 507190 markings/sec, 170 secs
lola: sara is running 175 secs || 88488298 markings, 276224169 edges, 497114 markings/sec, 175 secs
lola: sara is running 180 secs || 91029453 markings, 284374126 edges, 508231 markings/sec, 180 secs
lola: sara is running 185 secs || 93602647 markings, 292561462 edges, 514639 markings/sec, 185 secs
lola: sara is running 190 secs || 96213933 markings, 300823295 edges, 522257 markings/sec, 190 secs
lola: sara is running 195 secs || 98738907 markings, 308869002 edges, 504995 markings/sec, 195 secs
lola: sara is running 200 secs || 101101887 markings, 316446357 edges, 472596 markings/sec, 200 secs
lola: sara is running 205 secs || 103414246 markings, 323820445 edges, 462472 markings/sec, 205 secs
lola: sara is running 210 secs || 105582041 markings, 330714494 edges, 433559 markings/sec, 210 secs
lola: sara is running 215 secs || 107737085 markings, 337599341 edges, 431009 markings/sec, 215 secs
lola: sara is running 220 secs || 109888685 markings, 344464163 edges, 430320 markings/sec, 220 secs
lola: sara is running 225 secs || 112039803 markings, 351330560 edges, 430224 markings/sec, 225 secs
lola: sara is running 230 secs || 114534317 markings, 359327824 edges, 498903 markings/sec, 230 secs
lola: sara is running 235 secs || 117017411 markings, 367275663 edges, 496619 markings/sec, 235 secs
lola: sara is running 240 secs || 119483536 markings, 375214540 edges, 493225 markings/sec, 240 secs
lola: sara is running 245 secs || 121945986 markings, 383106370 edges, 492490 markings/sec, 245 secs
lola: sara is running 250 secs || 124380702 markings, 390891358 edges, 486943 markings/sec, 250 secs
lola: sara is running 255 secs || 126765348 markings, 398602612 edges, 476929 markings/sec, 255 secs
lola: sara is running 260 secs || 129185550 markings, 406344459 edges, 484040 markings/sec, 260 secs
lola: sara is running 265 secs || 131645778 markings, 414197133 edges, 492046 markings/sec, 265 secs
lola: sara is running 270 secs || 134086107 markings, 421964456 edges, 488066 markings/sec, 270 secs
lola: sara is running 275 secs || 136537409 markings, 429758069 edges, 490260 markings/sec, 275 secs
lola: sara is running 280 secs || 138966319 markings, 437636203 edges, 485782 markings/sec, 280 secs
lola: sara is running 285 secs || 141407592 markings, 445451082 edges, 488255 markings/sec, 285 secs
lola: sara is running 290 secs || 143875723 markings, 453337794 edges, 493626 markings/sec, 290 secs
lola: sara is running 295 secs || 146348471 markings, 461303685 edges, 494550 markings/sec, 295 secs
lola: sara is running 300 secs || 148883714 markings, 469430899 edges, 507049 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((3 <= P4))) AND (E (F ((Pm2 <= 0))) OR ((1 <= Pout3) OR (3 <= Pback4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= Pout3) OR (3 <= Pback4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= Pout3) OR (3 <= Pback4))
lola: processed formula length: 32
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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: subprocess 11 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Pm2 <= 0)))
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 ((Pm2 <= 0)))
lola: processed formula length: 18
lola: 54 rewrites
lola: closed formula file Kanban-PT-0020-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: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= P4)))
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 ((3 <= P4)))
lola: processed formula length: 17
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pout3 + 1 <= Pm4) OR (A (G ((Pout1 <= 1))) OR ((P2 + 1 <= Pm2) AND (Pback4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pout1 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((Pout1 <= 1)))
lola: processed formula length: 20
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: (2 <= Pout1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 12 will run for 716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pout3 + 1 <= Pm4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pout3 + 1 <= Pm4)
lola: processed formula length: 18
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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 13 will run for 954 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((P2 + 1 <= Pm2) AND (Pback4 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P2 + 1 <= Pm2) AND (Pback4 <= 0))
lola: processed formula length: 35
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((Pout1 <= 2))) OR ((Pback2 + 1 <= Pm2) OR (Pout1 + 1 <= Pback3) OR (3 <= Pm3))) AND (1 <= P4))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pout1 <= 2)))
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 ((Pout1 <= 2)))
lola: processed formula length: 20
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 13 will run for 954 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= P4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P4)
lola: processed formula length: 9
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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 1432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pback2 + 1 <= Pm2) OR (Pout1 + 1 <= Pback3) OR (3 <= Pm3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pback2 + 1 <= Pm2) OR (Pout1 + 1 <= Pback3) OR (3 <= Pm3))
lola: processed formula length: 62
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 954 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((Pout1 <= Pback1) U ((3 <= Pm1) AND (Pout3 <= Pback2)))) OR E (((2 <= Pm2) U (3 <= Pout1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 954 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= Pm2) U (3 <= Pout1)))
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 (((2 <= Pm2) U (3 <= Pout1)))
lola: processed formula length: 31
lola: 56 rewrites
lola: closed formula file Kanban-PT-0020-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: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((Pout1 <= Pback1) U ((3 <= Pm1) AND (Pout3 <= Pback2))))
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 (((Pout1 <= Pback1) U ((3 <= Pm1) AND (Pout3 <= Pback2))))
lola: processed formula length: 60
lola: 56 rewrites
lola: closed formula file Kanban-PT-0020-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 <= Pm1) AND (Pout3 <= Pback2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 633 markings, 1006 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (((Pm3 <= P2) AND (3 <= P2)))) AND (1 <= Pback2)) OR E (((1 <= P3) U (P1 <= Pm1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= Pback2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Pback2)
lola: processed formula length: 13
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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 2864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= P3) U (P1 <= Pm1)))
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 (((1 <= P3) U (P1 <= Pm1)))
lola: processed formula length: 29
lola: 56 rewrites
lola: closed formula file Kanban-PT-0020-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: (P1 <= Pm1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0020-CTLCardinality-15-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: 1014 markings, 1772 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= Pback2) OR (3 <= P2) OR (Pm3 + 1 <= Pout3)))) OR ((Pback3 + 1 <= Pout4) OR E (G ((Pm3 + 1 <= Pback4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pback3 + 1 <= Pout4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pback3 + 1 <= Pout4)
lola: processed formula length: 21
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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: 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: A (G (((1 <= Pback2) OR (3 <= P2) OR (Pm3 + 1 <= Pout3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= Pback2) OR (3 <= P2) OR (Pm3 + 1 <= Pout3))))
lola: processed formula length: 60
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: ((Pback2 <= 0) AND (P2 <= 2) AND (Pout3 <= Pm3))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0020-CTLCardinality-17-0.sara
lola: state equation: calling and running 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: 55 markings, 54 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((P1 <= Pout2))) OR ((1 <= Pout1) AND (2 <= Pout3) AND (Pm4 + 1 <= Pout4)))))
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: ========================================
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (P1 <= Pout2))) AND ((Pout1 <= 0) OR (Pout3 <= 1) OR (Pout4 <= Pm4)))))
lola: processed formula length: 100
lola: 57 rewrites
lola: closed formula file Kanban-PT-0020-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).
sara: try reading problem file Kanban-PT-0020-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: 1565997 markings, 7276752 edges, 313199 markings/sec, 0 secs
lola: 3094692 markings, 14213035 edges, 305739 markings/sec, 5 secs
lola: 4576379 markings, 20920763 edges, 296337 markings/sec, 10 secs
lola: 6027374 markings, 27478895 edges, 290199 markings/sec, 15 secs
lola: 7462575 markings, 33948812 edges, 287040 markings/sec, 20 secs
lola: 8836065 markings, 40136117 edges, 274698 markings/sec, 25 secs
lola: 10204678 markings, 46284215 edges, 273723 markings/sec, 30 secs
lola: 11583440 markings, 52472909 edges, 275752 markings/sec, 35 secs
lola: 12988123 markings, 58764486 edges, 280937 markings/sec, 40 secs
lola: 14401111 markings, 65096530 edges, 282598 markings/sec, 45 secs
lola: 15821638 markings, 71455086 edges, 284105 markings/sec, 50 secs
lola: 17242481 markings, 77800246 edges, 284169 markings/sec, 55 secs
lola: 18660655 markings, 84134370 edges, 283635 markings/sec, 60 secs
lola: 20073805 markings, 90440589 edges, 282630 markings/sec, 65 secs
lola: 21492215 markings, 96740360 edges, 283682 markings/sec, 70 secs
lola: 22906329 markings, 103011660 edges, 282823 markings/sec, 75 secs
lola: 24322937 markings, 109297664 edges, 283322 markings/sec, 80 secs
lola: 25726917 markings, 115558119 edges, 280796 markings/sec, 85 secs
lola: 27134257 markings, 121820652 edges, 281468 markings/sec, 90 secs
lola: 28543519 markings, 128092079 edges, 281852 markings/sec, 95 secs
lola: 29953752 markings, 134359082 edges, 282047 markings/sec, 100 secs
lola: 31357989 markings, 140582935 edges, 280847 markings/sec, 105 secs
lola: 32741747 markings, 146720320 edges, 276752 markings/sec, 110 secs
lola: 34127456 markings, 152857218 edges, 277142 markings/sec, 115 secs
lola: 35500329 markings, 158941817 edges, 274575 markings/sec, 120 secs
lola: 36908579 markings, 165138945 edges, 281650 markings/sec, 125 secs
lola: 38289314 markings, 171249076 edges, 276147 markings/sec, 130 secs
lola: 39682919 markings, 177404730 edges, 278721 markings/sec, 135 secs
lola: 41085307 markings, 183587028 edges, 280478 markings/sec, 140 secs
lola: 42499039 markings, 189802624 edges, 282746 markings/sec, 145 secs
lola: 43911286 markings, 196025437 edges, 282449 markings/sec, 150 secs
lola: 45306517 markings, 202186036 edges, 279046 markings/sec, 155 secs
lola: 46715268 markings, 208386927 edges, 281750 markings/sec, 160 secs
lola: 48102769 markings, 214486262 edges, 277500 markings/sec, 165 secs
lola: 49459243 markings, 220455182 edges, 271295 markings/sec, 170 secs
lola: 50834728 markings, 226516943 edges, 275097 markings/sec, 175 secs
lola: 52190471 markings, 232495221 edges, 271149 markings/sec, 180 secs
lola: 53543174 markings, 238428860 edges, 270541 markings/sec, 185 secs
lola: 54920504 markings, 244483394 edges, 275466 markings/sec, 190 secs
lola: 56316664 markings, 250609927 edges, 279232 markings/sec, 195 secs
lola: 57710877 markings, 256737871 edges, 278843 markings/sec, 200 secs
lola: 59114853 markings, 262885255 edges, 280795 markings/sec, 205 secs
lola: 60485775 markings, 268887020 edges, 274184 markings/sec, 210 secs
lola: 61850728 markings, 274894873 edges, 272991 markings/sec, 215 secs
lola: 63234694 markings, 280946931 edges, 276793 markings/sec, 220 secs
lola: 64618873 markings, 287012133 edges, 276836 markings/sec, 225 secs
lola: 65995417 markings, 293055103 edges, 275309 markings/sec, 230 secs
lola: 67391494 markings, 299162170 edges, 279215 markings/sec, 235 secs
lola: 68764397 markings, 305191342 edges, 274581 markings/sec, 240 secs
lola: 70137804 markings, 311230822 edges, 274681 markings/sec, 245 secs
lola: 71531098 markings, 317303446 edges, 278659 markings/sec, 250 secs
lola: 72906979 markings, 323352381 edges, 275176 markings/sec, 255 secs
lola: 74297085 markings, 329404861 edges, 278021 markings/sec, 260 secs
lola: 75688732 markings, 335460353 edges, 278329 markings/sec, 265 secs
lola: 77078852 markings, 341533344 edges, 278024 markings/sec, 270 secs
lola: 78469888 markings, 347612639 edges, 278207 markings/sec, 275 secs
lola: 79863444 markings, 353690595 edges, 278711 markings/sec, 280 secs
lola: 81255016 markings, 359795910 edges, 278314 markings/sec, 285 secs
lola: 82651678 markings, 365864669 edges, 279332 markings/sec, 290 secs
lola: 84050936 markings, 371956218 edges, 279852 markings/sec, 295 secs
lola: 85440500 markings, 378019142 edges, 277913 markings/sec, 300 secs
lola: 86823311 markings, 384058917 edges, 276562 markings/sec, 305 secs
lola: 88212007 markings, 390117157 edges, 277739 markings/sec, 310 secs
lola: 89593129 markings, 396140987 edges, 276224 markings/sec, 315 secs
lola: 90981595 markings, 402187240 edges, 277693 markings/sec, 320 secs
lola: 92373365 markings, 408223189 edges, 278354 markings/sec, 325 secs
lola: 93765473 markings, 414267621 edges, 278422 markings/sec, 330 secs
lola: 95140606 markings, 420283292 edges, 275027 markings/sec, 335 secs
lola: 96530191 markings, 426327793 edges, 277917 markings/sec, 340 secs
lola: 97920606 markings, 432382774 edges, 278083 markings/sec, 345 secs
lola: 99309260 markings, 438418117 edges, 277731 markings/sec, 350 secs
lola: 100679784 markings, 444383591 edges, 274105 markings/sec, 355 secs
lola: 102058153 markings, 450388583 edges, 275674 markings/sec, 360 secs
lola: 103436431 markings, 456361798 edges, 275656 markings/sec, 365 secs
lola: 104832880 markings, 462399007 edges, 279290 markings/sec, 370 secs
lola: 106212705 markings, 468395225 edges, 275965 markings/sec, 375 secs
lola: 107592924 markings, 474391529 edges, 276044 markings/sec, 380 secs
lola: 108976622 markings, 480433247 edges, 276740 markings/sec, 385 secs
lola: 110359699 markings, 486461485 edges, 276615 markings/sec, 390 secs
lola: 111751515 markings, 492478483 edges, 278363 markings/sec, 395 secs
lola: 113156033 markings, 498527683 edges, 280904 markings/sec, 400 secs
lola: 114533999 markings, 504512357 edges, 275593 markings/sec, 405 secs
lola: 115954493 markings, 510669207 edges, 284099 markings/sec, 410 secs
lola: 117333234 markings, 516638863 edges, 275748 markings/sec, 415 secs
lola: 118709500 markings, 522607798 edges, 275253 markings/sec, 420 secs
lola: 120112463 markings, 528655955 edges, 280593 markings/sec, 425 secs
lola: 121481906 markings, 534611386 edges, 273889 markings/sec, 430 secs
lola: 122859676 markings, 540585874 edges, 275554 markings/sec, 435 secs
lola: 124219327 markings, 546516800 edges, 271930 markings/sec, 440 secs
lola: 125599413 markings, 552501760 edges, 276017 markings/sec, 445 secs
lola: 126993484 markings, 558544412 edges, 278814 markings/sec, 450 secs
lola: 128325209 markings, 564328680 edges, 266345 markings/sec, 455 secs
lola: 129689001 markings, 570179402 edges, 272758 markings/sec, 460 secs
lola: 131069406 markings, 576150846 edges, 276081 markings/sec, 465 secs
lola: 132464385 markings, 582188233 edges, 278996 markings/sec, 470 secs
lola: 132787604 markings, 583566015 edges, 64644 markings/sec, 475 secs
lola: 132835724 markings, 583774831 edges, 9624 markings/sec, 480 secs
lola: 132857169 markings, 583863900 edges, 4289 markings/sec, 485 secs
lola: 132871569 markings, 583927636 edges, 2880 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA Kanban-PT-0020-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (((3 <= Pout2) R ((Pback2 + 1 <= P4) OR (Pout2 <= 2))))
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 (((3 <= Pout2) R ((Pback2 + 1 <= P4) OR (Pout2 <= 2))))
lola: processed formula length: 58
lola: 59 rewrites
lola: closed formula file Kanban-PT-0020-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: ((P4 <= Pback2) AND (3 <= Pout2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0020-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0020-CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || 2824415 markings, 8084979 edges, 564883 markings/sec, 0 secs
lola: sara is running 5 secs || 5553726 markings, 16231335 edges, 545862 markings/sec, 5 secs
lola: sara is running 10 secs || 8227024 markings, 24298100 edges, 534660 markings/sec, 10 secs
lola: sara is running 15 secs || 10841970 markings, 32228019 edges, 522989 markings/sec, 15 secs
lola: sara is running 20 secs || 13428462 markings, 40136828 edges, 517298 markings/sec, 20 secs
lola: sara is running 25 secs || 16095120 markings, 48318626 edges, 533332 markings/sec, 25 secs
lola: sara is running 30 secs || 18762000 markings, 56552535 edges, 533376 markings/sec, 30 secs
lola: sara is running 35 secs || 21407546 markings, 64763267 edges, 529109 markings/sec, 35 secs
lola: sara is running 40 secs || 24050744 markings, 72948405 edges, 528640 markings/sec, 40 secs
lola: sara is running 45 secs || 26691066 markings, 81131042 edges, 528064 markings/sec, 45 secs
lola: sara is running 50 secs || 29246557 markings, 89172942 edges, 511098 markings/sec, 50 secs
lola: sara is running 55 secs || 31833570 markings, 97215414 edges, 517403 markings/sec, 55 secs
lola: sara is running 60 secs || 34403914 markings, 105235376 edges, 514069 markings/sec, 60 secs
lola: sara is running 65 secs || 36934301 markings, 113180738 edges, 506077 markings/sec, 65 secs
lola: sara is running 70 secs || 39481227 markings, 121191734 edges, 509385 markings/sec, 70 secs
lola: sara is running 75 secs || 42053295 markings, 129194144 edges, 514414 markings/sec, 75 secs
lola: sara is running 80 secs || 44587563 markings, 137141092 edges, 506854 markings/sec, 80 secs
lola: sara is running 85 secs || 47142075 markings, 145226625 edges, 510902 markings/sec, 85 secs
lola: sara is running 90 secs || 49706513 markings, 153301594 edges, 512888 markings/sec, 90 secs
lola: sara is running 95 secs || 52294103 markings, 161435466 edges, 517518 markings/sec, 95 secs
lola: sara is running 100 secs || 54833507 markings, 169436996 edges, 507881 markings/sec, 100 secs
lola: sara is running 105 secs || 57402303 markings, 177511642 edges, 513759 markings/sec, 105 secs
lola: sara is running 110 secs || 59921398 markings, 185450105 edges, 503819 markings/sec, 110 secs
lola: sara is running 115 secs || 62553660 markings, 193774029 edges, 526452 markings/sec, 115 secs
lola: sara is running 120 secs || 65142755 markings, 201987775 edges, 517819 markings/sec, 120 secs
lola: sara is running 125 secs || 67374249 markings, 209024599 edges, 446299 markings/sec, 125 secs
lola: sara is running 130 secs || 69564096 markings, 215977762 edges, 437969 markings/sec, 130 secs
lola: sara is running 135 secs || 71763928 markings, 222941872 edges, 439966 markings/sec, 135 secs
lola: sara is running 140 secs || 73954028 markings, 229869902 edges, 438020 markings/sec, 140 secs
lola: sara is running 145 secs || 76150198 markings, 236872786 edges, 439234 markings/sec, 145 secs
lola: sara is running 150 secs || 78500839 markings, 244411295 edges, 470128 markings/sec, 150 secs
lola: sara is running 155 secs || 81020649 markings, 252420614 edges, 503962 markings/sec, 155 secs
lola: sara is running 160 secs || 83453959 markings, 260207034 edges, 486662 markings/sec, 160 secs
lola: sara is running 165 secs || 85893806 markings, 267958924 edges, 487969 markings/sec, 165 secs
lola: sara is running 170 secs || 88332019 markings, 275721466 edges, 487643 markings/sec, 170 secs
lola: sara is running 175 secs || 90743554 markings, 283452993 edges, 482307 markings/sec, 175 secs
lola: sara is running 180 secs || 93171564 markings, 291186938 edges, 485602 markings/sec, 180 secs
lola: sara is running 185 secs || 95714532 markings, 299231601 edges, 508594 markings/sec, 185 secs
lola: sara is running 190 secs || 98244291 markings, 307290804 edges, 505952 markings/sec, 190 secs
lola: sara is running 195 secs || 100747743 markings, 315291306 edges, 500690 markings/sec, 195 secs
lola: sara is running 200 secs || 103241760 markings, 323270101 edges, 498803 markings/sec, 200 secs
lola: sara is running 205 secs || 105762048 markings, 331300983 edges, 504058 markings/sec, 205 secs
lola: sara is running 210 secs || 108274338 markings, 339311801 edges, 502458 markings/sec, 210 secs
lola: sara is running 215 secs || 110716201 markings, 347102583 edges, 488373 markings/sec, 215 secs
lola: sara is running 220 secs || 113116169 markings, 354752301 edges, 479994 markings/sec, 220 secs
lola: sara is running 225 secs || 115450078 markings, 362249754 edges, 466782 markings/sec, 225 secs
lola: sara is running 230 secs || 117849768 markings, 369966127 edges, 479938 markings/sec, 230 secs
lola: sara is running 235 secs || 120262505 markings, 377708755 edges, 482547 markings/sec, 235 secs
lola: sara is running 240 secs || 122677308 markings, 385420728 edges, 482961 markings/sec, 240 secs
lola: sara is running 245 secs || 125074229 markings, 393122326 edges, 479384 markings/sec, 245 secs
lola: sara is running 250 secs || 127470707 markings, 400851477 edges, 479296 markings/sec, 250 secs
lola: sara is running 255 secs || 129879954 markings, 408568515 edges, 481849 markings/sec, 255 secs
lola: sara is running 260 secs || 132288791 markings, 416254564 edges, 481767 markings/sec, 260 secs
lola: sara is running 265 secs || 134717274 markings, 423965009 edges, 485697 markings/sec, 265 secs
lola: sara is running 270 secs || 137123934 markings, 431660458 edges, 481332 markings/sec, 270 secs
lola: sara is running 275 secs || 139501371 markings, 439346314 edges, 475487 markings/sec, 275 secs
lola: sara is running 280 secs || 141909848 markings, 447042454 edges, 481695 markings/sec, 280 secs
lola: sara is running 285 secs || 144302570 markings, 454718489 edges, 478544 markings/sec, 285 secs
lola: sara is running 290 secs || 146676773 markings, 462359656 edges, 474841 markings/sec, 290 secs
lola: sara is running 295 secs || 149075562 markings, 470039303 edges, 479758 markings/sec, 295 secs
lola: sara is running 300 secs || 150222904 markings, 473688933 edges, 229468 markings/sec, 300 secs
lola: sara is running 305 secs || 150237198 markings, 473734407 edges, 2859 markings/sec, 305 secs
lola: sara is running 310 secs || 150242593 markings, 473752651 edges, 1079 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA Kanban-PT-0020-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= Pback2) OR (3 <= P2) OR (Pm3 + 1 <= Pout3)))) OR ((Pback3 + 1 <= Pout4) OR E (G ((Pm3 + 1 <= Pback4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (Pback3 + 1 <= Pout4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pback3 + 1 <= Pout4)
lola: processed formula length: 21
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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: ========================================
lola: ...considering subproblem: E (G ((Pm3 + 1 <= Pback4)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((Pm3 + 1 <= Pback4)))
lola: processed formula length: 27
lola: 53 rewrites
lola: closed formula file Kanban-PT-0020-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: ========================================
lola: ...considering subproblem: A (G (((1 <= Pback2) OR (3 <= P2) OR (Pm3 + 1 <= Pout3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= Pback2) OR (3 <= P2) OR (Pm3 + 1 <= Pout3))))
lola: processed formula length: 60
lola: 55 rewrites
lola: closed formula file Kanban-PT-0020-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: ((Pback2 <= 0) AND (P2 <= 2) AND (Pout3 <= Pm3))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Kanban-PT-0020-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: unknown no yes yes no yes no no yes unknown yes no no no no no
lola:
preliminary result: unknown no yes yes no yes no no yes unknown yes no no no no no
lola: ========================================
lola: memory consumption: 21968 KB
lola: time consumption: 1527 seconds
BK_STOP 1527012199678
--------------------
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="Kanban-PT-0020"
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/Kanban-PT-0020.tgz
mv Kanban-PT-0020 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 Kanban-PT-0020, 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 r112-csrt-152666468900017"
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 ;