fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r112-csrt-152666468900010
Last Updated
June 26, 2018

About the Execution of LoLA for Kanban-PT-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
201.250 1695404.00 42114.00 194.40 FTFTFTTTTTTFFTFT 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.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K 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.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 2.9K 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-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666468900010
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527010663907

info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-0010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Kanban-PT-0010 @ 3569 seconds
lola: LoLA will run for 3569 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-0010-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: (((Pm4 <= 0) AND (P3 <= 2) AND (P4 <= 1) AND (Pback2 <= 2)) OR A (G (((Pback1 <= 2) OR (P1 <= 2))))) : (E (F (E (X ((2 <= Pback1))))) AND (((2 <= Pm2) OR (Pm4 <= Pout3)) AND (Pout1 <= 0))) : A (G (A (X ((Pm3 + 1 <= P1))))) : NOT((E ((TRUE U (3 <= Pm2))) AND A (G (((Pback1 <= Pout1) OR (Pback3 <= P1)))))) : NOT(A (X (A (G (TRUE))))) : (NOT(A (G (((Pback1 <= P2) OR (1 <= Pout4))))) AND E (((1 <= Pback3) U (Pback4 <= 1)))) : E (F (E (X (((3 <= Pm1) AND (1 <= P3)))))) : E (F (A (((1 <= P1) U (P2 <= Pout1))))) : (E (F (((P2 <= 2) OR (P1 + 1 <= Pm3)))) AND (((P1 <= Pout1) OR E (G ((Pback4 <= P1)))) AND E (X (((Pm3 <= Pback4) OR (2 <= Pout2)))))) : A (G (TRUE)) : ((E (((Pback4 <= Pback3) U (P3 <= Pout4))) AND A (((3 <= P1) U (3 <= P1)))) OR A (X (A (G ((Pm2 <= Pback3)))))) : A (G ((((Pm2 <= 1) OR ((Pback4 <= P2) AND (1 <= P1))) OR E (G ((2 <= Pback2)))))) : NOT(E (F (((P2 <= Pback1) OR (P1 <= Pm1) OR (P1 <= 1))))) : E ((A (F ((Pback2 <= Pout4))) U (((3 <= Pout2) OR (2 <= Pout2)) AND (Pout2 + 1 <= Pout3)))) : ((A (F ((Pm3 + 1 <= Pback1))) AND (E (F ((1 <= Pm4))) AND ((Pout1 <= Pback4) AND (Pm4 <= Pout4) AND ((1 <= Pm2) OR (Pback2 <= Pback3))))) OR E (((Pm2 <= Pout3) U ((3 <= Pback2) AND (3 <= Pm2))))) : NOT(NOT(E (F (((P3 <= Pout4) AND (3 <= Pback3))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:279
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:395
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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: 32 rewrites
lola: closed formula file Kanban-PT-0010-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-0010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 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: 32 rewrites
lola: closed formula file Kanban-PT-0010-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-0010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((2 <= Pback1))))) AND (((2 <= Pm2) OR (Pm4 <= Pout3)) AND (Pout1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= Pm2) OR (Pm4 <= Pout3)) AND (Pout1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= Pm2) OR (Pm4 <= Pout3)) AND (Pout1 <= 0))
lola: processed formula length: 50
lola: 32 rewrites
lola: closed formula file Kanban-PT-0010-CTLCardinality.task
lola: processed formula with 3 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: E (X (E (F ((2 <= Pback1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (2 <= Pback1)
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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: 116 markings, 148 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((3 <= Pm1) AND (1 <= P3))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: ((3 <= Pm1) AND (1 <= P3))
lola: processed formula length: 26
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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: 127 markings, 162 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((P2 <= 2) OR (P1 + 1 <= Pm3)))) AND (((P1 <= Pout1) OR E (G ((Pback4 <= P1)))) AND E (X (((Pm3 <= Pback4) OR (2 <= Pout2))))))
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: (P1 <= Pout1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P1 <= Pout1)
lola: processed formula length: 13
lola: 32 rewrites
lola: closed formula file Kanban-PT-0010-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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((Pback4 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((Pback4 <= P1)))
lola: processed formula length: 22
lola: 32 rewrites
lola: closed formula file Kanban-PT-0010-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 is possibly preserved.
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P2 <= 2) OR (P1 + 1 <= Pm3))))
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 (((P2 <= 2) OR (P1 + 1 <= Pm3))))
lola: processed formula length: 39
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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: 99 markings, 126 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((Pm3 <= Pback4) OR (2 <= Pout2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((Pm3 <= Pback4) OR (2 <= Pout2)))
lola: processed formula length: 38
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((Pm3 + 1 <= P1)))))
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: (P1 <= Pm3)
lola: processed formula length: 11
lola: 34 rewrites
lola: closed formula file Kanban-PT-0010-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: 88 markings, 112 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (((Pback4 <= Pback3) U (P3 <= Pout4))) AND A (((3 <= P1) U (3 <= P1)))) OR A (X (A (G ((Pm2 <= Pback3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= P1) U (3 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((3 <= P1) U (3 <= P1)))
lola: processed formula length: 27
lola: 36 rewrites
lola: closed formula file Kanban-PT-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((Pback4 <= Pback3) U (P3 <= Pout4)))
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 (((Pback4 <= Pback3) U (P3 <= Pout4)))
lola: processed formula length: 40
lola: 35 rewrites
lola: closed formula file Kanban-PT-0010-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: (P3 <= Pout4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-7-0.sara
lola: state equation: calling and running 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: 1413 markings, 2666 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-10 TRUE 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: E (F (((P3 <= Pout4) AND (3 <= Pback3))))
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 <= Pout4) AND (3 <= Pback3))))
lola: processed formula length: 41
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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: ((P3 <= Pout4) AND (3 <= Pback3))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-7-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Pback1 + 1 <= P2) AND (Pm1 + 1 <= P1) AND (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 (((Pback1 + 1 <= P2) AND (Pm1 + 1 <= P1) AND (2 <= P1))))
lola: processed formula length: 62
lola: 34 rewrites
lola: closed formula file Kanban-PT-0010-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: 95 markings, 126 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= P1) U (P2 <= Pout1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U A((1 <= P1) U (P2 <= Pout1)))
lola: processed formula length: 38
lola: 34 rewrites
lola: closed formula file Kanban-PT-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11765 markings, 47606 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((Pback2 <= Pout4))) U (((3 <= Pout2) OR (2 <= Pout2)) AND (Pout2 + 1 <= Pout3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(A(TRUE U (Pback2 <= Pout4)) U (((3 <= Pout2) OR (2 <= Pout2)) AND (Pout2 + 1 <= Pout3)))
lola: processed formula length: 91
lola: 34 rewrites
lola: closed formula file Kanban-PT-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4219 markings, 12218 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Pm2 <= 1) OR ((Pback4 <= P2) AND (1 <= P1))) OR E (G ((2 <= Pback2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (((2 <= Pm2) AND ((P2 + 1 <= Pback4) OR (P1 <= 0))) AND A(TRUE U (Pback2 <= 1)))))
lola: processed formula length: 96
lola: 38 rewrites
lola: closed formula file Kanban-PT-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 114330 markings, 266057 edges
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((Pm4 <= 0) AND (P3 <= 2) AND (P4 <= 1) AND (Pback2 <= 2)) OR A (G (((Pback1 <= 2) OR (P1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Pback1 <= 2) OR (P1 <= 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:694
lola: processed formula: A (G (((Pback1 <= 2) OR (P1 <= 2))))
lola: processed formula length: 37
lola: 34 rewrites
lola: closed formula file Kanban-PT-0010-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: 153 markings, 217 edges
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pm4 <= 0) AND (P3 <= 2) AND (P4 <= 1) AND (Pback2 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pm4 <= 0) AND (P3 <= 2) AND (P4 <= 1) AND (Pback2 <= 2))
lola: processed formula length: 58
lola: 32 rewrites
lola: closed formula file Kanban-PT-0010-CTLCardinality.task
lola: processed formula with 4 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-0010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((P2 + 1 <= Pback1) AND (Pout4 <= 0)))) AND E (((1 <= Pback3) U (Pback4 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= Pback3) U (Pback4 <= 1)))
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 <= Pback3) U (Pback4 <= 1)))
lola: processed formula length: 35
lola: 35 rewrites
lola: closed formula file Kanban-PT-0010-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: (Pback4 <= 1)
lola: state equation: Generated DNF with 1 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: 0 markings, 0 edges
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P2 + 1 <= Pback1) AND (Pout4 <= 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 (((P2 + 1 <= Pback1) AND (Pout4 <= 0))))
lola: processed formula length: 45
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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: ((P2 + 1 <= Pback1) AND (Pout4 <= 0))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-14-0.sara
sara: try reading problem file Kanban-PT-0010-CTLCardinality-13-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0010-CTLCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 38 markings, 38 edges
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Pm2 <= 2))) OR E (F (((Pout1 + 1 <= Pback1) AND (P1 + 1 <= Pback3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pm2 <= 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 ((Pm2 <= 2)))
lola: processed formula length: 18
lola: 34 rewrites
lola: closed formula file Kanban-PT-0010-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: (3 <= Pm2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Pout1 + 1 <= Pback1) AND (P1 + 1 <= Pback3))))
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 (((Pout1 + 1 <= Pback1) AND (P1 + 1 <= Pback3))))
lola: processed formula length: 54
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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: ((Pout1 + 1 <= Pback1) AND (P1 + 1 <= Pback3))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 84 markings, 101 edges
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0010-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((Pm3 + 1 <= Pback1))) AND (E (F ((1 <= Pm4))) AND ((Pout1 <= Pback4) AND (Pm4 <= Pout4) AND ((1 <= Pm2) OR (Pback2 <= Pback3))))) OR E (((Pm2 <= Pout3) U ((3 <= Pback2) AND (3 <= Pm2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= Pm4)))
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 ((1 <= Pm4)))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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: (1 <= Pm4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-15-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((Pm2 <= Pout3) U ((3 <= Pback2) AND (3 <= Pm2))))
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 (((Pm2 <= Pout3) U ((3 <= Pback2) AND (3 <= Pm2))))
lola: processed formula length: 53
lola: 35 rewrites
lola: closed formula file Kanban-PT-0010-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 <= Pback2) AND (3 <= Pm2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-17-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 286 markings, 880 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pout1 <= Pback4) AND (Pm4 <= Pout4) AND ((1 <= Pm2) OR (Pback2 <= Pback3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Pout1 <= Pback4) AND (Pm4 <= Pout4) AND ((1 <= Pm2) OR (Pback2 <= Pback3)))
lola: processed formula length: 78
lola: 32 rewrites
lola: closed formula file Kanban-PT-0010-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (F ((Pm3 + 1 <= Pback1))) AND (E (F ((1 <= Pm4))) AND ((Pout1 <= Pback4) AND (Pm4 <= Pout4) AND ((1 <= Pm2) OR (Pback2 <= Pback3))))) OR E (((Pm2 <= Pout3) U ((3 <= Pback2) AND (3 <= Pm2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= Pm4)))
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 ((1 <= Pm4)))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file Kanban-PT-0010-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: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((Pm3 + 1 <= Pback1)))
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: (Pback1 <= Pm3)
lola: processed formula length: 15
lola: 34 rewrites
lola: closed formula file Kanban-PT-0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 12 markings, 12 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((Pm2 <= Pout3) U ((3 <= Pback2) AND (3 <= Pm2))))
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 (((Pm2 <= Pout3) U ((3 <= Pback2) AND (3 <= Pm2))))
lola: processed formula length: 53
lola: 35 rewrites
lola: closed formula file Kanban-PT-0010-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 <= Pback2) AND (3 <= Pm2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0010-CTLCardinality-18-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 286 markings, 880 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Kanban-PT-0010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes yes yes yes yes no no yes no yes
lola:
preliminary result: no yes no yes no yes yes yes yes yes yes no no yes no yes
lola: memory consumption: 24700 KB
lola: time consumption: 0 seconds

BK_STOP 1527012359311

--------------------
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-0010"
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-0010.tgz
mv Kanban-PT-0010 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-0010, 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-152666468900010"
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 ;