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 212K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 33K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Angiogenesis-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-qhx1-152646241100033
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526628541979

info: Time: 3600 - MCC
===========================================================================================
prep: translating Angiogenesis-PT-20 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Angiogenesis-PT-20 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Angiogenesis-PT-20 @ 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: 103/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54 transition conflict sets
lola: TASK
lola: reading formula from Angiogenesis-PT-20-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (Pip2 <= Pten)
lola: A (G ((KdStarGStarPgStar <= KdStar))) : E (F ((3 <= KdStarGStarPgStarP3))) : E (F ((((KdStarG <= Pten) AND (1 <= GStarP3kP3) AND (KdStarGStarPg + 1 <= DAGE)) OR ((Enz <= 2) AND (KdStarPgStar <= KdStarGStarP3))))) : A (G (((2 <= Enz) OR ((KdStarGStarP3kStar <= KdStarGStarPgStar) AND ((KdStarGStarPgStarP2 <= Gab1) OR (3 <= AktP3)))))) : A (G (((3 <= Pip2) AND ((KdStarPgStar <= Pten) OR (2 <= GP3) OR (3 <= Akt))))) : E (F ((Pip2 <= KdStarPgStar))) : E (F ((((1 <= KdStarGStarP3kStarP2) AND (3 <= KdStarGStarP3k) AND (KdStarGStarPgStarP2 + 1 <= KdStarPg)) OR (KdStar <= 1)))) : E (F (((AktP3 + 1 <= KdStarGStarPgStar) AND (KdStarGStarPg + 1 <= KdStarGStarPgP3) AND (KdStarGStarPgStarP3 + 1 <= KdStarGStarP3kStar)))) : E (F ((3 <= GStarPgP3))) : E (F ((((KdStarGStar + 1 <= DAG) OR (KdStarGStarPg + 1 <= KdStarGStarPgStarP2)) AND (3 <= AktStar)))) : A (G ((KdStarGStarP3kP3 <= KdStarGStarP3kStar))) : A (G (((1 <= KdStar) OR (1 <= KdStarGP3) OR (1 <= Enz) OR (DAGE <= KdStarGStarP3kStarP2) OR (2 <= KdStarGStarP3k)))) : A (G (((KdStarGStarPgP3 <= KdStarGStarPgStarP2) OR (KdStarGStar <= 1) OR (Enz <= Pten) OR (1 <= KdStarGStarPgStarP2) OR (P3k <= GStarPgP3)))) : E (F (((((GStarPgP3 <= KdStarGStarP3kStarP2) AND (Akt <= GStarP3kP3)) OR (Pg + 1 <= KdStarGStarP3kStar)) AND (KdStarG <= KdStarGP3)))) : A (G (((KdStarGStarPgP3 <= 1) OR (Pten <= 2) OR (KdStarGStarP3kP3 <= KdStarPgStarP2)))) : E (F (()))
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: 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: 3 rewrites
lola: closed formula file Angiogenesis-PT-20-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 Angiogenesis-PT-20-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= GStarPgP3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= GStarPgP3)))
lola: processed formula length: 24
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-20-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= GStarPgP3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-20-ReachabilityCardinality-0.sara.

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

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= KdStarGStarPgStarP3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= KdStarGStarPgStarP3)))
lola: processed formula length: 34
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-20-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= KdStarGStarPgStarP3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-20-ReachabilityCardinality-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 877 markings, 1418 edges
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((KdStarGStarPgStar <= KdStar)))
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 ((KdStarGStarPgStar <= KdStar)))
lola: processed formula length: 37
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-20-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: (KdStar + 1 <= KdStarGStarPgStar)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-3-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: 62 markings, 82 edges
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-0 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 ((KdStarGStarP3kP3 <= KdStarGStarP3kStar)))
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 ((KdStarGStarP3kP3 <= KdStarGStarP3kStar)))
lola: processed formula length: 48
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-20-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: (KdStarGStarP3kStar + 1 <= KdStarGStarP3kP3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-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: 69 markings, 90 edges
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-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: E (F ((Pip2 <= KdStarPgStar)))
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 ((Pip2 <= KdStarPgStar)))
lola: processed formula length: 30
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-20-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: (Pip2 <= KdStarPgStar)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-5-0.sara
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((KdStarGStarPgP3 <= 1) OR (Pten <= 2) OR (KdStarGStarP3kP3 <= KdStarPgStarP2))))
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 (((KdStarGStarPgP3 <= 1) OR (Pten <= 2) OR (KdStarGStarP3kP3 <= KdStarPgStarP2))))
lola: processed formula length: 89
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-20-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: sara: try reading problem file Angiogenesis-PT-20-ReachabilityCardinality-5-0.sara.
rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((2 <= KdStarGStarPgP3) AND (3 <= Pten) AND (KdStarPgStarP2 + 1 <= KdStarGStarP3kP3))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola:
state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-20-ReachabilityCardinality-6-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-14 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: E (F ((((1 <= KdStarGStarP3kStarP2) AND (3 <= KdStarGStarP3k) AND (KdStarGStarPgStarP2 + 1 <= KdStarPg)) OR (KdStar <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((1 <= KdStarGStarP3kStarP2) AND (3 <= KdStarGStarP3k) AND (KdStarGStarPgStarP2 + 1 <= KdStarPg)) OR (KdStar <= 1))))
lola: processed formula length: 125
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-20-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 <= KdStarGStarP3kStarP2) AND (3 <= KdStarGStarP3k) AND (KdStarGStarPgStarP2 + 1 <= KdStarPg)) OR (KdStar <= 1))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-7-0.sara

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= Pip2) AND ((KdStarPgStar <= Pten) OR (2 <= GP3) OR (3 <= Akt)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= Pip2) AND ((KdStarPgStar <= Pten) OR (2 <= GP3) OR (3 <= Akt)))))
lola: processed formula length: 80
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-20-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: state equation: calling and running sara
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Pip2 <= 2) OR ((Pten + 1 <= KdStarPgStar) AND (GP3 <= 1) AND (Akt <= 2)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-8-0.sara
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((KdStarGStar + 1 <= DAG) OR (KdStarGStarPg + 1 <= KdStarGStarPgStarP2)) AND (3 <= AktStar))))
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 ((((KdStarGStar + 1 <= DAG) OR (KdStarGStarPg + 1 <= KdStarGStarPgStarP2)) AND (3 <= AktStar))))
lola: processed formula length: 102
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-20-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: (((KdStarGStar + 1 <= DAG) OR (KdStarGStarPg + 1 <= KdStarGStarPgStarP2)) AND (3 <= AktStar))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-9-0.sara
lola: 74 markings, 95 edges
sara: try reading problem file Angiogenesis-PT-20-ReachabilityCardinality-7-0.sara.
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= KdStar) OR (1 <= KdStarGP3) OR (1 <= Enz) OR (DAGE <= KdStarGStarP3kStarP2) OR (2 <= KdStarGStarP3k))))
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 <= KdStar) OR (1 <= KdStarGP3) OR (1 <= Enz) OR (DAGE <= KdStarGStarP3kStarP2) OR (2 <= KdStarGStarP3k))))
lola: processed formula length: 120
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-20-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: ((KdStar <= 0) AND (KdStarGP3 <= 0) AND (Enz <= 0) AND (KdStarGStarP3kStarP2 + 1 <= DAGE) AND (KdStarGStarP3k <= 1))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-10-0.sara

