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 812K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 633K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhaseVariation-PT-D05CS100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469700621
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527048584803

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhaseVariation-PT-D05CS100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhaseVariation-PT-D05CS100 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ PhaseVariation-PT-D05CS100 @ 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: 754/65536 symbol table entries, 76 collisions
lola: preprocessing...
lola: Size of bit vector: 2464
lola: finding significant places
lola: 77 places, 677 transitions, 51 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D05CS100-ReachabilityCardinality.task
lola: always true
lola: E (F (((cell___5_2__B_ <= cell___5_5__A_) AND (cell___3_2__B_ <= cell___2_1__A_) AND (cell___1_3__A_ <= cell___2_1__B_) AND (pool__4_4_ <= cell___3_1__B_) AND (2 <= pool__2_4_)))) : A (G ((cell___5_2__B_ <= pool__4_3_))) : A (G (((cell___2_3__A_ <= pool__3_5_) OR (2 <= pool__2_1_) OR ((cell___1_3__A_ <= cell___3_1__A_) AND (3 <= cell___3_5__A_)) OR ((3 <= pool__3_3_) AND ((pool__1_3_ <= cell___5_1__A_) OR (1 <= pool__4_3_)))))) : A (G ((((cell___5_2__A_ <= 2) OR (3 <= pool__3_3_)) AND (cell___5_5__A_ <= pool__2_4_)))) : A (G ((cell___5_4__B_ + 1 <= pool__3_2_))) : E (F ((((cell___5_5__A_ <= pool__5_3_) OR (cell___3_4__B_ <= cell___5_4__A_) OR (2 <= pool__2_2_) OR (3 <= pool__4_1_)) AND (pool__5_2_ <= cell___3_5__A_)))) : A (G (((cell___5_3__B_ <= cell___5_2__A_) OR (3 <= cell___2_4__A_) OR ((2 <= cell___5_5__B_) AND (3 <= cell___2_5__A_)) OR (((cell___5_4__B_ <= cell___4_3__B_) OR (cell___4_3__B_ <= pool__3_3_)))))) : E (F (((pool__4_5_ + 1 <= cell___5_1__A_) AND (cell___5_4__B_ + 1 <= cell___4_1__B_) AND ((cell___4_3__A_ + 1 <= cell___1_4__B_) OR (cell___2_4__A_ <= 0))))) : A (G (((cell___5_2__B_ <= 1) AND (cell___2_4__B_ <= 2) AND ((pool__1_5_ + 1 <= cell___5_4__B_) OR (cell___4_5__A_ + 1 <= pool__1_1_))))) : E (F (((pool__1_2_ <= cell___4_5__A_) OR (pool__1_2_ + 1 <= cell___3_3__A_)))) : A (G (((((cell___1_1__A_ <= pool__3_4_) OR (1 <= cell___3_2__B_)) AND (pool__3_5_ <= cell___1_3__A_)) OR (cell___4_2__B_ <= 2)))) : A (G (((1 <= pool__3_2_) AND (cell___2_4__A_ <= 2)))) : E (F ((pool__4_5_ <= cell___2_1__A_))) : E (F (((((1 <= cell___1_1__B_) AND (cell___3_2__A_ <= cell___5_2__B_)) OR ((pool__2_2_ <= cell___5_3__A_) AND (2 <= cell___5_1__A_))) AND ((3 <= cell___3_3__B_) OR (pool__3_2_ <= 0))))) : A (G (((cell___4_5__A_ + 1 <= cell___2_4__B_) OR (cell___2_4__B_ <= 0) OR (3 <= pool__2_5_)))) : A (G (((cell___5_2__A_ + 1 <= pool__2_2_) OR (cell___2_3__A_ + 1 <= cell___2_5__A_) OR (3 <= cell___3_3__B_))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___5_2__B_ <= pool__4_3_)))
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 ((cell___5_2__B_ <= pool__4_3_)))
lola: processed formula length: 38
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: (pool__4_3_ + 1 <= cell___5_2__B_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-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: 8 markings, 7 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-1 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: A (G ((cell___5_4__B_ + 1 <= pool__3_2_)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((cell___5_4__B_ + 1 <= pool__3_2_)))
lola: processed formula length: 42
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (pool__3_2_ <= cell___5_4__B_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pool__3_2_) AND (cell___2_4__A_ <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= pool__3_2_) AND (cell___2_4__A_ <= 2))))
lola: processed formula length: 53
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((pool__3_2_ <= 0) OR (3 <= cell___2_4__A_))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-2-0.sara
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pool__4_5_ <= cell___2_1__A_)))
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 ((pool__4_5_ <= cell___2_1__A_)))
lola: processed formula length: 38
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: (pool__4_5_ <= cell___2_1__A_)
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: 6 markings, 5 edges
lola:
FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-3-0.sara
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((pool__1_2_ <= cell___4_5__A_) OR (pool__1_2_ + 1 <= cell___3_3__A_))))
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 (((pool__1_2_ <= cell___4_5__A_) OR (pool__1_2_ + 1 <= cell___3_3__A_))))
lola: processed formula length: 79
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((pool__1_2_ <= cell___4_5__A_) OR (pool__1_2_ + 1 <= cell___3_3__A_))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-4-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: 6 markings, 5 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___4_5__A_ + 1 <= cell___2_4__B_) OR (cell___2_4__B_ <= 0) OR (3 <= pool__2_5_))))
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 (((cell___4_5__A_ + 1 <= cell___2_4__B_) OR (cell___2_4__B_ <= 0) OR (3 <= pool__2_5_))))
lola: processed formula length: 96
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-14 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 ((((cell___5_2__A_ <= 2) OR (3 <= pool__3_3_)) AND (cell___5_5__A_ <= pool__2_4_))))
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 ((((cell___5_2__A_ <= 2) OR (3 <= pool__3_3_)) AND (cell___5_5__A_ <= pool__2_4_))))
lola: processed formula length: 90
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: (((3 <= cell___5_2__A_) AND (pool__3_3_ <= 2)) OR (pool__2_4_ + 1 <= cell___5_5__A_))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-3 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 (((cell___5_2__A_ + 1 <= pool__2_2_) OR (cell___2_3__A_ + 1 <= cell___2_5__A_) OR (3 <= cell___3_3__B_))))
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 (((cell___5_2__A_ + 1 <= pool__2_2_) OR (cell___2_3__A_ + 1 <= cell___2_5__A_) OR (3 <= cell___3_3__B_))))
lola: processed formula length: 113
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((pool__2_2_ <= cell___5_2__A_) AND (cell___2_5__A_ <= cell___2_3__A_) AND (cell___3_3__B_ <= 2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-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 (((cell___5_2__B_ <= 1) AND (cell___2_4__B_ <= 2) AND ((pool__1_5_ + 1 <= cell___5_4__B_) OR (cell___4_5__A_ + 1 <= pool__1_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((cell___5_2__B_ <= 1) AND (cell___2_4__B_ <= 2) AND ((pool__1_5_ + 1 <= cell___5_4__B_) OR (cell___4_5__A_ + 1 <= pool__1_1_)))))
lola: processed formula length: 137
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((2 <= cell___5_2__B_) OR (3 <= cell___2_4__B_) OR ((cell___5_4__B_ <= pool__1_5_) AND (pool__1_1_ <= cell___4_5__A_)))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-8 FALSE 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: A (G (((((cell___1_1__A_ <= pool__3_4_) OR (1 <= cell___3_2__B_)) AND (pool__3_5_ <= cell___1_3__A_)) OR (cell___4_2__B_ <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((((cell___1_1__A_ <= pool__3_4_) OR (1 <= cell___3_2__B_)) AND (pool__3_5_ <= cell___1_3__A_)) OR (cell___4_2__B_ <= 2))))
lola: processed formula length: 131
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((((pool__3_4_ + 1 <= cell___1_1__A_) AND (cell___3_2__B_ <= 0)) OR (cell___1_3__A_ + 1 <= pool__3_5_)) AND (3 <= cell___4_2__B_))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-9-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-10 FALSE 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: E (F (((pool__4_5_ + 1 <= cell___5_1__A_) AND (cell___5_4__B_ + 1 <= cell___4_1__B_) AND ((cell___4_3__A_ + 1 <= cell___1_4__B_) OR (cell___2_4__A_ <= 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 (((pool__4_5_ + 1 <= cell___5_1__A_) AND (cell___5_4__B_ + 1 <= cell___4_1__B_) AND ((cell___4_3__A_ + 1 <= cell___1_4__B_) OR (cell___2_4__A_ <= 0)))))
lola: processed formula length: 158
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((pool__4_5_ + 1 <= cell___5_1__A_) AND (cell___5_4__B_ + 1 <= cell___4_1__B_) AND ((cell___4_3__A_ + 1 <= cell___1_4__B_) OR (cell___2_4__A_ <= 0)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-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: 11 markings, 10 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-7 TRUE 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 (((((1 <= cell___1_1__B_) AND (cell___3_2__A_ <= cell___5_2__B_)) OR ((pool__2_2_ <= cell___5_3__A_) AND (2 <= cell___5_1__A_))) AND ((3 <= cell___3_3__B_) OR (pool__3_2_ <= 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 (((((1 <= cell___1_1__B_) AND (cell___3_2__A_ <= cell___5_2__B_)) OR ((pool__2_2_ <= cell___5_3__A_) AND (2 <= cell___5_1__A_))) AND ((3 <= cell___3_3__B_) OR (pool__3_2_ <= 0)))))
lola: processed formula length: 187
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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 <= cell___1_1__B_) AND (cell___3_2__A_ <= cell___5_2__B_)) OR ((pool__2_2_ <= cell___5_3__A_) AND (2 <= cell___5_1__A_))) AND ((3 <= cell___3_3__B_) OR (pool__3_2_ <= 0)))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-11-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: 5 markings, 4 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-13 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: E (F ((((cell___5_5__A_ <= pool__5_3_) OR (cell___3_4__B_ <= cell___5_4__A_) OR (2 <= pool__2_2_) OR (3 <= pool__4_1_)) AND (pool__5_2_ <= cell___3_5__A_))))
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 ((((cell___5_5__A_ <= pool__5_3_) OR (cell___3_4__B_ <= cell___5_4__A_) OR (2 <= pool__2_2_) OR (3 <= pool__4_1_)) AND (pool__5_2_ <= cell___3_5__A_))))
lola: processed formula length: 160
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: (((cell___5_5__A_ <= pool__5_3_) OR (cell___3_4__B_ <= cell___5_4__A_) OR (2 <= pool__2_2_) OR (3 <= pool__4_1_)) AND (pool__5_2_ <= cell___3_5__A_))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-5 TRUE 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 (((cell___5_3__B_ <= cell___5_2__A_) OR (3 <= cell___2_4__A_) OR ((2 <= cell___5_5__B_) AND (3 <= cell___2_5__A_)) OR (((cell___5_4__B_ <= cell___4_3__B_) OR (cell___4_3__B_ <= pool__3_3_))))))
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 (((cell___5_3__B_ <= cell___5_2__A_) OR (3 <= cell___2_4__A_) OR ((2 <= cell___5_5__B_) AND (3 <= cell___2_5__A_)) OR (((cell___5_4__B_ <= cell___4_3__B_) OR (cell___4_3__B_ <= pool__3_3_))))))
lola: processed formula length: 202
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((cell___5_2__A_ + 1 <= cell___5_3__B_) AND (cell___2_4__A_ <= 2) AND ((cell___5_5__B_ <= 1) OR (cell___2_5__A_ <= 2)) AND (((cell___4_3__B_ + 1 <= cell___5_4__B_) AND (pool__3_3_ + 1 <= cell___4_3__B_))))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-13-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: 12 markings, 11 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-6 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 (((cell___5_2__B_ <= cell___5_5__A_) AND (cell___3_2__B_ <= cell___2_1__A_) AND (cell___1_3__A_ <= cell___2_1__B_) AND (pool__4_4_ <= cell___3_1__B_) AND (2 <= pool__2_4_))))
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 (((cell___5_2__B_ <= cell___5_5__A_) AND (cell___3_2__B_ <= cell___2_1__A_) AND (cell___1_3__A_ <= cell___2_1__B_) AND (pool__4_4_ <= cell___3_1__B_) AND (2 <= pool__2_4_))))
lola: processed formula length: 179
lola: 1 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((cell___5_2__B_ <= cell___5_5__A_) AND (cell___3_2__B_ <= cell___2_1__A_) AND (cell___1_3__A_ <= cell___2_1__B_) AND (pool__4_4_ <= cell___3_1__B_) AND (2 <= pool__2_4_))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-14-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-0 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 (((cell___2_3__A_ <= pool__3_5_) OR (2 <= pool__2_1_) OR ((cell___1_3__A_ <= cell___3_1__A_) AND (3 <= cell___3_5__A_)) OR ((3 <= pool__3_3_) AND ((pool__1_3_ <= cell___5_1__A_) OR (1 <= pool__4_3_))))))
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 (((cell___2_3__A_ <= pool__3_5_) OR (2 <= pool__2_1_) OR ((cell___1_3__A_ <= cell___3_1__A_) AND (3 <= cell___3_5__A_)) OR ((3 <= pool__3_3_) AND ((pool__1_3_ <= cell___5_1__A_) OR (1 <= pool__4_3_))))))
lola: processed formula length: 212
lola: 2 rewrites
lola: closed formula file PhaseVariation-PT-D05CS100-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: ((pool__3_5_ + 1 <= cell___2_3__A_) AND (pool__2_1_ <= 1) AND ((cell___3_1__A_ + 1 <= cell___1_3__A_) OR (cell___3_5__A_ <= 2)) AND ((pool__3_3_ <= 2) OR ((cell___5_1__A_ + 1 <= pool__1_3_) AND (pool__4_3_ <= 0))))
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D05CS100-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA PhaseVariation-PT-D05CS100-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes no yes no yes no no yes yes no no
lola:
preliminary result: yes no no no no yes no yes no yes no no yes yes no no
lola: memory consumption: 28464 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PhaseVariation-PT-D05CS100"
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/PhaseVariation-PT-D05CS100.tgz
mv PhaseVariation-PT-D05CS100 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 PhaseVariation-PT-D05CS100, 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-152666469700621"
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 ;