Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................................................................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-0500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469000045
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527010701198

info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-0500 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-0500 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Kanban-PT-0500 @ 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-0500-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: ((((P3 <= Pm3) OR (Pm4 <= 1) OR (((3 <= Pm4) OR (1 <= Pm2)) AND (Pm1 <= 2))) OR E (G (((P3 <= Pm4) AND (1 <= Pout2))))) AND ((((2 <= Pm1) OR (P3 + 1 <= Pback1)) OR A (G ((2 <= P1)))) AND E (X ((Pout1 <= 1))))) : (((Pback1 + 1 <= Pback2) AND (Pm1 <= 0)) OR (E (F ((P1 + 1 <= Pout2))) AND A (F ((Pout4 <= P2))))) : A (G (((Pm1 <= Pm3) OR E (F ((1 <= P1)))))) : A (G ((2 <= P4))) : E (F (NOT(E (F ((Pback3 <= Pout3)))))) : NOT(E (F ((P1 <= Pback2)))) : E (F (((Pback1 + 1 <= Pm1) AND ((P4 <= 2) OR ((1 <= Pback1) AND (2 <= Pm2)))))) : E (F (FALSE)) : ((NOT(E (F ((P2 <= Pback4)))) AND ((Pm4 <= Pout3) AND (1 <= P4))) AND E (X (((3 <= P3) OR (1 <= P3) OR ((2 <= Pout4) AND (Pm4 <= Pout1)))))) : E (F (NOT(A (F ((1 <= P3)))))) : (((A (G ((3 <= P3))) AND A (F ((3 <= P3)))) OR ((P1 + 1 <= Pm2) AND (Pout3 <= Pback4) AND ((Pm3 <= Pback2) OR (1 <= Pm3) OR (Pm2 <= 2)))) AND (((Pback3 <= 1) OR (P2 <= Pm4)) OR A (G ((P3 + 1 <= Pm2))))) : A (G (((Pout1 <= 1)))) : (A (G (A (X ((Pback2 <= P4))))) OR NOT((E (G ((Pback2 <= Pout3))) OR (Pback3 <= P3)))) : A (G (())) : A (G ((E (X ((3 <= Pback4))) OR E (G ((3 <= P3)))))) : A (G (A (X ((Pback1 <= P3)))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:398
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: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: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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-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-0500-CTLCardinality-7 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-13 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: (A (G ((Pback4 + 1 <= P2))) AND (((Pm4 <= Pout3) AND (1 <= P4)) AND E (X (((3 <= P3) OR (1 <= P3) OR ((2 <= Pout4) AND (Pm4 <= Pout1)))))))
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: ((Pm4 <= Pout3) AND (1 <= P4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pm4 <= Pout3) AND (1 <= P4))
lola: processed formula length: 30
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pback4 + 1 <= 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:695
lola: processed formula: A (G ((Pback4 + 1 <= P2)))
lola: processed formula length: 26
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: (P2 <= Pback4)
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: 1001 markings, 1000 edges
lola: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((Pback2 <= P4))))) OR (A (F ((Pout3 + 1 <= Pback2))) AND (P3 + 1 <= Pback3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P3 + 1 <= Pback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P3 + 1 <= Pback3)
lola: processed formula length: 18
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((Pback2 <= P4)))))
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: (P4 + 1 <= Pback2)
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: 504 markings, 503 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA Kanban-PT-0500-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((P3 <= Pm3) OR (Pm4 <= 1) OR (((3 <= Pm4) OR (1 <= Pm2)) AND (Pm1 <= 2))) OR E (G (((P3 <= Pm4) AND (1 <= Pout2))))) AND ((((2 <= Pm1) OR (P3 + 1 <= Pback1)) OR A (G ((2 <= P1)))) AND E (X ((Pout1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((P3 <= Pm4) AND (1 <= Pout2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((P3 <= Pm4) AND (1 <= Pout2))))
lola: processed formula length: 38
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-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: subprocess 5 will run for 324 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:694
lola: processed formula: A (G ((2 <= P1)))
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: (P1 <= 1)
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: 2995 markings, 2994 edges
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= Pm1) OR (P3 + 1 <= Pback1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= Pm1) OR (P3 + 1 <= Pback1))
lola: processed formula length: 35
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-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: state equation: write sara problem file to Kanban-PT-0500-CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-0 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: A (G ((E (X ((3 <= Pback4))) OR E (G ((3 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (NOT(EX((3 <= Pback4))) AND A(TRUE U (P3 <= 2)))))
lola: processed formula length: 63
lola: 32 rewrites
lola: closed formula file Kanban-PT-0500-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: 1925332 markings, 6391820 edges, 385066 markings/sec, 0 secs
lola: 3608646 markings, 13165289 edges, 336663 markings/sec, 5 secs
lola: 5276181 markings, 19540727 edges, 333507 markings/sec, 10 secs
lola: 7028271 markings, 26119860 edges, 350418 markings/sec, 15 secs
lola: 8789136 markings, 32619948 edges, 352173 markings/sec, 20 secs
lola: 10406947 markings, 38872795 edges, 323562 markings/sec, 25 secs
lola: 12271384 markings, 45902577 edges, 372887 markings/sec, 30 secs
lola: 14044452 markings, 52585666 edges, 354614 markings/sec, 35 secs
lola: 15721537 markings, 58907599 edges, 335417 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 16411568 markings, 61510603 edges

FORMULA Kanban-PT-0500-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((Pback1 <= 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 + 1 <= Pback1)
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: 1507 markings, 1507 edges
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= 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:694
lola: processed formula: A (G ((2 <= P4)))
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: (P4 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0500-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 500 markings, 499 edges
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 440 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:694
lola: processed formula: A (G (((Pout1 <= 1))))
lola: processed formula length: 22
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: ((2 <= Pout1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0500-CTLCardinality-8-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: 15 markings, 14 edges
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pback2 + 1 <= 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 ((Pback2 + 1 <= P1)))
lola: processed formula length: 26
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: (P1 <= Pback2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0500-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0500-CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3997 markings, 4495 edges
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Pback1 + 1 <= Pm1) AND ((P4 <= 2) OR ((1 <= Pback1) AND (2 <= Pm2))))))
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 + 1 <= Pm1) AND ((P4 <= 2) OR ((1 <= Pback1) AND (2 <= Pm2))))))
lola: processed formula length: 80
lola: 27 rewrites
lola: closed formula file Kanban-PT-0500-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 + 1 <= Pm1) AND ((P4 <= 2) OR ((1 <= Pback1) AND (2 <= Pm2))))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0500-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0500-CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 505 markings, 504 edges
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((P3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (P3 <= 0)
lola: processed formula length: 9
lola: 27 rewrites
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG 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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 2002 markings, 2002 edges
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Pout3 + 1 <= Pback3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (Pback3 <= Pout3)
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: 3991785 markings, 8032072 edges, 798357 markings/sec, 0 secs
lola: 7357693 markings, 15759473 edges, 673182 markings/sec, 5 secs
lola: 10638961 markings, 23207573 edges, 656254 markings/sec, 10 secs
lola: 13879413 markings, 30564154 edges, 648090 markings/sec, 15 secs
lola: 17089813 markings, 37852073 edges, 642080 markings/sec, 20 secs
lola: 20233207 markings, 44989400 edges, 628679 markings/sec, 25 secs
lola: 23418913 markings, 52246221 edges, 637141 markings/sec, 30 secs
lola: 26524342 markings, 59292854 edges, 621086 markings/sec, 35 secs
lola: 29669093 markings, 66429415 edges, 628950 markings/sec, 40 secs
lola: 32757000 markings, 73433870 edges, 617581 markings/sec, 45 secs
lola: 35794701 markings, 80339753 edges, 607540 markings/sec, 50 secs
lola: 39293209 markings, 88287888 edges, 699702 markings/sec, 55 secs
lola: 42823879 markings, 96318472 edges, 706134 markings/sec, 60 secs
lola: 46391655 markings, 104396482 edges, 713555 markings/sec, 65 secs
lola: 49927240 markings, 112439002 edges, 707117 markings/sec, 70 secs
lola: 53463764 markings, 120480116 edges, 707305 markings/sec, 75 secs
lola: 56998334 markings, 128495342 edges, 706914 markings/sec, 80 secs
lola: 60509189 markings, 136463527 edges, 702171 markings/sec, 85 secs
lola: 63975852 markings, 144347516 edges, 693333 markings/sec, 90 secs
lola: 67404732 markings, 152141821 edges, 685776 markings/sec, 95 secs
lola: 70871947 markings, 160023079 edges, 693443 markings/sec, 100 secs
lola: 74364762 markings, 167952131 edges, 698563 markings/sec, 105 secs
lola: 77809996 markings, 175774878 edges, 689047 markings/sec, 110 secs
lola: 81281476 markings, 183663546 edges, 694296 markings/sec, 115 secs
lola: 84568528 markings, 191130907 edges, 657410 markings/sec, 120 secs
lola: 87724526 markings, 198320594 edges, 631200 markings/sec, 125 secs
lola: 90957800 markings, 205671886 edges, 646655 markings/sec, 130 secs
lola: 94281834 markings, 213233866 edges, 664807 markings/sec, 135 secs
lola: 97750359 markings, 221118363 edges, 693705 markings/sec, 140 secs
lola: 101171797 markings, 228911410 edges, 684288 markings/sec, 145 secs
lola: 104556308 markings, 236629303 edges, 676902 markings/sec, 150 secs
lola: 108050309 markings, 244577349 edges, 698800 markings/sec, 155 secs
lola: 111481114 markings, 252405312 edges, 686161 markings/sec, 160 secs
lola: 114881705 markings, 260151101 edges, 680118 markings/sec, 165 secs
lola: 118252966 markings, 267847290 edges, 674252 markings/sec, 170 secs
lola: 121700324 markings, 275696679 edges, 689472 markings/sec, 175 secs
lola: 125152379 markings, 283564668 edges, 690411 markings/sec, 180 secs
lola: 128498823 markings, 291194381 edges, 669289 markings/sec, 185 secs
lola: 131793879 markings, 298711715 edges, 659011 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1107 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Pm1 <= Pm3) OR E (F ((1 <= P1))))))
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 ((Pm3 + 1 <= Pm1) AND NOT(E(TRUE U (1 <= P1))))))
lola: processed formula length: 62
lola: 30 rewrites
lola: closed formula file Kanban-PT-0500-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: 2549020 markings, 6759749 edges, 509804 markings/sec, 0 secs
lola: 4885201 markings, 13631745 edges, 467236 markings/sec, 5 secs
lola: 6910718 markings, 20738146 edges, 405103 markings/sec, 10 secs
lola: 9059128 markings, 28275928 edges, 429682 markings/sec, 15 secs
lola: 11200990 markings, 36020967 edges, 428372 markings/sec, 20 secs
lola: 13773807 markings, 43053605 edges, 514563 markings/sec, 25 secs
lola: 16258087 markings, 49916334 edges, 496856 markings/sec, 30 secs
lola: 18578601 markings, 56778159 edges, 464103 markings/sec, 35 secs
lola: 20899298 markings, 63787908 edges, 464139 markings/sec, 40 secs
lola: 23037700 markings, 70413011 edges, 427680 markings/sec, 45 secs
lola: 25183428 markings, 77109950 edges, 429146 markings/sec, 50 secs
lola: 27308474 markings, 83768167 edges, 425009 markings/sec, 55 secs
lola: 29647882 markings, 90751045 edges, 467882 markings/sec, 60 secs
lola: 31775850 markings, 97477276 edges, 425594 markings/sec, 65 secs
lola: 33875470 markings, 104197610 edges, 419924 markings/sec, 70 secs
lola: 35950472 markings, 110794582 edges, 415000 markings/sec, 75 secs
lola: 38030795 markings, 117415512 edges, 416065 markings/sec, 80 secs
lola: 40166588 markings, 124300267 edges, 427159 markings/sec, 85 secs
lola: 42434747 markings, 131084747 edges, 453632 markings/sec, 90 secs
lola: 44675350 markings, 138106388 edges, 448121 markings/sec, 95 secs
lola: 46726341 markings, 144613458 edges, 410198 markings/sec, 100 secs
lola: 48768598 markings, 151132203 edges, 408451 markings/sec, 105 secs
lola: 50818824 markings, 157722022 edges, 410045 markings/sec, 110 secs
lola: 52926254 markings, 164288202 edges, 421486 markings/sec, 115 secs
lola: 55055541 markings, 170746195 edges, 425857 markings/sec, 120 secs
lola: 56870713 markings, 176599846 edges, 363034 markings/sec, 125 secs
lola: 58676300 markings, 182386474 edges, 361117 markings/sec, 130 secs
lola: 60696434 markings, 188854208 edges, 404027 markings/sec, 135 secs
lola: 62779257 markings, 195536052 edges, 416565 markings/sec, 140 secs
lola: 64909468 markings, 202362117 edges, 426042 markings/sec, 145 secs
lola: 67011176 markings, 209141602 edges, 420342 markings/sec, 150 secs
lola: 69082836 markings, 215768577 edges, 414332 markings/sec, 155 secs
lola: 71197312 markings, 222625543 edges, 422895 markings/sec, 160 secs
lola: 73250667 markings, 229245377 edges, 410671 markings/sec, 165 secs
lola: 75269079 markings, 235756848 edges, 403682 markings/sec, 170 secs
lola: 77339739 markings, 242460131 edges, 414132 markings/sec, 175 secs
lola: 79366776 markings, 248986749 edges, 405407 markings/sec, 180 secs
lola: 81394516 markings, 255517529 edges, 405548 markings/sec, 185 secs
lola: 83286417 markings, 261643734 edges, 378380 markings/sec, 190 secs
lola: 85046020 markings, 267327289 edges, 351921 markings/sec, 195 secs
lola: 86808360 markings, 273032840 edges, 352468 markings/sec, 200 secs
lola: 88659020 markings, 279050992 edges, 370132 markings/sec, 205 secs
lola: 90584528 markings, 285299521 edges, 385102 markings/sec, 210 secs
lola: 92544872 markings, 291651271 edges, 392069 markings/sec, 215 secs
lola: 94508105 markings, 298000120 edges, 392647 markings/sec, 220 secs
lola: 96318310 markings, 303818381 edges, 362041 markings/sec, 225 secs
lola: 98059779 markings, 309463204 edges, 348294 markings/sec, 230 secs
lola: 99783040 markings, 315096053 edges, 344652 markings/sec, 235 secs
lola: 101588997 markings, 320885259 edges, 361191 markings/sec, 240 secs
lola: 103601293 markings, 327368162 edges, 402459 markings/sec, 245 secs
lola: 105610395 markings, 333858149 edges, 401820 markings/sec, 250 secs
lola: 107609741 markings, 340310503 edges, 399869 markings/sec, 255 secs
lola: 109473546 markings, 346307671 edges, 372761 markings/sec, 260 secs
lola: 111201653 markings, 351886883 edges, 345621 markings/sec, 265 secs
lola: 112909613 markings, 357425169 edges, 341592 markings/sec, 270 secs
lola: 114641578 markings, 363022316 edges, 346393 markings/sec, 275 secs
lola: 116623595 markings, 369453594 edges, 396403 markings/sec, 280 secs
lola: 118601150 markings, 375834849 edges, 395511 markings/sec, 285 secs
lola: 120472525 markings, 381922696 edges, 374275 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((Pback1 + 1 <= Pback2) AND (Pm1 <= 0)) OR (E (F ((P1 + 1 <= Pout2))) AND A (F ((Pout4 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pback1 + 1 <= Pback2) AND (Pm1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pback1 + 1 <= Pback2) AND (Pm1 <= 0))
lola: processed formula length: 39
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-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: subprocess 15 will run for 3023 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Pout4 <= P2)))
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: (P2 + 1 <= Pout4)
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: ========================================
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 3023 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((A (G ((3 <= P3))) AND A (F ((3 <= P3)))) OR ((P1 + 1 <= Pm2) AND (Pout3 <= Pback4) AND ((Pm3 <= Pback2) OR (1 <= Pm3) OR (Pm2 <= 2)))) AND (((Pback3 <= 1) OR (P2 <= Pm4)) OR A (G ((P3 + 1 <= Pm2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3023 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pback3 <= 1) OR (P2 <= Pm4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pback3 <= 1) OR (P2 <= Pm4))
lola: processed formula length: 31
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 ((3 <= P3)))
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 <= P3)))
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1495 markings, 1494 edges
lola: formula 0: (P3 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((P1 + 1 <= Pm2) AND (Pout3 <= Pback4) AND ((Pm3 <= Pback2) OR (1 <= Pm3) OR (Pm2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P1 + 1 <= Pm2) AND (Pout3 <= Pback4) AND ((Pm3 <= Pback2) OR (1 <= Pm3) OR (Pm2 <= 2)))
lola: processed formula length: 91
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: processed formula with 5 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: ========================================

lola: ========================================
FORMULA Kanban-PT-0500-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Pout3 + 1 <= Pback3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (Pback3 <= Pout3)
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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: 4413902 markings, 9068365 edges, 882780 markings/sec, 0 secs
lola: 8252679 markings, 17777432 edges, 767755 markings/sec, 5 secs
lola: 11976453 markings, 26250748 edges, 744755 markings/sec, 10 secs
lola: 15688998 markings, 34667170 edges, 742509 markings/sec, 15 secs
lola: 18993041 markings, 42185222 edges, 660809 markings/sec, 20 secs
lola: 22268059 markings, 49625091 edges, 655004 markings/sec, 25 secs
lola: 25366256 markings, 56659036 edges, 619639 markings/sec, 30 secs
lola: 28487066 markings, 63741199 edges, 624162 markings/sec, 35 secs
lola: 31564205 markings, 70725925 edges, 615428 markings/sec, 40 secs
lola: 34677829 markings, 77819406 edges, 622725 markings/sec, 45 secs
lola: 38301719 markings, 86024485 edges, 724778 markings/sec, 50 secs
lola: 41868062 markings, 94141686 edges, 713269 markings/sec, 55 secs
lola: 45425168 markings, 102221556 edges, 711421 markings/sec, 60 secs
lola: 48789948 markings, 109858615 edges, 672956 markings/sec, 65 secs
lola: 52155911 markings, 117510784 edges, 673193 markings/sec, 70 secs
lola: 55398625 markings, 124857251 edges, 648543 markings/sec, 75 secs
lola: 58554478 markings, 132045230 edges, 631171 markings/sec, 80 secs
lola: 61888419 markings, 139593431 edges, 666788 markings/sec, 85 secs
lola: 65136293 markings, 146986684 edges, 649575 markings/sec, 90 secs
lola: 68387831 markings, 154376072 edges, 650308 markings/sec, 95 secs
lola: 71926908 markings, 162410208 edges, 707815 markings/sec, 100 secs
lola: 75406078 markings, 170309278 edges, 695834 markings/sec, 105 secs
lola: 78866215 markings, 178168634 edges, 692027 markings/sec, 110 secs
lola: 82286080 markings, 185941474 edges, 683973 markings/sec, 115 secs
lola: 85612704 markings, 193511266 edges, 665325 markings/sec, 120 secs
lola: 88993052 markings, 201196424 edges, 676070 markings/sec, 125 secs
lola: 92417658 markings, 208980809 edges, 684921 markings/sec, 130 secs
lola: 95770956 markings, 216613743 edges, 670660 markings/sec, 135 secs
lola: 99144906 markings, 224301838 edges, 674790 markings/sec, 140 secs
lola: 102470285 markings, 231880029 edges, 665076 markings/sec, 145 secs
lola: 105839770 markings, 239544791 edges, 673897 markings/sec, 150 secs
lola: 109305783 markings, 247436082 edges, 693203 markings/sec, 155 secs
lola: 112680386 markings, 255138396 edges, 674921 markings/sec, 160 secs
lola: 116124163 markings, 262979618 edges, 688755 markings/sec, 165 secs
lola: 119497897 markings, 270679081 edges, 674747 markings/sec, 170 secs
lola: 122981454 markings, 278619341 edges, 696711 markings/sec, 175 secs
lola: 126421449 markings, 286460606 edges, 687999 markings/sec, 180 secs
lola: 129836743 markings, 294243323 edges, 683059 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA Kanban-PT-0500-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (((Pm1 <= Pm3) OR E (F ((1 <= P1))))))
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 ((Pm3 + 1 <= Pm1) AND NOT(E(TRUE U (1 <= P1))))))
lola: processed formula length: 62
lola: 30 rewrites
lola: closed formula file Kanban-PT-0500-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: 3062611 markings, 8312846 edges, 612522 markings/sec, 0 secs
lola: 5741417 markings, 16630529 edges, 535761 markings/sec, 5 secs
lola: 8122050 markings, 24988266 edges, 476127 markings/sec, 10 secs
lola: 10527569 markings, 33453316 edges, 481104 markings/sec, 15 secs
lola: 13170504 markings, 41444304 edges, 528587 markings/sec, 20 secs
lola: 15785569 markings, 48887652 edges, 523013 markings/sec, 25 secs
lola: 18352694 markings, 56148012 edges, 513425 markings/sec, 30 secs
lola: 20843467 markings, 63617940 edges, 498155 markings/sec, 35 secs
lola: 23085387 markings, 70559070 edges, 448384 markings/sec, 40 secs
lola: 25217664 markings, 77218451 edges, 426455 markings/sec, 45 secs
lola: 27355283 markings, 83916411 edges, 427524 markings/sec, 50 secs
lola: 29701102 markings, 90918887 edges, 469164 markings/sec, 55 secs
lola: 31849017 markings, 97709857 edges, 429583 markings/sec, 60 secs
lola: 33940137 markings, 104398587 edges, 418224 markings/sec, 65 secs
lola: 36089466 markings, 111243462 edges, 429866 markings/sec, 70 secs
lola: 38320947 markings, 118348335 edges, 446296 markings/sec, 75 secs
lola: 40469367 markings, 125265333 edges, 429684 markings/sec, 80 secs
lola: 42853593 markings, 132443525 edges, 476845 markings/sec, 85 secs
lola: 45164137 markings, 139649772 edges, 462109 markings/sec, 90 secs
lola: 47273949 markings, 146351511 edges, 421962 markings/sec, 95 secs
lola: 49302699 markings, 152845892 edges, 405750 markings/sec, 100 secs
lola: 51324288 markings, 159315850 edges, 404318 markings/sec, 105 secs
lola: 53499436 markings, 165801603 edges, 435030 markings/sec, 110 secs
lola: 55657009 markings, 172670400 edges, 431515 markings/sec, 115 secs
lola: 57743210 markings, 179399164 edges, 417240 markings/sec, 120 secs
lola: 59803533 markings, 185978870 edges, 412065 markings/sec, 125 secs
lola: 61800460 markings, 192387900 edges, 399385 markings/sec, 130 secs
lola: 63807993 markings, 198829919 edges, 401507 markings/sec, 135 secs
lola: 65793522 markings, 205226103 edges, 397106 markings/sec, 140 secs
lola: 67746037 markings, 211489306 edges, 390503 markings/sec, 145 secs
lola: 69744644 markings, 217913775 edges, 399721 markings/sec, 150 secs
lola: 71701271 markings, 224243830 edges, 391325 markings/sec, 155 secs
lola: 73558005 markings, 230234151 edges, 371347 markings/sec, 160 secs
lola: 75406142 markings, 236212822 edges, 369627 markings/sec, 165 secs
lola: 77262368 markings, 242209557 edges, 371245 markings/sec, 170 secs
lola: 79141726 markings, 248260092 edges, 375872 markings/sec, 175 secs
lola: 81079908 markings, 254515431 edges, 387636 markings/sec, 180 secs
lola: 83063556 markings, 260903114 edges, 396730 markings/sec, 185 secs
lola: 85003449 markings, 267186161 edges, 387979 markings/sec, 190 secs
lola: 86980206 markings, 273595125 edges, 395351 markings/sec, 195 secs
lola: 88943418 markings, 279966661 edges, 392642 markings/sec, 200 secs
lola: 90908200 markings, 286345289 edges, 392956 markings/sec, 205 secs
lola: 92884513 markings, 292733241 edges, 395263 markings/sec, 210 secs
lola: 94873791 markings, 299181792 edges, 397856 markings/sec, 215 secs
lola: 96833375 markings, 305483164 edges, 391917 markings/sec, 220 secs
lola: 98751656 markings, 311728070 edges, 383656 markings/sec, 225 secs
lola: 100636992 markings, 317834026 edges, 377067 markings/sec, 230 secs
lola: 102613388 markings, 324196515 edges, 395279 markings/sec, 235 secs
lola: 104605760 markings, 330671610 edges, 398474 markings/sec, 240 secs
lola: 106545163 markings, 336873924 edges, 387881 markings/sec, 245 secs
lola: 108484020 markings, 343118048 edges, 387771 markings/sec, 250 secs
lola: 110410092 markings, 349361209 edges, 385214 markings/sec, 255 secs
lola: 112339766 markings, 355591098 edges, 385935 markings/sec, 260 secs
lola: 114271610 markings, 361838166 edges, 386369 markings/sec, 265 secs
lola: 116206479 markings, 368123194 edges, 386974 markings/sec, 270 secs
lola: 118137019 markings, 374350180 edges, 386108 markings/sec, 275 secs
lola: 120070898 markings, 380599165 edges, 386776 markings/sec, 280 secs
lola: 120828185 markings, 383074753 edges, 151457 markings/sec, 285 secs
lola: 120833770 markings, 383094166 edges, 1117 markings/sec, 290 secs
lola: 120838535 markings, 383109917 edges, 953 markings/sec, 295 secs
lola: 120843947 markings, 383124560 edges, 1082 markings/sec, 300 secs
lola: 120857616 markings, 383169579 edges, 2734 markings/sec, 305 secs
lola: 120871908 markings, 383218629 edges, 2858 markings/sec, 310 secs
lola: 120879088 markings, 383243736 edges, 1436 markings/sec, 315 secs
lola: 120892519 markings, 383283719 edges, 2686 markings/sec, 320 secs
lola: 120900616 markings, 383310828 edges, 1619 markings/sec, 325 secs
lola: 120912386 markings, 383347997 edges, 2354 markings/sec, 330 secs
lola: 120919385 markings, 383370184 edges, 1400 markings/sec, 335 secs
lola: 120922427 markings, 383378342 edges, 608 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA Kanban-PT-0500-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (((Pback1 + 1 <= Pback2) AND (Pm1 <= 0)) OR (E (F ((P1 + 1 <= Pout2))) AND A (F ((Pout4 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((Pback1 + 1 <= Pback2) AND (Pm1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pback1 + 1 <= Pback2) AND (Pm1 <= 0))
lola: processed formula length: 39
lola: 26 rewrites
lola: closed formula file Kanban-PT-0500-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((Pout4 <= P2)))
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: (P2 + 1 <= Pout4)
lola: processed formula length: 17
lola: 28 rewrites
lola: closed formula file Kanban-PT-0500-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 (F ((P1 + 1 <= Pout2)))
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 ((P1 + 1 <= Pout2)))
lola: processed formula length: 25
lola: 27 rewrites
lola: closed formula file Kanban-PT-0500-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: 2007 markings, 2006 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Kanban-PT-0500-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes unknown no unknown no yes no no yes no no no yes no no
lola:
preliminary result: no yes unknown no unknown no yes no no yes no no no yes no no
lola: memory consumption: 21964 KB
lola: time consumption: 1093 seconds

BK_STOP 1527012292054

--------------------
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-0500"
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-0500.tgz
mv Kanban-PT-0500 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-0500, 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-152666469000045"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;