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 184K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K 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.0K 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 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CircadianClock-PT-000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306600493
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526613817894

info: Time: 3600 - MCC
===========================================================================================
prep: translating CircadianClock-PT-000100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CircadianClock-PT-000100 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ CircadianClock-PT-000100 @ 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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-000100-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= dr)
lola: LP says that atomic proposition is always false: (2 <= da_a)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= da_a)
lola: LP says that atomic proposition is always false: (2 <= dr)
lola: LP says that atomic proposition is always false: (3 <= dr)
lola: LP says that atomic proposition is always false: (3 <= dr)
lola: LP says that atomic proposition is always false: (3 <= dr)
lola: LP says that atomic proposition is always false: (3 <= da_a)
lola: LP says that atomic proposition is always false: (2 <= dr_a)
lola: LP says that atomic proposition is always false: (2 <= da_a)
lola: NOT(A (G (E (F ((3 <= mr)))))) : (A (G (((1 <= mr_cap) OR (3 <= ma)))) OR A (((1 <= c) U ((1 <= ma) AND (1 <= a_cap))))) : (E (G ((a_cap <= r))) OR (A (G ((3 <= ma_cap))) AND A (X (((1 <= mr) OR (dr_a <= a)))))) : (E (((1 <= da) U ((1 <= a) AND (ma_cap <= mr)))) OR ((r_cap <= c) AND (((1 <= mr) OR (c <= c_cap)) AND A (G ((1 <= mr_cap)))))) : A (G ((E (G (TRUE)) OR (((dr_a <= c_cap) OR (mr_cap <= c)) AND ((3 <= c) OR (3 <= ma_cap)))))) : E (((3 <= r_cap) U ((3 <= r) AND (c_cap <= r_cap) AND ((a_cap <= r_cap) OR (2 <= c))))) : E (F (E (G (())))) : (NOT(E (((1 <= da) U (ma_cap <= mr)))) AND E (G (A (G ((3 <= r_cap)))))) : (NOT((A (F ((da <= c_cap))) OR A (X ((c <= a))))) OR E ((((1 <= da)) U (a_cap <= 1)))) : NOT(NOT((() OR A (G ((2 <= mr_cap)))))) : (E ((((1 <= r) OR (ma <= dr_a)) U ((ma <= dr) AND (r_cap <= r)))) OR ()) : A (F (((r <= da) AND A (G ((dr_a <= r_cap)))))) : A (G (E (F (((c_cap <= r_cap) OR (3 <= mr_cap)))))) : (E (F (A (G (FALSE)))) AND ((r_cap <= 0) OR (E (G ((a <= c_cap))) AND ()))) : A (G ((((1 <= mr_cap) OR (da_a <= dr) OR ((c <= ma) AND (a_cap <= da_a))) AND A (X ((r <= mr_cap)))))) : E (X (E (F (()))))
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 52 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: processed formula with 0 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

