Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 9.7K 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 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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-0200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469000042
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527010698009

info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-0200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-0200 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Kanban-PT-0200 @ 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-0200-ReachabilityFireability.task
lola: E (F (((FIREABLE(tback2) OR FIREABLE(tback1)) AND NOT FIREABLE(tok4) AND FIREABLE(tout1) AND FIREABLE(tok2)))) : A (G ((FIREABLE(tback3) OR FIREABLE(tok4) OR (FIREABLE(tback2) AND FIREABLE(tout1)) OR NOT FIREABLE(tok2) OR NOT FIREABLE(tback4) OR FIREABLE(tout1) OR FIREABLE(tredo2) OR (FIREABLE(tredo2) AND FIREABLE(tsynch1_23))))) : A (G ((FIREABLE(tok1) OR FIREABLE(tin4)))) : E (F (())) : A (G (((FIREABLE(tsynch1_23) AND FIREABLE(tout1)) OR FIREABLE(tin4)))) : E (F ((FIREABLE(tsynch4_23) AND FIREABLE(tsynch1_23) AND FIREABLE(tback2) AND FIREABLE(tok1) AND (FIREABLE(tsynch1_23) OR FIREABLE(tredo2)) AND (FIREABLE(tback3) OR FIREABLE(tok1) OR FIREABLE(tsynch1_23) OR (NOT FIREABLE(tok2) AND FIREABLE(tok3)))))) : A (G (FIREABLE(tin4))) : A (G (((FIREABLE(tout1) AND FIREABLE(tsynch4_23)) OR NOT FIREABLE(tback4) OR NOT FIREABLE(tsynch4_23) OR (FIREABLE(tin4) AND FIREABLE(tok4)) OR NOT FIREABLE(tok4) OR FIREABLE(tsynch1_23)))) : E (F ((FIREABLE(tok4) AND FIREABLE(tredo2) AND FIREABLE(tback1) AND FIREABLE(tok1)))) : A (G ((NOT FIREABLE(tout1) OR NOT FIREABLE(tok3) OR FIREABLE(tback2) OR NOT FIREABLE(tback3) OR NOT FIREABLE(tredo3)))) : A (G (FIREABLE(tin4))) : A (G ((FIREABLE(tredo2) OR FIREABLE(tredo4) OR (NOT FIREABLE(tok4) AND NOT FIREABLE(tok2))))) : A (G (())) : A (G ((NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3) OR (FIREABLE(tback4) AND FIREABLE(tback2) AND NOT FIREABLE(tok4)) OR NOT FIREABLE(tsynch1_23) OR (FIREABLE(tok3) AND (FIREABLE(tout1) OR FIREABLE(tback4)))))) : A (G (())) : A (G ((FIREABLE(tin4) OR FIREABLE(tback2) OR FIREABLE(tredo3))))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 9 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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-0200-ReachabilityFireability-3 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: 9 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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-0200-ReachabilityFireability-12 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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-0200-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(tin4)))
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 (FIREABLE(tin4)))
lola: processed formula length: 22
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-6 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: A (G (FIREABLE(tin4)))
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 (FIREABLE(tin4)))
lola: processed formula length: 22
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: NOT FIREABLE(tin4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0200-ReachabilityFireability-4-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: 201 markings, 200 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-10 FALSE 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 (G ((FIREABLE(tok1) OR FIREABLE(tin4))))
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 ((FIREABLE(tok1) OR FIREABLE(tin4))))
lola: processed formula length: 43
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: (NOT FIREABLE(tok1) AND NOT FIREABLE(tin4))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(tsynch1_23) AND FIREABLE(tout1)) OR FIREABLE(tin4))))
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 (((FIREABLE(tsynch1_23) AND FIREABLE(tout1)) OR FIREABLE(tin4))))
lola: processed formula length: 71
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: ((NOT FIREABLE(tsynch1_23) OR NOT FIREABLE(tout1)) AND NOT FIREABLE(tin4))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: state equation: write sara problem file to Kanban-PT-0200-ReachabilityFireability-6-0.sara
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-4 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 ((FIREABLE(tin4) OR FIREABLE(tback2) OR FIREABLE(tredo3))))
lola: ========================================
lola: SUBTASK
lola: state equation: calling and running sara
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 ((FIREABLE(tin4) OR FIREABLE(tback2) OR FIREABLE(tredo3))))
lola: processed formula length: 66
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: (NOT FIREABLE(tin4) AND NOT FIREABLE(tback2) AND NOT FIREABLE(tredo3))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0200-ReachabilityFireability-7-0.sara
sara: lola: try reading problem file Kanban-PT-0200-ReachabilityFireability-6-0.sara.
state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 201 markings, 200 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-15 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: A (G ((FIREABLE(tredo2) OR FIREABLE(tredo4) OR (NOT FIREABLE(tok4) AND NOT FIREABLE(tok2)))))
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 ((FIREABLE(tredo2) OR FIREABLE(tredo4) OR (NOT FIREABLE(tok4) AND NOT FIREABLE(tok2)))))
lola: processed formula length: 95
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: (NOT FIREABLE(tredo2) AND NOT FIREABLE(tredo4) AND (FIREABLE(tok4) OR FIREABLE(tok2)))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-11 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 ((FIREABLE(tok4) AND FIREABLE(tredo2) AND FIREABLE(tback1) AND FIREABLE(tok1))))
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 ((FIREABLE(tok4) AND FIREABLE(tredo2) AND FIREABLE(tback1) AND FIREABLE(tok1))))
lola: processed formula length: 85
lola: 10 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: 1840 markings, 2252 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-8 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 ((NOT FIREABLE(tout1) OR NOT FIREABLE(tok3) OR FIREABLE(tback2) OR NOT FIREABLE(tback3) OR NOT FIREABLE(tredo3))))
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 ((NOT FIREABLE(tout1) OR NOT FIREABLE(tok3) OR FIREABLE(tback2) OR NOT FIREABLE(tback3) OR NOT FIREABLE(tredo3))))
lola: processed formula length: 123
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: 2823 markings, 3632 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-9 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: E (F (((FIREABLE(tback2) OR FIREABLE(tback1)) AND NOT FIREABLE(tok4) AND FIREABLE(tout1) AND FIREABLE(tok2))))
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 (((FIREABLE(tback2) OR FIREABLE(tback1)) AND NOT FIREABLE(tok4) AND FIREABLE(tout1) AND FIREABLE(tok2))))
lola: processed formula length: 111
lola: 10 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: ((FIREABLE(tback2) OR FIREABLE(tback1)) AND NOT FIREABLE(tok4) AND FIREABLE(tout1) AND FIREABLE(tok2))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0200-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0200-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 15 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-0 TRUE 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 (((FIREABLE(tout1) AND FIREABLE(tsynch4_23)) OR NOT FIREABLE(tback4) OR NOT FIREABLE(tsynch4_23) OR (FIREABLE(tin4) AND FIREABLE(tok4)) OR NOT FIREABLE(tok4) OR FIREABLE(tsynch1_23))))
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 (((FIREABLE(tout1) AND FIREABLE(tsynch4_23)) OR NOT FIREABLE(tback4) OR NOT FIREABLE(tsynch4_23) OR (FIREABLE(tin4) AND FIREABLE(tok4)) OR NOT FIREABLE(tok4) OR FIREABLE(tsynch1_23))))
lola: processed formula length: 194
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: ((NOT FIREABLE(tout1) OR NOT FIREABLE(tsynch4_23)) AND FIREABLE(tback4) AND FIREABLE(tsynch4_23) AND (NOT FIREABLE(tin4) OR NOT FIREABLE(tok4)) AND FIREABLE(tok4) AND NOT FIREABLE(tsynch1_23))
lola: state equation: Generated DNF with 24 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0200-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file Kanban-PT-0200-ReachabilityFireability-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: 403 markings, 403 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-7 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: A (G ((NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3) OR (FIREABLE(tback4) AND FIREABLE(tback2) AND NOT FIREABLE(tok4)) OR NOT FIREABLE(tsynch1_23) OR (FIREABLE(tok3) AND (FIREABLE(tout1) OR FIREABLE(tback4))))))
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 ((NOT FIREABLE(tredo1) OR NOT FIREABLE(tback3) OR (FIREABLE(tback4) AND FIREABLE(tback2) AND NOT FIREABLE(tok4)) OR NOT FIREABLE(tsynch1_23) OR (FIREABLE(tok3) AND (FIREABLE(tout1) OR FIREABLE(tback4))))))
lola: processed formula length: 215
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: (FIREABLE(tredo1) AND FIREABLE(tback3) AND (NOT FIREABLE(tback4) OR NOT FIREABLE(tback2) OR FIREABLE(tok4)) AND FIREABLE(tsynch1_23) AND (NOT FIREABLE(tok3) OR (NOT FIREABLE(tout1) AND NOT FIREABLE(tback4))))
lola: state equation: Generated DNF with 45 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Kanban-PT-0200-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Kanban-PT-0200-ReachabilityFireability-13-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: 20 markings, 22 edges
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-13 FALSE 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 ((FIREABLE(tsynch4_23) AND FIREABLE(tsynch1_23) AND FIREABLE(tback2) AND FIREABLE(tok1) AND (FIREABLE(tsynch1_23) OR FIREABLE(tredo2)) AND (FIREABLE(tback3) OR FIREABLE(tok1) OR FIREABLE(tsynch1_23) OR (NOT FIREABLE(tok2) AND FIREABLE(tok3))))))
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 ((FIREABLE(tsynch4_23) AND FIREABLE(tsynch1_23) AND FIREABLE(tback2) AND FIREABLE(tok1) AND (FIREABLE(tsynch1_23) OR FIREABLE(tredo2)) AND (FIREABLE(tback3) OR FIREABLE(tok1) OR FIREABLE(tsynch1_23) OR (NOT FIREABLE(tok2) AND FIREABLE(tok3))))))
lola: processed formula length: 254
lola: 10 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: (FIREABLE(tsynch4_23) AND FIREABLE(tsynch1_23) AND FIREABLE(tback2) AND FIREABLE(tok1) AND (FIREABLE(tsynch1_23) OR FIREABLE(tredo2)) AND (FIREABLE(tback3) OR FIREABLE(tok1) OR FIREABLE(tsynch1_23) OR (NOT FIREABLE(tok2) AND FIREABLE(tok3))))
lola: state equation: Generated DNF with 83 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to Kanban-PT-0200-ReachabilityFireability-14-0.sara
lola: ========================================

