About the Execution of LoLA for Diffusion2D-PT-D50N010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 344.200 | 311722.00 | 436310.00 | 97.50 | TTTTTFFTTTTFTTTF | normal |
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 7.5M
-rw-r--r-- 1 mcc users 4.2K 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 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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.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 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 7.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D50N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937000292
=====================================================================
--------------------
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-D50N010-ReachabilityCardinality-00
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-01
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-02
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-03
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-04
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-05
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-06
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-07
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-08
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-09
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D50N010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526708717880
info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D50N010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D50N010 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D50N010 @ 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: 21904/65536 symbol table entries, 8280 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2500 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D50N010-ReachabilityCardinality.task
lola: E (F ((3 <= cAMP__40_12_))) : E (F (((1 <= cAMP__44_37_) AND (cAMP__4_48_ <= cAMP__30_1_) AND ((2 <= cAMP__48_3_) OR (cAMP__8_8_ <= cAMP__33_50_)) AND ((3 <= cAMP__37_45_) OR (1 <= cAMP__2_15_) OR (cAMP__30_6_ <= cAMP__45_31_) OR (3 <= cAMP__44_47_))))) : E (F ((1 <= cAMP__9_40_))) : E (F ((3 <= cAMP__7_43_))) : E (F ((1 <= cAMP__2_23_))) : A (G ((cAMP__23_13_ <= 1))) : A (G (((cAMP__28_38_ <= cAMP__37_45_) AND ((1 <= cAMP__48_37_) OR (cAMP__38_7_ <= cAMP__26_43_) OR (3 <= cAMP__10_28_) OR (cAMP__26_11_ <= cAMP__47_20_))))) : E (F ((2 <= cAMP__37_40_))) : E (F (((2 <= cAMP__49_9_) AND (1 <= cAMP__19_33_) AND (cAMP__23_5_ <= cAMP__3_15_) AND (cAMP__48_19_ <= cAMP__27_47_) AND (cAMP__31_23_ <= cAMP__36_18_)))) : E (F ((cAMP__14_1_ + 1 <= cAMP__14_24_))) : E (F (((3 <= cAMP__43_47_) AND ((3 <= cAMP__43_29_) OR (2 <= cAMP__48_42_)) AND (3 <= cAMP__37_4_)))) : A (G (((cAMP__4_9_ <= cAMP__32_27_) OR (2 <= cAMP__15_50_)))) : E (F (((cAMP__26_48_ <= 0) AND ((cAMP__36_18_ + 1 <= cAMP__31_10_) OR (cAMP__5_43_ + 1 <= cAMP__40_46_))))) : E (F (((cAMP__6_19_ + 1 <= cAMP__29_33_) AND (cAMP__15_40_ <= 2) AND (3 <= cAMP__29_16_)))) : E (F ((1 <= cAMP__7_39_))) : A (G (((cAMP__11_39_ <= cAMP__20_46_) OR ((2 <= cAMP__1_11_) AND (3 <= cAMP__36_50_) AND (cAMP__44_14_ + 1 <= cAMP__34_26_)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__40_12_)))
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__40_12_)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__40_12_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 5360 markings, 19505 edges, 1072 markings/sec, 0 secs
lola: sara is running 5 secs || 10718 markings, 39358 edges, 1072 markings/sec, 5 secs
lola: sara is running 10 secs || 16070 markings, 58729 edges, 1070 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19368 markings, 70656 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= cAMP__9_40_)))
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 <= cAMP__9_40_)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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 <= cAMP__9_40_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__7_43_)))
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__7_43_)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__7_43_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-2-0.sara.
lola: sara is running 0 secs || 5539 markings, 18774 edges, 1108 markings/sec, 0 secs
lola: sara is running 5 secs || 11065 markings, 38051 edges, 1105 markings/sec, 5 secs
lola: sara is running 10 secs || 16610 markings, 56921 edges, 1109 markings/sec, 10 secs
lola: sara is running 15 secs || 22159 markings, 75982 edges, 1110 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 27715 markings, 94247 edges, 1111 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27718 markings, 94251 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= cAMP__2_23_)))
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 <= cAMP__2_23_)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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 <= cAMP__2_23_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__23_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__23_13_ <= 1)))
lola: processed formula length: 27
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__23_13_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2779 markings, 9973 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__37_40_)))
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__37_40_)))
lola: processed formula length: 27
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__37_40_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3451 markings, 12095 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= cAMP__7_39_)))
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 <= cAMP__7_39_)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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 <= cAMP__7_39_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__14_1_ + 1 <= cAMP__14_24_)))
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__14_1_ + 1 <= cAMP__14_24_)))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__14_1_ + 1 <= cAMP__14_24_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__4_9_ <= cAMP__32_27_) OR (2 <= cAMP__15_50_))))
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_9_ <= cAMP__32_27_) OR (2 <= cAMP__15_50_))))
lola: processed formula length: 62
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__32_27_ + 1 <= cAMP__4_9_) AND (cAMP__15_50_ <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-8-0.sara.
lola: sara is running 0 secs || 5280 markings, 16928 edges, 1056 markings/sec, 0 secs
lola: sara is running 5 secs || 10595 markings, 33792 edges, 1063 markings/sec, 5 secs
lola: sara is running 10 secs || 15918 markings, 50718 edges, 1065 markings/sec, 10 secs
lola: sara is running 15 secs || 21201 markings, 69149 edges, 1057 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 26441 markings, 89008 edges, 1048 markings/sec, 20 secs
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-D50N010-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__6_19_ + 1 <= cAMP__29_33_) AND (cAMP__15_40_ <= 2) AND (3 <= cAMP__29_16_))))
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__6_19_ + 1 <= cAMP__29_33_) AND (cAMP__15_40_ <= 2) AND (3 <= cAMP__29_16_))))
lola: processed formula length: 91
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__6_19_ + 1 <= cAMP__29_33_) AND (cAMP__15_40_ <= 2) AND (3 <= cAMP__29_16_))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-9-0.sara.
lola: sara is running 0 secs || 5298 markings, 18560 edges, 1060 markings/sec, 0 secs
lola: sara is running 5 secs || 10568 markings, 37866 edges, 1054 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14635 markings, 51622 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__43_47_) AND ((3 <= cAMP__43_29_) OR (2 <= cAMP__48_42_)) AND (3 <= cAMP__37_4_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= cAMP__43_47_) AND ((3 <= cAMP__43_29_) OR (2 <= cAMP__48_42_)) AND (3 <= cAMP__37_4_))))
lola: processed formula length: 102
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__43_47_) AND ((3 <= cAMP__43_29_) OR (2 <= cAMP__48_42_)) AND (3 <= cAMP__37_4_))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-10-0.sara.
lola: sara is running 0 secs || 5538 markings, 19206 edges, 1108 markings/sec, 0 secs
lola: sara is running 5 secs || 11072 markings, 38297 edges, 1107 markings/sec, 5 secs
lola: sara is running 10 secs || 16607 markings, 57400 edges, 1107 markings/sec, 10 secs
lola: sara is running 15 secs || 22139 markings, 76497 edges, 1106 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 27671 markings, 94945 edges, 1106 markings/sec, 20 secs
lola: sara is running 25 secs || 33186 markings, 113874 edges, 1103 markings/sec, 25 secs
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-D50N010-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__26_48_ <= 0) AND ((cAMP__36_18_ + 1 <= cAMP__31_10_) OR (cAMP__5_43_ + 1 <= cAMP__40_46_)))))
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__26_48_ <= 0) AND ((cAMP__36_18_ + 1 <= cAMP__31_10_) OR (cAMP__5_43_ + 1 <= cAMP__40_46_)))))
lola: processed formula length: 108
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__26_48_ <= 0) AND ((cAMP__36_18_ + 1 <= cAMP__31_10_) OR (cAMP__5_43_ + 1 <= cAMP__40_46_)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 136 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 814 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__11_39_ <= cAMP__20_46_) OR ((2 <= cAMP__1_11_) AND (3 <= cAMP__36_50_) AND (cAMP__44_14_ + 1 <= cAMP__34_26_)))))
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__11_39_ <= cAMP__20_46_) OR ((2 <= cAMP__1_11_) AND (3 <= cAMP__36_50_) AND (cAMP__44_14_ + 1 <= cAMP__34_26_)))))
lola: processed formula length: 128
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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_46_ + 1 <= cAMP__11_39_) AND ((cAMP__1_11_ <= 1) OR (cAMP__36_50_ <= 2) OR (cAMP__34_26_ <= cAMP__44_14_)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-12-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-D50N010-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__49_9_) AND (1 <= cAMP__19_33_) AND (cAMP__23_5_ <= cAMP__3_15_) AND (cAMP__48_19_ <= cAMP__27_47_) AND (cAMP__31_23_ <= cAMP__36_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 (((2 <= cAMP__49_9_) AND (1 <= cAMP__19_33_) AND (cAMP__23_5_ <= cAMP__3_15_) AND (cAMP__48_19_ <= cAMP__27_47_) AND (cAMP__31_23_ <= cAMP__36_18_))))
lola: processed formula length: 155
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__49_9_) AND (1 <= cAMP__19_33_) AND (cAMP__23_5_ <= cAMP__3_15_) AND (cAMP__48_19_ <= cAMP__27_47_) AND (cAMP__31_23_ <= cAMP__36_18_))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1483 markings, 4470 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__28_38_ <= cAMP__37_45_) AND ((1 <= cAMP__48_37_) OR (cAMP__38_7_ <= cAMP__26_43_) OR (3 <= cAMP__10_28_) OR (cAMP__26_11_ <= cAMP__47_20_)))))
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__28_38_ <= cAMP__37_45_) AND ((1 <= cAMP__48_37_) OR (cAMP__38_7_ <= cAMP__26_43_) OR (3 <= cAMP__10_28_) OR (cAMP__26_11_ <= cAMP__47_20_)))))
lola: processed formula length: 159
lola: 2 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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__37_45_ + 1 <= cAMP__28_38_) OR ((cAMP__48_37_ <= 0) AND (cAMP__26_43_ + 1 <= cAMP__38_7_) AND (cAMP__10_28_ <= 2) AND (cAMP__47_20_ + 1 <= cAMP__26_11_)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola:
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__44_37_) AND (cAMP__4_48_ <= cAMP__30_1_) AND ((2 <= cAMP__48_3_) OR (cAMP__8_8_ <= cAMP__33_50_)) AND ((3 <= cAMP__37_45_) OR (1 <= cAMP__2_15_) OR (cAMP__30_6_ <= cAMP__45_31_) OR (3 <= cAMP__44_47_)))))
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 <= cAMP__44_37_) AND (cAMP__4_48_ <= cAMP__30_1_) AND ((2 <= cAMP__48_3_) OR (cAMP__8_8_ <= cAMP__33_50_)) AND ((3 <= cAMP__37_45_) OR (1 <= cAMP__2_15_) OR (cAMP__30_6_ <= cAMP__45_31_) OR (3 <= cAMP__44_47_)))))
lola: processed formula length: 227
lola: 1 rewrites
lola: closed formula file Diffusion2D-PT-D50N010-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 <= cAMP__44_37_) AND (cAMP__4_48_ <= cAMP__30_1_) AND ((2 <= cAMP__48_3_) OR (cAMP__8_8_ <= cAMP__33_50_)) AND ((3 <= cAMP__37_45_) OR (1 <= cAMP__2_15_) OR (cAMP__30_6_ <= cAMP__45_31_) OR (3 <= cAMP__44_47_)))
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no yes yes yes yes no yes yes yes no
lola:
preliminary result: yes yes yes yes yes no no yes yes yes yes no yes yes yes no
lola: memory consumption: 39532 KB
lola: time consumption: 311 seconds
BK_STOP 1526709029602
--------------------
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-D50N010"
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-D50N010.tgz
mv Diffusion2D-PT-D50N010 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-D50N010, 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-152649937000292"
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 '
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 ;