About the Execution of LoLA for ClientsAndServers-PT-N0020P0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.480 | 937509.00 | 891974.00 | 8168.50 | TF?FFTTTFFFTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.....................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.4K 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.6K 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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.4K 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.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.1K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ClientsAndServers-PT-N0020P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357200108
=====================================================================
--------------------
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-N0020P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0020P0-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526521497612
info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N0020P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N0020P0 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ClientsAndServers-PT-N0020P0 @ 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-N0020P0-CTLCardinality.task
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (MpA <= CwA)
lola: A (X ((A (G (TRUE)) OR (2 <= MpG)))) : E ((E (G ((SwG <= SF))) U ((CwG + 1 <= SF) AND (CF <= 2)))) : NOT(A (G (E (F ((3 <= SpG)))))) : A (F ((E (G (TRUE)) AND ((CA + 1 <= MtF) AND (SF <= 2))))) : (A (F ((1 <= SpG))) AND A (X (E (G ((CwG <= CR)))))) : A (G (())) : (E (X ((3 <= MtF))) OR E (F (A (X ((2 <= SpA)))))) : E (((SA <= SwG) U ((SpG <= 2) AND (Si + 1 <= SA)))) : NOT(NOT(E (((SG <= SF) U (3 <= MtF))))) : A (F ((((CG + 1 <= Ci) AND (MwU + 1 <= SF)) OR (1 <= SwA)))) : ((A (G (((SA <= StR) OR (2 <= Uf)))) AND (((MtF <= Uf) OR (CwG <= StR) OR (MtF <= CwG) OR (3 <= MwU)) AND (SwA <= CF))) OR A (((Si <= SF) U ((1 <= SA) OR (3 <= MpA))))) : A (((2 <= StR) U E (F ((3 <= MpA))))) : (A (F (((MpG + 1 <= SG) AND (SF <= 0)))) OR (2 <= SwG)) : E (X ((E (G ((CF <= CwG))) AND E (X ((CF <= MpA)))))) : (E (X (E (F ((2 <= CA))))) OR NOT((A (X ((1 <= Cb))) OR A (X ((SR <= StR)))))) : E (G ((SpA <= CF)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:136
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 33 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-0 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 33 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 ClientsAndServers-PT-N0020P0-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= SpG))) AND A (X (E (G ((CwG <= CR))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= SpG)))
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: (SpG <= 0)
lola: processed formula length: 10
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 3325 markings, 4065 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((CwG <= CR)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (CR + 1 <= CwG))))
lola: processed formula length: 34
lola: 36 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 320 markings, 319 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-4 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: (E (X ((3 <= MtF))) OR E (F (A (X ((2 <= SpA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= MtF)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((3 <= MtF))
lola: processed formula length: 14
lola: 34 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((2 <= SpA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((2 <= SpA)))
lola: processed formula length: 24
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: 1001 markings, 1000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-6 TRUE 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 (X ((E (G ((CF <= CwG))) AND E (X ((CF <= MpA))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX((NOT(A(TRUE U (CwG + 1 <= CF))) AND EX((CF <= MpA))))
lola: processed formula length: 56
lola: 37 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: 1000 markings, 999 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-13 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: (E (X (E (F ((2 <= CA))))) OR (E (X ((Cb <= 0))) AND E (X ((StR + 1 <= SR)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((Cb <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((Cb <= 0))
lola: processed formula length: 13
lola: 34 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((StR + 1 <= SR)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((StR + 1 <= SR))
lola: processed formula length: 19
lola: 34 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= CA)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (2 <= CA)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 34 markings, 33 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= MpA)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((3 <= MpA)))
lola: processed formula length: 18
lola: 34 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: 43 markings, 42 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((SpG <= 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 <= SpG)
lola: processed formula length: 10
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: 3453175 markings, 4630937 edges, 690635 markings/sec, 0 secs
lola: 6876828 markings, 9375200 edges, 684731 markings/sec, 5 secs
lola: 10132094 markings, 13933471 edges, 651053 markings/sec, 10 secs
lola: 12846686 markings, 17751307 edges, 542918 markings/sec, 15 secs
lola: 15601168 markings, 21635620 edges, 550896 markings/sec, 20 secs
lola: 18382382 markings, 25571140 edges, 556243 markings/sec, 25 secs
lola: 20884152 markings, 29118189 edges, 500354 markings/sec, 30 secs
lola: 23374578 markings, 32650980 edges, 498085 markings/sec, 35 secs
lola: 26149577 markings, 36603813 edges, 555000 markings/sec, 40 secs
lola: 28899767 markings, 40515608 edges, 550038 markings/sec, 45 secs
lola: 31319426 markings, 43967521 edges, 483932 markings/sec, 50 secs
lola: 33815667 markings, 47542392 edges, 499248 markings/sec, 55 secs
lola: 36307363 markings, 51108976 edges, 498339 markings/sec, 60 secs
lola: 38802399 markings, 54666391 edges, 499007 markings/sec, 65 secs
lola: 41256210 markings, 58208180 edges, 490762 markings/sec, 70 secs
lola: 43707321 markings, 61741547 edges, 490222 markings/sec, 75 secs
lola: 46149773 markings, 65254533 edges, 488490 markings/sec, 80 secs
lola: 48601210 markings, 68783612 edges, 490287 markings/sec, 85 secs
lola: 51031702 markings, 72285520 edges, 486098 markings/sec, 90 secs
lola: 53455343 markings, 75780653 edges, 484728 markings/sec, 95 secs
lola: 55885808 markings, 79285277 edges, 486093 markings/sec, 100 secs
lola: 58299047 markings, 82767829 edges, 482648 markings/sec, 105 secs
lola: 60717341 markings, 86249347 edges, 483659 markings/sec, 110 secs
lola: 63104546 markings, 89705008 edges, 477441 markings/sec, 115 secs
lola: 65482870 markings, 93149599 edges, 475665 markings/sec, 120 secs
lola: 67870537 markings, 96598310 edges, 477533 markings/sec, 125 secs
lola: 70255960 markings, 100050288 edges, 477085 markings/sec, 130 secs
lola: 72610000 markings, 103469420 edges, 470808 markings/sec, 135 secs
lola: 74990900 markings, 106911229 edges, 476180 markings/sec, 140 secs
lola: 77351353 markings, 110327859 edges, 472091 markings/sec, 145 secs
lola: 79632194 markings, 113632952 edges, 456168 markings/sec, 150 secs
lola: 81981802 markings, 117053429 edges, 469922 markings/sec, 155 secs
lola: 84390657 markings, 120550039 edges, 481771 markings/sec, 160 secs
lola: 86794269 markings, 124036414 edges, 480722 markings/sec, 165 secs
lola: 89194020 markings, 127514394 edges, 479950 markings/sec, 170 secs
lola: 91459055 markings, 130801575 edges, 453007 markings/sec, 175 secs
lola: 93820576 markings, 134225710 edges, 472304 markings/sec, 180 secs
lola: 96193386 markings, 137657247 edges, 474562 markings/sec, 185 secs
lola: 98532019 markings, 141060131 edges, 467727 markings/sec, 190 secs
lola: 100884349 markings, 144463084 edges, 470466 markings/sec, 195 secs
lola: 103231110 markings, 147870483 edges, 469352 markings/sec, 200 secs
lola: 105559515 markings, 151265523 edges, 465681 markings/sec, 205 secs
lola: 107897208 markings, 154652527 edges, 467539 markings/sec, 210 secs
lola: 110225774 markings, 158039259 edges, 465713 markings/sec, 215 secs
lola: 112548737 markings, 161422221 edges, 464593 markings/sec, 220 secs
lola: 114860907 markings, 164783227 edges, 462434 markings/sec, 225 secs
lola: 117166851 markings, 168144632 edges, 461189 markings/sec, 230 secs
lola: 119476068 markings, 171503306 edges, 461843 markings/sec, 235 secs
lola: 121787657 markings, 174861580 edges, 462318 markings/sec, 240 secs
lola: 124081676 markings, 178213548 edges, 458804 markings/sec, 245 secs
lola: 126363665 markings, 181542616 edges, 456398 markings/sec, 250 secs
lola: 128678535 markings, 184905617 edges, 462974 markings/sec, 255 secs
lola: 130959704 markings, 188229304 edges, 456234 markings/sec, 260 secs
lola: 133173519 markings, 191454837 edges, 442763 markings/sec, 265 secs
lola: 135465966 markings, 194785313 edges, 458489 markings/sec, 270 secs
lola: 137746811 markings, 198107966 edges, 456169 markings/sec, 275 secs
lola: 140027537 markings, 201431461 edges, 456145 markings/sec, 280 secs
lola: 142298749 markings, 204744705 edges, 454242 markings/sec, 285 secs
lola: 144560332 markings, 208046959 edges, 452317 markings/sec, 290 secs
lola: 146838909 markings, 211357941 edges, 455715 markings/sec, 295 secs
lola: 149116441 markings, 214668328 edges, 455506 markings/sec, 300 secs
lola: 151386631 markings, 217971785 edges, 454038 markings/sec, 305 secs
lola: 153638803 markings, 221268697 edges, 450434 markings/sec, 310 secs
lola: 155901363 markings, 224558558 edges, 452512 markings/sec, 315 secs
lola: 158163746 markings, 227849028 edges, 452477 markings/sec, 320 secs
lola: 160424006 markings, 231138845 edges, 452052 markings/sec, 325 secs
lola: 162683217 markings, 234430148 edges, 451842 markings/sec, 330 secs
lola: 164945987 markings, 237724785 edges, 452554 markings/sec, 335 secs
lola: 167205047 markings, 241012206 edges, 451812 markings/sec, 340 secs
lola: 169462792 markings, 244291781 edges, 451549 markings/sec, 345 secs
lola: 171711588 markings, 247566111 edges, 449759 markings/sec, 350 secs
lola: 173960474 markings, 250841193 edges, 449777 markings/sec, 355 secs
lola: 176208834 markings, 254110186 edges, 449672 markings/sec, 360 secs
lola: 178438368 markings, 257368045 edges, 445907 markings/sec, 365 secs
lola: 180678464 markings, 260638325 edges, 448019 markings/sec, 370 secs
lola: 182854380 markings, 263818974 edges, 435183 markings/sec, 375 secs
lola: 183817341 markings, 265228679 edges, 192592 markings/sec, 380 secs
lola: 183831386 markings, 265249923 edges, 2809 markings/sec, 385 secs
lola: 183860318 markings, 265292488 edges, 5786 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown no yes yes unknown unknown unknown unknown yes unknown yes yes unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((SpA <= CF)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((SpA <= CF)))
lola: processed formula length: 19
lola: 33 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: 1001 markings, 1000 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((CA + 1 <= MtF) AND (SF <= 2))))
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: ((MtF <= CA) OR (3 <= SF))
lola: processed formula length: 27
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 does not eventually occur.
lola: 2726 markings, 2726 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((CG + 1 <= Ci) AND (MwU + 1 <= SF)) OR (1 <= SwA))))
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: (((Ci <= CG) OR (SF <= MwU)) AND (SwA <= 0))
lola: processed formula length: 45
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: 3592686 markings, 5145954 edges, 718537 markings/sec, 0 secs
lola: 6961185 markings, 10007582 edges, 673700 markings/sec, 5 secs
lola: 10380161 markings, 14951494 edges, 683795 markings/sec, 10 secs
lola: 13710507 markings, 19765359 edges, 666069 markings/sec, 15 secs
lola: 16972792 markings, 24499875 edges, 652457 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18222611 markings, 26314460 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((SwG <= SF))) U ((CwG + 1 <= SF) AND (CF <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(NOT(A(TRUE U (SF + 1 <= SwG))) U ((CwG + 1 <= SF) AND (CF <= 2)))
lola: processed formula length: 67
lola: 36 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11401 markings, 16981 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((SG <= SF) U (3 <= MtF)))
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 (((SG <= SF) U (3 <= MtF)))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 <= MtF)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0020P0-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N0020P0-CTLCardinality-12-0.sara.
lola: state equation 0: solution produced
lola: sara is running 0 secs || 1237186 markings, 5595586 edges, 247437 markings/sec, 0 secs
lola: sara is running 5 secs || 2497689 markings, 11438751 edges, 252101 markings/sec, 5 secs
lola: sara is running 10 secs || 3751534 markings, 17253489 edges, 250769 markings/sec, 10 secs
lola: sara is running 15 secs || 5019588 markings, 23136561 edges, 253611 markings/sec, 15 secs
lola: sara is running 20 secs || 6290969 markings, 29026066 edges, 254276 markings/sec, 20 secs
lola: sara is running 25 secs || 7574945 markings, 34982094 edges, 256795 markings/sec, 25 secs
lola: sara is running 30 secs || 8859283 markings, 40934012 edges, 256868 markings/sec, 30 secs
lola: sara is running 35 secs || 10144789 markings, 46896431 edges, 257101 markings/sec, 35 secs
lola: sara is running 40 secs || 11450753 markings, 52948558 edges, 261193 markings/sec, 40 secs
lola: sara is running 45 secs || 12763534 markings, 59038559 edges, 262556 markings/sec, 45 secs
lola: sara is running 50 secs || 14087491 markings, 65176154 edges, 264791 markings/sec, 50 secs
lola: sara is running 55 secs || 15425613 markings, 71379001 edges, 267624 markings/sec, 55 secs
lola: sara is running 60 secs || 16814531 markings, 77812023 edges, 277784 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 17511879 markings, 80956960 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1026 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((MpG + 1 <= SG) AND (SF <= 0)))) OR (2 <= SwG))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1026 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= SwG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SwG)
lola: processed formula length: 10
lola: 33 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 1539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((MpG + 1 <= SG) AND (SF <= 0))))
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: ((SG <= MpG) OR (1 <= SF))
lola: processed formula length: 27
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 does not eventually occur.
lola: 607 markings, 607 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((SA <= SwG) U ((SpG <= 2) AND (Si + 1 <= SA))))
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 (((SA <= SwG) U ((SpG <= 2) AND (Si + 1 <= SA))))
lola: processed formula length: 51
lola: 36 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: ((SpG <= 2) AND (Si + 1 <= SA))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0020P0-CTLCardinality-14-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: 1005 markings, 1004 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (((SA <= StR) OR (2 <= Uf)))) AND (((MtF <= Uf) OR (CwG <= StR) OR (MtF <= CwG) OR (3 <= MwU)) AND (SwA <= CF))) OR A (((Si <= SF) U ((1 <= SA) OR (3 <= MpA)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((SA <= StR) OR (2 <= Uf))))
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 (((SA <= StR) OR (2 <= Uf))))
lola: processed formula length: 35
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: ((StR + 1 <= SA) AND (Uf <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0020P0-CTLCardinality-15-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: 778 markings, 780 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 ((SpG <= 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 <= SpG)
lola: processed formula length: 10
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: 3587314 markings, 4814269 edges, 717463 markings/sec, 0 secs
lola: 6964269 markings, 9495749 edges, 675391 markings/sec, 5 secs
lola: 10184169 markings, 14005466 edges, 643980 markings/sec, 10 secs
lola: 13320996 markings, 18421737 edges, 627365 markings/sec, 15 secs
lola: 16009416 markings, 22213814 edges, 537684 markings/sec, 20 secs
lola: 18790642 markings, 26149361 edges, 556245 markings/sec, 25 secs
lola: 21532070 markings, 30039287 edges, 548286 markings/sec, 30 secs
lola: 24249671 markings, 33894402 edges, 543520 markings/sec, 35 secs
lola: 26925274 markings, 37701595 edges, 535121 markings/sec, 40 secs
lola: 29574990 markings, 41477184 edges, 529943 markings/sec, 45 secs
lola: 32201045 markings, 45220033 edges, 525211 markings/sec, 50 secs
lola: 34776794 markings, 48920776 edges, 515150 markings/sec, 55 secs
lola: 37377978 markings, 52636379 edges, 520237 markings/sec, 60 secs
lola: 39955932 markings, 56327770 edges, 515591 markings/sec, 65 secs
lola: 42500944 markings, 60005043 edges, 509002 markings/sec, 70 secs
lola: 45040424 markings, 63660269 edges, 507896 markings/sec, 75 secs
lola: 47587759 markings, 67319131 edges, 509467 markings/sec, 80 secs
lola: 50119483 markings, 70966239 edges, 506345 markings/sec, 85 secs
lola: 52647609 markings, 74613767 edges, 505625 markings/sec, 90 secs
lola: 55158155 markings, 78237372 edges, 502109 markings/sec, 95 secs
lola: 57677215 markings, 81867516 edges, 503812 markings/sec, 100 secs
lola: 60181456 markings, 85477256 edges, 500848 markings/sec, 105 secs
lola: 62672558 markings, 89077904 edges, 498220 markings/sec, 110 secs
lola: 65145365 markings, 92658759 edges, 494561 markings/sec, 115 secs
lola: 67619914 markings, 96237281 edges, 494910 markings/sec, 120 secs
lola: 70099771 markings, 99822584 edges, 495971 markings/sec, 125 secs
lola: 72545187 markings, 103376790 edges, 489083 markings/sec, 130 secs
lola: 75015627 markings, 106947183 edges, 494088 markings/sec, 135 secs
lola: 77468440 markings, 110495923 edges, 490563 markings/sec, 140 secs
lola: 79921671 markings, 114054009 edges, 490646 markings/sec, 145 secs
lola: 82350312 markings, 117586486 edges, 485728 markings/sec, 150 secs
lola: 84790437 markings, 121127163 edges, 488025 markings/sec, 155 secs
lola: 87216448 markings, 124650153 edges, 485202 markings/sec, 160 secs
lola: 89640550 markings, 128159986 edges, 484820 markings/sec, 165 secs
lola: 92056281 markings, 131668819 edges, 483146 markings/sec, 170 secs
lola: 94469005 markings, 135166231 edges, 482545 markings/sec, 175 secs
lola: 96891987 markings, 138673830 edges, 484596 markings/sec, 180 secs
lola: 99277520 markings, 142142338 edges, 477107 markings/sec, 185 secs
lola: 101671441 markings, 145609084 edges, 478784 markings/sec, 190 secs
lola: 104048079 markings, 149062288 edges, 475328 markings/sec, 195 secs
lola: 106413216 markings, 152499504 edges, 473027 markings/sec, 200 secs
lola: 108776952 markings, 155929778 edges, 472747 markings/sec, 205 secs
lola: 111135295 markings, 159364014 edges, 471669 markings/sec, 210 secs
lola: 113481592 markings, 162771177 edges, 469259 markings/sec, 215 secs
lola: 115801605 markings, 166154363 edges, 464003 markings/sec, 220 secs
lola: 118124812 markings, 169542148 edges, 464641 markings/sec, 225 secs
lola: 120445588 markings, 172916622 edges, 464155 markings/sec, 230 secs
lola: 122760944 markings, 176291574 edges, 463071 markings/sec, 235 secs
lola: 125062793 markings, 179640193 edges, 460370 markings/sec, 240 secs
lola: 127360958 markings, 182995107 edges, 459633 markings/sec, 245 secs
lola: 129662084 markings, 186343223 edges, 460225 markings/sec, 250 secs
lola: 131948542 markings, 189672673 edges, 457292 markings/sec, 255 secs
lola: 134242790 markings, 193009072 edges, 458850 markings/sec, 260 secs
lola: 136528480 markings, 196334857 edges, 457138 markings/sec, 265 secs
lola: 138807562 markings, 199651280 edges, 455816 markings/sec, 270 secs
lola: 141067391 markings, 202949025 edges, 451966 markings/sec, 275 secs
lola: 143320541 markings, 206237663 edges, 450630 markings/sec, 280 secs
lola: 145581190 markings, 209530926 edges, 452130 markings/sec, 285 secs
lola: 147841951 markings, 212818490 edges, 452152 markings/sec, 290 secs
lola: 150096467 markings, 216101516 edges, 450903 markings/sec, 295 secs
lola: 152345449 markings, 219373371 edges, 449796 markings/sec, 300 secs
lola: 154574665 markings, 222629816 edges, 445843 markings/sec, 305 secs
lola: 156819358 markings, 225891438 edges, 448939 markings/sec, 310 secs
lola: 159051320 markings, 229143635 edges, 446392 markings/sec, 315 secs
lola: 161280229 markings, 232387766 edges, 445782 markings/sec, 320 secs
lola: 163512832 markings, 235641385 edges, 446521 markings/sec, 325 secs
lola: 165737855 markings, 238877572 edges, 445005 markings/sec, 330 secs
lola: 167966491 markings, 242118465 edges, 445727 markings/sec, 335 secs
lola: 170177677 markings, 245336920 edges, 442237 markings/sec, 340 secs
lola: 172390700 markings, 248554674 edges, 442605 markings/sec, 345 secs
lola: 174596324 markings, 251764117 edges, 441125 markings/sec, 350 secs
lola: 176786341 markings, 254959789 edges, 438003 markings/sec, 355 secs
lola: 178980319 markings, 258160088 edges, 438796 markings/sec, 360 secs
lola: 181176756 markings, 261365685 edges, 439287 markings/sec, 365 secs
lola: 183069410 markings, 264133144 edges, 378531 markings/sec, 370 secs
lola: 183753125 markings, 265132959 edges, 136743 markings/sec, 375 secs
lola: 183767532 markings, 265154381 edges, 2881 markings/sec, 380 secs
lola: 183782888 markings, 265177737 edges, 3071 markings/sec, 385 secs
lola: 183796418 markings, 265198059 edges, 2706 markings/sec, 390 secs
lola: 183799107 markings, 265201971 edges, 538 markings/sec, 395 secs
lola: 183799388 markings, 265202253 edges, 56 markings/sec, 400 secs
lola: 183816601 markings, 265227767 edges, 3443 markings/sec, 405 secs
lola: 183821737 markings, 265234938 edges, 1027 markings/sec, 410 secs
lola: 183829361 markings, 265247038 edges, 1525 markings/sec, 415 secs
lola: 183831829 markings, 265250456 edges, 494 markings/sec, 420 secs
lola: 183835746 markings, 265255898 edges, 783 markings/sec, 425 secs
lola: 183845496 markings, 265270592 edges, 1950 markings/sec, 430 secs
lola: 183851559 markings, 265279778 edges, 1213 markings/sec, 435 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA ClientsAndServers-PT-N0020P0-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((A (G (((SA <= StR) OR (2 <= Uf)))) AND (((MtF <= Uf) OR (CwG <= StR) OR (MtF <= CwG) OR (3 <= MwU)) AND (SwA <= CF))) OR A (((Si <= SF) U ((1 <= SA) OR (3 <= MpA)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((SA <= StR) OR (2 <= Uf))))
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 (((SA <= StR) OR (2 <= Uf))))
lola: processed formula length: 35
lola: 35 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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: ((StR + 1 <= SA) AND (Uf <= 1))
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: 778 markings, 780 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((Si <= SF) U ((1 <= SA) OR (3 <= MpA))))
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 (((Si <= SF) U ((1 <= SA) OR (3 <= MpA))))
lola: processed formula length: 45
lola: 37 rewrites
lola: closed formula file ClientsAndServers-PT-N0020P0-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 ClientsAndServers-PT-N0020P0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no unknown no no yes yes yes no no no yes no yes yes yes
lola:
preliminary result: yes no unknown no no yes yes yes no no no yes no yes yes yes
lola: memory consumption: 20612 KB
lola: time consumption: 938 seconds
BK_STOP 1526522435121
--------------------
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-N0020P0"
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-N0020P0.tgz
mv ClientsAndServers-PT-N0020P0 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-N0020P0, 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-152646357200108"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;