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 1.3M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K 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 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D20N150, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937000229
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526683312127

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D20N150 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D20N150 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D20N150 @ 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: 3364/65536 symbol table entries, 222 collisions
lola: preprocessing...
lola: Size of bit vector: 12800
lola: finding significant places
lola: 400 places, 2964 transitions, 399 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 400 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D20N150-ReachabilityCardinality.task
lola: E (F ((3 <= cAMP__17_9_))) : A (G (((cAMP__15_13_ <= 1) OR (cAMP__8_2_ <= 0) OR (cAMP__6_2_ <= 2)))) : A (G (((cAMP__20_18_ <= 1) OR ((cAMP__7_14_ <= 1) AND (cAMP__1_18_ <= 2))))) : A (G (((cAMP__4_13_ + 1 <= cAMP__4_18_) OR (cAMP__15_16_ + 1 <= cAMP__4_12_) OR (cAMP__2_13_ <= 1)))) : A (G (((cAMP__1_18_ <= cAMP__18_5_) OR ((cAMP__20_11_ + 1 <= cAMP__1_10_) AND (cAMP__11_4_ + 1 <= cAMP__8_5_))))) : A (G (((cAMP__10_13_ <= 1) OR (cAMP__2_2_ + 1 <= cAMP__2_8_) OR (cAMP__5_12_ <= 0) OR (cAMP__7_9_ + 1 <= cAMP__7_2_)))) : E (F ((((2 <= cAMP__4_17_) AND (cAMP__14_6_ <= cAMP__12_12_)) OR (2 <= cAMP__13_18_) OR ((1 <= cAMP__5_13_) AND (cAMP__5_16_ <= cAMP__1_19_))))) : E (F (((cAMP__18_11_ <= cAMP__17_17_) AND ((3 <= cAMP__4_7_) OR (1 <= cAMP__4_2_)) AND (3 <= cAMP__13_18_)))) : E (F (((3 <= cAMP__3_17_) OR (2 <= cAMP__20_14_)))) : A (G (((2 <= cAMP__16_11_) OR ((3 <= cAMP__6_10_) AND (cAMP__3_20_ <= cAMP__3_18_)) OR (cAMP__18_9_ <= cAMP__12_1_)))) : A (G ((((cAMP__9_11_ <= cAMP__4_15_) AND (1 <= cAMP__18_5_)) OR ((3 <= cAMP__20_12_) AND (cAMP__20_8_ <= cAMP__17_6_)) OR ((1 <= cAMP__11_11_) AND ((cAMP__19_8_ <= cAMP__13_2_) OR (2 <= cAMP__2_7_)))))) : A (G (((cAMP__12_1_ + 1 <= cAMP__20_13_) OR ((3 <= cAMP__19_11_) AND (2 <= cAMP__10_2_)) OR (3 <= cAMP__11_9_) OR (cAMP__4_15_ <= 1)))) : E (F (((cAMP__1_4_ <= 2) AND (2 <= cAMP__19_8_) AND (((1 <= cAMP__8_12_) AND (3 <= cAMP__2_20_)) OR (cAMP__5_6_ + 1 <= cAMP__20_8_))))) : A (G (((cAMP__10_14_ <= cAMP__11_19_) OR (cAMP__11_1_ <= 0) OR (cAMP__4_18_ <= cAMP__1_18_)))) : A (G ((cAMP__4_16_ <= 2))) : A (G ((cAMP__6_9_ <= cAMP__20_13_)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__17_9_)))
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 <= cAMP__17_9_)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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 <= cAMP__17_9_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-0 TRUE 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: A (G ((cAMP__4_16_ <= 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 ((cAMP__4_16_ <= 2)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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 <= cAMP__4_16_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-14 FALSE 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 <= cAMP__3_17_) OR (2 <= cAMP__20_14_))))
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 <= cAMP__3_17_) OR (2 <= cAMP__20_14_))))
lola: processed formula length: 52
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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 <= cAMP__3_17_) OR (2 <= cAMP__20_14_))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic

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

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

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__20_18_ <= 1) OR ((cAMP__7_14_ <= 1) AND (cAMP__1_18_ <= 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 (((cAMP__20_18_ <= 1) OR ((cAMP__7_14_ <= 1) AND (cAMP__1_18_ <= 2)))))
lola: processed formula length: 77
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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 <= cAMP__20_18_) AND ((2 <= cAMP__7_14_) OR (3 <= cAMP__1_18_)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 330 markings, 898 edges
lola: ========================================

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__15_13_ <= 1) OR (cAMP__8_2_ <= 0) OR (cAMP__6_2_ <= 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 (((cAMP__15_13_ <= 1) OR (cAMP__8_2_ <= 0) OR (cAMP__6_2_ <= 2))))
lola: processed formula length: 73
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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 <= cAMP__15_13_) AND (1 <= cAMP__8_2_) AND (3 <= cAMP__6_2_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-1 FALSE 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 (((cAMP__10_14_ <= cAMP__11_19_) OR (cAMP__11_1_ <= 0) OR (cAMP__4_18_ <= cAMP__1_18_))))
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 (((cAMP__10_14_ <= cAMP__11_19_) OR (cAMP__11_1_ <= 0) OR (cAMP__4_18_ <= cAMP__1_18_))))
lola: processed formula length: 96
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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: ((cAMP__11_19_ + 1 <= cAMP__10_14_) AND (1 <= cAMP__11_1_) AND (cAMP__1_18_ + 1 <= cAMP__4_18_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 43 edges
lola: ========================================

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__18_11_ <= cAMP__17_17_) AND ((3 <= cAMP__4_7_) OR (1 <= cAMP__4_2_)) AND (3 <= cAMP__13_18_))))
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 (((cAMP__18_11_ <= cAMP__17_17_) AND ((3 <= cAMP__4_7_) OR (1 <= cAMP__4_2_)) AND (3 <= cAMP__13_18_))))
lola: processed formula length: 110
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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: ((cAMP__18_11_ <= cAMP__17_17_) AND ((3 <= cAMP__4_7_) OR (1 <= cAMP__4_2_)) AND (3 <= cAMP__13_18_))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4582 markings, 15864 edges
lola: ========================================

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__4_13_ + 1 <= cAMP__4_18_) OR (cAMP__15_16_ + 1 <= cAMP__4_12_) OR (cAMP__2_13_ <= 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 (((cAMP__4_13_ + 1 <= cAMP__4_18_) OR (cAMP__15_16_ + 1 <= cAMP__4_12_) OR (cAMP__2_13_ <= 1))))
lola: processed formula length: 103
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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: ((cAMP__4_18_ <= cAMP__4_13_) AND (cAMP__4_12_ <= cAMP__15_16_) AND (2 <= cAMP__2_13_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 535 markings, 1599 edges
lola: ========================================

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__12_1_ + 1 <= cAMP__20_13_) OR ((3 <= cAMP__19_11_) AND (2 <= cAMP__10_2_)) OR (3 <= cAMP__11_9_) OR (cAMP__4_15_ <= 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 (((cAMP__12_1_ + 1 <= cAMP__20_13_) OR ((3 <= cAMP__19_11_) AND (2 <= cAMP__10_2_)) OR (3 <= cAMP__11_9_) OR (cAMP__4_15_ <= 1))))
lola: processed formula length: 138
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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: ((cAMP__20_13_ <= cAMP__12_1_) AND ((cAMP__19_11_ <= 2) OR (cAMP__10_2_ <= 1)) AND (cAMP__11_9_ <= 2) AND (2 <= cAMP__4_15_))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__1_4_ <= 2) AND (2 <= cAMP__19_8_) AND (((1 <= cAMP__8_12_) AND (3 <= cAMP__2_20_)) OR (cAMP__5_6_ + 1 <= cAMP__20_8_)))))
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 (((cAMP__1_4_ <= 2) AND (2 <= cAMP__19_8_) AND (((1 <= cAMP__8_12_) AND (3 <= cAMP__2_20_)) OR (cAMP__5_6_ + 1 <= cAMP__20_8_)))))
lola: processed formula length: 136
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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: ((cAMP__1_4_ <= 2) AND (2 <= cAMP__19_8_) AND (((1 <= cAMP__8_12_) AND (3 <= cAMP__2_20_)) OR (cAMP__5_6_ + 1 <= cAMP__20_8_)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__1_18_ <= cAMP__18_5_) OR ((cAMP__20_11_ + 1 <= cAMP__1_10_) AND (cAMP__11_4_ + 1 <= cAMP__8_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 (((cAMP__1_18_ <= cAMP__18_5_) OR ((cAMP__20_11_ + 1 <= cAMP__1_10_) AND (cAMP__11_4_ + 1 <= cAMP__8_5_)))))
lola: processed formula length: 114
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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: ((cAMP__18_5_ + 1 <= cAMP__1_18_) AND ((cAMP__1_10_ <= cAMP__20_11_) OR (cAMP__8_5_ <= cAMP__11_4_)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__10_13_ <= 1) OR (cAMP__2_2_ + 1 <= cAMP__2_8_) OR (cAMP__5_12_ <= 0) OR (cAMP__7_9_ + 1 <= cAMP__7_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 (((cAMP__10_13_ <= 1) OR (cAMP__2_2_ + 1 <= cAMP__2_8_) OR (cAMP__5_12_ <= 0) OR (cAMP__7_9_ + 1 <= cAMP__7_2_))))
lola: processed formula length: 122
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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 <= cAMP__10_13_) AND (cAMP__2_8_ <= cAMP__2_2_) AND (1 <= cAMP__5_12_) AND (cAMP__7_2_ <= cAMP__7_9_))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 17 edges
lola: ========================================

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= cAMP__16_11_) OR ((3 <= cAMP__6_10_) AND (cAMP__3_20_ <= cAMP__3_18_)) OR (cAMP__18_9_ <= cAMP__12_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 (((2 <= cAMP__16_11_) OR ((3 <= cAMP__6_10_) AND (cAMP__3_20_ <= cAMP__3_18_)) OR (cAMP__18_9_ <= cAMP__12_1_))))
lola: processed formula length: 120
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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: ((cAMP__16_11_ <= 1) AND ((cAMP__6_10_ <= 2) OR (cAMP__3_18_ + 1 <= cAMP__3_20_)) AND (cAMP__12_1_ + 1 <= cAMP__18_9_))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-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: 8 markings, 7 edges

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= cAMP__4_17_) AND (cAMP__14_6_ <= cAMP__12_12_)) OR (2 <= cAMP__13_18_) OR ((1 <= cAMP__5_13_) AND (cAMP__5_16_ <= cAMP__1_19_)))))
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 ((((2 <= cAMP__4_17_) AND (cAMP__14_6_ <= cAMP__12_12_)) OR (2 <= cAMP__13_18_) OR ((1 <= cAMP__5_13_) AND (cAMP__5_16_ <= cAMP__1_19_)))))
lola: processed formula length: 146
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: (((2 <= cAMP__4_17_) AND (cAMP__14_6_ <= cAMP__12_12_)) OR (2 <= cAMP__13_18_) OR ((1 <= cAMP__5_13_) AND (cAMP__5_16_ <= cAMP__1_19_)))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__9_11_ <= cAMP__4_15_) AND (1 <= cAMP__18_5_)) OR ((3 <= cAMP__20_12_) AND (cAMP__20_8_ <= cAMP__17_6_)) OR ((1 <= cAMP__11_11_) AND ((cAMP__19_8_ <= cAMP__13_2_) OR (2 <= cAMP__2_7_))))))
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 ((((cAMP__9_11_ <= cAMP__4_15_) AND (1 <= cAMP__18_5_)) OR ((3 <= cAMP__20_12_) AND (cAMP__20_8_ <= cAMP__17_6_)) OR ((1 <= cAMP__11_11_) AND ((cAMP__19_8_ <= cAMP__13_2_) OR (2 <= cAMP__2_7_))))))
lola: processed formula length: 205
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D20N150-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: (((cAMP__4_15_ + 1 <= cAMP__9_11_) OR (cAMP__18_5_ <= 0)) AND ((cAMP__20_12_ <= 2) OR (cAMP__17_6_ + 1 <= cAMP__20_8_)) AND ((cAMP__11_11_ <= 0) OR ((cAMP__13_2_ + 1 <= cAMP__19_8_) AND (cAMP__2_7_ <= 1))))
lola: state equation: Generated DNF with 28 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D20N150-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D20N150-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 151 markings, 150 edges
lola: ========================================

FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no no yes yes yes no no no yes no no no
lola:
preliminary result: yes no no no no no yes yes yes no no no yes no no no
lola: memory consumption: 28132 KB
lola: time consumption: 11 seconds

BK_STOP 1526683323093

--------------------
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="Diffusion2D-PT-D20N150"
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/Diffusion2D-PT-D20N150.tgz
mv Diffusion2D-PT-D20N150 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 Diffusion2D-PT-D20N150, 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 r076-blw3-152649937000229"
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 ;