About the Execution of LoLA for Diffusion2D-PT-D05N350
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
146.270 | 800.00 | 300.00 | 17.50 | TTTTTTTTTTTTFFFF | 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 228K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K 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.8K 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 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Diffusion2D-PT-D05N350, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936900164
=====================================================================
--------------------
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-D05N350-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526649474344
info: Time: 3600 - MCC
===========================================================================================
prep: translating Diffusion2D-PT-D05N350 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Diffusion2D-PT-D05N350 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ Diffusion2D-PT-D05N350 @ 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: 169/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 144 transitions, 24 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D05N350-CTLCardinality.task
lola: E (F (E (F ((cAMP__3_3_ + 1 <= cAMP__5_5_))))) : E ((E (F ((cAMP__1_2_ <= cAMP__2_2_))) U (3 <= cAMP__4_1_))) : E (F ((((cAMP__5_3_ <= cAMP__1_1_) AND (2 <= cAMP__1_5_) AND (1 <= cAMP__3_1_)) AND E (F ((cAMP__4_5_ <= cAMP__3_1_)))))) : A (X (E (F (((cAMP__3_3_ <= cAMP__5_3_) AND (cAMP__3_4_ <= cAMP__2_3_)))))) : E (F (((2 <= cAMP__1_2_) AND E (X ((3 <= cAMP__1_2_)))))) : E (F (E (X ((3 <= cAMP__5_1_))))) : NOT(A (G (E (X ((1 <= cAMP__4_3_)))))) : E (((cAMP__2_4_ <= cAMP__2_1_) U E (X ((3 <= cAMP__3_1_))))) : ((NOT(A (G ((cAMP__5_2_ <= cAMP__3_5_)))) AND E (X (((2 <= cAMP__1_1_) OR (cAMP__3_3_ <= cAMP__1_1_))))) OR E ((((cAMP__2_2_ <= cAMP__5_3_) OR (2 <= cAMP__2_3_)) U ((3 <= cAMP__2_3_) AND (1 <= cAMP__3_1_))))) : (((cAMP__5_1_ <= cAMP__2_2_) AND (cAMP__4_1_ <= cAMP__4_4_) AND ((cAMP__5_4_ <= 0) OR (3 <= cAMP__1_2_) OR (1 <= cAMP__3_2_))) AND (((cAMP__5_1_ <= 1) AND (cAMP__3_2_ + 1 <= cAMP__5_4_)) OR E (F ((cAMP__3_3_ + 1 <= cAMP__5_2_))))) : E (G (E (F (((cAMP__2_1_ <= cAMP__1_2_) AND (3 <= cAMP__5_2_)))))) : (A (F (((cAMP__4_4_ <= cAMP__2_3_) OR (cAMP__5_5_ + 1 <= cAMP__5_4_)))) AND (NOT(A (G ((cAMP__4_1_ <= cAMP__3_3_)))) AND ((cAMP__5_3_ <= 1) OR (cAMP__5_1_ <= 0) OR ((cAMP__2_4_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__3_2_))))) : (1 <= cAMP__1_5_) : (cAMP__4_3_ + 1 <= cAMP__5_2_) : ((2 <= cAMP__4_1_) AND A (G (A (X ((1 <= cAMP__3_3_)))))) : A ((A (G ((1 <= cAMP__2_2_))) U ((2 <= cAMP__4_5_) OR (2 <= cAMP__4_3_) OR (2 <= cAMP__1_3_))))
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= cAMP__1_5_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= cAMP__1_5_)
lola: processed formula length: 17
lola: 15 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__4_3_ + 1 <= cAMP__5_2_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__4_3_ + 1 <= cAMP__5_2_)
lola: processed formula length: 30
lola: 15 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= cAMP__5_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (3 <= cAMP__5_1_)
lola: processed formula length: 17
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 7691 markings, 17127 edges
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-5 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: E (F (A (X ((cAMP__4_3_ <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((cAMP__4_3_ <= 0)))
lola: processed formula length: 31
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 701 markings, 700 edges
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((cAMP__2_4_ <= cAMP__2_1_) U E (X ((3 <= cAMP__3_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((cAMP__2_4_ <= cAMP__2_1_) U EX((3 <= cAMP__3_1_)))
lola: processed formula length: 53
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3262 markings, 8405 edges
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((cAMP__3_5_ + 1 <= cAMP__5_2_))) AND E (X (((2 <= cAMP__1_1_) OR (cAMP__3_3_ <= cAMP__1_1_))))) OR E ((((cAMP__2_2_ <= cAMP__5_3_) OR (2 <= cAMP__2_3_)) U ((3 <= cAMP__2_3_) AND (1 <= cAMP__3_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__3_5_ + 1 <= cAMP__5_2_)))
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_5_ + 1 <= cAMP__5_2_)))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.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_5_ + 1 <= cAMP__5_2_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N350-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((cAMP__2_2_ <= cAMP__5_3_) OR (2 <= cAMP__2_3_)) U ((3 <= cAMP__2_3_) AND (1 <= cAMP__3_1_))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((cAMP__2_2_ <= cAMP__5_3_) OR (2 <= cAMP__2_3_)) U ((3 <= cAMP__2_3_) AND (1 <= cAMP__3_1_))))
lola: processed formula length: 100
lola: 18 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= cAMP__2_3_) AND (1 <= cAMP__3_1_))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N350-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D05N350-CTLCardinality-6-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 space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 67737 markings, 326859 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((cAMP__3_3_ <= cAMP__5_3_) AND (cAMP__3_4_ <= cAMP__2_3_))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U ((cAMP__3_3_ <= cAMP__5_3_) AND (cAMP__3_4_ <= cAMP__2_3_))))
lola: processed formula length: 73
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4890 markings, 4890 edges
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__1_2_) AND E (X ((3 <= cAMP__1_2_))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U ((2 <= cAMP__1_2_) AND EX((3 <= cAMP__1_2_))))
lola: processed formula length: 55
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3178 markings, 8291 edges
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= cAMP__4_1_) AND A (X (A (G ((1 <= cAMP__3_3_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= cAMP__4_1_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= cAMP__4_1_)
lola: processed formula length: 17
lola: 15 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__3_3_ + 1 <= cAMP__5_5_)))
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_3_ + 1 <= cAMP__5_5_)))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.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_3_ + 1 <= cAMP__5_5_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N350-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 359 markings, 363 edges
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((cAMP__1_2_ <= cAMP__2_2_))) U (3 <= cAMP__4_1_)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(E(TRUE U (cAMP__1_2_ <= cAMP__2_2_)) U (3 <= cAMP__4_1_))
lola: processed formula length: 59
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4532 markings, 19038 edges
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: sara: try reading problem file Diffusion2D-PT-D05N350-CTLCardinality-9-0.sara.
subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__5_3_ <= cAMP__1_1_) AND (2 <= cAMP__1_5_) AND (1 <= cAMP__3_1_)) AND E (F ((cAMP__4_5_ <= cAMP__3_1_))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (((cAMP__5_3_ <= cAMP__1_1_) AND (2 <= cAMP__1_5_) AND (1 <= cAMP__3_1_)) AND E(TRUE U (cAMP__4_5_ <= cAMP__3_1_))))
lola: processed formula length: 125
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12676 markings, 50789 edges
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((cAMP__2_1_ <= cAMP__1_2_) AND (3 <= cAMP__5_2_))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: ((cAMP__2_1_ <= cAMP__1_2_) AND (3 <= cAMP__5_2_))
lola: processed formula length: 50
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 710 markings, 715 edges
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= cAMP__4_5_) OR (2 <= cAMP__4_3_) OR (2 <= cAMP__1_3_)) OR (A (G ((1 <= cAMP__2_2_))) AND A (F (((2 <= cAMP__4_5_) OR (2 <= cAMP__4_3_) OR (2 <= cAMP__1_3_))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= cAMP__4_5_) OR (2 <= cAMP__4_3_) OR (2 <= cAMP__1_3_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= cAMP__4_5_) OR (2 <= cAMP__4_3_) OR (2 <= cAMP__1_3_))
lola: processed formula length: 63
lola: 15 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= cAMP__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 ((1 <= cAMP__2_2_)))
lola: processed formula length: 25
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.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__2_2_ <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to Diffusion2D-PT-D05N350-CTLCardinality-14-0.sara
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((cAMP__5_1_ <= cAMP__2_2_) AND (cAMP__4_1_ <= cAMP__4_4_) AND ((cAMP__5_4_ <= 0) OR (3 <= cAMP__1_2_) OR (1 <= cAMP__3_2_))) AND (((cAMP__5_1_ <= 1) AND (cAMP__3_2_ + 1 <= cAMP__5_4_)) OR E (F ((cAMP__3_3_ + 1 <= cAMP__5_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file Diffusion2D-PT-D05N350-CTLCardinality-14-0.sara.
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cAMP__5_1_ <= 1) AND (cAMP__3_2_ + 1 <= cAMP__5_4_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__5_1_ <= 1) AND (cAMP__3_2_ + 1 <= cAMP__5_4_))
lola: processed formula length: 54
lola: 15 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__3_3_ + 1 <= cAMP__5_2_)))
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_3_ + 1 <= cAMP__5_2_)))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.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_3_ + 1 <= cAMP__5_2_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N350-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 354 markings, 354 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((cAMP__4_4_ <= cAMP__2_3_) OR (cAMP__5_5_ + 1 <= cAMP__5_4_)))) AND (E (F ((cAMP__3_3_ + 1 <= cAMP__4_1_))) AND ((cAMP__5_3_ <= 1) OR (cAMP__5_1_ <= 0) OR ((cAMP__2_4_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__3_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__3_3_ + 1 <= cAMP__4_1_)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((cAMP__3_3_ + 1 <= cAMP__4_1_)))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.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_3_ + 1 <= cAMP__4_1_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N350-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 353 markings, 352 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((cAMP__4_4_ <= cAMP__2_3_) OR (cAMP__5_5_ + 1 <= cAMP__5_4_))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((cAMP__2_3_ + 1 <= cAMP__4_4_) AND (cAMP__5_4_ <= cAMP__5_5_))
lola: processed formula length: 63
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((cAMP__5_1_ <= cAMP__2_2_) AND (cAMP__4_1_ <= cAMP__4_4_) AND ((cAMP__5_4_ <= 0) OR (3 <= cAMP__1_2_) OR (1 <= cAMP__3_2_))) AND (((cAMP__5_1_ <= 1) AND (cAMP__3_2_ + 1 <= cAMP__5_4_)) OR E (F ((cAMP__3_3_ + 1 <= cAMP__5_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((cAMP__5_1_ <= 1) AND (cAMP__3_2_ + 1 <= cAMP__5_4_))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__5_1_ <= 1) AND (cAMP__3_2_ + 1 <= cAMP__5_4_))
lola: processed formula length: 54
lola: 15 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__3_3_ + 1 <= cAMP__5_2_)))
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_3_ + 1 <= cAMP__5_2_)))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.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_3_ + 1 <= cAMP__5_2_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N350-CTLCardinality-17-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 354 markings, 354 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((cAMP__5_1_ <= cAMP__2_2_) AND (cAMP__4_1_ <= cAMP__4_4_) AND ((cAMP__5_4_ <= 0) OR (3 <= cAMP__1_2_) OR (1 <= cAMP__3_2_)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__5_1_ <= cAMP__2_2_) AND (cAMP__4_1_ <= cAMP__4_4_) AND ((cAMP__5_4_ <= 0) OR (3 <= cAMP__1_2_) OR (1 <= cAMP__3_2_)))
lola: processed formula length: 127
lola: 15 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (F (((cAMP__4_4_ <= cAMP__2_3_) OR (cAMP__5_5_ + 1 <= cAMP__5_4_)))) AND (E (F ((cAMP__3_3_ + 1 <= cAMP__4_1_))) AND ((cAMP__5_3_ <= 1) OR (cAMP__5_1_ <= 0) OR ((cAMP__2_4_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__3_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__3_3_ + 1 <= cAMP__4_1_)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((cAMP__3_3_ + 1 <= cAMP__4_1_)))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.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_3_ + 1 <= cAMP__4_1_)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D05N350-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 353 markings, 352 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((cAMP__5_3_ <= 1) OR (cAMP__5_1_ <= 0) OR ((cAMP__2_4_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__3_2_)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cAMP__5_3_ <= 1) OR (cAMP__5_1_ <= 0) OR ((cAMP__2_4_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__3_2_)))
lola: processed formula length: 100
lola: 15 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((cAMP__4_4_ <= cAMP__2_3_) OR (cAMP__5_5_ + 1 <= cAMP__5_4_))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((cAMP__2_3_ + 1 <= cAMP__4_4_) AND (cAMP__5_4_ <= cAMP__5_5_))
lola: processed formula length: 63
lola: 17 rewrites
lola: closed formula file Diffusion2D-PT-D05N350-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes yes yes yes yes yes yes no no no no
lola:
preliminary result: yes yes yes yes yes yes yes yes yes yes yes yes no no no no
lola: memory consumption: 23580 KB
lola: time consumption: 1 seconds
BK_STOP 1526649475144
--------------------
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-D05N350"
export BK_EXAMINATION="CTLCardinality"
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-D05N350.tgz
mv Diffusion2D-PT-D05N350 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-D05N350, examination is CTLCardinality"
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-152649936900164"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;