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 2.4M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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 6.0K 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.8K 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.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 2.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCshifumi-PT-3b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735300180
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526708632840

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCshifumi-PT-3b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DLCshifumi-PT-3b formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ DLCshifumi-PT-3b @ 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: 16669/65536 symbol table entries, 5526 collisions
lola: preprocessing...
lola: Size of bit vector: 7058
lola: finding significant places
lola: 7058 places, 9611 transitions, 6776 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 12409 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-3b-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p345)
lola: LP says that atomic proposition is always false: (2 <= p1619)
lola: LP says that atomic proposition is always false: (2 <= p3277)
lola: LP says that atomic proposition is always false: (2 <= p21)
lola: LP says that atomic proposition is always false: (2 <= p3738)
lola: LP says that atomic proposition is always false: (2 <= p2518)
lola: LP says that atomic proposition is always false: (2 <= p875)
lola: LP says that atomic proposition is always false: (3 <= p5473)
lola: LP says that atomic proposition is always false: (2 <= p4062)
lola: LP says that atomic proposition is always false: (2 <= p3017)
lola: LP says that atomic proposition is always false: (2 <= p4160)
lola: LP says that atomic proposition is always false: (3 <= p251)
lola: LP says that atomic proposition is always false: (2 <= p3602)
lola: LP says that atomic proposition is always false: (3 <= p4501)
lola: LP says that atomic proposition is always false: (3 <= p6745)
lola: A (G (((1 <= p5198) OR (p6925 <= p3566)))) : E (F ((p3523 + 1 <= p5137))) : A (G ((((p6939 <= p1639) OR (p2527 <= p1722) OR ((1 <= p6595) AND (p50 <= p2719)))))) : A (G (((((p878 <= p294) AND (p6912 <= p2458))) AND (p3583 <= p294)))) : A (G ((p172 <= p5281))) : E (F (((p3000 <= 0) AND (p5660 + 1 <= p2610) AND (p5638 <= p4857)))) : A (G (())) : E (F (((p4648 <= 0) AND (p1884 + 1 <= p6874) AND (p1960 <= p4519) AND (1 <= p6964) AND (p2400 <= p197)))) : E (F (((1 <= p6216)))) : E (F (FALSE)) : E (F ((((1 <= p3347) AND (1 <= p1891) AND (p6820 + 1 <= p4552)) OR ((p1157 + 1 <= p5544))))) : A (G (TRUE)) : A (G ((((p958 + 1 <= p2831) OR (p865 <= 0))))) : E (F ((1 <= p5399))) : E (F ((((p4303 <= p4493)) AND (p4238 + 1 <= p5064) AND ((p1259 + 1 <= p1523))))) : A (G ((p5062 <= p5698)))
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: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 205 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 DLCshifumi-PT-3b-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 DLCshifumi-PT-3b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 218 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 DLCshifumi-PT-3b-ReachabilityCardinality.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 DLCshifumi-PT-3b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 234 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 DLCshifumi-PT-3b-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 DLCshifumi-PT-3b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6216))))
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 <= p6216))))
lola: processed formula length: 22
lola: 10 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: ((1 <= p6216))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 89 markings, 88 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p5399)))
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 <= p5399)))
lola: processed formula length: 20
lola: 10 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: (1 <= p5399)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 201 markings, 200 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p172 <= p5281)))
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 ((p172 <= p5281)))
lola: processed formula length: 23
lola: 11 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: (p5281 + 1 <= p172)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 142 markings, 141 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p3523 + 1 <= p5137)))
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 ((p3523 + 1 <= p5137)))
lola: processed formula length: 28
lola: 10 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: (p3523 + 1 <= p5137)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3505 markings, 3887 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p5062 <= p5698)))
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 ((p5062 <= p5698)))
lola: processed formula length: 24
lola: 11 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: (p5698 + 1 <= p5062)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 252 markings, 251 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p5198) OR (p6925 <= p3566))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p5198) OR (p6925 <= p3566))))
lola: processed formula length: 43
lola: 11 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: ((p5198 <= 0) AND (p3566 + 1 <= p6925))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p958 + 1 <= p2831) OR (p865 <= 0)))))
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 ((((p958 + 1 <= p2831) OR (p865 <= 0)))))
lola: processed formula length: 47
lola: 11 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: (((p2831 <= p958) AND (1 <= p865)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-9-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: 38 markings, 37 edges
lola:
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3000 <= 0) AND (p5660 + 1 <= p2610) AND (p5638 <= p4857))))
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 (((p3000 <= 0) AND (p5660 + 1 <= p2610) AND (p5638 <= p4857))))
lola: processed formula length: 68
lola: 10 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: ((p3000 <= 0) AND (p5660 + 1 <= p2610) AND (p5638 <= p4857))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-10-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: 27 markings, 26 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p878 <= p294) AND (p6912 <= p2458))) AND (p3583 <= p294))))
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 (((((p878 <= p294) AND (p6912 <= p2458))) AND (p3583 <= p294))))
lola: processed formula length: 69
lola: 11 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: ((((p294 + 1 <= p878) OR (p2458 + 1 <= p6912))) OR (p294 + 1 <= p3583))
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 44 markings, 43 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p4303 <= p4493)) AND (p4238 + 1 <= p5064) AND ((p1259 + 1 <= p1523)))))
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 ((((p4303 <= p4493)) AND (p4238 + 1 <= p5064) AND ((p1259 + 1 <= p1523)))))
lola: processed formula length: 80
lola: 10 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: (((p4303 <= p4493)) AND (p4238 + 1 <= p5064) AND ((p1259 + 1 <= p1523)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12304 markings, 13197 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1093 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p3347) AND (1 <= p1891) AND (p6820 + 1 <= p4552)) OR ((p1157 + 1 <= p5544)))))
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 <= p3347) AND (1 <= p1891) AND (p6820 + 1 <= p4552)) OR ((p1157 + 1 <= p5544)))))
lola: processed formula length: 93
lola: 10 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: (((1 <= p3347) AND (1 <= p1891) AND (p6820 + 1 <= p4552)) OR ((p1157 + 1 <= p5544)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15101 markings, 17654 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p6939 <= p1639) OR (p2527 <= p1722) OR ((1 <= p6595) AND (p50 <= p2719))))))
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 ((((p6939 <= p1639) OR (p2527 <= p1722) OR ((1 <= p6595) AND (p50 <= p2719))))))
lola: processed formula length: 87
lola: 11 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: (((p1639 + 1 <= p6939) AND (p1722 + 1 <= p2527) AND ((p6595 <= 0) OR (p2719 + 1 <= p50))))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 123 markings, 122 edges
lola: ========================================

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p4648 <= 0) AND (p1884 + 1 <= p6874) AND (p1960 <= p4519) AND (1 <= p6964) AND (p2400 <= p197))))
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 (((p4648 <= 0) AND (p1884 + 1 <= p6874) AND (p1960 <= p4519) AND (1 <= p6964) AND (p2400 <= p197))))
lola: processed formula length: 105
lola: 10 rewrites
lola: closed formula file DLCshifumi-PT-3b-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: ((p4648 <= 0) AND (p1884 + 1 <= p6874) AND (p1960 <= p4519) AND (1 <= p6964) AND (p2400 <= p197))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges

FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no yes yes yes yes no yes yes no yes yes no
lola:
preliminary result: no yes no no no yes yes yes yes no yes yes no yes yes no
lola: ========================================
lola: memory consumption: 38412 KB
lola: time consumption: 292 seconds

BK_STOP 1526708925916

--------------------
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="DLCshifumi-PT-3b"
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/DLCshifumi-PT-3b.tgz
mv DLCshifumi-PT-3b 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 DLCshifumi-PT-3b, 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 r064-smll-152649735300180"
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 ;