Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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-0100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666468900033
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527010688003

info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-0100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-0100 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Kanban-PT-0100 @ 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-0100-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (P2 <= P3)
lola: after: (0 <= 0)
lola: always true
lola: A (G ((((Pm1 <= Pm4) AND (Pout2 + 1 <= Pm4)) OR (Pback4 + 1 <= P2)))) : E (F (((Pback1 <= Pm2) AND (1 <= Pback1) AND (P2 <= Pout1) AND (1 <= P2) AND (Pm3 + 1 <= Pback3) AND (P4 <= 0)))) : A (G ((((P1 <= Pback3) AND (1 <= Pm3)) OR (P2 <= Pback2) OR (((1 <= P1) OR (Pback3 <= Pm1)) AND ((2 <= P3) OR (2 <= Pm3)))))) : A (G (TRUE)) : E (F (((Pout1 <= P4) AND (P1 <= Pback2) AND ((Pback3 <= Pback2) OR (1 <= P3)) AND ((Pout2 <= Pback1) OR (3 <= Pm1) OR (2 <= Pback2))))) : A (G (((Pm4 <= 0) OR (Pback3 <= 1) OR (Pout1 <= 1) OR (Pm4 + 1 <= P2)))) : A (G (((Pm3 + 1 <= Pm2) OR (Pback1 <= 1) OR ((Pout3 <= Pout2) AND (Pback4 <= P2) AND (Pback1 + 1 <= Pm2))))) : E (F ((P4 <= Pm3))) : E (F (((3 <= Pout2) AND (Pback4 + 1 <= Pout4)))) : E (F ((P4 <= 0))) : E (F (((Pout1 <= 0) AND (Pm1 + 1 <= Pout1) AND (2 <= Pback1)))) : E (F (((Pout2 + 1 <= Pm4) AND (P2 <= 1) AND ((1 <= Pm1) OR (Pout2 <= Pout1) OR (Pback2 <= Pout3))))) : E (F (((P4 <= Pout4) AND (Pback4 <= Pout2)))) : A (G ((3 <= P3))) : E (F ((((Pout4 <= 0) AND (P3 + 1 <= Pout2)) OR ((P3 <= 1) AND (Pm4 <= 1))))) : E (F (((3 <= Pback1) AND (Pm3 <= 1))))
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 3 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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-0100-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P4 <= 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 ((P4 <= 0)))
lola: processed formula length: 17
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: (P4 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-0.sara

FORMULA Kanban-PT-0100-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 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: 5 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: (P3 <= 2)
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: 295 markings, 294 edges
lola:
FORMULA Kanban-PT-0100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-2-0.sara
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P4 <= 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 ((P4 <= Pm3)))
lola: processed formula length: 19
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: (P4 <= Pm3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-3-0.sara

FORMULA Kanban-PT-0100-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Pback1) AND (Pm3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= Pback1) AND (Pm3 <= 1))))
lola: processed formula length: 38
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: ========================================
lola: state equation: calling and running sara
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= Pback1) AND (Pm3 <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0100-ReachabilityCardinality-3-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: 992 markings, 1248 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-15 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: E (F (((3 <= Pout2) AND (Pback4 + 1 <= Pout4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= Pout2) AND (Pback4 + 1 <= Pout4))))
lola: processed formula length: 48
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= Pout2) AND (Pback4 + 1 <= Pout4))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0100-ReachabilityCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Pout1 <= 0) AND (Pm1 + 1 <= Pout1) AND (2 <= Pback1))))
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 <= 0) AND (Pm1 + 1 <= Pout1) AND (2 <= Pback1))))
lola: processed formula length: 63
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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 <= 0) AND (Pm1 + 1 <= Pout1) AND (2 <= Pback1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0100-ReachabilityCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Pm4 <= 0) OR (Pback3 <= 1) OR (Pout1 <= 1) OR (Pm4 + 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:694
lola: processed formula: A (G (((Pm4 <= 0) OR (Pback3 <= 1) OR (Pout1 <= 1) OR (Pm4 + 1 <= P2))))
lola: processed formula length: 75
lola: 5 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: ((1 <= Pm4) AND (2 <= Pback3) AND (2 <= Pout1) AND (P2 <= Pm4))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 128 markings, 132 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-5 FALSE 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: E (F ((((Pout4 <= 0) AND (P3 + 1 <= Pout2)) OR ((P3 <= 1) AND (Pm4 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((Pout4 <= 0) AND (P3 + 1 <= Pout2)) OR ((P3 <= 1) AND (Pm4 <= 1)))))
lola: processed formula length: 77
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: 204 markings, 203 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P4 <= Pout4) AND (Pback4 <= 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 (((P4 <= Pout4) AND (Pback4 <= Pout2))))
lola: processed formula length: 45
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: ((P4 <= Pout4) AND (Pback4 <= Pout2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0100-ReachabilityCardinality-9-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: 101 markings, 100 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((Pm1 <= Pm4) AND (Pout2 + 1 <= Pm4)) OR (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:694
lola: processed formula: A (G ((((Pm1 <= Pm4) AND (Pout2 + 1 <= Pm4)) OR (Pback4 + 1 <= P2))))
lola: processed formula length: 70
lola: 5 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: (((Pm4 + 1 <= Pm1) OR (Pm4 <= Pout2)) AND (P2 <= Pback4))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0100-ReachabilityCardinality-10-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: 203 markings, 202 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((P1 <= Pback3) AND (1 <= Pm3)) OR (P2 <= Pback2) OR (((1 <= P1) OR (Pback3 <= Pm1)) AND ((2 <= P3) OR (2 <= Pm3))))))
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 ((((P1 <= Pback3) AND (1 <= Pm3)) OR (P2 <= Pback2) OR (((1 <= P1) OR (Pback3 <= Pm1)) AND ((2 <= P3) OR (2 <= Pm3))))))
lola: processed formula length: 129
lola: 5 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: (((Pback3 + 1 <= P1) OR (Pm3 <= 0)) AND (Pback2 + 1 <= P2) AND (((P1 <= 0) AND (Pm1 + 1 <= Pback3)) OR ((P3 <= 1) AND (Pm3 <= 1))))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0100-ReachabilityCardinality-11-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: 2077 markings, 2566 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-2 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: A (G (((Pm3 + 1 <= Pm2) OR (Pback1 <= 1) OR ((Pout3 <= Pout2) AND (Pback4 <= P2) AND (Pback1 + 1 <= Pm2)))))
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 (((Pm3 + 1 <= Pm2) OR (Pback1 <= 1) OR ((Pout3 <= Pout2) AND (Pback4 <= P2) AND (Pback1 + 1 <= Pm2)))))
lola: processed formula length: 110
lola: 5 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: ((Pm2 <= Pm3) AND (2 <= Pback1) AND ((Pout2 + 1 <= Pout3) OR (P2 + 1 <= Pback4) OR (Pm2 <= Pback1)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0100-ReachabilityCardinality-12-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: 926 markings, 1136 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Pback1 <= Pm2) AND (1 <= Pback1) AND (P2 <= Pout1) AND (1 <= P2) AND (Pm3 + 1 <= Pback3) AND (P4 <= 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 (((Pback1 <= Pm2) AND (1 <= Pback1) AND (P2 <= Pout1) AND (1 <= P2) AND (Pm3 + 1 <= Pback3) AND (P4 <= 0))))
lola: processed formula length: 113
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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 <= Pm2) AND (1 <= Pback1) AND (P2 <= Pout1) AND (1 <= P2) AND (Pm3 + 1 <= Pback3) AND (P4 <= 0))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-13-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1924 markings, 1930 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Pout2 + 1 <= Pm4) AND (P2 <= 1) AND ((1 <= Pm1) OR (Pout2 <= Pout1) OR (Pback2 <= Pout3)))))
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 (((Pout2 + 1 <= Pm4) AND (P2 <= 1) AND ((1 <= Pm1) OR (Pout2 <= Pout1) OR (Pback2 <= Pout3)))))
lola: processed formula length: 102
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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: ((Pout2 + 1 <= Pm4) AND (P2 <= 1) AND ((1 <= Pm1) OR (Pout2 <= Pout1) OR (Pback2 <= Pout3)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 299 markings, 298 edges
lola: ========================================

FORMULA Kanban-PT-0100-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Pout1 <= P4) AND (P1 <= Pback2) AND ((Pback3 <= Pback2) OR (1 <= P3)) AND ((Pout2 <= Pback1) OR (3 <= Pm1) OR (2 <= Pback2)))))
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 <= P4) AND (P1 <= Pback2) AND ((Pback3 <= Pback2) OR (1 <= P3)) AND ((Pout2 <= Pback1) OR (3 <= Pm1) OR (2 <= Pback2)))))
lola: processed formula length: 138
lola: 4 rewrites
lola: closed formula file Kanban-PT-0100-ReachabilityCardinality.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 <= P4) AND (P1 <= Pback2) AND ((Pback3 <= Pback2) OR (1 <= P3)) AND ((Pout2 <= Pback1) OR (3 <= Pm1) OR (2 <= Pback2)))
lola: state equation: Generated DNF with 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0100-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0100-ReachabilityCardinality-15-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: 797 markings, 895 edges

FORMULA Kanban-PT-0100-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes yes no no yes yes yes no yes yes no yes yes
lola:
preliminary result: no yes no yes yes no no yes yes yes no yes yes no yes yes
lola: ========================================
lola: memory consumption: 24108 KB
lola: time consumption: 0 seconds

BK_STOP 1527012303997

--------------------
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-0100"
export BK_EXAMINATION="ReachabilityCardinality"
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-0100.tgz
mv Kanban-PT-0100 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-0100, examination is ReachabilityCardinality"
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-152666468900033"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;