About the Execution of LoLA for RefineWMG-PT-010010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.080 | 517368.00 | 519329.00 | 5820.80 | FFTFFFFFTFFTFF?? | 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.3K May 30 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 29 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 09:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 28 09:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.8K May 28 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 27 05:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 27 05:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 24K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-010010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170300680
=====================================================================
--------------------
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 RefineWMG-PT-010-010-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-010-010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527823203210
info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-010010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-010010 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RefineWMG-PT-010010 @ 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: 97/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-010-010-LTLCardinality.task
lola: A ((X (G ((2 <= p13))) U G (F ((2 <= p7))))) : A ((((3 <= p34) U (p20 <= p16)) U ((3 <= p5) U (3 <= p10)))) : A ((p20 <= p32)) : A (X (F (F ((p50 <= p10))))) : A (F ((2 <= p6))) : A (G ((F ((p44 <= p18)) U F ((psecond <= p11))))) : A (F ((1 <= pterce))) : A (G (G (((2 <= p14) U (p11 <= p40))))) : A ((1 <= p28)) : A (F ((psecond <= p17))) : A (X ((p45 <= p20))) : A ((((2 <= p49) U (2 <= p5)) U ((p43 <= p28) U (2 <= p9)))) : A (X (F (((1 <= p28) U (p19 <= p11))))) : A (F (X (G (X ((1 <= p36)))))) : A (G (X (G (X ((2 <= p8)))))) : A (G (G (X (F ((p6 <= p25))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p20 <= p32)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p20 <= p32)
lola: processed formula length: 12
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-2 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: (1 <= p28)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p28)
lola: processed formula length: 10
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-8 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: A (X (F ((p50 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p50 <= p10))))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 28 markings, 28 edges
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-3 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: A (X ((p45 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p45 <= p20)))
lola: processed formula length: 20
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 19 markings, 19 edges
lola:
FORMULA RefineWMG-PT-010-010-LTLCardinality-10 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 (F ((p19 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p19 <= p11))))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 13 markings, 13 edges
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-12 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 (X (G ((2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((2 <= p8)))))
lola: processed formula length: 25
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 3636067 markings, 5635109 edges, 727213 markings/sec, 0 secs
lola: 6969326 markings, 10800934 edges, 666652 markings/sec, 5 secs
lola: 10210066 markings, 15823384 edges, 648148 markings/sec, 10 secs
lola: 13550009 markings, 20999566 edges, 667989 markings/sec, 15 secs
lola: 16813771 markings, 26057696 edges, 652752 markings/sec, 20 secs
lola: 20028510 markings, 31039845 edges, 642948 markings/sec, 25 secs
lola: 23288592 markings, 36092268 edges, 652016 markings/sec, 30 secs
lola: 26479369 markings, 41037279 edges, 638155 markings/sec, 35 secs
lola: 29662337 markings, 45970188 edges, 636594 markings/sec, 40 secs
lola: 32840145 markings, 50895110 edges, 635562 markings/sec, 45 secs
lola: 36000233 markings, 55792559 edges, 632018 markings/sec, 50 secs
lola: 39462019 markings, 61157583 edges, 692357 markings/sec, 55 secs
lola: 42962526 markings, 66582609 edges, 700101 markings/sec, 60 secs
lola: 46493647 markings, 72055074 edges, 706224 markings/sec, 65 secs
lola: 50023250 markings, 77525198 edges, 705921 markings/sec, 70 secs
lola: 53529402 markings, 82958976 edges, 701230 markings/sec, 75 secs
lola: 56952286 markings, 88263709 edges, 684577 markings/sec, 80 secs
lola: 60351153 markings, 93531218 edges, 679773 markings/sec, 85 secs
lola: 63772244 markings, 98833162 edges, 684218 markings/sec, 90 secs
lola: 67135266 markings, 104045119 edges, 672604 markings/sec, 95 secs
lola: 68808090 markings, 106638628 edges, 334565 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p6)))
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: (p6 <= 1)
lola: processed formula length: 9
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 25 markings, 25 edges
FORMULA RefineWMG-PT-010-010-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= pterce)))
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: (pterce <= 0)
lola: processed formula length: 13
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 2 markings, 2 edges
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((psecond <= p17)))
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: (p17 + 1 <= psecond)
lola: processed formula length: 20
lola: 24 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 2 markings, 2 edges
FORMULA RefineWMG-PT-010-010-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p36))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p36))))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-LTLCardinality.task
lola: ========================================
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: add low 27
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: 8 markings, 9 edges
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p7))))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 25 markings, 25 edges
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((psecond <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((psecond <= p11))))
lola: processed formula length: 28
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 3 markings, 3 edges
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p6 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p6 <= p25))))
lola: processed formula length: 23
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 4098835 markings, 5123537 edges, 819767 markings/sec, 0 secs
lola: 8043872 markings, 10054834 edges, 789007 markings/sec, 5 secs
lola: 11906789 markings, 14883481 edges, 772583 markings/sec, 10 secs
lola: 15746252 markings, 19682809 edges, 767893 markings/sec, 15 secs
lola: 19592388 markings, 24490479 edges, 769227 markings/sec, 20 secs
lola: 23419631 markings, 29274533 edges, 765449 markings/sec, 25 secs
lola: 27151633 markings, 33939535 edges, 746400 markings/sec, 30 secs
lola: 30654353 markings, 38317935 edges, 700544 markings/sec, 35 secs
lola: 34192653 markings, 42740811 edges, 707660 markings/sec, 40 secs
lola: 37652481 markings, 47065596 edges, 691966 markings/sec, 45 secs
lola: 41074842 markings, 51343547 edges, 684472 markings/sec, 50 secs
lola: 44517321 markings, 55646645 edges, 688496 markings/sec, 55 secs
lola: 47907270 markings, 59884082 edges, 677990 markings/sec, 60 secs
lola: 51304814 markings, 64131011 edges, 679509 markings/sec, 65 secs
lola: 54717048 markings, 68396304 edges, 682447 markings/sec, 70 secs
lola: 58089602 markings, 72611997 edges, 674511 markings/sec, 75 secs
lola: 61811954 markings, 77264937 edges, 744470 markings/sec, 80 secs
lola: 65443151 markings, 81803932 edges, 726239 markings/sec, 85 secs
lola: 68979539 markings, 86224418 edges, 707278 markings/sec, 90 secs
lola: 72538660 markings, 90673319 edges, 711824 markings/sec, 95 secs
lola: 76071791 markings, 95089733 edges, 706626 markings/sec, 100 secs
lola: 79557484 markings, 99446848 edges, 697139 markings/sec, 105 secs
lola: 83181806 markings, 103977252 edges, 724864 markings/sec, 110 secs
lola: 86890824 markings, 108613524 edges, 741804 markings/sec, 115 secs
lola: 90594329 markings, 113242904 edges, 740701 markings/sec, 120 secs
lola: 94213929 markings, 117767405 edges, 723920 markings/sec, 125 secs
lola: 95059894 markings, 118824862 edges, 169193 markings/sec, 130 secs
lola: 95075635 markings, 118844538 edges, 3148 markings/sec, 135 secs
lola: 95083801 markings, 118854744 edges, 1633 markings/sec, 140 secs
lola: 95091207 markings, 118864003 edges, 1481 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p34) U (p20 <= p16)) U ((3 <= p5) U (3 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= p34) U (p20 <= p16)) U ((3 <= p5) U (3 <= p10))))
lola: processed formula length: 60
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 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: 25 markings, 25 edges
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p49) U (2 <= p5)) U ((p43 <= p28) U (2 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p49) U (2 <= p5)) U ((p43 <= p28) U (2 <= p9))))
lola: processed formula length: 59
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 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 RefineWMG-PT-010-010-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((p11 <= p40)))) AND A (G (((2 <= p14) OR (p11 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p14) OR (p11 <= p40))))
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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: A (G (((2 <= p14) OR (p11 <= p40))))
lola: processed formula length: 36
lola: 27 rewrites
lola: closed formula file RefineWMG-PT-010-010-LTLCardinality.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:674
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p14 <= 1) AND (p40 + 1 <= p11))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 44 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA RefineWMG-PT-010-010-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((2 <= p8)))))
lola: processed formula length: 25
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 3868476 markings, 5995287 edges, 773695 markings/sec, 0 secs
lola: 7653755 markings, 11861659 edges, 757056 markings/sec, 5 secs
lola: 11316329 markings, 17537846 edges, 732515 markings/sec, 10 secs
lola: 14892280 markings, 23079799 edges, 715190 markings/sec, 15 secs
lola: 18430649 markings, 28563503 edges, 707674 markings/sec, 20 secs
lola: 21984233 markings, 34070793 edges, 710717 markings/sec, 25 secs
lola: 25547497 markings, 39593084 edges, 712653 markings/sec, 30 secs
lola: 29134488 markings, 45152137 edges, 717398 markings/sec, 35 secs
lola: 32645750 markings, 50593831 edges, 702252 markings/sec, 40 secs
lola: 35956513 markings, 55724800 edges, 662153 markings/sec, 45 secs
lola: 39123572 markings, 60633060 edges, 633412 markings/sec, 50 secs
lola: 42329461 markings, 65601490 edges, 641178 markings/sec, 55 secs
lola: 45640167 markings, 70732369 edges, 662141 markings/sec, 60 secs
lola: 48833372 markings, 75681147 edges, 638641 markings/sec, 65 secs
lola: 51983098 markings, 80562543 edges, 629945 markings/sec, 70 secs
lola: 55215547 markings, 85572133 edges, 646490 markings/sec, 75 secs
lola: 58601864 markings, 90820193 edges, 677263 markings/sec, 80 secs
lola: 61769292 markings, 95729030 edges, 633486 markings/sec, 85 secs
lola: 64963825 markings, 100679858 edges, 638907 markings/sec, 90 secs
lola: 68123728 markings, 105577028 edges, 631981 markings/sec, 95 secs
lola: 68814010 markings, 106646804 edges, 138056 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA RefineWMG-PT-010-010-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (F ((p6 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p6 <= p25))))
lola: processed formula length: 23
lola: 22 rewrites
lola: closed formula file RefineWMG-PT-010-010-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: 3931245 markings, 4914050 edges, 786249 markings/sec, 0 secs
lola: 7658184 markings, 9572724 edges, 745388 markings/sec, 5 secs
lola: 11250682 markings, 14063347 edges, 718500 markings/sec, 10 secs
lola: 14809730 markings, 18512157 edges, 711810 markings/sec, 15 secs
lola: 18362364 markings, 22952949 edges, 710527 markings/sec, 20 secs
lola: 22093865 markings, 27617326 edges, 746300 markings/sec, 25 secs
lola: 25867282 markings, 32334098 edges, 754683 markings/sec, 30 secs
lola: 29693263 markings, 37116572 edges, 765196 markings/sec, 35 secs
lola: 33533375 markings, 41916713 edges, 768022 markings/sec, 40 secs
lola: 37335217 markings, 46669016 edges, 760368 markings/sec, 45 secs
lola: 41045164 markings, 51306449 edges, 741989 markings/sec, 50 secs
lola: 44758084 markings, 55947599 edges, 742584 markings/sec, 55 secs
lola: 48420198 markings, 60525242 edges, 732423 markings/sec, 60 secs
lola: 52101103 markings, 65126373 edges, 736181 markings/sec, 65 secs
lola: 55795134 markings, 69743912 edges, 738806 markings/sec, 70 secs
lola: 59447457 markings, 74309315 edges, 730465 markings/sec, 75 secs
lola: 63022537 markings, 78778166 edges, 715016 markings/sec, 80 secs
lola: 66632249 markings, 83290305 edges, 721942 markings/sec, 85 secs
lola: 70361347 markings, 87951677 edges, 745820 markings/sec, 90 secs
lola: 74094833 markings, 92618536 edges, 746697 markings/sec, 95 secs
lola: 77785669 markings, 97232081 edges, 738167 markings/sec, 100 secs
lola: 81547745 markings, 101934674 edges, 752415 markings/sec, 105 secs
lola: 85200433 markings, 106500536 edges, 730538 markings/sec, 110 secs
lola: 88826978 markings, 111033717 edges, 725309 markings/sec, 115 secs
lola: 92427224 markings, 115534024 edges, 720049 markings/sec, 120 secs
lola: 95028443 markings, 118785560 edges, 520244 markings/sec, 125 secs
lola: 95037679 markings, 118797093 edges, 1847 markings/sec, 130 secs
lola: 95059878 markings, 118824841 edges, 4440 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA RefineWMG-PT-010-010-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no no no yes no no yes no no unknown unknown
lola:
preliminary result: no no yes no no no no no yes no no yes no no unknown unknown
lola: memory consumption: 17692 KB
lola: time consumption: 517 seconds
BK_STOP 1527823720578
--------------------
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="RefineWMG-PT-010010"
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/RefineWMG-PT-010010.tgz
mv RefineWMG-PT-010010 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 RefineWMG-PT-010010, 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 r280-csrt-152749170300680"
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 ;