About the Execution of LoLA for ClientsAndServers-PT-N0200P0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.320 | 461057.00 | 404114.00 | 7026.80 | FTFFTFFT?FFFFTFF | 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 176K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-N0200P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257200045
=====================================================================
--------------------
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-N0200P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0200P0-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527783857940
info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N0200P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N0200P0 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N0200P0 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-N0200P0-LTLCardinality.task
lola: LP says that atomic proposition is always true: (2 <= Mi)
lola: A (F ((3 <= CR))) : A ((G ((SA <= CwG)) U ((CR <= CwA) U (Cb <= SpG)))) : A (X ((F ((SR <= CwA)) U G ((CR <= SwA))))) : A ((1 <= SwA)) : A (TRUE) : A ((G (X ((2 <= CR))) U ((3 <= CA) U (3 <= CA)))) : A (X (X (((MtF <= SwG) U (2 <= CA))))) : A (X ((StF <= Ci))) : A (G (F (G (F ((1 <= SpA)))))) : A (G (X ((SA <= MpG)))) : A (G (G (X (X ((1 <= StR)))))) : A (X ((X ((1 <= SA)) U F ((Si <= SF))))) : A (F (F (G (X ((2 <= MpA)))))) : A ((MpA <= MpG)) : A (X (X (G (G ((MtF <= MpA)))))) : A ((Uf <= CF))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= SwA)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= SwA)
lola: processed formula length: 10
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 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: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.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-N0200P0-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (MpA <= MpG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MpA <= MpG)
lola: processed formula length: 12
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.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
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Uf <= CF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Uf <= CF)
lola: processed formula length: 10
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-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: A (X (X (((MtF <= SwG) U (2 <= CA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((MtF <= SwG) U (2 <= CA)))))
lola: processed formula length: 38
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10001 markings, 10001 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((StF <= Ci)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((StF <= Ci)))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((SA <= MpG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((SA <= MpG))))
lola: processed formula length: 23
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10022 markings, 10023 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((1 <= StR)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= StR)))))
lola: processed formula length: 26
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10001 markings, 10001 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-10 FALSE 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 (X (F ((Si <= SF))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Si <= SF))))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10999 markings, 11094 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-11 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: A (X ((F ((SR <= CwA)) U G ((CR <= SwA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((SR <= CwA)) U G ((CR <= SwA)))))
lola: processed formula length: 43
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10402 markings, 10403 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-2 FALSE 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: A (X (X (G ((MtF <= MpA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((MtF <= MpA)))))
lola: processed formula length: 28
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10022 markings, 10023 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-14 FALSE 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: A ((X (G ((2 <= CR))) U ((3 <= CA) U (3 <= CA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= CR))) U ((3 <= CA) U (3 <= CA))))
lola: processed formula length: 49
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10001 markings, 10001 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= 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: (CR <= 2)
lola: processed formula length: 9
lola: 24 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.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: 21 markings, 21 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= MpA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= MpA))))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6409 markings, 6410 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= SpA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= SpA))))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3731569 markings, 4319333 edges, 746314 markings/sec, 0 secs
lola: 7282267 markings, 8451125 edges, 710140 markings/sec, 5 secs
lola: 10719597 markings, 12457205 edges, 687466 markings/sec, 10 secs
lola: 14171531 markings, 16478435 edges, 690387 markings/sec, 15 secs
lola: 17526413 markings, 20375680 edges, 670976 markings/sec, 20 secs
lola: 20846846 markings, 24249635 edges, 664087 markings/sec, 25 secs
lola: 24146210 markings, 28087168 edges, 659873 markings/sec, 30 secs
lola: 27558287 markings, 32073876 edges, 682415 markings/sec, 35 secs
lola: 30892879 markings, 35953052 edges, 666918 markings/sec, 40 secs
lola: 34190740 markings, 39800995 edges, 659572 markings/sec, 45 secs
lola: 37446419 markings, 43598642 edges, 651136 markings/sec, 50 secs
lola: 40651544 markings, 47318329 edges, 641025 markings/sec, 55 secs
lola: 43903392 markings, 51131318 edges, 650370 markings/sec, 60 secs
lola: 47187918 markings, 54935678 edges, 656905 markings/sec, 65 secs
lola: 50408424 markings, 58689540 edges, 644101 markings/sec, 70 secs
lola: 53540332 markings, 62368548 edges, 626382 markings/sec, 75 secs
lola: 56762700 markings, 66110655 edges, 644474 markings/sec, 80 secs
lola: 59912235 markings, 69776067 edges, 629907 markings/sec, 85 secs
lola: 63045904 markings, 73428205 edges, 626734 markings/sec, 90 secs
lola: 66216208 markings, 77125475 edges, 634061 markings/sec, 95 secs
lola: 69605130 markings, 81070275 edges, 677784 markings/sec, 100 secs
lola: 72900104 markings, 84914989 edges, 658995 markings/sec, 105 secs
lola: 76156635 markings, 88721363 edges, 651306 markings/sec, 110 secs
lola: 79367029 markings, 92479377 edges, 642079 markings/sec, 115 secs
lola: 82645192 markings, 96265020 edges, 655633 markings/sec, 120 secs
lola: 85791379 markings, 99932152 edges, 629237 markings/sec, 125 secs
lola: 88917169 markings, 103593906 edges, 625158 markings/sec, 130 secs
lola: 92054772 markings, 107234257 edges, 627521 markings/sec, 135 secs
lola: 95206863 markings, 110908270 edges, 630418 markings/sec, 140 secs
lola: 98417297 markings, 114679068 edges, 642087 markings/sec, 145 secs
lola: 101589814 markings, 118349844 edges, 634503 markings/sec, 150 secs
lola: 104682767 markings, 121972231 edges, 618591 markings/sec, 155 secs
lola: 107765326 markings, 125549410 edges, 616512 markings/sec, 160 secs
lola: 110814371 markings, 129126582 edges, 609809 markings/sec, 165 secs
lola: 113979707 markings, 132794314 edges, 633067 markings/sec, 170 secs
lola: 116996065 markings, 136346706 edges, 603272 markings/sec, 175 secs
lola: 120088503 markings, 139916034 edges, 618488 markings/sec, 180 secs
lola: 122466773 markings, 142688933 edges, 475654 markings/sec, 185 secs
lola: 122514285 markings, 142744362 edges, 9502 markings/sec, 190 secs
lola: 122544798 markings, 142779958 edges, 6103 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((CR <= CwA) U (Cb <= SpG)) OR (G ((SA <= CwG)) AND F ((Cb <= SpG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((CR <= CwA) U (Cb <= SpG)) OR (G ((SA <= CwG)) AND F ((Cb <= SpG)))))
lola: processed formula length: 74
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= SpA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= SpA))))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0200P0-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3400063 markings, 3934195 edges, 680013 markings/sec, 0 secs
lola: 6882387 markings, 7983904 edges, 696465 markings/sec, 5 secs
lola: 10318266 markings, 11982624 edges, 687176 markings/sec, 10 secs
lola: 13807711 markings, 16045431 edges, 697889 markings/sec, 15 secs
lola: 17185971 markings, 19996258 edges, 675652 markings/sec, 20 secs
lola: 20577896 markings, 23942470 edges, 678385 markings/sec, 25 secs
lola: 23903447 markings, 27803953 edges, 665110 markings/sec, 30 secs
lola: 27354793 markings, 31841778 edges, 690269 markings/sec, 35 secs
lola: 30733482 markings, 35775698 edges, 675738 markings/sec, 40 secs
lola: 34080933 markings, 39678825 edges, 669490 markings/sec, 45 secs
lola: 37401272 markings, 43538927 edges, 664068 markings/sec, 50 secs
lola: 40644707 markings, 47310355 edges, 648687 markings/sec, 55 secs
lola: 43950797 markings, 51184052 edges, 661218 markings/sec, 60 secs
lola: 47274362 markings, 55036525 edges, 664713 markings/sec, 65 secs
lola: 50533266 markings, 58844839 edges, 651781 markings/sec, 70 secs
lola: 53722615 markings, 62571344 edges, 637870 markings/sec, 75 secs
lola: 57004449 markings, 66379542 edges, 656367 markings/sec, 80 secs
lola: 60208397 markings, 70110995 edges, 640790 markings/sec, 85 secs
lola: 63469994 markings, 73912785 edges, 652319 markings/sec, 90 secs
lola: 66823968 markings, 77822340 edges, 670795 markings/sec, 95 secs
lola: 70180745 markings, 81735166 edges, 671355 markings/sec, 100 secs
lola: 73606142 markings, 85728043 edges, 685079 markings/sec, 105 secs
lola: 76981495 markings, 89662533 edges, 675071 markings/sec, 110 secs
lola: 80332152 markings, 93568210 edges, 670131 markings/sec, 115 secs
lola: 83673779 markings, 97463965 edges, 668325 markings/sec, 120 secs
lola: 86926993 markings, 101279955 edges, 650643 markings/sec, 125 secs
lola: 90236810 markings, 105127706 edges, 661963 markings/sec, 130 secs
lola: 93473750 markings, 108888024 edges, 647388 markings/sec, 135 secs
lola: 96812445 markings, 112788040 edges, 667739 markings/sec, 140 secs
lola: 100111307 markings, 116661462 edges, 659772 markings/sec, 145 secs
lola: 103385273 markings, 120442824 edges, 654793 markings/sec, 150 secs
lola: 106571052 markings, 124182896 edges, 637156 markings/sec, 155 secs
lola: 109795744 markings, 127916497 edges, 644938 markings/sec, 160 secs
lola: 113021515 markings, 131695154 edges, 645154 markings/sec, 165 secs
lola: 116262949 markings, 135456353 edges, 648287 markings/sec, 170 secs
lola: 119409430 markings, 139147937 edges, 629296 markings/sec, 175 secs
lola: 122430090 markings, 142646138 edges, 604132 markings/sec, 180 secs
lola: 122439666 markings, 142657308 edges, 1915 markings/sec, 185 secs
lola: 122448338 markings, 142667426 edges, 1734 markings/sec, 190 secs
lola: 122467265 markings, 142689551 edges, 3785 markings/sec, 195 secs
lola: 122474307 markings, 142697722 edges, 1408 markings/sec, 200 secs
lola: 122476456 markings, 142700228 edges, 430 markings/sec, 205 secs
lola: 122483784 markings, 142708779 edges, 1466 markings/sec, 210 secs
lola: 122488038 markings, 142713742 edges, 851 markings/sec, 215 secs
lola: 122496799 markings, 142723961 edges, 1752 markings/sec, 220 secs
lola: 122518652 markings, 142749457 edges, 4371 markings/sec, 225 secs
lola: 122528236 markings, 142760637 edges, 1917 markings/sec, 230 secs
lola: 122531352 markings, 142764273 edges, 623 markings/sec, 235 secs
lola: 122533381 markings, 142766640 edges, 406 markings/sec, 240 secs
lola: 122537723 markings, 142771706 edges, 868 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA ClientsAndServers-PT-N0200P0-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no yes no no yes unknown no no no no yes no no
lola:
preliminary result: no yes no no yes no no yes unknown no no no no yes no no
lola: memory consumption: 16768 KB
lola: time consumption: 460 seconds
BK_STOP 1527784318997
--------------------
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-N0200P0"
export BK_EXAMINATION="LTLCardinality"
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-N0200P0.tgz
mv ClientsAndServers-PT-N0200P0 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-N0200P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732257200045"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 ;