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 3.2M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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.2K 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 15K 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 3.0M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D30N150, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937000257
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526694189784

info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D30N150 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D30N150 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D30N150 @ 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: 7744/65536 symbol table entries, 1051 collisions
lola: preprocessing...
lola: Size of bit vector: 28800
lola: finding significant places
lola: 900 places, 6844 transitions, 899 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 900 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D30N150-ReachabilityCardinality.task
lola: E (F (((2 <= cAMP__7_26_) AND (2 <= cAMP__10_13_)))) : A (G ((((cAMP__3_3_ + 1 <= cAMP__6_20_) OR (cAMP__26_13_ <= 1)) AND (cAMP__2_16_ <= 2)))) : A (G ((cAMP__30_20_ <= cAMP__14_13_))) : A (G (((cAMP__6_13_ <= cAMP__17_12_) OR ((cAMP__22_6_ <= 2) AND (cAMP__1_15_ <= 0))))) : A (G ((cAMP__12_4_ <= cAMP__11_16_))) : A (G (((cAMP__23_22_ <= cAMP__17_21_) OR (cAMP__25_12_ <= cAMP__8_14_) OR (cAMP__22_1_ + 1 <= cAMP__6_22_) OR ((cAMP__19_9_ <= cAMP__10_11_) AND (cAMP__7_27_ <= cAMP__27_22_))))) : A (G (((cAMP__8_17_ <= 0) AND (cAMP__14_10_ <= 1) AND (cAMP__10_7_ <= 0) AND (cAMP__28_1_ <= 0)))) : A (G ((cAMP__26_4_ <= 2))) : A (G (((1 <= cAMP__21_12_) OR (cAMP__11_1_ <= 0)))) : A (G (((cAMP__15_29_ <= cAMP__28_7_) OR (cAMP__15_29_ <= cAMP__10_18_) OR (3 <= cAMP__19_27_) OR (1 <= cAMP__22_10_) OR ((1 <= cAMP__5_9_) AND (2 <= cAMP__9_29_)) OR (cAMP__13_11_ <= 0)))) : A (G (((cAMP__29_6_ <= 2) OR (cAMP__2_16_ <= 0) OR (cAMP__8_29_ + 1 <= cAMP__28_5_) OR (cAMP__23_12_ <= 1)))) : A (G (((cAMP__8_30_ <= cAMP__12_11_) OR (cAMP__10_28_ <= 1) OR (cAMP__1_2_ <= 0) OR (cAMP__5_26_ <= 1)))) : A (G ((((cAMP__4_5_ + 1 <= cAMP__27_17_) AND ((cAMP__3_4_ <= cAMP__24_21_) OR (3 <= cAMP__4_13_))) OR ((cAMP__16_18_ <= 2) AND (cAMP__26_7_ <= cAMP__24_2_))))) : E (F ((3 <= cAMP__1_11_))) : E (F (((cAMP__3_19_ <= cAMP__17_22_) AND (cAMP__14_25_ <= cAMP__15_9_) AND ((cAMP__22_11_ + 1 <= cAMP__3_26_) OR ((1 <= cAMP__30_13_) AND (cAMP__20_23_ <= cAMP__12_30_)))))) : A (G ((((cAMP__6_20_ <= 2) AND (cAMP__22_10_ + 1 <= cAMP__3_11_)) OR (cAMP__15_25_ <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__26_4_ <= 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__26_4_ <= 2)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__26_4_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6126 markings, 20212 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__1_11_)))
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__1_11_)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__1_11_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11818 markings, 39321 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__12_4_ <= cAMP__11_16_)))
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_4_ <= cAMP__11_16_)))
lola: processed formula length: 37
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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_16_ + 1 <= cAMP__12_4_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-2-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-D30N150-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__7_26_) AND (2 <= cAMP__10_13_))))
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__7_26_) AND (2 <= cAMP__10_13_))))
lola: processed formula length: 52
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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: ((2 <= cAMP__7_26_) AND (2 <= cAMP__10_13_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1119 markings, 3759 edges
lola: ========================================

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

FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__30_20_ <= cAMP__14_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__30_20_ <= cAMP__14_13_)))
lola: processed formula length: 38
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__14_13_ + 1 <= cAMP__30_20_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-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-D30N150-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__6_13_ <= cAMP__17_12_) OR ((cAMP__22_6_ <= 2) AND (cAMP__1_15_ <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((cAMP__6_13_ <= cAMP__17_12_) OR ((cAMP__22_6_ <= 2) AND (cAMP__1_15_ <= 0)))))
lola: processed formula length: 87
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__17_12_ + 1 <= cAMP__6_13_) AND ((3 <= cAMP__22_6_) OR (1 <= cAMP__1_15_)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-6-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-D30N150-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__3_3_ + 1 <= cAMP__6_20_) OR (cAMP__26_13_ <= 1)) AND (cAMP__2_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__3_3_ + 1 <= cAMP__6_20_) OR (cAMP__26_13_ <= 1)) AND (cAMP__2_16_ <= 2))))
lola: processed formula length: 90
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__6_20_ <= cAMP__3_3_) AND (2 <= cAMP__26_13_)) OR (3 <= cAMP__2_16_))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 842 markings, 2820 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__8_17_ <= 0) AND (cAMP__14_10_ <= 1) AND (cAMP__10_7_ <= 0) AND (cAMP__28_1_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((cAMP__8_17_ <= 0) AND (cAMP__14_10_ <= 1) AND (cAMP__10_7_ <= 0) AND (cAMP__28_1_ <= 0))))
lola: processed formula length: 98
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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: ((1 <= cAMP__8_17_) OR (2 <= cAMP__14_10_) OR (1 <= cAMP__10_7_) OR (1 <= cAMP__28_1_))
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-8-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: 11 markings, 12 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__6_20_ <= 2) AND (cAMP__22_10_ + 1 <= cAMP__3_11_)) OR (cAMP__15_25_ <= 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__6_20_ <= 2) AND (cAMP__22_10_ + 1 <= cAMP__3_11_)) OR (cAMP__15_25_ <= 1))))
lola: processed formula length: 92
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__6_20_) OR (cAMP__3_11_ <= cAMP__22_10_)) AND (2 <= cAMP__15_25_))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 634 markings, 2042 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__29_6_ <= 2) OR (cAMP__2_16_ <= 0) OR (cAMP__8_29_ + 1 <= cAMP__28_5_) OR (cAMP__23_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 (((cAMP__29_6_ <= 2) OR (cAMP__2_16_ <= 0) OR (cAMP__8_29_ + 1 <= cAMP__28_5_) OR (cAMP__23_12_ <= 1))))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__29_6_) AND (1 <= cAMP__2_16_) AND (cAMP__28_5_ <= cAMP__8_29_) AND (2 <= cAMP__23_12_))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-10-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-D30N150-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__8_30_ <= cAMP__12_11_) OR (cAMP__10_28_ <= 1) OR (cAMP__1_2_ <= 0) OR (cAMP__5_26_ <= 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__8_30_ <= cAMP__12_11_) OR (cAMP__10_28_ <= 1) OR (cAMP__1_2_ <= 0) OR (cAMP__5_26_ <= 1))))
lola: processed formula length: 108
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__12_11_ + 1 <= cAMP__8_30_) AND (2 <= cAMP__10_28_) AND (1 <= cAMP__1_2_) AND (2 <= cAMP__5_26_))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-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-D30N150-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__15_29_ <= cAMP__28_7_) OR (cAMP__15_29_ <= cAMP__10_18_) OR (3 <= cAMP__19_27_) OR (1 <= cAMP__22_10_) OR ((1 <= cAMP__5_9_) AND (2 <= cAMP__9_29_)) OR (cAMP__13_11_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((cAMP__15_29_ <= cAMP__28_7_) OR (cAMP__15_29_ <= cAMP__10_18_) OR (3 <= cAMP__19_27_) OR (1 <= cAMP__22_10_) OR ((1 <= cAMP__5_9_) AND (2 <= cAMP__9_29_)) OR (cAMP__13_11_ <= 0))))
lola: processed formula length: 193
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__28_7_ + 1 <= cAMP__15_29_) AND (cAMP__10_18_ + 1 <= cAMP__15_29_) AND (cAMP__19_27_ <= 2) AND (cAMP__22_10_ <= 0) AND ((cAMP__5_9_ <= 0) OR (cAMP__9_29_ <= 1)) AND (1 <= cAMP__13_11_))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-12-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-D30N150-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__4_5_ + 1 <= cAMP__27_17_) AND ((cAMP__3_4_ <= cAMP__24_21_) OR (3 <= cAMP__4_13_))) OR ((cAMP__16_18_ <= 2) AND (cAMP__26_7_ <= cAMP__24_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_5_ + 1 <= cAMP__27_17_) AND ((cAMP__3_4_ <= cAMP__24_21_) OR (3 <= cAMP__4_13_))) OR ((cAMP__16_18_ <= 2) AND (cAMP__26_7_ <= cAMP__24_2_)))))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__27_17_ <= cAMP__4_5_) OR ((cAMP__24_21_ + 1 <= cAMP__3_4_) AND (cAMP__4_13_ <= 2))) AND ((3 <= cAMP__16_18_) OR (cAMP__24_2_ + 1 <= cAMP__26_7_)))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 614 markings, 927 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__3_19_ <= cAMP__17_22_) AND (cAMP__14_25_ <= cAMP__15_9_) AND ((cAMP__22_11_ + 1 <= cAMP__3_26_) OR ((1 <= cAMP__30_13_) AND (cAMP__20_23_ <= cAMP__12_30_))))))
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__3_19_ <= cAMP__17_22_) AND (cAMP__14_25_ <= cAMP__15_9_) AND ((cAMP__22_11_ + 1 <= cAMP__3_26_) OR ((1 <= cAMP__30_13_) AND (cAMP__20_23_ <= cAMP__12_30_))))))
lola: processed formula length: 174
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__3_19_ <= cAMP__17_22_) AND (cAMP__14_25_ <= cAMP__15_9_) AND ((cAMP__22_11_ + 1 <= cAMP__3_26_) OR ((1 <= cAMP__30_13_) AND (cAMP__20_23_ <= cAMP__12_30_))))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 44 markings, 113 edges
lola: ========================================

FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__23_22_ <= cAMP__17_21_) OR (cAMP__25_12_ <= cAMP__8_14_) OR (cAMP__22_1_ + 1 <= cAMP__6_22_) OR ((cAMP__19_9_ <= cAMP__10_11_) AND (cAMP__7_27_ <= cAMP__27_22_)))))
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__23_22_ <= cAMP__17_21_) OR (cAMP__25_12_ <= cAMP__8_14_) OR (cAMP__22_1_ + 1 <= cAMP__6_22_) OR ((cAMP__19_9_ <= cAMP__10_11_) AND (cAMP__7_27_ <= cAMP__27_22_)))))
lola: processed formula length: 181
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D30N150-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__17_21_ + 1 <= cAMP__23_22_) AND (cAMP__8_14_ + 1 <= cAMP__25_12_) AND (cAMP__6_22_ <= cAMP__22_1_) AND ((cAMP__10_11_ + 1 <= cAMP__19_9_) OR (cAMP__27_22_ + 1 <= cAMP__7_27_)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-15-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-D30N150-ReachabilityCardinality-5 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 no no no no no no no yes yes no
lola:
preliminary result: yes no no no no no no no no no no no no yes yes no
lola: memory consumption: 30136 KB
lola: time consumption: 63 seconds

BK_STOP 1526694252695

--------------------
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-D30N150"
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-D30N150.tgz
mv Diffusion2D-PT-D30N150 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-D30N150, 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-152649937000257"
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 ;