sara: try reading problem file Angiogenesis-PT-20-ReachabilityCardinality-9-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-20-ReachabilityCardinality-10-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((AktP3 + 1 <= KdStarGStarPgStar) AND (KdStarGStarPg + 1 <= KdStarGStarPgP3) AND (KdStarGStarPgStarP3 + 1 <= KdStarGStarP3kStar))))
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 (((AktP3 + 1 <= KdStarGStarPgStar) AND (KdStarGStarPg + 1 <= KdStarGStarPgP3) AND (KdStarGStarPgStarP3 + 1 <= KdStarGStarP3kStar))))
lola: processed formula length: 137
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-20-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: ((AktP3 + 1 <= KdStarGStarPgStar) AND (KdStarGStarPg + 1 <= KdStarGStarPgP3) AND (KdStarGStarPgStarP3 + 1 <= KdStarGStarP3kStar))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-20-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3006 markings, 4733 edges
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-7 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 (((2 <= Enz) OR ((KdStarGStarP3kStar <= KdStarGStarPgStar) AND ((KdStarGStarPgStarP2 <= Gab1) OR (3 <= AktP3))))))
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 (((2 <= Enz) OR ((KdStarGStarP3kStar <= KdStarGStarPgStar) AND ((KdStarGStarPgStarP2 <= Gab1) OR (3 <= AktP3))))))
lola: processed formula length: 121
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-20-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: ((Enz <= 1) AND ((KdStarGStarPgStar + 1 <= KdStarGStarP3kStar) OR ((Gab1 + 1 <= KdStarGStarPgStarP2) AND (AktP3 <= 2))))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 120 markings, 175 edges
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((KdStarGStarPgP3 <= KdStarGStarPgStarP2) OR (KdStarGStar <= 1) OR (Enz <= Pten) OR (1 <= KdStarGStarPgStarP2) OR (P3k <= GStarPgP3))))
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 (((KdStarGStarPgP3 <= KdStarGStarPgStarP2) OR (KdStarGStar <= 1) OR (Enz <= Pten) OR (1 <= KdStarGStarPgStarP2) OR (P3k <= GStarPgP3))))
lola: processed formula length: 145
lola: 5 rewrites
lola: closed formula file Angiogenesis-PT-20-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: ((KdStarGStarPgStarP2 + 1 <= KdStarGStarPgP3) AND (2 <= KdStarGStar) AND (Pten + 1 <= Enz) AND (KdStarGStarPgStarP2 <= 0) AND (GStarPgP3 + 1 <= P3k))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 150 markings, 233 edges
lola: state equation: write sara problem file to Angiogenesis-PT-20-ReachabilityCardinality-13-0.sara