FORMULA CircadianClock-PT-000100-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-13 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((a_cap <= r))) OR (A (G ((3 <= ma_cap))) AND A (X (((1 <= mr) OR (dr_a <= a))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= ma_cap)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= ma_cap)))
lola: processed formula length: 21
lola: 54 rewrites
lola: closed formula file CircadianClock-PT-000100-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: (ma_cap <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-000100-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 99 markings, 98 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((a_cap <= r)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((a_cap <= r)))
lola: processed formula length: 20
lola: 52 rewrites
lola: closed formula file CircadianClock-PT-000100-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: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= mr_cap) OR (da_a <= dr) OR ((c <= ma) AND (a_cap <= da_a))))) AND A (X (A (G ((r <= mr_cap))))))
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: A (G (((1 <= mr_cap) OR (da_a <= dr) OR ((c <= ma) AND (a_cap <= da_a)))))
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 <= mr_cap) OR (da_a <= dr) OR ((c <= ma) AND (a_cap <= da_a)))))
lola: processed formula length: 76
lola: 54 rewrites
lola: closed formula file CircadianClock-PT-000100-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 106 markings, 106 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G ((c_cap + 1 <= da))) AND E (X ((a + 1 <= c)))) OR E ((((1 <= da)) U (a_cap <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= da)) U (a_cap <= 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 ((((1 <= da)) U (a_cap <= 1)))
lola: processed formula length: 32
lola: 55 rewrites
lola: closed formula file CircadianClock-PT-000100-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: (a_cap <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-000100-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-000100-CTLCardinality-6-0.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 10300 markings, 15349 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-8 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: A (G ((2 <= mr_cap)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= mr_cap)))
lola: processed formula length: 21
lola: 54 rewrites
lola: closed formula file CircadianClock-PT-000100-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: (mr_cap <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-000100-CTLCardinality-7-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: 100 markings, 99 edges

FORMULA CircadianClock-PT-000100-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((mr <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (3 <= mr)
lola: processed formula length: 9
lola: 54 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2203956 markings, 4401210 edges, 440791 markings/sec, 0 secs
lola: 4029388 markings, 8061134 edges, 365086 markings/sec, 5 secs
lola: 5710446 markings, 11426772 edges, 336212 markings/sec, 10 secs
lola: 7370771 markings, 14757322 edges, 332065 markings/sec, 15 secs
lola: 9048346 markings, 18119479 edges, 335515 markings/sec, 20 secs
lola: 11349131 markings, 22754479 edges, 460157 markings/sec, 25 secs
lola: 13714544 markings, 27504464 edges, 473083 markings/sec, 30 secs
lola: 15889642 markings, 31858605 edges, 435020 markings/sec, 35 secs
lola: 17907853 markings, 35897542 edges, 403642 markings/sec, 40 secs
lola: 19939474 markings, 39987676 edges, 406324 markings/sec, 45 secs
lola: 21526440 markings, 43169259 edges, 317393 markings/sec, 50 secs
lola: 23360485 markings, 46853915 edges, 366809 markings/sec, 55 secs
lola: 25519958 markings, 51201837 edges, 431895 markings/sec, 60 secs
lola: 27541309 markings, 55278435 edges, 404270 markings/sec, 65 secs
lola: 29803616 markings, 59837166 edges, 452461 markings/sec, 70 secs
lola: 31824929 markings, 63918259 edges, 404263 markings/sec, 75 secs
lola: 34027306 markings, 68338753 edges, 440475 markings/sec, 80 secs
lola: 36081739 markings, 72458411 edges, 410887 markings/sec, 85 secs
lola: 37817262 markings, 75940854 edges, 347105 markings/sec, 90 secs
lola: 39546911 markings, 79401645 edges, 345930 markings/sec, 95 secs
lola: 41235145 markings, 82794160 edges, 337647 markings/sec, 100 secs
lola: 43151124 markings, 86653582 edges, 383196 markings/sec, 105 secs
lola: 45094373 markings, 90583993 edges, 388650 markings/sec, 110 secs
lola: 47339169 markings, 95101809 edges, 448959 markings/sec, 115 secs
lola: 49568575 markings, 99591969 edges, 445881 markings/sec, 120 secs
lola: 51736719 markings, 103959579 edges, 433629 markings/sec, 125 secs
lola: 53703648 markings, 107926645 edges, 393386 markings/sec, 130 secs
lola: 55661115 markings, 111866855 edges, 391493 markings/sec, 135 secs
lola: 57612190 markings, 115818689 edges, 390215 markings/sec, 140 secs
lola: 59573500 markings, 119780357 edges, 392262 markings/sec, 145 secs
lola: 61529455 markings, 123725597 edges, 391191 markings/sec, 150 secs
lola: 63618411 markings, 127931733 edges, 417791 markings/sec, 155 secs
lola: 65652107 markings, 132018660 edges, 406739 markings/sec, 160 secs
lola: 67817546 markings, 136386058 edges, 433088 markings/sec, 165 secs
lola: 70071005 markings, 140920351 edges, 450692 markings/sec, 170 secs
lola: 72159623 markings, 145104999 edges, 417724 markings/sec, 175 secs
lola: 74164603 markings, 149114820 edges, 400996 markings/sec, 180 secs
lola: 76042098 markings, 152871980 edges, 375499 markings/sec, 185 secs
lola: 77768032 markings, 156336434 edges, 345187 markings/sec, 190 secs
lola: 79454242 markings, 159719416 edges, 337242 markings/sec, 195 secs
lola: 81201370 markings, 163234323 edges, 349426 markings/sec, 200 secs
lola: 83126917 markings, 167110187 edges, 385109 markings/sec, 205 secs
lola: 84997800 markings, 170885148 edges, 374177 markings/sec, 210 secs
lola: 86907255 markings, 174733750 edges, 381891 markings/sec, 215 secs
lola: 88919956 markings, 178781752 edges, 402540 markings/sec, 220 secs
lola: 90996557 markings, 182982488 edges, 415320 markings/sec, 225 secs
lola: 92971812 markings, 186972914 edges, 395051 markings/sec, 230 secs
lola: 94924958 markings, 190903212 edges, 390629 markings/sec, 235 secs
lola: 96874902 markings, 194832181 edges, 389989 markings/sec, 240 secs
lola: 98766658 markings, 198627225 edges, 378351 markings/sec, 245 secs
lola: 100795944 markings, 202687921 edges, 405857 markings/sec, 250 secs
lola: 102928904 markings, 206970032 edges, 426592 markings/sec, 255 secs
lola: 105278536 markings, 211688804 edges, 469926 markings/sec, 260 secs
lola: 107378819 markings, 215909207 edges, 420057 markings/sec, 265 secs
lola: 109464915 markings, 220109266 edges, 417219 markings/sec, 270 secs
lola: 111737776 markings, 224664723 edges, 454572 markings/sec, 275 secs
lola: 113858386 markings, 228930825 edges, 424122 markings/sec, 280 secs
lola: 115871552 markings, 232966004 edges, 402633 markings/sec, 285 secs
lola: 117788171 markings, 236811298 edges, 383324 markings/sec, 290 secs
lola: 119754428 markings, 240753174 edges, 393251 markings/sec, 295 secs
lola: 121708818 markings, 244670801 edges, 390878 markings/sec, 300 secs
lola: 123714180 markings, 248703691 edges, 401072 markings/sec, 305 secs
lola: 124258509 markings, 249798508 edges, 108866 markings/sec, 310 secs
lola: 124308060 markings, 249899634 edges, 9910 markings/sec, 315 secs
lola: 124317970 markings, 249919509 edges, 1982 markings/sec, 320 secs
lola: 124322588 markings, 249928878 edges, 924 markings/sec, 325 secs
lola: 124347875 markings, 249979489 edges, 5057 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((c_cap <= r_cap) OR (3 <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((c_cap <= r_cap) OR (3 <= mr_cap))
lola: processed formula length: 36
lola: 53 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2242895 markings, 4469903 edges, 448579 markings/sec, 0 secs
lola: 4138397 markings, 8260686 edges, 379100 markings/sec, 5 secs
lola: 5971249 markings, 11917025 edges, 366570 markings/sec, 10 secs
lola: 7988707 markings, 15950552 edges, 403492 markings/sec, 15 secs
lola: 9962597 markings, 19884294 edges, 394778 markings/sec, 20 secs
lola: 11851105 markings, 23663145 edges, 377702 markings/sec, 25 secs
lola: 13752379 markings, 27453744 edges, 380255 markings/sec, 30 secs
lola: 15756841 markings, 31467328 edges, 400892 markings/sec, 35 secs
lola: 17742300 markings, 35463382 edges, 397092 markings/sec, 40 secs
lola: 19637307 markings, 39263133 edges, 379001 markings/sec, 45 secs
lola: 21478381 markings, 42938939 edges, 368215 markings/sec, 50 secs
lola: 23398585 markings, 46786301 edges, 384041 markings/sec, 55 secs
lola: 25232537 markings, 50449606 edges, 366790 markings/sec, 60 secs
lola: 27099566 markings, 54201459 edges, 373406 markings/sec, 65 secs
lola: 29029061 markings, 58062365 edges, 385899 markings/sec, 70 secs
lola: 30900934 markings, 61827227 edges, 374375 markings/sec, 75 secs
lola: 32834407 markings, 65709138 edges, 386695 markings/sec, 80 secs
lola: 34707878 markings, 69460152 edges, 374694 markings/sec, 85 secs
lola: 36552659 markings, 73156421 edges, 368956 markings/sec, 90 secs
lola: 38370276 markings, 76798400 edges, 363523 markings/sec, 95 secs
lola: 40112293 markings, 80290341 edges, 348403 markings/sec, 100 secs
lola: 41859613 markings, 83791438 edges, 349464 markings/sec, 105 secs
lola: 43637017 markings, 87353052 edges, 355481 markings/sec, 110 secs
lola: 45358723 markings, 90802930 edges, 344341 markings/sec, 115 secs
lola: 47089412 markings, 94270713 edges, 346138 markings/sec, 120 secs
lola: 48763071 markings, 97625418 edges, 334732 markings/sec, 125 secs
lola: 50436784 markings, 100978827 edges, 334743 markings/sec, 130 secs
lola: 52255695 markings, 104623707 edges, 363782 markings/sec, 135 secs
lola: 54020283 markings, 108159527 edges, 352918 markings/sec, 140 secs
lola: 55743312 markings, 111612866 edges, 344606 markings/sec, 145 secs
lola: 57445500 markings, 115023906 edges, 340438 markings/sec, 150 secs
lola: 59105369 markings, 118349743 edges, 331974 markings/sec, 155 secs
lola: 60866792 markings, 121879501 edges, 352285 markings/sec, 160 secs
lola: 62570259 markings, 125292585 edges, 340693 markings/sec, 165 secs
lola: 64234180 markings, 128627828 edges, 332784 markings/sec, 170 secs
lola: 65918171 markings, 132002000 edges, 336798 markings/sec, 175 secs
lola: 67546158 markings, 135264236 edges, 325597 markings/sec, 180 secs
lola: 69431554 markings, 139042062 edges, 377079 markings/sec, 185 secs
lola: 71284155 markings, 142754200 edges, 370520 markings/sec, 190 secs
lola: 73085969 markings, 146365932 edges, 360363 markings/sec, 195 secs
lola: 74881462 markings, 149963598 edges, 359099 markings/sec, 200 secs
lola: 76599503 markings, 153406179 edges, 343608 markings/sec, 205 secs
lola: 78429833 markings, 157073769 edges, 366066 markings/sec, 210 secs
lola: 80176040 markings, 160572810 edges, 349241 markings/sec, 215 secs
lola: 81884798 markings, 163997894 edges, 341752 markings/sec, 220 secs
lola: 83602344 markings, 167439300 edges, 343509 markings/sec, 225 secs
lola: 85264736 markings, 170770346 edges, 332478 markings/sec, 230 secs
lola: 87106758 markings, 174461328 edges, 368404 markings/sec, 235 secs
lola: 88885718 markings, 178025887 edges, 355792 markings/sec, 240 secs
lola: 90607698 markings, 181477587 edges, 344396 markings/sec, 245 secs
lola: 92328783 markings, 184925943 edges, 344217 markings/sec, 250 secs
lola: 93995014 markings, 188264967 edges, 333246 markings/sec, 255 secs
lola: 95767829 markings, 191817026 edges, 354563 markings/sec, 260 secs
lola: 97464065 markings, 195216319 edges, 339247 markings/sec, 265 secs
lola: 99152857 markings, 198600868 edges, 337758 markings/sec, 270 secs
lola: 100835383 markings, 201972138 edges, 336505 markings/sec, 275 secs
lola: 102484133 markings, 205275962 edges, 329750 markings/sec, 280 secs
lola: 104339901 markings, 208994406 edges, 371154 markings/sec, 285 secs
lola: 106178278 markings, 212679316 edges, 367675 markings/sec, 290 secs
lola: 108006784 markings, 216343369 edges, 365701 markings/sec, 295 secs
lola: 109802417 markings, 219941262 edges, 359127 markings/sec, 300 secs
lola: 111530548 markings, 223404176 edges, 345626 markings/sec, 305 secs
lola: 113372548 markings, 227095148 edges, 368400 markings/sec, 310 secs
lola: 115147883 markings, 230652343 edges, 355067 markings/sec, 315 secs
lola: 116883863 markings, 234132010 edges, 347196 markings/sec, 320 secs
lola: 118639298 markings, 237649507 edges, 351087 markings/sec, 325 secs
lola: 120335641 markings, 241048690 edges, 339269 markings/sec, 330 secs
lola: 122250485 markings, 244885633 edges, 382969 markings/sec, 335 secs
lola: 122430383 markings, 245246232 edges, 35980 markings/sec, 340 secs
lola: 122450411 markings, 245286398 edges, 4006 markings/sec, 345 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((r <= da) AND A (G ((dr_a <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U ((r <= da) AND NOT(E(TRUE U (r_cap + 1 <= dr_a)))))
lola: processed formula length: 60
lola: 55 rewrites
lola: closed formula file CircadianClock-PT-000100-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: 1973302 markings, 3937495 edges, 394660 markings/sec, 0 secs
lola: 3609532 markings, 7217050 edges, 327246 markings/sec, 5 secs
lola: 5202213 markings, 10406932 edges, 318536 markings/sec, 10 secs
lola: 6789353 markings, 13588533 edges, 317428 markings/sec, 15 secs
lola: 8376138 markings, 16771531 edges, 317357 markings/sec, 20 secs
lola: 10228914 markings, 20495656 edges, 370555 markings/sec, 25 secs
lola: 12343527 markings, 24754607 edges, 422923 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13004480 markings, 26084586 edges
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= r) OR (ma <= dr_a)) U ((ma <= dr) AND (r_cap <= r))))
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 ((((1 <= r) OR (ma <= dr_a)) U ((ma <= dr) AND (r_cap <= r))))
lola: processed formula length: 65
lola: 55 rewrites
lola: closed formula file CircadianClock-PT-000100-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: ((ma <= dr) AND (r_cap <= r))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 51 markings, 50 edges
lola:
FORMULA CircadianClock-PT-000100-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((3 <= r_cap) U ((3 <= r) AND (c_cap <= r_cap) AND ((a_cap <= r_cap) OR (2 <= c)))))
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 (((3 <= r_cap) U ((3 <= r) AND (c_cap <= r_cap) AND ((a_cap <= r_cap) OR (2 <= c)))))
lola: processed formula length: 88
lola: 55 rewrites
lola: closed formula file CircadianClock-PT-000100-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 <= r) AND (c_cap <= r_cap) AND ((a_cap <= r_cap) OR (2 <= c)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-000100-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-000100-CTLCardinality-12-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 1585147 markings, 3161986 edges, 317029 markings/sec, 0 secs
lola: sara is running 5 secs || 2950806 markings, 5897588 edges, 273132 markings/sec, 5 secs
lola: sara is running 10 secs || 4256801 markings, 8517665 edges, 261199 markings/sec, 10 secs
lola: sara is running 15 secs || 5593299 markings, 11193799 edges, 267300 markings/sec, 15 secs
lola: sara is running 20 secs || 6933178 markings, 13878896 edges, 267976 markings/sec, 20 secs
lola: sara is running 25 secs || 8261904 markings, 16542996 edges, 265745 markings/sec, 25 secs
lola: sara is running 30 secs || 9744389 markings, 19524334 edges, 296497 markings/sec, 30 secs
lola: sara is running 35 secs || 11369172 markings, 22798705 edges, 324957 markings/sec, 35 secs
lola: sara is running 40 secs || 12988393 markings, 26053165 edges, 323844 markings/sec, 40 secs
lola: sara is running 45 secs || 14504795 markings, 29087476 edges, 303280 markings/sec, 45 secs
lola: sara is running 50 secs || 16017331 markings, 32115723 edges, 302507 markings/sec, 50 secs
lola: sara is running 55 secs || 17494682 markings, 35072991 edges, 295470 markings/sec, 55 secs
lola: sara is running 60 secs || 18988125 markings, 38087210 edges, 298689 markings/sec, 60 secs
lola: sara is running 65 secs || 20265257 markings, 40648090 edges, 255426 markings/sec, 65 secs
lola: sara is running 70 secs || 21505960 markings, 43132053 edges, 248141 markings/sec, 70 secs
lola: sara is running 75 secs || 23001501 markings, 46141528 edges, 299108 markings/sec, 75 secs
lola: sara is running 80 secs || 24517262 markings, 49195774 edges, 303152 markings/sec, 80 secs
lola: sara is running 85 secs || 25976277 markings, 52135941 edges, 291803 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 27428168 markings, 55070741 edges
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 914 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= mr_cap) OR (3 <= ma)))) OR A (((1 <= c) U ((1 <= ma) AND (1 <= a_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 914 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= mr_cap) OR (3 <= ma))))
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 <= mr_cap) OR (3 <= ma))))
lola: processed formula length: 37
lola: 54 rewrites
lola: closed formula file CircadianClock-PT-000100-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: ((mr_cap <= 0) AND (ma <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: state equation: write sara problem file to CircadianClock-PT-000100-CTLCardinality-13-0.sara
lola: ========================================
lola: subprocess 14 will run for 1371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= c) U ((1 <= ma) AND (1 <= a_cap))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((1 <= c) U ((1 <= ma) AND (1 <= a_cap))))
lola: processed formula length: 45
lola: 56 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((da <= 0) R (mr + 1 <= ma_cap))) AND A (G ((3 <= r_cap))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= r_cap)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= r_cap)))
lola: processed formula length: 20
lola: 54 rewrites
lola: closed formula file CircadianClock-PT-000100-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: (r_cap <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-000100-CTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100 markings, 99 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((1 <= da) U ((1 <= a) AND (ma_cap <= mr)))) OR ((r_cap <= c) AND (((1 <= mr) OR (c <= c_cap)) AND A (G ((1 <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: state equation: calling and running sara
lola: subprocess 15 will run for 2743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: sara: try reading problem file CircadianClock-PT-000100-CTLCardinality-14-0.sara.
...considering subproblem: (r_cap <= c)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (r_cap <= c)
lola:
processed formula length: 12
lola: 52 rewrites
lola: closed formula file CircadianClock-PT-000100-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: ========================================
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: ========================================
lola: ...considering subproblem: E (F (A (G ((mr <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (3 <= mr)
lola: processed formula length: 9
lola: 54 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2182913 markings, 4359175 edges, 436583 markings/sec, 0 secs
lola: 4028331 markings, 8058954 edges, 369084 markings/sec, 5 secs
lola: 5816305 markings, 11639082 edges, 357595 markings/sec, 10 secs
lola: 7591131 markings, 15197642 edges, 354965 markings/sec, 15 secs
lola: 9410627 markings, 18851291 edges, 363899 markings/sec, 20 secs
lola: 11827950 markings, 23716236 edges, 483465 markings/sec, 25 secs
lola: 14150544 markings, 28374989 edges, 464519 markings/sec, 30 secs
lola: 16317575 markings, 32713624 edges, 433406 markings/sec, 35 secs
lola: 18359169 markings, 36806361 edges, 408319 markings/sec, 40 secs
lola: 20259650 markings, 40626569 edges, 380096 markings/sec, 45 secs
lola: 21928337 markings, 43971007 edges, 333737 markings/sec, 50 secs
lola: 23973718 markings, 48091350 edges, 409076 markings/sec, 55 secs
lola: 26129240 markings, 52429840 edges, 431104 markings/sec, 60 secs
lola: 28235431 markings, 56681987 edges, 421238 markings/sec, 65 secs
lola: 30383439 markings, 61008152 edges, 429602 markings/sec, 70 secs
lola: 32409076 markings, 65094974 edges, 405127 markings/sec, 75 secs
lola: 34581291 markings, 69449453 edges, 434443 markings/sec, 80 secs
lola: 36590141 markings, 73477548 edges, 401770 markings/sec, 85 secs
lola: 38306489 markings, 76919378 edges, 343270 markings/sec, 90 secs
lola: 40019415 markings, 80354008 edges, 342585 markings/sec, 95 secs
lola: 41732194 markings, 83791875 edges, 342556 markings/sec, 100 secs
lola: 43718492 markings, 87801379 edges, 397260 markings/sec, 105 secs
lola: 45818192 markings, 92043164 edges, 419940 markings/sec, 110 secs
lola: 48047979 markings, 96526868 edges, 445957 markings/sec, 115 secs
lola: 50273941 markings, 101014907 edges, 445192 markings/sec, 120 secs
lola: 52384419 markings, 105265028 edges, 422096 markings/sec, 125 secs
lola: 54393264 markings, 109319136 edges, 401769 markings/sec, 130 secs
lola: 56326141 markings, 113216341 edges, 386575 markings/sec, 135 secs
lola: 58278879 markings, 117159652 edges, 390548 markings/sec, 140 secs
lola: 60240967 markings, 121126374 edges, 392418 markings/sec, 145 secs
lola: 62263736 markings, 125202631 edges, 404554 markings/sec, 150 secs
lola: 64334677 markings, 129375666 edges, 414188 markings/sec, 155 secs
lola: 66386996 markings, 133500644 edges, 410464 markings/sec, 160 secs
lola: 68710467 markings, 138181875 edges, 464694 markings/sec, 165 secs
lola: 70949402 markings, 142681672 edges, 447787 markings/sec, 170 secs
lola: 72954537 markings, 146696275 edges, 401027 markings/sec, 175 secs
lola: 74998332 markings, 150785983 edges, 408759 markings/sec, 180 secs
lola: 76690680 markings, 154180699 edges, 338470 markings/sec, 185 secs
lola: 78340155 markings, 157492559 edges, 329895 markings/sec, 190 secs
lola: 79993733 markings, 160803447 edges, 330716 markings/sec, 195 secs
lola: 81673125 markings, 164179263 edges, 335878 markings/sec, 200 secs
lola: 83552600 markings, 167975697 edges, 375895 markings/sec, 205 secs
lola: 85359015 markings, 171616517 edges, 361283 markings/sec, 210 secs
lola: 87292424 markings, 175509598 edges, 386682 markings/sec, 215 secs
lola: 89229913 markings, 179405114 edges, 387498 markings/sec, 220 secs
lola: 91294672 markings, 183584370 edges, 412952 markings/sec, 225 secs
lola: 93256623 markings, 187544458 edges, 392390 markings/sec, 230 secs
lola: 95205318 markings, 191470006 edges, 389739 markings/sec, 235 secs
lola: 97131566 markings, 195347367 edges, 385250 markings/sec, 240 secs
lola: 99039825 markings, 199176285 edges, 381652 markings/sec, 245 secs
lola: 101021559 markings, 203139738 edges, 396347 markings/sec, 250 secs
lola: 103167897 markings, 207446699 edges, 429268 markings/sec, 255 secs
lola: 105468832 markings, 212071327 edges, 460187 markings/sec, 260 secs
lola: 107523167 markings, 216201856 edges, 410867 markings/sec, 265 secs
lola: 109585957 markings, 220352101 edges, 412558 markings/sec, 270 secs
lola: 111816140 markings, 224821168 edges, 446037 markings/sec, 275 secs
lola: 113899656 markings, 229013624 edges, 416703 markings/sec, 280 secs
lola: 115865366 markings, 232953525 edges, 393142 markings/sec, 285 secs
lola: 117733478 markings, 236702111 edges, 373622 markings/sec, 290 secs
lola: 119670850 markings, 240586393 edges, 387474 markings/sec, 295 secs
lola: 121590916 markings, 244430957 edges, 384013 markings/sec, 300 secs
lola: 123552306 markings, 248378883 edges, 392278 markings/sec, 305 secs
lola: 124293961 markings, 249869428 edges, 148331 markings/sec, 310 secs
lola: 124299884 markings, 249881238 edges, 1185 markings/sec, 315 secs
lola: 124310437 markings, 249904472 edges, 2111 markings/sec, 320 secs
lola: 124319353 markings, 249922305 edges, 1783 markings/sec, 325 secs
lola: 124330805 markings, 249945344 edges, 2290 markings/sec, 330 secs
lola: 124334348 markings, 249952542 edges, 709 markings/sec, 335 secs
lola: 124352921 markings, 249989715 edges, 3715 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA CircadianClock-PT-000100-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((c_cap <= r_cap) OR (3 <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((c_cap <= r_cap) OR (3 <= mr_cap))
lola: processed formula length: 36
lola: 53 rewrites
lola: closed formula file CircadianClock-PT-000100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2210060 markings, 4404108 edges, 442012 markings/sec, 0 secs
lola: 4110983 markings, 8205841 edges, 380185 markings/sec, 5 secs
lola: 5904006 markings, 11782717 edges, 358605 markings/sec, 10 secs
lola: 7951445 markings, 15876389 edges, 409488 markings/sec, 15 secs
lola: 9941313 markings, 19841918 edges, 397974 markings/sec, 20 secs
lola: 11907354 markings, 23775639 edges, 393208 markings/sec, 25 secs
lola: 13834847 markings, 27618377 edges, 385499 markings/sec, 30 secs
lola: 15844150 markings, 31643235 edges, 401861 markings/sec, 35 secs
lola: 17852015 markings, 35684405 edges, 401573 markings/sec, 40 secs
lola: 19747130 markings, 39482203 edges, 379023 markings/sec, 45 secs
lola: 21629612 markings, 43242090 edges, 376496 markings/sec, 50 secs
lola: 23561135 markings, 47112175 edges, 386305 markings/sec, 55 secs
lola: 25431580 markings, 50850602 edges, 374089 markings/sec, 60 secs
lola: 27315759 markings, 54634797 edges, 376836 markings/sec, 65 secs
lola: 29263227 markings, 58534888 edges, 389494 markings/sec, 70 secs
lola: 31178925 markings, 62386604 edges, 383140 markings/sec, 75 secs
lola: 33104082 markings, 66248363 edges, 385031 markings/sec, 80 secs
lola: 35014281 markings, 70074108 edges, 382040 markings/sec, 85 secs
lola: 36837068 markings, 73726629 edges, 364557 markings/sec, 90 secs
lola: 38693672 markings, 77446694 edges, 371321 markings/sec, 95 secs
lola: 40476908 markings, 81020015 edges, 356647 markings/sec, 100 secs
lola: 42266840 markings, 84607644 edges, 357986 markings/sec, 105 secs
lola: 44079323 markings, 88239336 edges, 362497 markings/sec, 110 secs
lola: 45809185 markings, 91705817 edges, 345972 markings/sec, 115 secs
lola: 47595366 markings, 95284785 edges, 357236 markings/sec, 120 secs
lola: 49319313 markings, 98739150 edges, 344789 markings/sec, 125 secs
lola: 51082986 markings, 102274261 edges, 352735 markings/sec, 130 secs
lola: 52922542 markings, 105960225 edges, 367911 markings/sec, 135 secs
lola: 54673006 markings, 109467918 edges, 350093 markings/sec, 140 secs
lola: 56459717 markings, 113048150 edges, 357342 markings/sec, 145 secs
lola: 58191938 markings, 116518882 edges, 346444 markings/sec, 150 secs
lola: 59930476 markings, 120003738 edges, 347708 markings/sec, 155 secs
lola: 61697749 markings, 123544770 edges, 353455 markings/sec, 160 secs
lola: 63393249 markings, 126942475 edges, 339100 markings/sec, 165 secs
lola: 65142380 markings, 130447159 edges, 349826 markings/sec, 170 secs
lola: 66835899 markings, 133840345 edges, 338704 markings/sec, 175 secs
lola: 68616221 markings, 137409015 edges, 356064 markings/sec, 180 secs
lola: 70536216 markings, 141256216 edges, 383999 markings/sec, 185 secs
lola: 72379733 markings, 144950250 edges, 368703 markings/sec, 190 secs
lola: 74212334 markings, 148622541 edges, 366520 markings/sec, 195 secs
lola: 76013396 markings, 152231297 edges, 360212 markings/sec, 200 secs
lola: 77826144 markings, 155863649 edges, 362550 markings/sec, 205 secs
lola: 79600172 markings, 159419659 edges, 354806 markings/sec, 210 secs
lola: 81357009 markings, 162939904 edges, 351367 markings/sec, 215 secs
lola: 83099168 markings, 166430785 edges, 348432 markings/sec, 220 secs
lola: 84834838 markings, 169908660 edges, 347134 markings/sec, 225 secs
lola: 86657135 markings, 173559996 edges, 364459 markings/sec, 230 secs
lola: 88447626 markings, 177148938 edges, 358098 markings/sec, 235 secs
lola: 90222186 markings, 180704813 edges, 354912 markings/sec, 240 secs
lola: 91959919 markings, 184186786 edges, 347547 markings/sec, 245 secs
lola: 93688329 markings, 187650132 edges, 345682 markings/sec, 250 secs
lola: 95466910 markings, 191213862 edges, 355716 markings/sec, 255 secs
lola: 97195572 markings, 194678951 edges, 345732 markings/sec, 260 secs
lola: 98916345 markings, 198126876 edges, 344155 markings/sec, 265 secs
lola: 100622743 markings, 201546221 edges, 341280 markings/sec, 270 secs
lola: 102319276 markings, 204945439 edges, 339307 markings/sec, 275 secs
lola: 104158784 markings, 208631374 edges, 367902 markings/sec, 280 secs
lola: 106029795 markings, 212381759 edges, 374202 markings/sec, 285 secs
lola: 107875560 markings, 216080321 edges, 369153 markings/sec, 290 secs
lola: 109697362 markings, 219730577 edges, 364360 markings/sec, 295 secs
lola: 111452938 markings, 223248643 edges, 351115 markings/sec, 300 secs
lola: 113312556 markings, 226974859 edges, 371924 markings/sec, 305 secs
lola: 115103976 markings, 230564477 edges, 358284 markings/sec, 310 secs
lola: 116867191 markings, 234098651 edges, 352643 markings/sec, 315 secs
lola: 118598291 markings, 237567304 edges, 346220 markings/sec, 320 secs
lola: 120267628 markings, 240912381 edges, 333867 markings/sec, 325 secs
lola: 122156004 markings, 244696223 edges, 377675 markings/sec, 330 secs
lola: 122496518 markings, 245378719 edges, 68103 markings/sec, 335 secs
lola: 122509652 markings, 245405136 edges, 2627 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA CircadianClock-PT-000100-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (((1 <= da) U ((1 <= a) AND (ma_cap <= mr)))) OR ((r_cap <= c) AND (((1 <= mr) OR (c <= c_cap)) AND A (G ((1 <= mr_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (r_cap <= c)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (r_cap <= c)
lola: processed formula length: 12
lola: 52 rewrites
lola: closed formula file CircadianClock-PT-000100-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: ========================================
lola: ========================================
lola: ...considering subproblem: E (((1 <= da) U ((1 <= a) AND (ma_cap <= mr))))
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 (((1 <= da) U ((1 <= a) AND (ma_cap <= mr))))
lola: processed formula length: 47
lola: 55 rewrites
lola: closed formula file CircadianClock-PT-000100-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: ((1 <= a) AND (ma_cap <= mr))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-000100-CTLCardinality-19-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 10202 markings, 15251 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CircadianClock-PT-000100-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: unknown no no yes yes yes no no yes no yes no unknown no no no
lola:
preliminary result: unknown no no yes yes yes no no yes no yes no unknown no no no
lola: memory consumption: 24744 KB
lola: time consumption: 1524 seconds

BK_STOP 1526615342514

--------------------
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="CircadianClock-PT-000100"
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/CircadianClock-PT-000100.tgz
mv CircadianClock-PT-000100 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 CircadianClock-PT-000100, 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 r028-ebro-152646306600493"
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 '' CTLCardinality.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 ;