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 172K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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 8.4K 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 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ClientsAndServers-PT-N0100P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357300150
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526551083100

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N0100P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N0100P0 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ClientsAndServers-PT-N0100P0 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: LP says that atomic proposition is always true: (3 <= Mi)
lola: LP says that atomic proposition is always true: (SR <= Mi)
lola: LP says that atomic proposition is always true: (2 <= Mi)
lola: A (F ((A (G ((3 <= Si))) AND A (F ((SpG <= CF)))))) : E (G (E (F (((3 <= MwU) AND (1 <= CG)))))) : (E (((1 <= SG) U (CwG <= SR))) AND E (F (E (G ((1 <= Cb)))))) : (E (F (E (G ((CR <= MtF))))) OR (SF + 1 <= CG)) : E (F ((A (F ((SA <= StR))) AND E (F ((2 <= MpA)))))) : E (G (((MwU <= CA) OR (1 <= StF)))) : E (F (((MpA + 1 <= MpG) AND (MpG + 1 <= Cb) AND (((3 <= SpG) AND (2 <= CwG)) OR (MpA <= 0))))) : A (G (A (F ((CwG <= 1))))) : A (X (A (G ((MtF <= 2))))) : (((3 <= Ci) AND E (F (((1 <= Uf) AND (Mi <= MtF))))) AND ((CA <= SR) OR E (G (TRUE)))) : E (F ((Ci + 1 <= MpG))) : ((3 <= Cb) OR E (G ((((StF <= SwA) OR (SR <= CR)) AND (SF <= StR))))) : E (X (NOT(E (G ((SR <= SpG)))))) : ((A (F (((1 <= CF) OR (Uf <= CR)))) AND (SG <= Si)) OR ()) : E (F ((((3 <= CG) AND (SR <= CG) AND ((2 <= MpA) OR (1 <= CA))) AND A (F ((SpA <= SA)))))) : NOT(NOT(A (G ((SF <= Ci)))))
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:123
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((MtF <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (3 <= MtF)
lola: processed formula length: 10
lola: 19 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-8 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: E (X (A (F ((SpG + 1 <= SR)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(A(TRUE U (SpG + 1 <= SR)))
lola: processed formula length: 29
lola: 19 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: 281000 markings, 420899 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-12 TRUE 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 (F ((Ci + 1 <= MpG)))
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 ((Ci + 1 <= MpG)))
lola: processed formula length: 23
lola: 18 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: (Ci + 1 <= MpG)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0100P0-CTLCardinality-2-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: 805 markings, 804 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((SF <= Ci)))
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 ((SF <= Ci)))
lola: processed formula length: 18
lola: 19 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: 812 markings, 811 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-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 (F (((MpA + 1 <= MpG) AND (MpG + 1 <= Cb) AND (((3 <= SpG) AND (2 <= CwG)) OR (MpA <= 0)))))
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 (((MpA + 1 <= MpG) AND (MpG + 1 <= Cb) AND (((3 <= SpG) AND (2 <= CwG)) OR (MpA <= 0)))))
lola: processed formula length: 95
lola: 18 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1218 markings, 1217 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-6 TRUE 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 (A (F ((CwG <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (2 <= CwG)
lola: processed formula length: 10
lola: 19 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 820 markings, 820 edges

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((MwU <= CA) OR (1 <= StF))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((MwU <= CA) OR (1 <= StF))))
lola: processed formula length: 36
lola: 17 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: 1201 markings, 1200 edges

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((SA <= StR))) AND E (F ((2 <= MpA))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (A(TRUE U (SA <= StR)) AND E(TRUE U (2 <= MpA))))
lola: processed formula length: 58
lola: 20 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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 3 significant temporal operators and needs 13 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: 562834 markings, 1254245 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-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: A (F ((A (G ((3 <= Si))) AND A (F ((SpG <= CF))))))
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:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (NOT(E(TRUE U (Si <= 2))) AND A(TRUE U (SpG <= CF))))
lola: processed formula length: 62
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5001 markings, 11787 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-0 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 ((((3 <= CG) AND (SR <= CG) AND ((2 <= MpA) OR (1 <= CA))) AND A (F ((SpA <= SA))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (((3 <= CG) AND (SR <= CG) AND ((2 <= MpA) OR (1 <= CA))) AND A(TRUE U (SpA <= SA))))
lola: processed formula length: 95
lola: 19 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: 161658 markings, 393443 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-14 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: ((3 <= Ci) AND E (F (((1 <= Uf) AND (Mi <= MtF)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Ci)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Ci)
lola: processed formula length: 9
lola: 17 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: processed formula with 1 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: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= Uf) AND (Mi <= MtF))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= Uf) AND (Mi <= MtF))))
lola: processed formula length: 35
lola: 18 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: ((1 <= Uf) AND (Mi <= MtF))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0100P0-CTLCardinality-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17251 markings, 20024 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((3 <= MwU) AND (1 <= CG))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: ((3 <= MwU) AND (1 <= CG))
lola: processed formula length: 26
lola: 18 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: 5016 markings, 5016 edges

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= CF) OR (Uf <= CR)))) AND (SG <= Si))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SG <= Si)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SG <= Si)
lola: processed formula length: 10
lola: 17 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: processed formula with 1 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: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= CF) OR (Uf <= CR))))
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: ((CF <= 0) AND (CR + 1 <= Uf))
lola: processed formula length: 30
lola: 19 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: 3857170 markings, 5693609 edges, 771434 markings/sec, 0 secs
lola: 7736543 markings, 11474473 edges, 775875 markings/sec, 5 secs
lola: 11520584 markings, 17121904 edges, 756808 markings/sec, 10 secs
lola: 15261870 markings, 22708811 edges, 748257 markings/sec, 15 secs
lola: 18908526 markings, 28158047 edges, 729331 markings/sec, 20 secs
lola: 22558724 markings, 33611584 edges, 730040 markings/sec, 25 secs
lola: 25956971 markings, 38693107 edges, 679649 markings/sec, 30 secs
lola: 29366024 markings, 43788921 edges, 681811 markings/sec, 35 secs
lola: 32687541 markings, 48755363 edges, 664303 markings/sec, 40 secs
lola: 35965160 markings, 53657052 edges, 655524 markings/sec, 45 secs
lola: 39217126 markings, 58520884 edges, 650393 markings/sec, 50 secs
lola: 42511578 markings, 63448815 edges, 658890 markings/sec, 55 secs
lola: 45766256 markings, 68317775 edges, 650936 markings/sec, 60 secs
lola: 48999111 markings, 73154545 edges, 646571 markings/sec, 65 secs
lola: 52209531 markings, 77958056 edges, 642084 markings/sec, 70 secs
lola: 55451284 markings, 82808816 edges, 648351 markings/sec, 75 secs
lola: 58653013 markings, 87600154 edges, 640346 markings/sec, 80 secs
lola: 61839611 markings, 92369286 edges, 637320 markings/sec, 85 secs
lola: 64986685 markings, 97079917 edges, 629415 markings/sec, 90 secs
lola: 68043307 markings, 101652198 edges, 611324 markings/sec, 95 secs
lola: 71306607 markings, 106536489 edges, 652660 markings/sec, 100 secs
lola: 74530480 markings, 111362288 edges, 644775 markings/sec, 105 secs
lola: 77721109 markings, 116138934 edges, 638126 markings/sec, 110 secs
lola: 80762596 markings, 120695223 edges, 608297 markings/sec, 115 secs
lola: 83932495 markings, 125434919 edges, 633980 markings/sec, 120 secs
lola: 87094648 markings, 130169286 edges, 632431 markings/sec, 125 secs
lola: 90188296 markings, 134802767 edges, 618730 markings/sec, 130 secs
lola: 93248097 markings, 139379771 edges, 611960 markings/sec, 135 secs
lola: 96369482 markings, 144053762 edges, 624277 markings/sec, 140 secs
lola: 99384715 markings, 148571177 edges, 603047 markings/sec, 145 secs
lola: 102481180 markings, 153202383 edges, 619293 markings/sec, 150 secs
lola: 105704041 markings, 158028974 edges, 644572 markings/sec, 155 secs
lola: 108819054 markings, 162690393 edges, 623003 markings/sec, 160 secs
lola: 112083262 markings, 167578608 edges, 652842 markings/sec, 165 secs
lola: 115259913 markings, 172336992 edges, 635330 markings/sec, 170 secs
lola: 118374256 markings, 176997023 edges, 622869 markings/sec, 175 secs
lola: 121577533 markings, 181794790 edges, 640655 markings/sec, 180 secs
lola: 124575080 markings, 186281038 edges, 599509 markings/sec, 185 secs
lola: 127819032 markings, 191139535 edges, 648790 markings/sec, 190 secs
lola: 130924338 markings, 195792584 edges, 621061 markings/sec, 195 secs
lola: 134036673 markings, 200449023 edges, 622467 markings/sec, 200 secs
lola: 137150956 markings, 205114963 edges, 622857 markings/sec, 205 secs
lola: 140185836 markings, 209656492 edges, 606976 markings/sec, 210 secs
lola: 143319121 markings, 214350736 edges, 626657 markings/sec, 215 secs
lola: 146293258 markings, 218801844 edges, 594827 markings/sec, 220 secs
lola: 149508752 markings, 223619079 edges, 643099 markings/sec, 225 secs
lola: 152580198 markings, 228216290 edges, 614289 markings/sec, 230 secs
lola: 155858354 markings, 233127222 edges, 655631 markings/sec, 235 secs
lola: 158910833 markings, 237696314 edges, 610496 markings/sec, 240 secs
lola: 162162213 markings, 242567320 edges, 650276 markings/sec, 245 secs
lola: 165194064 markings, 247105743 edges, 606370 markings/sec, 250 secs
lola: 168421601 markings, 251941197 edges, 645507 markings/sec, 255 secs
lola: 171421908 markings, 256432537 edges, 600061 markings/sec, 260 secs
lola: 174655827 markings, 261277695 edges, 646784 markings/sec, 265 secs
lola: 177669762 markings, 265789449 edges, 602787 markings/sec, 270 secs
lola: 180853580 markings, 270559853 edges, 636764 markings/sec, 275 secs
lola: 183806366 markings, 274979941 edges, 590557 markings/sec, 280 secs
lola: 186980910 markings, 279737021 edges, 634909 markings/sec, 285 secs
lola: 189968521 markings, 284209032 edges, 597522 markings/sec, 290 secs
lola: 193111656 markings, 288919635 edges, 628627 markings/sec, 295 secs
lola: 196095878 markings, 293386359 edges, 596844 markings/sec, 300 secs
lola: 199188030 markings, 298021482 edges, 618430 markings/sec, 305 secs
lola: 202256041 markings, 302612969 edges, 613602 markings/sec, 310 secs
lola: 205310180 markings, 307192754 edges, 610828 markings/sec, 315 secs
lola: 208428994 markings, 311858985 edges, 623763 markings/sec, 320 secs
lola: 211386459 markings, 316286779 edges, 591493 markings/sec, 325 secs
lola: 214547504 markings, 321023984 edges, 632209 markings/sec, 330 secs
lola: 217502569 markings, 325447837 edges, 591013 markings/sec, 335 secs
lola: 220607145 markings, 330101498 edges, 620915 markings/sec, 340 secs
lola: 223549453 markings, 334505446 edges, 588462 markings/sec, 345 secs
lola: 226510561 markings, 338946500 edges, 592222 markings/sec, 350 secs
lola: 229504874 markings, 343426674 edges, 598863 markings/sec, 355 secs
lola: 232346257 markings, 347680617 edges, 568277 markings/sec, 360 secs
lola: 235390352 markings, 352243768 edges, 608819 markings/sec, 365 secs
lola: 238268710 markings, 356552424 edges, 575672 markings/sec, 370 secs
lola: 241190108 markings, 360934214 edges, 584280 markings/sec, 375 secs
lola: 244131072 markings, 365334672 edges, 588193 markings/sec, 380 secs
lola: 246989013 markings, 369613545 edges, 571588 markings/sec, 385 secs
lola: 250025177 markings, 374165279 edges, 607233 markings/sec, 390 secs
lola: 252893720 markings, 378459160 edges, 573709 markings/sec, 395 secs
lola: 255750417 markings, 382736600 edges, 571339 markings/sec, 400 secs
lola: 258867371 markings, 387408541 edges, 623391 markings/sec, 405 secs
lola: 261833411 markings, 391849140 edges, 593208 markings/sec, 410 secs
lola: 264903725 markings, 396452899 edges, 614063 markings/sec, 415 secs
lola: 267866782 markings, 400887899 edges, 592611 markings/sec, 420 secs
lola: 270838165 markings, 405336997 edges, 594277 markings/sec, 425 secs
lola: 273940774 markings, 409988136 edges, 620522 markings/sec, 430 secs
lola: 276893135 markings, 414408040 edges, 590472 markings/sec, 435 secs
lola: 279889255 markings, 418902339 edges, 599224 markings/sec, 440 secs
lola: 282898903 markings, 423406015 edges, 601930 markings/sec, 445 secs
lola: 285791173 markings, 427736593 edges, 578454 markings/sec, 450 secs
lola: 288805828 markings, 432257273 edges, 602931 markings/sec, 455 secs
lola: 291763983 markings, 436685100 edges, 591631 markings/sec, 460 secs
lola: 294729830 markings, 441126101 edges, 593169 markings/sec, 465 secs
lola: 297757316 markings, 445665436 edges, 605497 markings/sec, 470 secs
lola: 300661541 markings, 450013168 edges, 580845 markings/sec, 475 secs
lola: 303552194 markings, 454341834 edges, 578131 markings/sec, 480 secs
lola: 306574681 markings, 458873327 edges, 604497 markings/sec, 485 secs
lola: 309475189 markings, 463215905 edges, 580102 markings/sec, 490 secs
lola: 312411080 markings, 467621212 edges, 587178 markings/sec, 495 secs
lola: 315402190 markings, 472096799 edges, 598222 markings/sec, 500 secs
lola: 318272553 markings, 476394410 edges, 574073 markings/sec, 505 secs
lola: 321236237 markings, 480840700 edges, 592737 markings/sec, 510 secs
lola: 324226497 markings, 485315707 edges, 598052 markings/sec, 515 secs
lola: 327158416 markings, 489705855 edges, 586384 markings/sec, 520 secs
lola: 330188774 markings, 494251270 edges, 606072 markings/sec, 525 secs
lola: 333143149 markings, 498673215 edges, 590875 markings/sec, 530 secs
lola: 336059307 markings, 503039762 edges, 583232 markings/sec, 535 secs
lola: 339074765 markings, 507562882 edges, 603092 markings/sec, 540 secs
lola: 342014565 markings, 511963222 edges, 587960 markings/sec, 545 secs
lola: 344927573 markings, 516325262 edges, 582602 markings/sec, 550 secs
lola: 347932078 markings, 520831913 edges, 600901 markings/sec, 555 secs
lola: 350835386 markings, 525177679 edges, 580662 markings/sec, 560 secs
lola: 353706830 markings, 529477479 edges, 574289 markings/sec, 565 secs
lola: 356702679 markings, 533971453 edges, 599170 markings/sec, 570 secs
lola: 359640002 markings, 538368217 edges, 587465 markings/sec, 575 secs
lola: 362550163 markings, 542725982 edges, 582032 markings/sec, 580 secs
lola: 365552390 markings, 547229763 edges, 600445 markings/sec, 585 secs
lola: 368464426 markings, 551588477 edges, 582407 markings/sec, 590 secs
lola: 371339433 markings, 555893629 edges, 575001 markings/sec, 595 secs
lola: 374302889 markings, 560339996 edges, 592691 markings/sec, 600 secs
lola: 377227393 markings, 564717105 edges, 584901 markings/sec, 605 secs
lola: 380100685 markings, 569019401 edges, 574658 markings/sec, 610 secs
lola: 383031098 markings, 573417472 edges, 586083 markings/sec, 615 secs
lola: 385961323 markings, 577802375 edges, 586045 markings/sec, 620 secs
lola: 388801478 markings, 582055040 edges, 568031 markings/sec, 625 secs
lola: 391642291 markings, 586309483 edges, 568163 markings/sec, 630 secs
lola: 394782657 markings, 591018865 edges, 628073 markings/sec, 635 secs
lola: 397792634 markings, 595525555 edges, 601995 markings/sec, 640 secs
lola: 400805416 markings, 600037527 edges, 602556 markings/sec, 645 secs
lola: 403960589 markings, 604769344 edges, 631035 markings/sec, 650 secs
lola: 406985242 markings, 609297990 edges, 604931 markings/sec, 655 secs
lola: 410013473 markings, 613833135 edges, 605646 markings/sec, 660 secs
lola: 413160485 markings, 618553017 edges, 629402 markings/sec, 665 secs
lola: 416169128 markings, 623057490 edges, 601729 markings/sec, 670 secs
lola: 419201153 markings, 627598344 edges, 606405 markings/sec, 675 secs
lola: 422319807 markings, 632276255 edges, 623731 markings/sec, 680 secs
lola: 425298545 markings, 636735709 edges, 595748 markings/sec, 685 secs
lola: 428266677 markings, 641180700 edges, 593626 markings/sec, 690 secs
lola: 429165817 markings, 642527300 edges, 179828 markings/sec, 695 secs
lola: 429199311 markings, 642577445 edges, 6699 markings/sec, 700 secs
lola: 429219152 markings, 642607206 edges, 3968 markings/sec, 705 secs
lola: 429234787 markings, 642630659 edges, 3127 markings/sec, 710 secs
lola: 429246423 markings, 642648113 edges, 2327 markings/sec, 715 secs
lola: 429269824 markings, 642683088 edges, 4680 markings/sec, 720 secs
lola: 429275305 markings, 642691308 edges, 1096 markings/sec, 725 secs
lola: 429305471 markings, 642736461 edges, 6033 markings/sec, 730 secs
lola: 429337711 markings, 642784820 edges, 6448 markings/sec, 735 secs
lola: 429359848 markings, 642818027 edges, 4427 markings/sec, 740 secs
lola: 429382929 markings, 642852483 edges, 4616 markings/sec, 745 secs
lola: 429390574 markings, 642863892 edges, 1529 markings/sec, 750 secs
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 13 will run for 936 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((CR <= MtF))))) OR (SF + 1 <= CG))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 936 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SF + 1 <= CG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SF + 1 <= CG)
lola: processed formula length: 14
lola: 17 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: subprocess 14 will run for 1405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((CR <= MtF)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (CR <= MtF)
lola: processed formula length: 11
lola: 18 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG 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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 32 markings, 33 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= Cb) OR E (G ((((StF <= SwA) OR (SR <= CR)) AND (SF <= StR)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Cb)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Cb)
lola: processed formula length: 9
lola: 17 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: subprocess 15 will run for 2810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((StF <= SwA) OR (SR <= CR)) AND (SF <= StR))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((StF <= SwA) OR (SR <= CR)) AND (SF <= StR))))
lola: processed formula length: 55
lola: 17 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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 is possibly preserved.
lola: 5001 markings, 5000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((1 <= SG) U (CwG <= SR))) AND E (F (E (G ((1 <= Cb))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= SG) U (CwG <= SR)))
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 <= SG) U (CwG <= SR)))
lola: processed formula length: 29
lola: 20 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: formula 0: (CwG <= SR)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: (A (F (((1 <= CF) OR (Uf <= CR)))) AND (SG <= Si))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (SG <= Si)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SG <= Si)
lola: processed formula length: 10
lola: 17 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: processed formula with 1 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 (((1 <= CF) OR (Uf <= CR))))
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: ((CF <= 0) AND (CR + 1 <= Uf))
lola: processed formula length: 30
lola: 19 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: 3946054 markings, 5825853 edges, 789211 markings/sec, 0 secs
lola: 7724450 markings, 11456427 edges, 755679 markings/sec, 5 secs
lola: 11366724 markings, 16892580 edges, 728455 markings/sec, 10 secs
lola: 14978643 markings, 22286245 edges, 722384 markings/sec, 15 secs
lola: 18507261 markings, 27556579 edges, 705724 markings/sec, 20 secs
lola: 22026643 markings, 32816593 edges, 703876 markings/sec, 25 secs
lola: 25362537 markings, 37802601 edges, 667179 markings/sec, 30 secs
lola: 28755102 markings, 42876152 edges, 678513 markings/sec, 35 secs
lola: 32120063 markings, 47907081 edges, 672992 markings/sec, 40 secs
lola: 35370566 markings, 52768046 edges, 650101 markings/sec, 45 secs
lola: 38539983 markings, 57508334 edges, 633883 markings/sec, 50 secs
lola: 41748502 markings, 62307721 edges, 641704 markings/sec, 55 secs
lola: 45011212 markings, 67188529 edges, 652542 markings/sec, 60 secs
lola: 48248214 markings, 72031416 edges, 647400 markings/sec, 65 secs
lola: 51457036 markings, 76832544 edges, 641764 markings/sec, 70 secs
lola: 54690348 markings, 81670765 edges, 646662 markings/sec, 75 secs
lola: 57911038 markings, 86490456 edges, 644138 markings/sec, 80 secs
lola: 61068638 markings, 91216545 edges, 631520 markings/sec, 85 secs
lola: 64165749 markings, 95851888 edges, 619422 markings/sec, 90 secs
lola: 67351180 markings, 100616569 edges, 637086 markings/sec, 95 secs
lola: 70586435 markings, 105459013 edges, 647051 markings/sec, 100 secs
lola: 73829876 markings, 110314245 edges, 648688 markings/sec, 105 secs
lola: 76990291 markings, 115046260 edges, 632083 markings/sec, 110 secs
lola: 80095320 markings, 119690907 edges, 621006 markings/sec, 115 secs
lola: 83270552 markings, 124444418 edges, 635046 markings/sec, 120 secs
lola: 86429213 markings, 129173998 edges, 631732 markings/sec, 125 secs
lola: 89484729 markings, 133745657 edges, 611103 markings/sec, 130 secs
lola: 92617433 markings, 138436009 edges, 626541 markings/sec, 135 secs
lola: 95740479 markings, 143112836 edges, 624609 markings/sec, 140 secs
lola: 98744143 markings, 147607181 edges, 600733 markings/sec, 145 secs
lola: 101866638 markings, 152282780 edges, 624499 markings/sec, 150 secs
lola: 104952232 markings, 156904599 edges, 617119 markings/sec, 155 secs
lola: 108035769 markings, 161518094 edges, 616707 markings/sec, 160 secs
lola: 111194825 markings, 166249150 edges, 631811 markings/sec, 165 secs
lola: 114190081 markings, 170731901 edges, 599051 markings/sec, 170 secs
lola: 117313882 markings, 175409994 edges, 624760 markings/sec, 175 secs
lola: 120396677 markings, 180028365 edges, 616559 markings/sec, 180 secs
lola: 123393579 markings, 184512560 edges, 599380 markings/sec, 185 secs
lola: 126497505 markings, 189162063 edges, 620785 markings/sec, 190 secs
lola: 129490916 markings, 193641794 edges, 598682 markings/sec, 195 secs
lola: 132597329 markings, 198294976 edges, 621283 markings/sec, 200 secs
lola: 135537483 markings, 202695656 edges, 588031 markings/sec, 205 secs
lola: 138616515 markings, 207307709 edges, 615806 markings/sec, 210 secs
lola: 141538951 markings, 211682077 edges, 584487 markings/sec, 215 secs
lola: 144592462 markings, 216256149 edges, 610702 markings/sec, 220 secs
lola: 147498586 markings, 220613920 edges, 581225 markings/sec, 225 secs
lola: 150670005 markings, 225356882 edges, 634284 markings/sec, 230 secs
lola: 153759508 markings, 229987926 edges, 617901 markings/sec, 235 secs
lola: 156858780 markings, 234624513 edges, 619854 markings/sec, 240 secs
lola: 159953959 markings, 239263883 edges, 619036 markings/sec, 245 secs
lola: 163017148 markings, 243846900 edges, 612638 markings/sec, 250 secs
lola: 166080034 markings, 248438262 edges, 612577 markings/sec, 255 secs
lola: 169122925 markings, 252990864 edges, 608578 markings/sec, 260 secs
lola: 172142498 markings, 257518209 edges, 603915 markings/sec, 265 secs
lola: 175227486 markings, 262133240 edges, 616998 markings/sec, 270 secs
lola: 178216562 markings, 266608058 edges, 597815 markings/sec, 275 secs
lola: 181284157 markings, 271204241 edges, 613519 markings/sec, 280 secs
lola: 184210964 markings, 275585787 edges, 585361 markings/sec, 285 secs
lola: 187289344 markings, 280198586 edges, 615676 markings/sec, 290 secs
lola: 190241423 markings, 284617696 edges, 590416 markings/sec, 295 secs
lola: 193298907 markings, 289199821 edges, 611497 markings/sec, 300 secs
lola: 196240838 markings, 293603293 edges, 588386 markings/sec, 305 secs
lola: 199294068 markings, 298180068 edges, 610646 markings/sec, 310 secs
lola: 202299080 markings, 302677363 edges, 601002 markings/sec, 315 secs
lola: 205326911 markings, 307217736 edges, 605566 markings/sec, 320 secs
lola: 208357578 markings, 311752178 edges, 606133 markings/sec, 325 secs
lola: 211289622 markings, 316141801 edges, 586409 markings/sec, 330 secs
lola: 214357931 markings, 320740288 edges, 613662 markings/sec, 335 secs
lola: 217291090 markings, 325131150 edges, 586632 markings/sec, 340 secs
lola: 220316534 markings, 329666693 edges, 605089 markings/sec, 345 secs
lola: 223222935 markings, 334016686 edges, 581280 markings/sec, 350 secs
lola: 226112906 markings, 338352917 edges, 577994 markings/sec, 355 secs
lola: 229196263 markings, 342964716 edges, 616671 markings/sec, 360 secs
lola: 232120847 markings, 347343054 edges, 584917 markings/sec, 365 secs
lola: 235167560 markings, 351910366 edges, 609343 markings/sec, 370 secs
lola: 238074207 markings, 356261193 edges, 581329 markings/sec, 375 secs
lola: 241010075 markings, 360665250 edges, 587174 markings/sec, 380 secs
lola: 244014194 markings, 365159679 edges, 600824 markings/sec, 385 secs
lola: 246904415 markings, 369486834 edges, 578044 markings/sec, 390 secs
lola: 249914047 markings, 373999025 edges, 601926 markings/sec, 395 secs
lola: 252788407 markings, 378301367 edges, 574872 markings/sec, 400 secs
lola: 255652405 markings, 382589778 edges, 572800 markings/sec, 405 secs
lola: 258769552 markings, 387262137 edges, 623429 markings/sec, 410 secs
lola: 261738087 markings, 391706436 edges, 593707 markings/sec, 415 secs
lola: 264813448 markings, 396317915 edges, 615072 markings/sec, 420 secs
lola: 267800944 markings, 400789316 edges, 597499 markings/sec, 425 secs
lola: 270770933 markings, 405236346 edges, 593998 markings/sec, 430 secs
lola: 273859702 markings, 409866848 edges, 617754 markings/sec, 435 secs
lola: 276816859 markings, 414293812 edges, 591431 markings/sec, 440 secs
lola: 279819492 markings, 418798058 edges, 600527 markings/sec, 445 secs
lola: 282827258 markings, 423298785 edges, 601553 markings/sec, 450 secs
lola: 285750602 markings, 427675737 edges, 584669 markings/sec, 455 secs
lola: 288809527 markings, 432262821 edges, 611785 markings/sec, 460 secs
lola: 291778316 markings, 436706600 edges, 593758 markings/sec, 465 secs
lola: 294753213 markings, 441161176 edges, 594979 markings/sec, 470 secs
lola: 297819511 markings, 445758567 edges, 613260 markings/sec, 475 secs
lola: 300727411 markings, 450111893 edges, 581580 markings/sec, 480 secs
lola: 303626631 markings, 454458743 edges, 579844 markings/sec, 485 secs
lola: 306702321 markings, 459064449 edges, 615138 markings/sec, 490 secs
lola: 309622189 markings, 463436024 edges, 583974 markings/sec, 495 secs
lola: 312605287 markings, 467911518 edges, 596620 markings/sec, 500 secs
lola: 315573274 markings, 472352901 edges, 593597 markings/sec, 505 secs
lola: 318459057 markings, 476673775 edges, 577157 markings/sec, 510 secs
lola: 321462623 markings, 481179283 edges, 600713 markings/sec, 515 secs
lola: 324453875 markings, 485656237 edges, 598250 markings/sec, 520 secs
lola: 327405199 markings, 490075432 edges, 590265 markings/sec, 525 secs
lola: 330451690 markings, 494644670 edges, 609298 markings/sec, 530 secs
lola: 333396938 markings, 499053165 edges, 589050 markings/sec, 535 secs
lola: 336316095 markings, 503424334 edges, 583831 markings/sec, 540 secs
lola: 339356959 markings, 507985106 edges, 608173 markings/sec, 545 secs
lola: 342278285 markings, 512358148 edges, 584265 markings/sec, 550 secs
lola: 345202151 markings, 516736400 edges, 584773 markings/sec, 555 secs
lola: 348228692 markings, 521275701 edges, 605308 markings/sec, 560 secs
lola: 351113735 markings, 525594451 edges, 577009 markings/sec, 565 secs
lola: 353991610 markings, 529903938 edges, 575575 markings/sec, 570 secs
lola: 357008598 markings, 534429232 edges, 603398 markings/sec, 575 secs
lola: 359919693 markings, 538786999 edges, 582219 markings/sec, 580 secs
lola: 362824154 markings, 543136233 edges, 580892 markings/sec, 585 secs
lola: 365838354 markings, 547657618 edges, 602840 markings/sec, 590 secs
lola: 368727628 markings, 551982644 edges, 577855 markings/sec, 595 secs
lola: 371597637 markings, 556280315 edges, 574002 markings/sec, 600 secs
lola: 374574956 markings, 560747012 edges, 595464 markings/sec, 605 secs
lola: 377483485 markings, 565100495 edges, 581706 markings/sec, 610 secs
lola: 380352874 markings, 569397064 edges, 573878 markings/sec, 615 secs
lola: 383293363 markings, 573809624 edges, 588098 markings/sec, 620 secs
lola: 386202099 markings, 578162797 edges, 581747 markings/sec, 625 secs
lola: 389036035 markings, 582406262 edges, 566787 markings/sec, 630 secs
lola: 391899671 markings, 586705787 edges, 572727 markings/sec, 635 secs
lola: 395024731 markings, 591381248 edges, 625012 markings/sec, 640 secs
lola: 398026628 markings, 595875934 edges, 600379 markings/sec, 645 secs
lola: 401036855 markings, 600384245 edges, 602045 markings/sec, 650 secs
lola: 404203786 markings, 605133411 edges, 633386 markings/sec, 655 secs
lola: 407232544 markings, 609668329 edges, 605752 markings/sec, 660 secs
lola: 410266481 markings, 614211984 edges, 606787 markings/sec, 665 secs
lola: 413415120 markings, 618934186 edges, 629728 markings/sec, 670 secs
lola: 416434929 markings, 623455580 edges, 603962 markings/sec, 675 secs
lola: 419470760 markings, 628002093 edges, 607166 markings/sec, 680 secs
lola: 422585419 markings, 632673830 edges, 622932 markings/sec, 685 secs
lola: 425558351 markings, 637124737 edges, 594586 markings/sec, 690 secs
lola: 428377581 markings, 641346839 edges, 563846 markings/sec, 695 secs
lola: 429197779 markings, 642575145 edges, 164040 markings/sec, 700 secs
lola: 429255860 markings, 642662268 edges, 11616 markings/sec, 705 secs
lola: 429282622 markings, 642702328 edges, 5352 markings/sec, 710 secs
lola: 429286838 markings, 642708509 edges, 843 markings/sec, 715 secs
lola: 429299612 markings, 642727671 edges, 2555 markings/sec, 720 secs
lola: 429327711 markings, 642769820 edges, 5620 markings/sec, 725 secs
lola: 429342960 markings, 642792694 edges, 3050 markings/sec, 730 secs
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: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (((1 <= SG) U (CwG <= SR))) AND E (F (E (G ((1 <= Cb))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (((1 <= SG) U (CwG <= SR)))
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 <= SG) U (CwG <= SR)))
lola: processed formula length: 29
lola: 20 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: formula 0: (CwG <= SR)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= Cb)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (1 <= Cb)
lola: processed formula length: 9
lola: 18 rewrites
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG 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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 825 markings, 825 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes no no yes yes yes yes unknown yes no
lola:
preliminary result: no yes yes yes yes no yes no no yes yes yes yes unknown yes no
lola: memory consumption: 21328 KB
lola: time consumption: 1498 seconds

BK_STOP 1526552581718

--------------------
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="ClientsAndServers-PT-N0100P0"
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/ClientsAndServers-PT-N0100P0.tgz
mv ClientsAndServers-PT-N0100P0 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 ClientsAndServers-PT-N0100P0, 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 r040-smll-152646357300150"
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 ;