FORMULA Kanban-PT-0200-ReachabilityFireability-5 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: A (G ((FIREABLE(tback3) OR FIREABLE(tok4) OR (FIREABLE(tback2) AND FIREABLE(tout1)) OR NOT FIREABLE(tok2) OR NOT FIREABLE(tback4) OR FIREABLE(tout1) OR FIREABLE(tredo2) OR (FIREABLE(tredo2) AND FIREABLE(tsynch1_23)))))
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 ((FIREABLE(tback3) OR FIREABLE(tok4) OR (FIREABLE(tback2) AND FIREABLE(tout1)) OR NOT FIREABLE(tok2) OR NOT FIREABLE(tback4) OR FIREABLE(tout1) OR FIREABLE(tredo2) OR (FIREABLE(tredo2) AND FIREABLE(tsynch1_23)))))
lola: processed formula length: 225
lola: 11 rewrites
lola: closed formula file Kanban-PT-0200-ReachabilityFireability.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: (NOT FIREABLE(tback3) AND NOT FIREABLE(tok4) AND (NOT FIREABLE(tback2) OR NOT FIREABLE(tout1)) AND FIREABLE(tok2) AND FIREABLE(tback4) AND NOT FIREABLE(tout1) AND NOT FIREABLE(tredo2) AND (NOT FIREABLE(tredo2) OR NOT FIREABLE(tsynch1_23)))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA Kanban-PT-0200-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no no yes no no yes yes no yes no
lola:
preliminary result: yes yes no no no yes no no yes no no yes yes no yes no
lola: ========================================
lola: memory consumption: 14544 KB
lola: time consumption: 0 seconds


BK_STOP 1527010698400

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