lola: ========================================
FORMULA Angiogenesis-PT-20-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((KdStarG <= Pten) AND (1 <= GStarP3kP3) AND (KdStarGStarPg + 1 <= DAGE)) OR ((Enz <= 2) AND (KdStarPgStar <= KdStarGStarP3)))))
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 ((((KdStarG <= Pten) AND (1 <= GStarP3kP3) AND (KdStarGStarPg + 1 <= DAGE)) OR ((Enz <= 2) AND (KdStarPgStar <= KdStarGStarP3)))))
lola: processed formula length: 136
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-20-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: (((KdStarG <= Pten) AND (1 <= GStarP3kP3) AND (KdStarGStarPg + 1 <= DAGE)) OR ((Enz <= 2) AND (KdStarPgStar <= KdStarGStarP3)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 74 markings, 107 edges
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((GStarPgP3 <= KdStarGStarP3kStarP2) AND (Akt <= GStarP3kP3)) OR (Pg + 1 <= KdStarGStarP3kStar)) AND (KdStarG <= KdStarGP3))))
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 (((((GStarPgP3 <= KdStarGStarP3kStarP2) AND (Akt <= GStarP3kP3)) OR (Pg + 1 <= KdStarGStarP3kStar)) AND (KdStarG <= KdStarGP3))))
lola: processed formula length: 135
lola: 4 rewrites
lola: closed formula file Angiogenesis-PT-20-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 158 markings, 206 edges
lola: formula 0: ((((GStarPgP3 <= KdStarGStarP3kStarP2) AND (Akt <= GStarP3kP3)) OR (Pg + 1 <= KdStarGStarP3kStar)) AND (KdStarG <= KdStarGP3))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA Angiogenesis-PT-20-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes yes yes yes no no no yes no no
lola:
preliminary result: no yes yes no no yes yes yes yes yes no no no yes no no
lola: memory consumption: 23756 KB
lola: time consumption: 1 seconds


BK_STOP 1526628563148

--------------------
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="Angiogenesis-PT-20"
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/Angiogenesis-PT-20.tgz
mv Angiogenesis-PT-20 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 Angiogenesis-PT-20, 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 r016-qhx1-152646241100033"
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 ;